Report for /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/Addition02_false-unreach-call_true-no-overflow_true-termination/Addition02_false-unreach-call_true-no-overflow_true-termination.over.instr.c

Generated on 2017-05-11 13:06:03 by CPAchecker 1.6.1-svn

Matches in value-assignements (V): {{numOfValueMatches}}

Matches in edge-description: {{numOfDescriptionMatches}}

-V-
{{line.desc}}

Zoom Factor (%)

Run scripts/report-generator.py to display CFAs.

Zoom Factor (%)

Run scripts/report-generator.py to display ARG.

1
int num_of_inputs_at_33 = 1; int INPUTS_at_33[1]; int input_at_33_counter = 0;int num_of_inputs_at_27 = 1; int INPUTS_at_27[1]; int input_at_27_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_33[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_27[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__));  
2
  
3
/*  
4
 * Recursive implementation integer addition.  
5
 *   
6
 * Author: Matthias Heizmann  
7
 * Date: 2013-07-13  
8
 *   
9
 */  
10
  
11
extern int __VERIFIER_nondet_int(void);  
12
  
13
int addition(int m, int n) {  
14
    if (n == 0) {  
15
        return m;  
16
    }  
17
    if (n > 0) {  
18
        return addition(m+1, n-1);  
19
    }  
20
    if (n < 0) {  
21
        return addition(m-1, n+1);  
22
    }  
23
}  
24
  
25
  
26
int main() {initialize_reads();  
27
    int m = (input_at_27_counter < num_of_inputs_at_27) ? INPUTS_at_27[input_at_27_counter++] : __VERIFIER_nondet_int() ;  
28
    if (m < 0 || m > 1073741823) {  
29
        // additional branch to avoid undefined behavior   
30
        // (because of signed integer overflow)  
31
        return 0;  
32
    }  
33
    int n = (input_at_33_counter < num_of_inputs_at_33) ? INPUTS_at_33[input_at_33_counter++] : __VERIFIER_nondet_int() ;  
34
    if (n < 0 || n > 1073741823) {  
35
        // additional branch to avoid undefined behavior   
36
        // (because of signed integer overflow)  
37
        return 0;  
38
    }  
39
    int result = addition(m,n);  
40
    if (result == m - n) {  
41
        return 0;  
42
    } else {  
43
        __VERIFIER_assume(!((INPUTS_at_33[0]- 1073741823 < 1 + 0 && 0 < 1 + INPUTS_at_33[0]- 1 && INPUTS_at_27[0]- 1073741823 < 1 + 0 && 0 != INPUTS_at_33[0] && 0 == INPUTS_at_33[0]- 1)));__VERIFIER_assume(!((0 != INPUTS_at_27[0] && 0 != INPUTS_at_27[0]- 1 && 0 == INPUTS_at_27[0]- 2 && 0 < 1 + INPUTS_at_27[0]- 1 && 0 < 1 + INPUTS_at_27[0]- 2 && INPUTS_at_33[0]- 1073741823 < 1 + 0 && INPUTS_at_27[0]- 1073741823 < 1 + 0)));__VERIFIER_error();  
44
    }  
45
}  
2017-05-11 13:05:58:754	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 13:05:58:847	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 13:06:00:831	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 13:06:00:867	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 13:06:00:893	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 13:06:01:080	WARNING	Parallel analysis 1:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 13:06:01:695	INFO	Parallel analysis 1:PredicateCPA:PredicateCPA.<init>	Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).

2017-05-11 13:06:01:782	WARNING	Parallel analysis 1:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 13:06:01:868	WARNING	Parallel analysis 2:InvariantsCPA:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from addition to addition

2017-05-11 13:06:01:880	WARNING	Parallel analysis 1:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 13:06:02:013	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from addition to addition

2017-05-11 13:06:02:028	WARNING	Parallel analysis 1:InductionStepCase:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 13:06:02:030	INFO	Parallel analysis 1:InductionStepCase:PredicateCPA:PredicateCPA.<init>	Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).

2017-05-11 13:06:02:042	WARNING	Parallel analysis 1:InductionStepCase:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 13:06:02:056	WARNING	Parallel analysis 1:InductionStepCase:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 13:06:02:124	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from addition to addition

2017-05-11 13:06:02:145	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from addition to addition

2017-05-11 13:06:02:182	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from addition to addition

2017-05-11 13:06:02:190	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 13:06:02:240	INFO	Parallel analysis 2:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Recursion detected, aborting. To ignore recursion, add -skipRecursion to the command line.

2017-05-11 13:06:02:242	WARNING	CallstackTransferRelation.getAbstractSuccessorsForEdge	Warning: Analysis not completed due to recursion (line 18: Unsupported feature (recursion): __CPAchecker_TMP_0 = addition(m + 1, n - 1); (line was originally return addition(m+1, n-1);))

2017-05-11 13:06:02:512	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 13:06:02:515	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 13:06:02:533	WARNING	Parallel analysis 1:TargetLocationProvider:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Skipping recursive function call from addition to addition

2017-05-11 13:06:02:544	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 13:06:02:985	INFO	Parallel analysis 1:InductionStepCase:CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge	Recursion detected, aborting. To ignore recursion, add -skipRecursion to the command line.

2017-05-11 13:06:02:987	WARNING	CallstackTransferRelation.getAbstractSuccessorsForEdge	Warning: Analysis not completed due to recursion (line 21: Unsupported feature (recursion): __CPAchecker_TMP_1 = addition(m - 1, n + 1); (line was originally return addition(m-1, n+1);))

2017-05-11 13:06:02:988	SEVERE	ParallelAlgorithm.handleFutureResults	Error: Several exceptions occured during the analysis:
 -> line 18: Unsupported feature (recursion): __CPAchecker_TMP_0 = addition(m + 1, n - 1); (line was originally return addition(m+1, n-1);)
 -> line 21: Unsupported feature (recursion): __CPAchecker_TMP_1 = addition(m - 1, n + 1); (line was originally return addition(m-1, n+1);)

    
Parallel Algorithm statistics
-----------------------------
Number of algorithms used:        2


Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
===================================================================================================================================
Cannot print statistics for this analysis because it is still running.


Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties
===============================================================================================================================
Cannot print statistics for this analysis because it is still running.


Other statistics
================

Code Coverage
-----------------------------
  Function coverage:      0.333
  Visited lines:          0
  Total lines:            18
  Line coverage:          0.000
  Visited conditions:     0
  Total conditions:       52
  Condition coverage:     0.000

CPAchecker general statistics
-----------------------------
Number of program locations:     93
Number of CFA edges:             122
Number of relevant variables:    24
Number of functions:             3
Number of loops:                 2
Size of reached set:             1
  Number of reached locations:   1 (1%)
    Avg states per location:     1
    Max states per location:     1 (at node N32)
  Number of reached functions:   1 (33%)
  Number of partitions:          1
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       0
  Size of final wait list        1

Time for analysis setup:          1.955s
  Time for loading CPAs:          0.442s
  Time for loading parser:        0.469s
  Time for CFA construction:      0.968s
    Time for parsing file(s):     0.239s
    Time for AST to CFA:          0.308s
    Time for CFA sanity check:    0.032s
    Time for post-processing:     0.334s
      Time for var class.:        0.188s
    Time for CFA export:          0.198s
Time for Analysis:                2.154s
CPU time for analysis:            4.980s
Total time for CPAchecker:        4.124s
Total CPU time for CPAchecker:    8.980s
Time for statistics:              0.023s

Time for Garbage Collector:       0.503s (in 2 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                195MB (   186 MiB) max;    109MB (   104 MiB) avg;    247MB (   235 MiB) peak
Used non-heap memory:             37MB (    36 MiB) max;     28MB (    27 MiB) avg;     38MB (    36 MiB) peak
Used in PS Old Gen pool:          18MB (    17 MiB) max;      7MB (     6 MiB) avg;     18MB (    17 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;   1093MB (  1043 MiB) avg
Allocated non-heap memory:        38MB (    36 MiB) max;     29MB (    28 MiB) avg
Total process virtual memory:   8030MB (  7658 MiB) max;   7866MB (  7502 MiB) avg

    
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/Addition02_false-unreach-call_true-no-overflow_true-termination/Addition02_false-unreach-call_true-no-overflow_true-termination.over.instr.c
analysis.summaryEdges = true
analysis.useParallelAnalyses = true
cfa.allowBranchSwapping = false
cfa.simplifyCfa = false
limits.time.cpu = 900
log.level = INFO
output.path = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/Addition02_false-unreach-call_true-no-overflow_true-termination/cpa_output
overflow.config = sv-comp16--k-induction-overflow.properties
parallelAlgorithm.configFiles = components/kInduction/svcomp16-kInduction.properties, components/invariantGeneration-no-out.properties::supply-reached-refinable
specification = /work/anon/anon/cfc/analyzers/cpachecker/config/specification/sv-comp-reachability.spc