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_clnt.blast.04_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_ouwczdki/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: 22 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 22 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (5%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 21 (95%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 21 Times result was 'false': 18 (86%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 3192 BDD entailment checks: 94 Number of SMT sat checks: 21 trivial: 0 cached: 0 Max ABE block size: 46 Number of predicates discovered: 61 Number of abstraction locations: 2 Max number of predicates per location: 60 Avg number of predicates per location: 31 Total predicates per abstraction: 824 Max number of predicates per abstraction: 60 Avg number of predicates per abstraction: 39.24 Number of irrelevant predicates: 4 (0%) Number of preds handled by boolean abs: 820 (100%) Total number of models for allsat: 568 Max number of models for allsat: 58 Avg number of models for allsat: 27.05 Number of path formula cache hits: 3318 (44%) Time for post operator: 0.464s Time for path formula creation: 0.415s Actual computation: 0.384s Time for strengthen operator: 0.074s Time for satisfiability checks: 0.066s Time for prec operator: 3.568s Time for abstraction: 3.564s (Max: 0.433s, Count: 22) Boolean abstraction: 2.769s Solving time: 0.442s (Max: 0.057s) Model enumeration time: 1.887s Time for BDD construction: 0.334s (Max: 0.123s) Time for merge operator: 0.189s Time for coverage check: 0.022s Time for BDD entailment checks: 0.018s Total time for SMT solver (w/o itp): 2.395s Number of BDD nodes: 132113 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 0 (count: 3493, min: 0, max: 0, avg: 0,00) Time for BDD node cleanup: 0.001s 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.122s Automaton transfers with branching: 0 Automaton transfer successors: 10886 (count: 10886, min: 1, max: 1, avg: 1,00) [1 x 10886] CPA algorithm statistics ------------------------ Number of iterations: 5390 Max size of waitlist: 101 Average size of waitlist: 42 Number of computed successors: 7020 Max successors for one state: 2 Number of times merged: 1549 Number of times stopped: 1550 Number of times breaked: 3 Total time for CPA algorithm: 5.189s (Max: 3.528s) Time for choose from waitlist: 0.034s Time for precision adjustment: 3.627s Time for transfer relation: 0.913s Time for merge operator: 0.313s Time for stop operator: 0.116s Time for adding to reached set: 0.065s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 12 (count: 3, min: 2, max: 7, avg: 4,00) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 1.800s Counterexample analysis: 1.756s (Max: 1.513s, Calls: 3) Refinement sat check: 0.717s 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.003s Precision update: 0.002s ARG update: 0.021s Length of refined path (in blocks): 10 (count: 2, min: 3, max: 7, avg: 5,00) Number of affected states: 8 (count: 2, min: 2, max: 6, avg: 4,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: 8 (count: 2, min: 2, max: 6, avg: 4,00) Length (states) of path with itp 'false': 0 (count: 2, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 6 (count: 2, min: 1, max: 5, avg: 3,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.: 1544 Max. size of reached set after ref.: 42 Avg. size of reached set before ref.: 746.00 Avg. size of reached set after ref.: 28.33 Total time for CEGAR algorithm: 6.996s Time for refinements: 1.807s Average time for refinement: 0.602s Max time for refinement: 1.535s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 Code Coverage ----------------------------- Function coverage: 0,500 Visited lines: 508 Total lines: 523 Line coverage: 0,971 Visited conditions: 170 Total conditions: 174 Condition coverage: 0,977 CPAchecker general statistics ----------------------------- Number of program locations: 334 Number of CFA edges: 419 Number of relevant variables: 30 Number of functions: 4 Number of loops: 1 Size of reached set: 3318 Number of reached locations: 315 (94%) Avg states per location: 10 Max states per location: 12 (at node N25) Number of reached functions: 2 (50%) Number of partitions: 3307 Avg size of partitions: 1 Max size of partitions: 12 (with key [N98 (before line 1131), Function ssl3_connect called from node N34, stack depth 2 [a080b41], stack [main, ssl3_connect]]) Number of target states: 0 Time for analysis setup: 1.693s Time for loading CPAs: 0.431s Time for loading parser: 0.441s Time for CFA construction: 0.774s Time for parsing file(s): 0.333s Time for AST to CFA: 0.213s Time for CFA sanity check: 0.000s Time for post-processing: 0.105s Time for var class.: 0.000s Time for Analysis: 6.999s CPU time for analysis: 13.300s Time for analyzing result: 0.001s Total time for CPAchecker: 8.696s Total CPU time for CPAchecker: 16.040s Time for statistics: 0.062s Time for Garbage Collector: 0.166s (in 4 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 290MB ( 277 MiB) max; 109MB ( 104 MiB) avg; 300MB ( 286 MiB) peak Used non-heap memory: 25MB ( 24 MiB) max; 21MB ( 20 MiB) avg; 25MB ( 24 MiB) peak Used in PS Old Gen pool: 25MB ( 24 MiB) max; 13MB ( 13 MiB) avg; 25MB ( 24 MiB) peak Allocated heap memory: 451MB ( 430 MiB) max; 362MB ( 345 MiB) avg Allocated non-heap memory: 26MB ( 24 MiB) max; 24MB ( 23 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".