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.12_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_yf6zs12b/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: 78 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 78 (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: 77 (99%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 77 Times result was 'false': 73 (95%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 16108 BDD entailment checks: 1730 Number of SMT sat checks: 77 trivial: 0 cached: 0 Max ABE block size: 51 Number of predicates discovered: 90 Number of abstraction locations: 2 Max number of predicates per location: 89 Avg number of predicates per location: 45 Total predicates per abstraction: 5434 Max number of predicates per abstraction: 89 Avg number of predicates per abstraction: 70.57 Number of irrelevant predicates: 14 (0%) Number of preds handled by boolean abs: 5420 (100%) Total number of models for allsat: 4458 Max number of models for allsat: 132 Avg number of models for allsat: 57.90 Number of path formula cache hits: 8743 (26%) Time for post operator: 1.029s Time for path formula creation: 0.931s Actual computation: 0.867s Time for strengthen operator: 0.253s Time for satisfiability checks: 0.215s Time for prec operator: 9.330s Time for abstraction: 9.320s (Max: 0.632s, Count: 78) Boolean abstraction: 7.709s Solving time: 1.138s (Max: 0.066s) Model enumeration time: 5.296s Time for BDD construction: 0.979s (Max: 0.420s) Time for merge operator: 0.314s Time for coverage check: 0.055s Time for BDD entailment checks: 0.047s Total time for SMT solver (w/o itp): 6.648s Number of BDD nodes: 524745 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 22121 (count: 16721, min: 0, max: 22121, avg: 1,32) Time for BDD node cleanup: 0.081s 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.131s Automaton transfers with branching: 0 Automaton transfer successors: 47409 (count: 47409, min: 1, max: 1, avg: 1,00) [1 x 47409] CPA algorithm statistics ------------------------ Number of iterations: 23958 Max size of waitlist: 375 Average size of waitlist: 155 Number of computed successors: 31372 Max successors for one state: 2 Number of times merged: 7189 Number of times stopped: 7190 Number of times breaked: 4 Total time for CPA algorithm: 12.538s (Max: 8.762s) Time for choose from waitlist: 0.053s Time for precision adjustment: 9.468s Time for transfer relation: 1.922s Time for merge operator: 0.560s Time for stop operator: 0.164s Time for adding to reached set: 0.116s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 24 (count: 4, min: 2, max: 13, avg: 6,00) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 7.782s Counterexample analysis: 7.656s (Max: 5.932s, Calls: 4) Refinement sat check: 1.644s 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.012s Precision update: 0.005s ARG update: 0.090s Length of refined path (in blocks): 22 (count: 3, min: 3, max: 13, avg: 7,33) Number of affected states: 19 (count: 3, min: 2, max: 12, avg: 6,33) Length (states) of path with itp 'true': 0 (count: 3, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 19 (count: 3, min: 2, max: 12, avg: 6,33) Length (states) of path with itp 'false': 0 (count: 3, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 16 (count: 3, min: 1, max: 11, avg: 5,33) Equal non-trivial interpolants along paths: 0 (count: 3, 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: 4 Number of successful refinements: 4 Number of failed refinements: 0 Max. size of reached set before ref.: 3659 Max. size of reached set after ref.: 38 Avg. size of reached set before ref.: 1433.00 Avg. size of reached set after ref.: 28.75 Total time for CEGAR algorithm: 20.331s Time for refinements: 7.793s Average time for refinement: 1.948s Max time for refinement: 6.009s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 Code Coverage ----------------------------- Function coverage: 0,400 Visited lines: 568 Total lines: 597 Line coverage: 0,951 Visited conditions: 206 Total conditions: 214 Condition coverage: 0,963 CPAchecker general statistics ----------------------------- Number of program locations: 395 Number of CFA edges: 499 Number of relevant variables: 31 Number of functions: 5 Number of loops: 1 Size of reached set: 18566 Number of reached locations: 363 (92%) Avg states per location: 51 Max states per location: 58 (at node N25) Number of reached functions: 2 (40%) Number of partitions: 18510 Avg size of partitions: 1 Max size of partitions: 57 (with key [N97 (before lines 1141-1736), Function ssl3_accept called from node N33, stack depth 2 [18bbe3dd], stack [main, ssl3_accept]]) Number of target states: 0 Time for analysis setup: 1.839s Time for loading CPAs: 0.429s Time for loading parser: 0.524s Time for CFA construction: 0.834s Time for parsing file(s): 0.354s Time for AST to CFA: 0.239s Time for CFA sanity check: 0.001s Time for post-processing: 0.111s Time for var class.: 0.000s Time for Analysis: 20.341s CPU time for analysis: 33.800s Time for analyzing result: 0.008s Total time for CPAchecker: 22.184s Total CPU time for CPAchecker: 36.830s Time for statistics: 0.233s Time for Garbage Collector: 0.408s (in 10 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 1652MB ( 1576 MiB) max; 443MB ( 423 MiB) avg; 1652MB ( 1576 MiB) peak Used non-heap memory: 27MB ( 26 MiB) max; 24MB ( 23 MiB) avg; 27MB ( 26 MiB) peak Used in PS Old Gen pool: 49MB ( 47 MiB) max; 34MB ( 32 MiB) avg; 49MB ( 47 MiB) peak Allocated heap memory: 1908MB ( 1820 MiB) max; 1011MB ( 964 MiB) avg Allocated non-heap memory: 27MB ( 26 MiB) max; 26MB ( 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".