scripts/cpa.sh -heap 3000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -timelimit 900s -stats -spec test/programs/benchmarks/bitvector/ALL.prp test/programs/benchmarks/bitvector/byte_add_1_true-unreach-call.i -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 3000M. 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) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) Analysis incomplete: no errors found, but not everything could be checked. (CPAchecker.analyzeResult, WARNING) PredicateCPA statistics ----------------------- Number of abstractions: 59 (4% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 59 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 8 (14%) Times precision was {false}: 0 (0%) Times result was cached: 13 (22%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 38 (64%) Times result was 'false': 2 (3%) Number of strengthen sat checks: 21 Times result was 'false': 13 (62%) Number of coverage checks: 790 BDD entailment checks: 88 Number of SMT sat checks: 21 trivial: 0 cached: 5 Max ABE block size: 33 Number of predicates discovered: 10 Number of abstraction locations: 3 Max number of predicates per location: 6 Avg number of predicates per location: 4 Total predicates per abstraction: 132 Max number of predicates per abstraction: 6 Avg number of predicates per abstraction: 3.47 Number of irrelevant predicates: 6 (5%) Number of preds handled by boolean abs: 126 (95%) Total number of models for allsat: 154 Max number of models for allsat: 15 Avg number of models for allsat: 4.05 Number of path formula cache hits: 1276 (70%) Time for post operator: 0.166s Time for path formula creation: 0.152s Actual computation: 0.172s Time for strengthen operator: 0.082s Time for satisfiability checks: 0.079s Time for prec operator: 0.712s Time for abstraction: 0.710s (Max: 0.085s, Count: 59) Boolean abstraction: 0.425s Solving time: 0.070s (Max: 0.023s) Model enumeration time: 0.309s Time for BDD construction: 0.007s (Max: 0.001s) Time for merge operator: 0.023s Time for coverage check: 0.001s Time for BDD entailment checks: 0.000s Total time for SMT solver (w/o itp): 0.458s Number of BDD nodes: 453 Size of BDD node table: 10007 Size of BDD node cleanup queue: 158 (count: 321, min: 0, max: 158, avg: 0,49) 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.085s Automaton transfers with branching: 0 Automaton transfer successors: 2220 (count: 2220, min: 1, max: 1, avg: 1,00) [1 x 2220] CPA algorithm statistics ------------------------ Number of iterations: 991 Max size of waitlist: 8 Average size of waitlist: 4 Number of computed successors: 1380 Max successors for one state: 2 Number of times merged: 351 Number of times stopped: 372 Number of times breaked: 8 Total time for CPA algorithm: 1.303s (Max: 0.395s) Time for choose from waitlist: 0.008s Time for precision adjustment: 0.731s Time for transfer relation: 0.437s Time for merge operator: 0.049s Time for stop operator: 0.031s Time for adding to reached set: 0.015s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 39 (count: 8, min: 3, max: 7, avg: 4,88) Time for refinement: 0.675s Counterexample analysis: 0.406s (Max: 0.164s, Calls: 8) Refinement sat check: 0.230s Interpolant computation: 0.078s Error path post-processing: 0.143s Path-formulas extraction: 0.000s Building the counterexample trace: 0.406s Extracting precise counterexample: 0.143s Predicate creation: 0.007s Precision update: 0.004s ARG update: 0.109s Length of refined path (in blocks): 24 (count: 6, min: 2, max: 6, avg: 4,00) Number of affected states: 18 (count: 6, min: 1, max: 5, avg: 3,00) Length (states) of path with itp 'true': 0 (count: 6, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 18 (count: 6, min: 1, max: 5, avg: 3,00) Length (states) of path with itp 'false': 1 (count: 6, min: 0, max: 1, avg: 0,17) Different non-trivial interpolants along paths: 7 (count: 6, min: 0, max: 3, avg: 1,17) Equal non-trivial interpolants along paths: 5 (count: 6, min: 0, max: 1, avg: 0,83) 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: 8 Number of successful refinements: 7 Number of failed refinements: 0 Max. size of reached set before ref.: 213 Max. size of reached set after ref.: 25 Avg. size of reached set before ref.: 144.25 Avg. size of reached set after ref.: 21.57 Total time for CEGAR algorithm: 1.981s Time for refinements: 0.678s Average time for refinement: 0.084s Max time for refinement: 0.307s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 1 (100%) Time for counterexample checks: 0.448s CPAchecker general statistics ----------------------------- Number of program locations: 83 Number of functions: 3 Number of loops: 2 Size of reached set: 217 Number of reached locations: 82 (99%) Avg states per location: 2 Max states per location: 5 (at node N111) Number of reached functions: 3 (100%) Number of partitions: 212 Avg size of partitions: 1 Max size of partitions: 4 (with key [N111 (before line 88), Function mp_add called from node N136, stack depth 2 [79ed232c], stack [main, mp_add], Init]) Number of target states: 0 Time for analysis setup: 1.179s Time for loading CPAs: 0.291s Time for loading parser: 0.473s Time for CFA construction: 0.376s Time for parsing file(s): 0.232s Time for AST to CFA: 0.067s Time for CFA sanity check: 0.000s Time for post-processing: 0.051s Time for var class.: 0.000s Time for Analysis: 2.431s CPU time for analysis: 2.420s Total time for CPAchecker: 3.610s Total CPU time for CPAchecker: 3.590s Time for Garbage Collector: 0.086s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 132MB ( 126 MiB) max; 69MB ( 66 MiB) avg; 149MB ( 142 MiB) peak Used non-heap memory: 22MB ( 21 MiB) max; 18MB ( 17 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: 504MB ( 481 MiB) max; 504MB ( 481 MiB) avg Allocated non-heap memory: 24MB ( 23 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 4969MB ( 4739 MiB) max; 4907MB ( 4679 MiB) avg Verification result: UNKNOWN, incomplete analysis. More details about the verification run can be found in the directory "./output".