scripts/cpa.sh -sv-comp15 -disable-java-assertions -heap 10000m -timelimit 900s -stats -spec ../benchmarks/c/loop-new/ALL.prp ../benchmarks/c/loop-new/gauss_sum_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_1848590976_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.279s
ValueAnalysisCPA statistics
---------------------------
Number of variables: 59 (count: 21, min: 0, max: 4, avg: 2.81)
Number of global variables: 0 (count: 21, 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: 33 (count: 33, min: 1, max: 1, avg: 1.00) [1 x 33]
CPA algorithm statistics
------------------------
Number of iterations: 17
Max size of waitlist: 4
Average size of waitlist: 2
Number of computed successors: 21
Max successors for one state: 2
Number of times merged: 0
Number of times stopped: 1
Number of times breaked: 1
Total time for CPA algorithm: 0.015s (Max: 0.015s)
Time for choose from waitlist: 0.001s
Time for precision adjustment: 0.001s
Time for transfer relation: 0.009s
Time for stop operator: 0.004s
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.123s
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.123s
ValueAnalysisCPA statistics
---------------------------
Number of variables: 13 (count: 21, min: 0, max: 1, avg: 0.62)
Number of global variables: 0 (count: 21, 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: 49 (count: 49, min: 1, max: 1, avg: 1.00) [1 x 49]
ComponentAwarePrecisionAdjustment Statistics statistics
-------------------------------------------------------
Total time for precision adjustment: 0.003s
Total time for composite: 0.001s
Total time for abstraction computation: 0.000s
Total time for path threshold: 0.001s
Number of abstraction computations: 34
CPA algorithm statistics
------------------------
Number of iterations: 27
Max size of waitlist: 4
Average size of waitlist: 2
Number of computed successors: 34
Max successors for one state: 2
Number of times merged: 0
Number of times stopped: 2
Number of times breaked: 2
Total time for CPA algorithm: 0.006s (Max: 0.004s)
Time for choose from waitlist: 0.000s
Time for precision adjustment: 0.003s
Time for transfer relation: 0.002s
Time for stop operator: 0.000s
Time for adding to reached set: 0.001s
ValueAnalysisDelegatingRefiner statistics
-----------------------------------------
number of value analysis refinements: 1
number of successful valueAnalysis refinements: 1
number of predicate refinements: 0
ValueAnalysisInterpolationBasedRefiner statistics
-------------------------------------------------
Number of interpolations: 1
Number of interpolation queries: 3 (count: 14, min: 0, max: 1, avg: 0.21)
Size of interpolant: 1 (count: 14, min: 0, max: 1, avg: 0.07)
Time for interpolation: 0.004s
CEGAR algorithm statistics
--------------------------
Number of refinements: 2
Number of successful refinements: 1
Number of failed refinements: 0
Max. size of reached set before ref.: 21
Max. size of reached set after ref.: 8
Avg. size of reached set before ref.: 20.50
Avg. size of reached set after ref.: 8.00
Total time for CEGAR algorithm: 0.040s
Time for refinements: 0.034s
Average time for refinement: 0.017s
Max time for refinement: 0.024s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 0.045s
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)
Adjusting interestingVariableLimit to 1 (Analysis3:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions, INFO)
Starting satisfiability check... (Analysis3:BMCAlgorithm.checkTargetStates, INFO)
Error found, creating error path (Analysis3:BMCAlgorithm.addCounterexampleTo, INFO)
ARG branching without AssumeEdge at ARG node 133. (Analysis3:PredicateCPA:PathFormulaManagerImpl.buildBranchingFormula, WARNING)
Could not create error path because of missing branching information! (Analysis3:BMCAlgorithm.addCounterexampleTo, WARNING)
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.204s
PredicateCPA statistics
-----------------------
Number of abstractions: 0 (0% of all post computations)
Number of strengthen sat checks: 0
Number of coverage checks: 10
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.010s
Time for path formula creation: 0.010s
Time for strengthen operator: 0.001s
Time for prec operator: 0.000s
Time for merge operator: 0.001s
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: 52 (count: 32, min: 0, max: 3, avg: 1.63)
Number of global variables: 0 (count: 32, 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: 74 (count: 77, min: 0, max: 1, avg: 0.96) [0 x 3, 1 x 74]
CPA algorithm statistics
------------------------
Number of iterations: 51
Max size of waitlist: 4
Average size of waitlist: 2
Number of computed successors: 50
Max successors for one state: 2
Number of times merged: 5
Number of times stopped: 5
Number of times breaked: 0
Total time for CPA algorithm: 0.029s (Max: 0.017s)
Time for choose from waitlist: 0.000s
Time for precision adjustment: 0.003s
Time for transfer relation: 0.024s
Time for merge operator: 0.001s
Time for stop operator: 0.001s
Time for adding to reached set: 0.000s
BMC algorithm statistics
------------------------
Time for final sat check: 0.002s
Time for error path creation: 0.002s
Time for bounding assertions check: 0.001s
Number of cut points for induction: 0
Time for induction formula creation: 0.007s
Time for invariant generation: 0.035s
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.044s
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.105s
PredicateCPA statistics
-----------------------
Number of abstractions: 4 (6% 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: 2 (50%)
Times precision was {false}: 0 (0%)
Times result was cached: 0 (0%)
Times cartesian abs was used: 0 (0%)
Times boolean abs was used: 2 (50%)
Times result was 'false': 0 (0%)
Number of strengthen sat checks: 4
Times result was 'false': 1 (25%)
Number of coverage checks: 9
BDD entailment checks: 1
Number of SMT sat checks: 4
trivial: 0
cached: 1
Max ABE block size: 8
Number of predicates discovered: 3
Number of abstraction locations: 2
Max number of predicates per location: 2
Avg number of predicates per location: 1
Total predicates per abstraction: 2
Max number of predicates per abstraction: 1
Avg number of predicates per abstraction: 1.00
Number of irrelevant predicates: 0 (0%)
Number of preds handled by boolean abs: 2 (100%)
Total number of models for allsat: 3
Max number of models for allsat: 2
Avg number of models for allsat: 1.50
Number of path formula cache hits: 36 (37%)
Time for post operator: 0.005s
Time for path formula creation: 0.005s
Actual computation: 0.006s
Time for strengthen operator: 0.002s
Time for satisfiability checks: 0.002s
Time for prec operator: 0.005s
Time for abstraction: 0.004s (Max: 0.003s, Count: 4)
Boolean abstraction: 0.003s
Solving time: 0.000s (Max: 0.000s)
Model enumeration time: 0.000s
Time for BDD construction: 0.002s (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.002s
Number of BDD nodes: 202
Size of BDD node table: 10007
Size of BDD node cleanup queue: 0 (count: 19, 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: 93 (count: 93, min: 1, max: 1, avg: 1.00) [1 x 93]
CPA algorithm statistics
------------------------
Number of iterations: 51
Max size of waitlist: 4
Average size of waitlist: 2
Number of computed successors: 62
Max successors for one state: 2
Number of times merged: 4
Number of times stopped: 4
Number of times breaked: 3
Total time for CPA algorithm: 0.021s (Max: 0.009s)
Time for choose from waitlist: 0.000s
Time for precision adjustment: 0.005s
Time for transfer relation: 0.013s
Time for merge operator: 0.000s
Time for stop operator: 0.001s
Time for adding to reached set: 0.000s
Predicate-Abstraction Refiner statistics
----------------------------------------
Avg. length of target path (in blocks): 7 (count: 3, min: 2, max: 3, avg: 2.33)
Time for refinement: 0.019s
Counterexample analysis: 0.008s (Max: 0.005s, Calls: 3)
Refinement sat check: 0.003s
Interpolant computation: 0.000s
Error path post-processing: 0.008s
Path-formulas extraction: 0.000s
Building the counterexample trace: 0.008s
Extracting precise counterexample: 0.008s
Predicate creation: 0.000s
Precision update: 0.001s
ARG update: 0.000s
Length of refined path (in blocks): 2 (count: 1, min: 2, max: 2, avg: 2.00)
Number of affected states: 1 (count: 1, min: 1, max: 1, avg: 1.00)
Length (states) of path with itp 'true': 0 (count: 1, min: 0, max: 0, avg: 0.00)
Length (states) of path with itp non-trivial itp: 1 (count: 1, min: 1, max: 1, avg: 1.00)
Length (states) of path with itp 'false': 0 (count: 1, min: 0, max: 0, avg: 0.00)
Different non-trivial interpolants along paths: 0 (count: 1, min: 0, max: 0, avg: 0.00)
Equal non-trivial interpolants along paths: 0 (count: 1, 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: 3
Number of successful refinements: 2
Number of failed refinements: 0
Max. size of reached set before ref.: 31
Max. size of reached set after ref.: 11
Avg. size of reached set before ref.: 23.67
Avg. size of reached set after ref.: 6.00
Total time for CEGAR algorithm: 0.041s
Time for refinements: 0.020s
Average time for refinement: 0.006s
Max time for refinement: 0.015s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 0.037s
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: 872.053s
PredicateCPA statistics
-----------------------
Number of abstractions: 5679 (8% of all post computations)
Times abstraction was reused: 0
Because of function entry/exit: 0 (0%)
Because of loop head: 5679 (100%)
Because of join nodes: 0 (0%)
Because of threshold: 0 (0%)
Times precision was empty: 2 (0%)
Times precision was {false}: 0 (0%)
Times result was cached: 0 (0%)
Times cartesian abs was used: 0 (0%)
Times boolean abs was used: 5677 (100%)
Times result was 'false': 0 (0%)
Number of strengthen sat checks: 5678
Times result was 'false': 5571 (98%)
Number of coverage checks: 198508
BDD entailment checks: 198500
Number of SMT sat checks: 5678
trivial: 0
cached: 1
Max ABE block size: 8
Number of predicates discovered: 320
Number of abstraction locations: 2
Max number of predicates per location: 318
Avg number of predicates per location: 160
Total predicates per abstraction: 1193136
Max number of predicates per abstraction: 318
Avg number of predicates per abstraction: 210.17
Number of irrelevant predicates: 0 (0%)
Number of preds handled by boolean abs: 1193136 (100%)
Total number of models for allsat: 199246
Max number of models for allsat: 108
Avg number of models for allsat: 35.10
Number of path formula cache hits: 72134 (98%)
Time for post operator: 0.280s
Time for path formula creation: 0.236s
Actual computation: 0.134s
Time for strengthen operator: 60.938s
Time for satisfiability checks: 60.877s
Time for prec operator: 614.175s
Time for abstraction: 614.076s (Max: 0.715s, Count: 5679)
Boolean abstraction: 576.959s
Solving time: 65.706s (Max: 0.029s)
Model enumeration time: 47.345s
Time for BDD construction: 452.772s (Max: 0.566s)
Time for merge operator: 0.000s
Time for coverage check: 1.622s
Time for BDD entailment checks: 1.612s
Total time for SMT solver (w/o itp): 173.895s
Number of BDD nodes: 649132
Size of BDD node table: 829883
Size of BDD node cleanup queue: 3201918 (count: 1500133, min: 0, max: 67918, avg: 2.13)
Time for BDD node cleanup: 0.548s
Time for BDD garbage collection: 186.017s (in 22205 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.366s
Automaton transfers with branching: 0
Automaton transfer successors: 84895 (count: 84895, min: 1, max: 1, avg: 1.00) [1 x 84895]
CPA algorithm statistics
------------------------
Number of iterations: 62050
Max size of waitlist: 4
Average size of waitlist: 2
Number of computed successors: 62269
Max successors for one state: 2
Number of times merged: 4
Number of times stopped: 4
Number of times breaked: 107
Total time for CPA algorithm: 678.673s (Max: 33.873s)
Time for choose from waitlist: 0.056s
Time for precision adjustment: 614.292s
Time for transfer relation: 62.179s
Time for merge operator: 0.081s
Time for stop operator: 1.751s
Time for adding to reached set: 0.130s
Predicate-Abstraction Refiner statistics
----------------------------------------
Avg. length of target path (in blocks): 5779 (count: 107, min: 2, max: 107, avg: 54.01)
Time for refinement: 193.340s
Counterexample analysis: 193.106s (Max: 7.444s, Calls: 107)
Refinement sat check: 2.503s
Interpolant computation: 189.973s
Error path post-processing: 0.000s
Path-formulas extraction: 0.007s
Building the counterexample trace: 193.106s
Extracting precise counterexample: 0.000s
Predicate creation: 0.056s
Precision update: 0.051s
ARG update: 0.092s
Length of refined path (in blocks): 5777 (count: 106, min: 2, max: 107, avg: 54.50)
Number of affected states: 5671 (count: 106, min: 1, max: 106, avg: 53.50)
Length (states) of path with itp 'true': 0 (count: 106, min: 0, max: 0, avg: 0.00)
Length (states) of path with itp non-trivial itp: 5671 (count: 106, min: 1, max: 106, avg: 53.50)
Length (states) of path with itp 'false': 0 (count: 106, min: 0, max: 0, avg: 0.00)
Different non-trivial interpolants along paths: 5565 (count: 106, min: 0, max: 105, avg: 52.50)
Equal non-trivial interpolants along paths: 0 (count: 106, 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: 107
Number of successful refinements: 107
Number of failed refinements: 0
Max. size of reached set before ref.: 1175
Max. size of reached set after ref.: 11
Avg. size of reached set before ref.: 592.10
Avg. size of reached set after ref.: 10.91
Total time for CEGAR algorithm: 872.033s
Time for refinements: 193.360s
Average time for refinement: 1.807s
Max time for refinement: 7.446s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 0
CPAchecker general statistics
-----------------------------
Number of program locations: 23
Number of functions: 2
Number of loops: 1
Size of reached set: 77
Number of reached locations: 22 (96%)
Avg states per location: 3
Max states per location: 6 (at node N0)
Number of reached functions: 2 (100%)
Number of partitions: 72
Avg size of partitions: 1
Max size of partitions: 6 (with key [N23 (before lines 78-86), Function main called from node N9, stack depth 1 [5782899e], stack [main], Init])
Number of target states: 0
Time for analysis setup: 0.395s
Time for loading CPAs: 0.003s
Time for loading parser: 0.178s
Time for CFA construction: 0.193s
Time for parsing file(s): 0.104s
Time for AST to CFA: 0.055s
Time for CFA sanity check: 0.000s
Time for post-processing: 0.022s
Time for Analysis: 872.947s
CPU time for analysis: 899.640s
Total time for CPAchecker: 873.343s
Total CPU time for CPAchecker: 900.460s
Verification result: UNKNOWN, incomplete analysis.
More details about the verification run can be found in the directory "./output".