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.06_false-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_dg_3si98/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) Error path found, starting counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Using the following resource limits: CPU-time limit of 900s (CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO) Handling of pointer aliasing is disabled, analysis is unsound if aliased pointers exist. (CounterexampleCheck:ValueAnalysisCPA:PathFormulaManagerImpl., WARNING) Error path found and confirmed by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 17 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 17 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (6%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 16 (94%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 17 Times result was 'false': 11 (65%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 2491 BDD entailment checks: 25 Number of SMT sat checks: 17 trivial: 0 cached: 0 Max ABE block size: 54 Number of predicates discovered: 29 Number of abstraction locations: 2 Max number of predicates per location: 28 Avg number of predicates per location: 15 Total predicates per abstraction: 229 Max number of predicates per abstraction: 28 Avg number of predicates per abstraction: 14.31 Number of irrelevant predicates: 2 (1%) Number of preds handled by boolean abs: 227 (99%) Total number of models for allsat: 94 Max number of models for allsat: 39 Avg number of models for allsat: 5.88 Number of path formula cache hits: 4164 (59%) Time for post operator: 0.372s Time for path formula creation: 0.303s Actual computation: 0.272s Time for strengthen operator: 0.139s Time for satisfiability checks: 0.132s Time for prec operator: 1.617s Time for abstraction: 1.611s (Max: 0.261s, Count: 17) Boolean abstraction: 1.024s Solving time: 0.389s (Max: 0.080s) Model enumeration time: 0.529s Time for BDD construction: 0.067s (Max: 0.021s) Time for merge operator: 0.106s Time for coverage check: 0.004s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 1.050s Number of BDD nodes: 6609 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 405 (count: 558, min: 0, max: 405, avg: 0,73) Time for BDD node cleanup: 0.002s 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.073s Automaton transfers with branching: 0 Automaton transfer successors: 9032 (count: 9032, min: 1, max: 1, avg: 1,00) [1 x 9032] CPA algorithm statistics ------------------------ Number of iterations: 4304 Max size of waitlist: 69 Average size of waitlist: 31 Number of computed successors: 5809 Max successors for one state: 2 Number of times merged: 1233 Number of times stopped: 1233 Number of times breaked: 6 Total time for CPA algorithm: 3.045s (Max: 1.101s) Time for choose from waitlist: 0.038s Time for precision adjustment: 1.700s Time for transfer relation: 0.819s Time for merge operator: 0.232s Time for stop operator: 0.071s Time for adding to reached set: 0.078s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 23 (count: 6, min: 2, max: 7, avg: 3,83) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 1.893s Counterexample analysis: 1.617s (Max: 0.597s, Calls: 6) Refinement sat check: 0.588s Interpolant computation: 0.000s Error path post-processing: 0.215s Path-formulas extraction: 0.000s Building the counterexample trace: 0.000s Extracting precise counterexample: 0.215s Extracting infeasible sliced prefixes: 0.000s Selecting infeasible sliced prefixes: 0.000s Predicate creation: 0.004s Precision update: 0.002s ARG update: 0.036s Length of refined path (in blocks): 14 (count: 4, min: 2, max: 5, avg: 3,50) Number of affected states: 10 (count: 4, min: 1, max: 4, avg: 2,50) Length (states) of path with itp 'true': 0 (count: 4, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 10 (count: 4, min: 1, max: 4, avg: 2,50) Length (states) of path with itp 'false': 0 (count: 4, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 6 (count: 4, min: 0, max: 3, avg: 1,50) Equal non-trivial interpolants along paths: 0 (count: 4, 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: 6 Number of successful refinements: 5 Number of failed refinements: 0 Max. size of reached set before ref.: 1846 Max. size of reached set after ref.: 38 Avg. size of reached set before ref.: 788.33 Avg. size of reached set after ref.: 30.60 Total time for CEGAR algorithm: 4.950s Time for refinements: 1.905s Average time for refinement: 0.317s Max time for refinement: 0.611s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 1.742s Code Coverage ----------------------------- Function coverage: 0,400 Visited lines: 571 Total lines: 614 Line coverage: 0,930 Visited conditions: 220 Total conditions: 230 Condition coverage: 0,957 CPAchecker general statistics ----------------------------- Number of program locations: 411 Number of CFA edges: 523 Number of relevant variables: 31 Number of functions: 5 Number of loops: 1 Size of reached set: 1846 Number of reached locations: 373 (91%) Avg states per location: 4 Max states per location: 6 (at node N97) Number of reached functions: 2 (40%) Number of partitions: 1841 Avg size of partitions: 1 Max size of partitions: 6 (with key [N97 (before lines 1141-1768), Function ssl3_accept called from node N33, stack depth 2 [7fe8e0f1], stack [main, ssl3_accept]]) Number of target states: 1 Size of final wait list 66 Time for analysis setup: 2.125s Time for loading CPAs: 0.432s Time for loading parser: 0.514s Time for CFA construction: 1.130s Time for parsing file(s): 0.390s Time for AST to CFA: 0.198s Time for CFA sanity check: 0.000s Time for post-processing: 0.116s Time for var class.: 0.000s Time for Analysis: 6.692s CPU time for analysis: 12.930s Time for analyzing result: 0.001s Total time for CPAchecker: 8.820s Total CPU time for CPAchecker: 15.970s Time for statistics: 0.062s Time for Garbage Collector: 0.136s (in 4 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 167MB ( 159 MiB) max; 83MB ( 79 MiB) avg; 172MB ( 164 MiB) peak Used non-heap memory: 26MB ( 25 MiB) max; 21MB ( 20 MiB) avg; 26MB ( 25 MiB) peak Used in PS Old Gen pool: 23MB ( 22 MiB) max; 13MB ( 13 MiB) avg; 23MB ( 22 MiB) peak Allocated heap memory: 451MB ( 430 MiB) max; 349MB ( 333 MiB) avg Allocated non-heap memory: 26MB ( 25 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 15836MB ( 15103 MiB) max; 15780MB ( 15049 MiB) avg Verification result: FALSE. Property violation (__VERIFIER_error(); called in line 1779) found by chosen configuration. More details about the verification run can be found in the directory "./output".