scripts/cpa.sh -sv-comp15 -disable-java-assertions -heap 10000m -timelimit 900s -stats -spec ../benchmarks/c/loop-invgen/ALL.prp ../benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok_true-unreach-call.i
--------------------------------------------------------------------------------
Running CPAchecker with Java heap of size 10000m.
Running CPAchecker with the following extra VM options: -Djava.io.tmpdir=/tmp/vcloud-vcloud-master/worker/tmp_-1305257807_tempdir
Using the following resource limits: CPU-time limit of 900s (ResourceLimitChecker.fromConfiguration, INFO)
CPAchecker 1.3.10-svcomp15 (OpenJDK 64-Bit Server VM 1.7.0_85) started (CPAchecker.run, INFO)
Using Restarting Algorithm (CoreComponentsFactory.createAlgorithm, INFO)
The following configuration options were specified but are not used:
cpa.predicate.useFloatingPointArithmetic
cpa.callstack.skipVoidRecursion
cpa.arg.errorPath.file
cpa.callstack.skipFunctionPointerRecursion
cpa.arg.errorPath.graphml
(CPAchecker.printConfigurationWarnings, WARNING)
Starting analysis ... (CPAchecker.runAlgorithm, INFO)
Using the following resource limits: CPU-time limit of 60s (Analysis1:ResourceLimitChecker.fromConfiguration, INFO)
Error path found, starting counterexample check with CPACHECKER. (Analysis1:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Using the following resource limits: CPU-time limit of 900s (Analysis1:CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis1:CounterexampleCheck:PredicateCPA:PredicateCPA., INFO)
Error path found, but identified as infeasible by counterexample check with CPACHECKER. (Analysis1:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Warning: Analysis not completed (Refinement failed: External tool verified counterexample as infeasible) (CounterexampleCheckAlgorithm.checkCounterexample, WARNING)
Statistics for algorithm 1 of 6
===============================
Total time for algorithm 1: 0.277s
ValueAnalysisCPA statistics
---------------------------
Number of variables: 89 (count: 38, min: 0, max: 6, avg: 2.34)
Number of global variables: 0 (count: 38, min: 0, max: 0, avg: 0.00)
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.001s
Automaton transfers with branching: 0
Automaton transfer successors: 58 (count: 58, min: 1, max: 1, avg: 1.00) [1 x 58]
CPA algorithm statistics
------------------------
Number of iterations: 29
Max size of waitlist: 9
Average size of waitlist: 5
Number of computed successors: 40
Max successors for one state: 2
Number of times merged: 0
Number of times stopped: 3
Number of times breaked: 1
Total time for CPA algorithm: 0.017s (Max: 0.017s)
Time for choose from waitlist: 0.000s
Time for precision adjustment: 0.003s
Time for transfer relation: 0.012s
Time for stop operator: 0.001s
Time for adding to reached set: 0.000s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 0.126s
RestartAlgorithm switches to the next configuration... (RestartAlgorithm.run, INFO)
Using the following resource limits: CPU-time limit of 60s (Analysis2:ResourceLimitChecker.fromConfiguration, INFO)
Error path found, starting counterexample check with CPACHECKER. (Analysis2:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Using the following resource limits: CPU-time limit of 900s (Analysis2:CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis2:CounterexampleCheck:PredicateCPA:PredicateCPA., INFO)
Error path found, but identified as infeasible by counterexample check with CPACHECKER. (Analysis2:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Warning: Analysis not completed (Refinement failed: External tool verified counterexample as infeasible) (CounterexampleCheckAlgorithm.checkCounterexample, WARNING)
Statistics for algorithm 2 of 6
===============================
Total time for algorithm 2: 0.117s
ValueAnalysisCPA statistics
---------------------------
Number of variables: 0 (count: 37, min: 0, max: 0, avg: 0.00)
Number of global variables: 0 (count: 37, min: 0, max: 0, avg: 0.00)
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.000s
Automaton transfers with branching: 0
Automaton transfer successors: 58 (count: 58, min: 1, max: 1, avg: 1.00) [1 x 58]
ComponentAwarePrecisionAdjustment Statistics statistics
-------------------------------------------------------
Total time for precision adjustment: 0.001s
Total time for composite: 0.000s
Total time for abstraction computation: 0.000s
Total time for path threshold: 0.000s
Number of abstraction computations: 40
CPA algorithm statistics
------------------------
Number of iterations: 29
Max size of waitlist: 8
Average size of waitlist: 4
Number of computed successors: 40
Max successors for one state: 2
Number of times merged: 0
Number of times stopped: 4
Number of times breaked: 1
Total time for CPA algorithm: 0.008s (Max: 0.008s)
Time for choose from waitlist: 0.000s
Time for precision adjustment: 0.001s
Time for transfer relation: 0.006s
Time for stop operator: 0.001s
Time for adding to reached set: 0.000s
ValueAnalysisDelegatingRefiner statistics
-----------------------------------------
number of value analysis refinements: 0
number of successful valueAnalysis refinements: 0
number of predicate refinements: 0
ValueAnalysisInterpolationBasedRefiner statistics
-------------------------------------------------
Number of interpolations: 0
Number of interpolation queries: 0 (count: 0, min: 0, max: 0, avg: 0.00)
Size of interpolant: 0 (count: 0, min: 0, max: 0, avg: 0.00)
Time for interpolation: 0.000s
CEGAR algorithm statistics
--------------------------
Number of refinements: 1
Number of successful refinements: 0
Number of failed refinements: 0
Max. size of reached set before ref.: 37
Max. size of reached set after ref.: 0
Avg. size of reached set before ref.: 37.00
Avg. size of reached set after ref.: NaN
Total time for CEGAR algorithm: 0.021s
Time for refinements: 0.013s
Average time for refinement: 0.013s
Max time for refinement: 0.013s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 0.047s
RestartAlgorithm switches to the next configuration... (RestartAlgorithm.run, INFO)
Using the following resource limits: CPU-time limit of 60s (Analysis3:ResourceLimitChecker.fromConfiguration, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis3:PredicateCPA:PredicateCPA., INFO)
Creating formula for program (Analysis3:BMCAlgorithm.run, INFO)
Finding invariants (Analysis3:CPAInvariantGenerator$InvariantGenerationTask.call, INFO)
Starting satisfiability check... (Analysis3:BMCAlgorithm.checkTargetStates, INFO)
Starting assertions check... (Analysis3:BMCAlgorithm.checkBoundingAssertions, INFO)
Running algorithm to create induction hypothesis (Analysis3:BMCAlgorithm$KInductionProver.check, INFO)
Starting induction check... (Analysis3:BMCAlgorithm$KInductionProver.check, INFO)
Adjusting maxLoopIterations to 2 (Analysis3:LoopstackCPA:LoopstackCPA.adjustPrecision, INFO)
Starting satisfiability check... (Analysis3:BMCAlgorithm.checkTargetStates, INFO)
Error found, creating error path (Analysis3:BMCAlgorithm.addCounterexampleTo, INFO)
Adjusting interestingVariableLimit to 1 (Analysis3:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions, INFO)
Error path found, starting counterexample check with CPACHECKER. (Analysis3:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Using the following resource limits: CPU-time limit of 900s (Analysis3:CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis3:CounterexampleCheck:PredicateCPA:PredicateCPA., INFO)
Error path found, but identified as infeasible by counterexample check with CPACHECKER. (Analysis3:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Warning: Analysis not completed (Refinement failed: External tool verified counterexample as infeasible) (CounterexampleCheckAlgorithm.checkCounterexample, WARNING)
Statistics for algorithm 3 of 6
===============================
Total time for algorithm 3: 0.245s
PredicateCPA statistics
-----------------------
Number of abstractions: 0 (0% of all post computations)
Number of strengthen sat checks: 0
Number of coverage checks: 22
BDD entailment checks: 0
Number of SMT sat checks: 0
trivial: 0
cached: 0
Max ABE block size: 0
Number of predicates discovered: 0
Time for post operator: 0.015s
Time for path formula creation: 0.014s
Time for strengthen operator: 0.000s
Time for prec operator: 0.000s
Time for merge operator: 0.003s
Time for coverage check: 0.000s
Total time for SMT solver (w/o itp): 0.000s
Number of BDD nodes: 202
Size of BDD node table: 10007
Size of BDD node cleanup queue: 0 (count: 1, 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
Loopstack CPA statistics
------------------------
Bound k:2
Maximum loop iteration reached:3
ValueAnalysisCPA statistics
---------------------------
Number of variables: 123 (count: 66, min: 0, max: 6, avg: 1.86)
Number of global variables: 0 (count: 66, min: 0, max: 0, avg: 0.00)
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.004s
Automaton transfers with branching: 0
Automaton transfer successors: 131 (count: 137, min: 0, max: 1, avg: 0.96) [0 x 6, 1 x 131]
CPA algorithm statistics
------------------------
Number of iterations: 96
Max size of waitlist: 8
Average size of waitlist: 3
Number of computed successors: 101
Max successors for one state: 2
Number of times merged: 11
Number of times stopped: 11
Number of times breaked: 0
Total time for CPA algorithm: 0.045s (Max: 0.027s)
Time for choose from waitlist: 0.001s
Time for precision adjustment: 0.003s
Time for transfer relation: 0.033s
Time for merge operator: 0.005s
Time for stop operator: 0.002s
Time for adding to reached set: 0.000s
BMC algorithm statistics
------------------------
Time for final sat check: 0.003s
Time for error path creation: 0.025s
Time for bounding assertions check: 0.001s
Number of cut points for induction: 0
Time for induction formula creation: 0.011s
Time for invariant generation: 0.067s
Time for induction check: 0.001s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 0.042s
RestartAlgorithm switches to the next configuration... (RestartAlgorithm.run, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis4:PredicateCPA:PredicateCPA., INFO)
Using refinement for predicate analysis with PredicateAbstractionRefinementStrategy strategy. (Analysis4:PredicateCPA:PredicateCPARefiner., INFO)
Error path found, starting counterexample check with CPACHECKER. (Analysis4:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Using the following resource limits: CPU-time limit of 900s (Analysis4:CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis4:CounterexampleCheck:PredicateCPA:PredicateCPA., INFO)
Error path found, but identified as infeasible by counterexample check with CPACHECKER. (Analysis4:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Warning: Analysis not completed (Refinement failed: External tool verified counterexample as infeasible) (CounterexampleCheckAlgorithm.checkCounterexample, WARNING)
Statistics for algorithm 4 of 6
===============================
Total time for algorithm 4: 0.132s
PredicateCPA statistics
-----------------------
Number of abstractions: 5 (4% of all post computations)
Times abstraction was reused: 0
Because of function entry/exit: 0 (0%)
Because of loop head: 5 (100%)
Because of join nodes: 0 (0%)
Because of threshold: 0 (0%)
Times precision was empty: 2 (40%)
Times precision was {false}: 0 (0%)
Times result was cached: 0 (0%)
Times cartesian abs was used: 0 (0%)
Times boolean abs was used: 3 (60%)
Times result was 'false': 0 (0%)
Number of strengthen sat checks: 8
Times result was 'false': 4 (50%)
Number of coverage checks: 19
BDD entailment checks: 1
Number of SMT sat checks: 8
trivial: 0
cached: 1
Max ABE block size: 14
Number of predicates discovered: 4
Number of abstraction locations: 2
Max number of predicates per location: 2
Avg number of predicates per location: 2
Total predicates per abstraction: 5
Max number of predicates per abstraction: 2
Avg number of predicates per abstraction: 1.67
Number of irrelevant predicates: 0 (0%)
Number of preds handled by boolean abs: 5 (100%)
Total number of models for allsat: 4
Max number of models for allsat: 2
Avg number of models for allsat: 1.33
Number of path formula cache hits: 82 (39%)
Time for post operator: 0.008s
Time for path formula creation: 0.008s
Actual computation: 0.012s
Time for strengthen operator: 0.004s
Time for satisfiability checks: 0.003s
Time for prec operator: 0.007s
Time for abstraction: 0.007s (Max: 0.003s, Count: 5)
Boolean abstraction: 0.003s
Solving time: 0.001s (Max: 0.001s)
Model enumeration time: 0.000s
Time for BDD construction: 0.001s (Max: 0.001s)
Time for merge operator: 0.000s
Time for coverage check: 0.000s
Time for BDD entailment checks: 0.000s
Total time for SMT solver (w/o itp): 0.004s
Number of BDD nodes: 205
Size of BDD node table: 10007
Size of BDD node cleanup queue: 0 (count: 28, 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.005s
Automaton transfers with branching: 0
Automaton transfer successors: 185 (count: 185, min: 1, max: 1, avg: 1.00) [1 x 185]
CPA algorithm statistics
------------------------
Number of iterations: 108
Max size of waitlist: 10
Average size of waitlist: 6
Number of computed successors: 138
Max successors for one state: 2
Number of times merged: 9
Number of times stopped: 9
Number of times breaked: 4
Total time for CPA algorithm: 0.037s (Max: 0.013s)
Time for choose from waitlist: 0.002s
Time for precision adjustment: 0.009s
Time for transfer relation: 0.023s
Time for merge operator: 0.000s
Time for stop operator: 0.000s
Time for adding to reached set: 0.001s
Predicate-Abstraction Refiner statistics
----------------------------------------
Avg. length of target path (in blocks): 9 (count: 4, min: 2, max: 3, avg: 2.25)
Time for refinement: 0.022s
Counterexample analysis: 0.010s (Max: 0.004s, Calls: 4)
Refinement sat check: 0.003s
Interpolant computation: 0.002s
Error path post-processing: 0.000s
Path-formulas extraction: 0.000s
Building the counterexample trace: 0.010s
Extracting precise counterexample: 0.010s
Predicate creation: 0.000s
Precision update: 0.000s
ARG update: 0.001s
Length of refined path (in blocks): 4 (count: 2, min: 2, max: 2, avg: 2.00)
Number of affected states: 2 (count: 2, min: 1, max: 1, avg: 1.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: 2 (count: 2, min: 1, max: 1, avg: 1.00)
Length (states) of path with itp 'false': 0 (count: 2, min: 0, max: 0, avg: 0.00)
Different non-trivial interpolants along paths: 0 (count: 2, min: 0, max: 0, avg: 0.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.: 64
Max. size of reached set after ref.: 27
Avg. size of reached set before ref.: 46.25
Avg. size of reached set after ref.: 18.33
Total time for CEGAR algorithm: 0.059s
Time for refinements: 0.022s
Average time for refinement: 0.005s
Max time for refinement: 0.014s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 0.046s
RestartAlgorithm switches to the next configuration... (RestartAlgorithm.run, INFO)
Using the following resource limits: CPU-time limit of 900s (Analysis5:ResourceLimitChecker.fromConfiguration, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis5:PredicateCPA:PredicateCPA., INFO)
Using refinement for predicate analysis with PredicateAbstractionRefinementStrategy strategy. (Analysis5:PredicateCPA:PredicateCPARefiner., INFO)
Shutdown requested (The CPU-time limit of 900s has elapsed.), waiting for termination. (ForceTerminationOnShutdown$1.shutdownRequested, WARNING)
Warning: Analysis stopped (The CPU-time limit of 900s has elapsed.) (ShutdownNotifier.shutdownIfNecessary, WARNING)
Restart Algorithm statistics
----------------------------
Number of algorithms provided: 6
Number of algorithms used: 5
Total time for algorithm 5: 895.216s
PredicateCPA statistics
-----------------------
Number of abstractions: 305 (5% of all post computations)
Times abstraction was reused: 0
Because of function entry/exit: 0 (0%)
Because of loop head: 305 (100%)
Because of join nodes: 0 (0%)
Because of threshold: 0 (0%)
Times precision was empty: 2 (1%)
Times precision was {false}: 0 (0%)
Times result was cached: 0 (0%)
Times cartesian abs was used: 0 (0%)
Times boolean abs was used: 303 (99%)
Times result was 'false': 0 (0%)
Number of strengthen sat checks: 606
Times result was 'false': 580 (96%)
Number of coverage checks: 2917
BDD entailment checks: 2301
Number of SMT sat checks: 606
trivial: 0
cached: 1
Max ABE block size: 14
Number of predicates discovered: 82
Number of abstraction locations: 2
Max number of predicates per location: 80
Avg number of predicates per location: 41
Total predicates per abstraction: 15084
Max number of predicates per abstraction: 80
Avg number of predicates per abstraction: 49.78
Number of irrelevant predicates: 0 (0%)
Number of preds handled by boolean abs: 15084 (100%)
Total number of models for allsat: 327421
Max number of models for allsat: 3685
Avg number of models for allsat: 1080.60
Number of path formula cache hits: 6686 (92%)
Time for post operator: 0.096s
Time for path formula creation: 0.072s
Actual computation: 0.042s
Time for strengthen operator: 6.691s
Time for satisfiability checks: 6.683s
Time for prec operator: 882.658s
Time for abstraction: 882.651s (Max: 34.097s, Count: 305)
Boolean abstraction: 880.865s
Solving time: 4.169s (Max: 0.031s)
Model enumeration time: 848.713s
Time for BDD construction: 27.688s (Max: 0.490s)
Time for merge operator: 0.003s
Time for coverage check: 0.063s
Time for BDD entailment checks: 0.063s
Total time for SMT solver (w/o itp): 859.557s
Number of BDD nodes: 35692
Size of BDD node table: 40013
Size of BDD node cleanup queue: 131144 (count: 57039, min: 0, max: 19495, avg: 2.30)
Time for BDD node cleanup: 0.013s
Time for BDD garbage collection: 8.887s (in 21122 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.084s
Automaton transfers with branching: 0
Automaton transfer successors: 7597 (count: 7597, min: 1, max: 1, avg: 1.00) [1 x 7597]
CPA algorithm statistics
------------------------
Number of iterations: 5447
Max size of waitlist: 32
Average size of waitlist: 15
Number of computed successors: 6097
Max successors for one state: 2
Number of times merged: 308
Number of times stopped: 308
Number of times breaked: 26
Total time for CPA algorithm: 890.019s (Max: 139.328s)
Time for choose from waitlist: 0.030s
Time for precision adjustment: 882.691s
Time for transfer relation: 7.044s
Time for merge operator: 0.033s
Time for stop operator: 0.093s
Time for adding to reached set: 0.059s
Predicate-Abstraction Refiner statistics
----------------------------------------
Avg. length of target path (in blocks): 328 (count: 26, min: 2, max: 25, avg: 12.62)
Time for refinement: 5.162s
Counterexample analysis: 5.081s (Max: 0.591s, Calls: 26)
Refinement sat check: 3.688s
Interpolant computation: 1.311s
Error path post-processing: 0.000s
Path-formulas extraction: 0.001s
Building the counterexample trace: 5.081s
Extracting precise counterexample: 0.000s
Predicate creation: 0.026s
Precision update: 0.015s
ARG update: 0.037s
Length of refined path (in blocks): 326 (count: 25, min: 2, max: 25, avg: 13.04)
Number of affected states: 301 (count: 25, min: 1, max: 24, avg: 12.04)
Length (states) of path with itp 'true': 0 (count: 25, min: 0, max: 0, avg: 0.00)
Length (states) of path with itp non-trivial itp: 301 (count: 25, min: 1, max: 24, avg: 12.04)
Length (states) of path with itp 'false': 0 (count: 25, min: 0, max: 0, avg: 0.00)
Different non-trivial interpolants along paths: 276 (count: 25, min: 0, max: 23, avg: 11.04)
Equal non-trivial interpolants along paths: 0 (count: 25, 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: 26
Number of successful refinements: 26
Number of failed refinements: 0
Max. size of reached set before ref.: 482
Max. size of reached set after ref.: 27
Avg. size of reached set before ref.: 246.15
Avg. size of reached set after ref.: 26.00
Total time for CEGAR algorithm: 895.196s
Time for refinements: 5.177s
Average time for refinement: 0.199s
Max time for refinement: 0.596s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 0
CPAchecker general statistics
-----------------------------
Number of program locations: 41
Number of functions: 2
Number of loops: 1
Size of reached set: 65
Number of reached locations: 39 (95%)
Avg states per location: 1
Max states per location: 4 (at node N0)
Number of reached functions: 2 (100%)
Number of partitions: 64
Avg size of partitions: 1
Max size of partitions: 2 (with key [N46 (before lines 176-184), Function main called from node N9, stack depth 1 [6ee7aa08], stack [main], Init])
Number of target states: 0
Size of final wait list 8
Time for analysis setup: 0.406s
Time for loading CPAs: 0.004s
Time for loading parser: 0.188s
Time for CFA construction: 0.195s
Time for parsing file(s): 0.103s
Time for AST to CFA: 0.055s
Time for CFA sanity check: 0.000s
Time for post-processing: 0.024s
Time for Analysis: 896.305s
CPU time for analysis: 899.390s
Total time for CPAchecker: 896.711s
Total CPU time for CPAchecker: 900.240s
Verification result: UNKNOWN, incomplete analysis.
More details about the verification run can be found in the directory "./output".