scripts/cpa.sh -heap 13000M -noout -disable-java-assertions -setprop cpa.predicate.memoryAllocationsAlwaysSucceed=true -predicateAnalysis-PredAbsRefiner-ABEl -setprop cpa.predicate.handlePointerAliasing=false -timelimit 60s -stats -spec test/programs/benchmarks/ssh/ALL.prp test/programs/benchmarks/ssh/s3_srvr.blast.10_true-unreach-call.i.cil.c -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 13000M. Running CPAchecker with the following extra VM options: -Djava.io.tmpdir=/tmp/BenchExec_run_hg3pw74i/tmp Using the following resource limits: CPU-time limit of 60s (ResourceLimitChecker.fromConfiguration, INFO) CPAchecker 1.4-svn 18912M (OpenJDK 64-Bit Server VM 1.7.0_91) started (CPAchecker.run, INFO) Handling of pointer aliasing is disabled, analysis is unsound if aliased pointers exist. (PredicateCPA:PathFormulaManagerImpl., WARNING) Using predicate analysis with SMTInterpol 2.1-224-gfd408f2-comp and JFactory 1.21. (PredicateCPA:PredicateCPA., INFO) Using refinement for predicate analysis with PredicateAbstractionRefinementStrategy strategy. (PredicateCPA:PredicateCPARefiner., INFO) The following configuration options were specified but are not used: cpa.predicate.memoryAllocationsAlwaysSucceed (CPAchecker.printConfigurationWarnings, WARNING) Starting analysis ... (CPAchecker.runAlgorithm, INFO) Program contains array, or pointer (multiple level of indirection), or field (enable handleFieldAccess and handleFieldAliasing) access; analysis is imprecise in case of aliasing. (PredicateCPA:CtoFormulaConverter.makeVariableUnsafe, WARNING) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 61 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 61 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (2%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 60 (98%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 60 Times result was 'false': 57 (95%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 11974 BDD entailment checks: 1254 Number of SMT sat checks: 60 trivial: 0 cached: 0 Max ABE block size: 52 Number of predicates discovered: 69 Number of abstraction locations: 2 Max number of predicates per location: 68 Avg number of predicates per location: 35 Total predicates per abstraction: 3474 Max number of predicates per abstraction: 68 Avg number of predicates per abstraction: 57.90 Number of irrelevant predicates: 7 (0%) Number of preds handled by boolean abs: 3467 (100%) Total number of models for allsat: 970 Max number of models for allsat: 34 Avg number of models for allsat: 16.17 Number of path formula cache hits: 4351 (18%) Time for post operator: 1.043s Time for path formula creation: 0.967s Actual computation: 0.905s Time for strengthen operator: 0.140s Time for satisfiability checks: 0.103s Time for prec operator: 5.914s Time for abstraction: 5.899s (Max: 0.242s, Count: 61) Boolean abstraction: 4.431s Solving time: 1.265s (Max: 0.069s) Model enumeration time: 2.588s Time for BDD construction: 0.303s (Max: 0.114s) Time for merge operator: 0.463s Time for coverage check: 0.037s Time for BDD entailment checks: 0.034s Total time for SMT solver (w/o itp): 3.956s Number of BDD nodes: 132416 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 9396 (count: 6453, min: 0, max: 9396, avg: 1,46) Time for BDD node cleanup: 0.010s Time for BDD garbage collection: 0.000s (in 0 runs) PrecisionBootstrap statistics ----------------------------- Init. function predicates: 0 Init. global predicates: 0 Init. location predicates: 0 AutomatonAnalysis (SVCOMP) statistics ------------------------------------- Number of states: 1 Total time for successor computation: 0.113s Automaton transfers with branching: 0 Automaton transfer successors: 35412 (count: 35412, min: 1, max: 1, avg: 1,00) [1 x 35412] CPA algorithm statistics ------------------------ Number of iterations: 17814 Max size of waitlist: 327 Average size of waitlist: 144 Number of computed successors: 23319 Max successors for one state: 2 Number of times merged: 5360 Number of times stopped: 5361 Number of times breaked: 3 Total time for CPA algorithm: 9.234s (Max: 7.084s) Time for choose from waitlist: 0.058s Time for precision adjustment: 6.044s Time for transfer relation: 1.797s Time for merge operator: 0.786s Time for stop operator: 0.160s Time for adding to reached set: 0.112s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 14 (count: 3, min: 2, max: 9, avg: 4,67) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 4.555s Counterexample analysis: 4.498s (Max: 4.195s, Calls: 3) Refinement sat check: 1.333s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.000s Extracting precise counterexample: 0.000s Extracting infeasible sliced prefixes: 0.000s Selecting infeasible sliced prefixes: 0.000s Predicate creation: 0.006s Precision update: 0.002s ARG update: 0.028s Length of refined path (in blocks): 12 (count: 2, min: 3, max: 9, avg: 6,00) Number of affected states: 10 (count: 2, min: 2, max: 8, avg: 5,00) Length (states) of path with itp 'true': 0 (count: 2, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 10 (count: 2, min: 2, max: 8, avg: 5,00) Length (states) of path with itp 'false': 0 (count: 2, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 8 (count: 2, min: 1, max: 7, avg: 4,00) Equal non-trivial interpolants along paths: 0 (count: 2, min: 0, max: 0, avg: 0,00) Different precisions along paths: 0 (count: 0, min: 0, max: 0, avg: 0,00) Equal precisions along paths: 0 (count: 0, min: 0, max: 0, avg: 0,00) Number of refs with location-based cutoff: 0 CEGAR algorithm statistics -------------------------- Number of refinements: 3 Number of successful refinements: 3 Number of failed refinements: 0 Max. size of reached set before ref.: 2272 Max. size of reached set after ref.: 38 Avg. size of reached set before ref.: 967.67 Avg. size of reached set after ref.: 25.67 Total time for CEGAR algorithm: 13.799s Time for refinements: 4.564s Average time for refinement: 1.521s Max time for refinement: 4.230s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 Code Coverage ----------------------------- Function coverage: 0,400 Visited lines: 558 Total lines: 587 Line coverage: 0,951 Visited conditions: 196 Total conditions: 204 Condition coverage: 0,961 CPAchecker general statistics ----------------------------- Number of program locations: 378 Number of CFA edges: 477 Number of relevant variables: 31 Number of functions: 5 Number of loops: 1 Size of reached set: 15133 Number of reached locations: 346 (92%) Avg states per location: 43 Max states per location: 50 (at node N25) Number of reached functions: 2 (40%) Number of partitions: 15085 Avg size of partitions: 1 Max size of partitions: 49 (with key [N97 (before lines 1141-1709), Function ssl3_accept called from node N33, stack depth 2 [206efae9], stack [main, ssl3_accept]]) Number of target states: 0 Time for analysis setup: 1.800s Time for loading CPAs: 0.415s Time for loading parser: 0.501s Time for CFA construction: 0.837s Time for parsing file(s): 0.366s Time for AST to CFA: 0.184s Time for CFA sanity check: 0.000s Time for post-processing: 0.115s Time for var class.: 0.000s Time for Analysis: 13.807s CPU time for analysis: 25.950s Time for analyzing result: 0.006s Total time for CPAchecker: 15.611s Total CPU time for CPAchecker: 28.980s Time for statistics: 0.299s Time for Garbage Collector: 0.282s (in 8 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 558MB ( 532 MiB) max; 193MB ( 184 MiB) avg; 585MB ( 558 MiB) peak Used non-heap memory: 27MB ( 25 MiB) max; 23MB ( 22 MiB) avg; 27MB ( 26 MiB) peak Used in PS Old Gen pool: 39MB ( 37 MiB) max; 24MB ( 23 MiB) avg; 39MB ( 37 MiB) peak Allocated heap memory: 1267MB ( 1208 MiB) max; 623MB ( 594 MiB) avg Allocated non-heap memory: 27MB ( 26 MiB) max; 25MB ( 24 MiB) avg Total process virtual memory: 15768MB ( 15038 MiB) max; 15768MB ( 15038 MiB) avg Verification result: TRUE. No property violation found by chosen configuration. More details about the verification run can be found in the directory "./output".