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.11_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_de6hqlru/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: 12 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 12 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (8%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 11 (92%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 12 Times result was 'false': 8 (67%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 1805 BDD entailment checks: 17 Number of SMT sat checks: 12 trivial: 0 cached: 0 Max ABE block size: 51 Number of predicates discovered: 59 Number of abstraction locations: 2 Max number of predicates per location: 58 Avg number of predicates per location: 30 Total predicates per abstraction: 314 Max number of predicates per abstraction: 58 Avg number of predicates per abstraction: 28.55 Number of irrelevant predicates: 6 (2%) Number of preds handled by boolean abs: 308 (98%) Total number of models for allsat: 196 Max number of models for allsat: 73 Avg number of models for allsat: 17.82 Number of path formula cache hits: 2831 (55%) Time for post operator: 0.330s Time for path formula creation: 0.305s Actual computation: 0.295s Time for strengthen operator: 0.152s Time for satisfiability checks: 0.146s Time for prec operator: 2.761s Time for abstraction: 2.758s (Max: 0.574s, Count: 12) Boolean abstraction: 2.214s Solving time: 0.612s (Max: 0.148s) Model enumeration time: 1.012s Time for BDD construction: 0.502s (Max: 0.183s) Time for merge operator: 0.114s Time for coverage check: 0.004s Time for BDD entailment checks: 0.002s Total time for SMT solver (w/o itp): 1.769s Number of BDD nodes: 98787 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 352 (count: 1623, min: 0, max: 249, avg: 0,22) Time for BDD node cleanup: 0.003s 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.076s Automaton transfers with branching: 0 Automaton transfer successors: 6634 (count: 6634, min: 1, max: 1, avg: 1,00) [1 x 6634] CPA algorithm statistics ------------------------ Number of iterations: 3164 Max size of waitlist: 63 Average size of waitlist: 30 Number of computed successors: 4192 Max successors for one state: 2 Number of times merged: 894 Number of times stopped: 894 Number of times breaked: 4 Total time for CPA algorithm: 3.956s (Max: 2.505s) Time for choose from waitlist: 0.023s Time for precision adjustment: 2.825s Time for transfer relation: 0.730s Time for merge operator: 0.195s Time for stop operator: 0.062s Time for adding to reached set: 0.046s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 16 (count: 4, min: 2, max: 6, avg: 4,00) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 3.296s Counterexample analysis: 3.041s (Max: 2.298s, Calls: 4) Refinement sat check: 0.563s Interpolant computation: 0.000s Error path post-processing: 0.199s Path-formulas extraction: 0.000s Building the counterexample trace: 0.000s Extracting precise counterexample: 0.199s Extracting infeasible sliced prefixes: 0.000s Selecting infeasible sliced prefixes: 0.000s Predicate creation: 0.006s Precision update: 0.003s ARG update: 0.026s Length of refined path (in blocks): 8 (count: 2, min: 3, max: 5, avg: 4,00) Number of affected states: 6 (count: 2, min: 2, max: 4, avg: 3,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: 6 (count: 2, min: 2, max: 4, avg: 3,00) Length (states) of path with itp 'false': 0 (count: 2, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 4 (count: 2, min: 1, max: 3, avg: 2,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: 4 Number of successful refinements: 3 Number of failed refinements: 0 Max. size of reached set before ref.: 1460 Max. size of reached set after ref.: 38 Avg. size of reached set before ref.: 844.00 Avg. size of reached set after ref.: 25.67 Total time for CEGAR algorithm: 7.262s Time for refinements: 3.306s Average time for refinement: 0.826s Max time for refinement: 2.325s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 1.698s Code Coverage ----------------------------- Function coverage: 0,400 Visited lines: 548 Total lines: 591 Line coverage: 0,927 Visited conditions: 198 Total conditions: 208 Condition coverage: 0,952 CPAchecker general statistics ----------------------------- Number of program locations: 385 Number of CFA edges: 486 Number of relevant variables: 31 Number of functions: 5 Number of loops: 1 Size of reached set: 1460 Number of reached locations: 347 (90%) Avg states per location: 4 Max states per location: 5 (at node N97) Number of reached functions: 2 (40%) Number of partitions: 1456 Avg size of partitions: 1 Max size of partitions: 5 (with key [N97 (before lines 1141-1720), Function ssl3_accept called from node N33, stack depth 2 [674eb0f5], stack [main, ssl3_accept]]) Number of target states: 1 Size of final wait list 47 Time for analysis setup: 1.844s Time for loading CPAs: 0.463s Time for loading parser: 0.558s Time for CFA construction: 0.773s Time for parsing file(s): 0.341s Time for AST to CFA: 0.228s Time for CFA sanity check: 0.000s Time for post-processing: 0.110s Time for var class.: 0.000s Time for Analysis: 8.961s CPU time for analysis: 17.540s Time for analyzing result: 0.001s Total time for CPAchecker: 10.808s Total CPU time for CPAchecker: 20.630s Time for statistics: 0.035s Time for Garbage Collector: 0.174s (in 4 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 211MB ( 201 MiB) max; 90MB ( 86 MiB) avg; 216MB ( 206 MiB) peak Used non-heap memory: 26MB ( 25 MiB) max; 22MB ( 21 MiB) avg; 26MB ( 25 MiB) peak Used in PS Old Gen pool: 24MB ( 23 MiB) max; 15MB ( 14 MiB) avg; 24MB ( 23 MiB) peak Allocated heap memory: 451MB ( 430 MiB) max; 363MB ( 346 MiB) avg Allocated non-heap memory: 26MB ( 25 MiB) max; 25MB ( 23 MiB) avg Total process virtual memory: 15836MB ( 15103 MiB) max; 15777MB ( 15046 MiB) avg Verification result: FALSE. Property violation (__VERIFIER_error(); called in line 1731) found by chosen configuration. More details about the verification run can be found in the directory "./output".