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/modulus_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: 4 (13% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 4 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 4 (100%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 0 (0%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 1 Times result was 'false': 0 (0%) Number of coverage checks: 4 BDD entailment checks: 2 Number of SMT sat checks: 1 trivial: 0 cached: 0 Max ABE block size: 7 Number of predicates discovered: 0 Number of path formula cache hits: 4 (7%) Time for post operator: 0.023s Time for path formula creation: 0.023s Actual computation: 0.033s Time for strengthen operator: 0.035s Time for satisfiability checks: 0.033s Time for prec operator: 0.006s Time for abstraction: 0.006s (Max: 0.004s, Count: 4) Solving time: 0.000s (Max: 0.000s) Model enumeration time: 0.000s Time for BDD construction: 0.000s (Max: 0.000s) Time for merge operator: 0.002s Time for coverage check: 0.001s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 0.033s Number of BDD nodes: 202 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 8, 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.001s Automaton transfers with branching: 0 Automaton transfer successors: 53 (count: 53, min: 1, max: 1, avg: 1,00) [1 x 53] CPA algorithm statistics ------------------------ Number of iterations: 27 Max size of waitlist: 4 Average size of waitlist: 2 Number of computed successors: 30 Max successors for one state: 2 Number of times merged: 1 Number of times stopped: 3 Number of times breaked: 1 Total time for CPA algorithm: 0.080s (Max: 0.071s) Time for choose from waitlist: 0.001s Time for precision adjustment: 0.008s Time for transfer relation: 0.065s Time for merge operator: 0.002s Time for stop operator: 0.002s Time for adding to reached set: 0.001s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 2 (count: 1, min: 2, max: 2, avg: 2,00) Time for refinement: 0.082s Counterexample analysis: 0.044s (Max: 0.044s, Calls: 1) Refinement sat check: 0.010s Interpolant computation: 0.000s Error path post-processing: 0.037s Path-formulas extraction: 0.000s Building the counterexample trace: 0.044s Extracting precise counterexample: 0.037s Predicate creation: 0.000s Precision update: 0.000s ARG update: 0.000s Length of refined path (in blocks): 0 (count: 0, min: 0, max: 0, avg: 0,00) Number of affected states: 0 (count: 0, min: 0, max: 0, avg: 0,00) Length (states) of path with itp 'true': 0 (count: 0, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 0 (count: 0, min: 0, max: 0, avg: 0,00) Length (states) of path with itp 'false': 0 (count: 0, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 0 (count: 0, min: 0, max: 0, avg: 0,00) Equal non-trivial interpolants along paths: 0 (count: 0, 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: 1 Number of successful refinements: 0 Number of failed refinements: 0 Max. size of reached set before ref.: 20 Max. size of reached set after ref.: 0 Avg. size of reached set before ref.: 20.00 Avg. size of reached set after ref.: NaN Total time for CEGAR algorithm: 0.166s Time for refinements: 0.086s Average time for refinement: 0.086s Max time for refinement: 0.086s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 1 (100%) Time for counterexample checks: 0.160s CPAchecker general statistics ----------------------------- Number of program locations: 26 Number of functions: 2 Number of loops: 2 Size of reached set: 26 Number of reached locations: 24 (92%) Avg states per location: 1 Max states per location: 2 (at node N8) Number of reached functions: 2 (100%) Number of partitions: 26 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 1.600s Time for loading CPAs: 0.421s Time for loading parser: 0.616s Time for CFA construction: 0.508s Time for parsing file(s): 0.329s Time for AST to CFA: 0.079s Time for CFA sanity check: 0.000s Time for post-processing: 0.064s Time for var class.: 0.000s Time for Analysis: 0.326s CPU time for analysis: 0.330s Total time for CPAchecker: 1.927s Total CPU time for CPAchecker: 1.930s Time for Garbage Collector: 0.000s (in 0 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 111MB ( 106 MiB) max; 60MB ( 57 MiB) avg; 114MB ( 108 MiB) peak Used non-heap memory: 20MB ( 19 MiB) max; 13MB ( 12 MiB) avg; 21MB ( 20 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: 4967MB ( 4737 MiB) max; 4903MB ( 4675 MiB) avg Verification result: UNKNOWN, incomplete analysis. More details about the verification run can be found in the directory "./output".