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.15_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_uwhf8dxg/tmp Using the following resource limits: CPU-time limit of 60s (ResourceLimitChecker.fromConfiguration, INFO) CPAchecker 1.4-svn (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: 67 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 67 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (1%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 66 (99%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 66 Times result was 'false': 63 (95%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 13873 BDD entailment checks: 1317 Number of SMT sat checks: 66 trivial: 0 cached: 0 Max ABE block size: 54 Number of predicates discovered: 97 Number of abstraction locations: 2 Max number of predicates per location: 96 Avg number of predicates per location: 49 Total predicates per abstraction: 5012 Max number of predicates per abstraction: 96 Avg number of predicates per abstraction: 75.94 Number of irrelevant predicates: 13 (0%) Number of preds handled by boolean abs: 4999 (100%) Total number of models for allsat: 2096 Max number of models for allsat: 90 Avg number of models for allsat: 31.76 Number of path formula cache hits: 7621 (27%) Time for post operator: 1.032s Time for path formula creation: 0.925s Actual computation: 0.863s Time for strengthen operator: 0.182s Time for satisfiability checks: 0.129s Time for prec operator: 7.235s Time for abstraction: 7.225s (Max: 0.673s, Count: 67) Boolean abstraction: 5.518s Solving time: 1.241s (Max: 0.079s) Model enumeration time: 3.099s Time for BDD construction: 0.806s (Max: 0.433s) Time for merge operator: 0.370s Time for coverage check: 0.060s Time for BDD entailment checks: 0.057s Total time for SMT solver (w/o itp): 4.469s Number of BDD nodes: 130037 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 13801 (count: 7567, min: 0, max: 13801, avg: 1,82) Time for BDD node cleanup: 0.015s Time for BDD garbage collection: 0.020s (in 1 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.138s Automaton transfers with branching: 0 Automaton transfer successors: 40878 (count: 40878, min: 1, max: 1, avg: 1,00) [1 x 40878] CPA algorithm statistics ------------------------ Number of iterations: 20370 Max size of waitlist: 327 Average size of waitlist: 139 Number of computed successors: 26835 Max successors for one state: 2 Number of times merged: 6278 Number of times stopped: 6279 Number of times breaked: 3 Total time for CPA algorithm: 10.585s (Max: 6.709s) Time for choose from waitlist: 0.061s Time for precision adjustment: 7.405s Time for transfer relation: 1.897s Time for merge operator: 0.662s Time for stop operator: 0.167s Time for adding to reached set: 0.126s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 20 (count: 3, min: 2, max: 15, avg: 6,67) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 6.585s Counterexample analysis: 6.462s (Max: 6.137s, Calls: 3) Refinement sat check: 2.053s 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.022s Precision update: 0.007s ARG update: 0.063s Length of refined path (in blocks): 18 (count: 2, min: 3, max: 15, avg: 9,00) Number of affected states: 16 (count: 2, min: 2, max: 14, avg: 8,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: 16 (count: 2, min: 2, max: 14, avg: 8,00) Length (states) of path with itp 'false': 0 (count: 2, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 14 (count: 2, min: 1, max: 13, avg: 7,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.: 4246 Max. size of reached set after ref.: 38 Avg. size of reached set before ref.: 1637.67 Avg. size of reached set after ref.: 25.67 Total time for CEGAR algorithm: 17.185s Time for refinements: 6.595s Average time for refinement: 2.198s Max time for refinement: 6.215s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 Code Coverage ----------------------------- Function coverage: 0,400 Visited lines: 570 Total lines: 599 Line coverage: 0,952 Visited conditions: 208 Total conditions: 216 Condition coverage: 0,963 CPAchecker general statistics ----------------------------- Number of program locations: 390 Number of CFA edges: 495 Number of relevant variables: 31 Number of functions: 5 Number of loops: 1 Size of reached set: 15721 Number of reached locations: 358 (92%) Avg states per location: 43 Max states per location: 50 (at node N25) Number of reached functions: 2 (40%) Number of partitions: 15673 Avg size of partitions: 1 Max size of partitions: 49 (with key [N97 (before lines 1141-1733), Function ssl3_accept called from node N33, stack depth 2 [6b82fc0a], stack [main, ssl3_accept]]) Number of target states: 0 Time for analysis setup: 1.918s Time for loading CPAs: 0.470s Time for loading parser: 0.582s Time for CFA construction: 0.815s Time for parsing file(s): 0.351s Time for AST to CFA: 0.227s Time for CFA sanity check: 0.000s Time for post-processing: 0.117s Time for var class.: 0.000s Time for Analysis: 17.209s CPU time for analysis: 30.200s Time for analyzing result: 0.008s Total time for CPAchecker: 19.129s Total CPU time for CPAchecker: 33.390s Time for statistics: 0.242s Time for Garbage Collector: 0.390s (in 10 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 1109MB ( 1057 MiB) max; 280MB ( 267 MiB) avg; 1137MB ( 1084 MiB) peak Used non-heap memory: 27MB ( 26 MiB) max; 23MB ( 22 MiB) avg; 27MB ( 26 MiB) peak Used in PS Old Gen pool: 50MB ( 47 MiB) max; 32MB ( 30 MiB) avg; 50MB ( 47 MiB) peak Allocated heap memory: 1907MB ( 1819 MiB) max; 786MB ( 750 MiB) avg Allocated non-heap memory: 28MB ( 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".