scripts/cpa.sh -heap 50000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -timelimit 900s -stats -spec test/programs/benchmarks/bitvector/ALL.prp test/programs/benchmarks/bitvector/sum02_true-unreach-call.i -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 50000M. Using the following resource limits: CPU-time limit of 900s (ResourceLimitChecker.fromConfiguration, INFO) CPAchecker 1.4-svn (OpenJDK 64-Bit Server VM 1.7.0_65) started (CPAchecker.run, INFO) Using predicate analysis with SMTInterpol 2.1-174-ga199d47-comp and JFactory 1.21. (PredicateCPA:PredicateCPA., INFO) Using refinement for predicate analysis with PredicateAbstractionRefinementStrategy strategy. (PredicateCPA:PredicateCPARefiner., INFO) Starting analysis ... (CPAchecker.runAlgorithm, INFO) 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) Error path found, but identified as infeasible by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Infeasible counterexample found, but could not remove it from the ARG. Therefore, we cannot prove safety. (CounterexampleCheckAlgorithm.checkCounterexample, 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) Error path found, but identified as infeasible by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) 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) Error path found, but identified as infeasible by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) 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) Error path found, but identified as infeasible by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) Analysis incomplete: no errors found, but not everything could be checked. (CPAchecker.analyzeResult, WARNING) PredicateCPA statistics ----------------------- Number of abstractions: 11 (6% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 11 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 2 (18%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 9 (82%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 10 Times result was 'false': 3 (30%) Number of coverage checks: 62 BDD entailment checks: 22 Number of SMT sat checks: 10 trivial: 0 cached: 1 Max ABE block size: 3 Number of predicates discovered: 8 Number of abstraction locations: 2 Max number of predicates per location: 6 Avg number of predicates per location: 4 Total predicates per abstraction: 44 Max number of predicates per abstraction: 6 Avg number of predicates per abstraction: 4.89 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 44 (100%) Total number of models for allsat: 35 Max number of models for allsat: 10 Avg number of models for allsat: 3.89 Number of path formula cache hits: 156 (45%) Time for post operator: 0.072s Time for path formula creation: 0.071s Actual computation: 0.085s Time for strengthen operator: 0.074s Time for satisfiability checks: 0.072s Time for prec operator: 0.129s Time for abstraction: 0.129s (Max: 0.028s, Count: 11) Boolean abstraction: 0.074s Solving time: 0.009s (Max: 0.002s) Model enumeration time: 0.037s Time for BDD construction: 0.003s (Max: 0.001s) Time for merge operator: 0.001s Time for coverage check: 0.002s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 0.118s Number of BDD nodes: 365 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 121, min: 0, max: 0, avg: 0,00) Time for BDD node cleanup: 0.000s 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.010s Automaton transfers with branching: 0 Automaton transfer successors: 233 (count: 233, min: 1, max: 1, avg: 1,00) [1 x 233] CPA algorithm statistics ------------------------ Number of iterations: 155 Max size of waitlist: 3 Average size of waitlist: 2 Number of computed successors: 185 Max successors for one state: 2 Number of times merged: 20 Number of times stopped: 21 Number of times breaked: 7 Total time for CPA algorithm: 0.341s (Max: 0.096s) Time for choose from waitlist: 0.001s Time for precision adjustment: 0.144s Time for transfer relation: 0.175s Time for merge operator: 0.005s Time for stop operator: 0.003s Time for adding to reached set: 0.005s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 29 (count: 7, min: 2, max: 7, avg: 4,14) Time for refinement: 0.268s Counterexample analysis: 0.130s (Max: 0.033s, Calls: 7) Refinement sat check: 0.058s Interpolant computation: 0.017s Error path post-processing: 0.122s Path-formulas extraction: 0.000s Building the counterexample trace: 0.130s Extracting precise counterexample: 0.122s Predicate creation: 0.001s Precision update: 0.002s ARG update: 0.001s Length of refined path (in blocks): 5 (count: 2, min: 2, max: 3, avg: 2,50) Number of affected states: 3 (count: 2, min: 1, max: 2, avg: 1,50) 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: 3 (count: 2, min: 1, max: 2, avg: 1,50) Length (states) of path with itp 'false': 0 (count: 2, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 1 (count: 2, min: 0, max: 1, avg: 0,50) 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: 7 Number of successful refinements: 3 Number of failed refinements: 0 Max. size of reached set before ref.: 95 Max. size of reached set after ref.: 4 Avg. size of reached set before ref.: 51.43 Avg. size of reached set after ref.: 3.00 Total time for CEGAR algorithm: 0.622s Time for refinements: 0.280s Average time for refinement: 0.040s Max time for refinement: 0.091s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 4 Number of infeasible paths: 4 (100%) Time for counterexample checks: 0.293s CPAchecker general statistics ----------------------------- Number of program locations: 21 Number of functions: 2 Number of loops: 1 Size of reached set: 96 Number of reached locations: 20 (95%) Avg states per location: 4 Max states per location: 6 (at node N0) Number of reached functions: 2 (100%) Number of partitions: 91 Avg size of partitions: 1 Max size of partitions: 6 (with key [N16 (before line 12), Function main called from node N9, stack depth 1 [27347a08], stack [main], Init]) Number of target states: 0 Time for analysis setup: 1.400s Time for loading CPAs: 0.536s Time for loading parser: 0.330s Time for CFA construction: 0.441s Time for parsing file(s): 0.182s Time for AST to CFA: 0.162s Time for CFA sanity check: 0.000s Time for post-processing: 0.073s Time for var class.: 0.000s Time for Analysis: 0.915s CPU time for analysis: 1.230s Total time for CPAchecker: 2.317s Total CPU time for CPAchecker: 3.240s Time for Garbage Collector: 0.000s (in 0 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 233MB ( 222 MiB) max; 133MB ( 127 MiB) avg; 243MB ( 232 MiB) peak Used non-heap memory: 21MB ( 20 MiB) max; 16MB ( 15 MiB) avg; 22MB ( 21 MiB) peak Used in PS Old Gen pool: 0MB ( 0 MiB) max; 0MB ( 0 MiB) avg; 0MB ( 0 MiB) peak Allocated heap memory: 2024MB ( 1930 MiB) max; 2024MB ( 1930 MiB) avg Allocated non-heap memory: 24MB ( 23 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 57123MB ( 54476 MiB) max; 57071MB ( 54428 MiB) avg Verification result: UNKNOWN, incomplete analysis. More details about the verification run can be found in the directory "./output".