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_24 = 14; int INPUTS_at_24[14]; int input_at_24_counter = 0;int num_of_inputs_at_15 = 1; int INPUTS_at_15[1]; int input_at_15_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<14; instrumentation_index++) INPUTS_at_24[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_15[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_error() __attribute__ ((__noreturn__)); |
2 | |
3 | extern void __VERIFIER_assume(int); |
4 | void __VERIFIER_assert(int cond) { |
5 | if (!(cond != 0)) { |
6 | __VERIFIER_assume(!((0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && 0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && INPUTS_at_15[0]- 1 < 1 + 0 && 0 != INPUTS_at_24[0])));__VERIFIER_assume(!((0 != INPUTS_at_24[1] && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 2 && INPUTS_at_24[0]- 2 < 1 + 0 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_15[0])));__VERIFIER_assume(!((0 == INPUTS_at_24[2] && 0 < 1 + INPUTS_at_24[1]- 3 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[2])));__VERIFIER_assume(!((0 == INPUTS_at_24[3] && 0 < 1 + INPUTS_at_24[2]- 4 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[3])));__VERIFIER_assume(!((0 == INPUTS_at_24[4] && 0 < 1 + INPUTS_at_24[3]- 5 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[4])));__VERIFIER_assume(!((0 == INPUTS_at_24[5] && 0 < 1 + INPUTS_at_24[4]- 6 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[5])));__VERIFIER_assume(!((0 == INPUTS_at_24[6] && 0 < 1 + INPUTS_at_24[5]- 7 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[6])));__VERIFIER_assume(!((0 == INPUTS_at_24[7] && 0 < 1 + INPUTS_at_24[6]- 8 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[7])));__VERIFIER_assume(!((0 == INPUTS_at_24[8] && 0 < 1 + INPUTS_at_24[7]- 9 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[9] && 0 < 1 + INPUTS_at_24[8]- 10 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7])));__VERIFIER_assume(!((0 == INPUTS_at_24[10] && 0 < 1 + INPUTS_at_24[9]- 11 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[10] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[11] && 0 < 1 + INPUTS_at_24[10]- 12 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[11] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[12] && 0 < 1 + INPUTS_at_24[11]- 13 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[10] && 0 != INPUTS_at_24[12] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[13] && 0 < 1 + INPUTS_at_24[12]- 14 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[10] && 0 != INPUTS_at_24[11] && 0 != INPUTS_at_24[13] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_error(); |
7 | } |
8 | return; |
9 | } |
10 | |
11 | int __VERIFIER_nondet_int(); |
12 | |
13 | int main() {initialize_reads(); |
14 | int i=0, x=0, y=0; |
15 | int n= (input_at_15_counter < num_of_inputs_at_15) ? INPUTS_at_15[input_at_15_counter++] : __VERIFIER_nondet_int() ; |
16 | if (!(n>0)) |
17 | return 0; |
18 | for(i=0; i<n; i++) |
19 | { |
20 | x = x-y; |
21 | if (!(x==0)) { |
22 | __VERIFIER_assume(!((0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && 0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && INPUTS_at_15[0]- 1 < 1 + 0 && 0 != INPUTS_at_24[0])));__VERIFIER_assume(!((0 != INPUTS_at_24[1] && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 2 && INPUTS_at_24[0]- 2 < 1 + 0 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_15[0])));__VERIFIER_assume(!((0 == INPUTS_at_24[2] && 0 < 1 + INPUTS_at_24[1]- 3 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[2])));__VERIFIER_assume(!((0 == INPUTS_at_24[3] && 0 < 1 + INPUTS_at_24[2]- 4 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[3])));__VERIFIER_assume(!((0 == INPUTS_at_24[4] && 0 < 1 + INPUTS_at_24[3]- 5 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[4])));__VERIFIER_assume(!((0 == INPUTS_at_24[5] && 0 < 1 + INPUTS_at_24[4]- 6 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[5])));__VERIFIER_assume(!((0 == INPUTS_at_24[6] && 0 < 1 + INPUTS_at_24[5]- 7 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[6])));__VERIFIER_assume(!((0 == INPUTS_at_24[7] && 0 < 1 + INPUTS_at_24[6]- 8 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[7])));__VERIFIER_assume(!((0 == INPUTS_at_24[8] && 0 < 1 + INPUTS_at_24[7]- 9 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[9] && 0 < 1 + INPUTS_at_24[8]- 10 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7])));__VERIFIER_assume(!((0 == INPUTS_at_24[10] && 0 < 1 + INPUTS_at_24[9]- 11 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[10] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[11] && 0 < 1 + INPUTS_at_24[10]- 12 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[11] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[12] && 0 < 1 + INPUTS_at_24[11]- 13 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[10] && 0 != INPUTS_at_24[12] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[13] && 0 < 1 + INPUTS_at_24[12]- 14 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[10] && 0 != INPUTS_at_24[11] && 0 != INPUTS_at_24[13] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_error(); |
23 | } |
24 | y = (input_at_24_counter < num_of_inputs_at_24) ? INPUTS_at_24[input_at_24_counter++] : __VERIFIER_nondet_int() ; |
25 | if (!(y!=0)) |
26 | return 0; |
27 | x = x+y; |
28 | if (!(x!=0)) { |
29 | __VERIFIER_assume(!((0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && 0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && INPUTS_at_15[0]- 1 < 1 + 0 && 0 != INPUTS_at_24[0])));__VERIFIER_assume(!((0 != INPUTS_at_24[1] && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 2 && INPUTS_at_24[0]- 2 < 1 + 0 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_15[0])));__VERIFIER_assume(!((0 == INPUTS_at_24[2] && 0 < 1 + INPUTS_at_24[1]- 3 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[2])));__VERIFIER_assume(!((0 == INPUTS_at_24[3] && 0 < 1 + INPUTS_at_24[2]- 4 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[3])));__VERIFIER_assume(!((0 == INPUTS_at_24[4] && 0 < 1 + INPUTS_at_24[3]- 5 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[4])));__VERIFIER_assume(!((0 == INPUTS_at_24[5] && 0 < 1 + INPUTS_at_24[4]- 6 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[5])));__VERIFIER_assume(!((0 == INPUTS_at_24[6] && 0 < 1 + INPUTS_at_24[5]- 7 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[6])));__VERIFIER_assume(!((0 == INPUTS_at_24[7] && 0 < 1 + INPUTS_at_24[6]- 8 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[7])));__VERIFIER_assume(!((0 == INPUTS_at_24[8] && 0 < 1 + INPUTS_at_24[7]- 9 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[9] && 0 < 1 + INPUTS_at_24[8]- 10 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7])));__VERIFIER_assume(!((0 == INPUTS_at_24[10] && 0 < 1 + INPUTS_at_24[9]- 11 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[10] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[11] && 0 < 1 + INPUTS_at_24[10]- 12 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[11] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[12] && 0 < 1 + INPUTS_at_24[11]- 13 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[10] && 0 != INPUTS_at_24[12] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[13] && 0 < 1 + INPUTS_at_24[12]- 14 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[10] && 0 != INPUTS_at_24[11] && 0 != INPUTS_at_24[13] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_error(); |
30 | } |
31 | } |
32 | if (!(x==0)) { |
33 | __VERIFIER_assume(!((0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && 0 != INPUTS_at_24[0] && 0 < 1 + INPUTS_at_15[0]- 1 && INPUTS_at_15[0]- 1 < 1 + 0 && 0 != INPUTS_at_24[0])));__VERIFIER_assume(!((0 != INPUTS_at_24[1] && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 1 && 0 < 1 + INPUTS_at_24[0]- 2 && INPUTS_at_24[0]- 2 < 1 + 0 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_15[0])));__VERIFIER_assume(!((0 == INPUTS_at_24[2] && 0 < 1 + INPUTS_at_24[1]- 3 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[2])));__VERIFIER_assume(!((0 == INPUTS_at_24[3] && 0 < 1 + INPUTS_at_24[2]- 4 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[3])));__VERIFIER_assume(!((0 == INPUTS_at_24[4] && 0 < 1 + INPUTS_at_24[3]- 5 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[4])));__VERIFIER_assume(!((0 == INPUTS_at_24[5] && 0 < 1 + INPUTS_at_24[4]- 6 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[5])));__VERIFIER_assume(!((0 == INPUTS_at_24[6] && 0 < 1 + INPUTS_at_24[5]- 7 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[6])));__VERIFIER_assume(!((0 == INPUTS_at_24[7] && 0 < 1 + INPUTS_at_24[6]- 8 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[7])));__VERIFIER_assume(!((0 == INPUTS_at_24[8] && 0 < 1 + INPUTS_at_24[7]- 9 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[9] && 0 < 1 + INPUTS_at_24[8]- 10 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7])));__VERIFIER_assume(!((0 == INPUTS_at_24[10] && 0 < 1 + INPUTS_at_24[9]- 11 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[10] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[11] && 0 < 1 + INPUTS_at_24[10]- 12 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[11] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[12] && 0 < 1 + INPUTS_at_24[11]- 13 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[10] && 0 != INPUTS_at_24[12] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_assume(!((0 == INPUTS_at_24[13] && 0 < 1 + INPUTS_at_24[12]- 14 && 0 != INPUTS_at_15[0] && 0 != INPUTS_at_24[0] && 0 != INPUTS_at_24[9] && 0 != INPUTS_at_24[10] && 0 != INPUTS_at_24[11] && 0 != INPUTS_at_24[13] && 0 != INPUTS_at_24[1] && 0 != INPUTS_at_24[2] && 0 != INPUTS_at_24[3] && 0 != INPUTS_at_24[4] && 0 != INPUTS_at_24[5] && 0 != INPUTS_at_24[6] && 0 != INPUTS_at_24[7] && 0 != INPUTS_at_24[8])));__VERIFIER_error(); |
34 | } |
35 | } |
2017-05-11 13:36:11:294 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 13:36:11:411 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 13:36:14:556 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 13:36:14:585 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 13:36:14:617 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 13:36:14:812 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:36:15:426 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:36:15:528 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:36:15:622 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:36:15:977 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:36:15:987 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:36:15:997 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:36:16:011 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:36:16:592 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:36:17:519 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:36:17:524 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:36:17:758 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:36:21:188 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 13:36:21:188 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:21:189 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:23:426 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 13:36:23:427 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:23:427 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:24:501 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 4
2017-05-11 13:36:24:502 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:24:502 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:25:865 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 5
2017-05-11 13:36:25:865 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:25:866 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:26:810 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 3
2017-05-11 13:36:26:811 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:26:811 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:28:296 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 7
2017-05-11 13:36:28:297 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:28:302 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:29:450 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 8
2017-05-11 13:36:29:451 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:29:464 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:29:883 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:36:30:237 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 10
2017-05-11 13:36:30:237 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:30:238 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:30:798 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 2
2017-05-11 13:36:30:798 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:36:30:806 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:36:30:806 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:36:30:826 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:36:30:923 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 14
2017-05-11 13:36:30:923 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:30:923 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:31:759 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 16
2017-05-11 13:36:31:759 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:31:759 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:32:264 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 20
2017-05-11 13:36:32:265 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:32:265 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:32:866 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 22
2017-05-11 13:36:32:866 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:32:867 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:33:501 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 23
2017-05-11 13:36:33:501 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:33:502 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:34:073 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:36:34:127 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 25
2017-05-11 13:36:34:128 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:34:128 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:34:631 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 29
2017-05-11 13:36:34:631 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:34:631 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:35:166 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 31
2017-05-11 13:36:35:166 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@205dad3d
2017-05-11 13:36:35:166 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:36:35:324 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 3
2017-05-11 13:36:35:325 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:36:35:331 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:36:35:332 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:36:35:364 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:36:41:021 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:36:43:000 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 4
2017-05-11 13:36:43:001 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:36:43:029 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:36:43:030 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:36:43:071 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:36:48:300 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:36:52:007 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 5
2017-05-11 13:36:52:008 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:36:52:014 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:36:52:015 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:36:52:055 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:36:58:042 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:37:01:126 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 6
2017-05-11 13:37:01:127 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:37:01:132 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:37:01:133 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:37:01:185 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:37:08:252 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:37:14:302 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 7
2017-05-11 13:37:14:303 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:37:14:308 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:37:14:309 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:37:14:367 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:37:22:510 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:37:30:557 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 8
2017-05-11 13:37:30:557 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:37:30:563 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:37:30:564 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:37:30:625 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:37:39:812 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:37:48:694 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 9
2017-05-11 13:37:48:694 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:37:48:700 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:37:48:701 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:37:48:778 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:37:59:650 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:38:14:322 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 10
2017-05-11 13:38:14:322 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:38:14:328 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:38:14:329 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:38:14:411 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:38:26:792 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:38:41:506 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 11
2017-05-11 13:38:41:507 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:38:41:513 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:38:41:514 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:38:41:609 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:38:54:354 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:39:14:797 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 12
2017-05-11 13:39:14:797 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:39:14:804 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:39:14:804 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:39:14:903 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:39:29:468 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:39:57:560 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 13
2017-05-11 13:39:57:560 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:39:57:566 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:39:57:567 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:39:57:673 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:40:13:847 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:40:38:161 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 14
2017-05-11 13:40:38:162 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:40:38:168 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:40:38:168 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:40:38:295 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:40:56:089 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:41:35:846 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 15
2017-05-11 13:41:35:846 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:41:39:696 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:41:41:479 INFO Parallel analysis 1:BMCAlgorithm.analyzeCounterexample Error found, creating error path
2017-05-11 13:41:44:528 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:45:373 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:41:45:373 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:46:157 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:41:46:157 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:47:008 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:41:47:008 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:47:682 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:41:47:683 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:48:486 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:41:48:486 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:49:195 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:41:49:196 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:49:877 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:41:49:877 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:50:595 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:41:50:596 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:51:330 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:41:51:330 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:52:021 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:41:52:022 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:52:878 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:41:52:878 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:53:943 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:41:53:944 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:55:620 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:41:55:621 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:56:499 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:41:56:500 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:57:336 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:41:57:336 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:58:063 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:41:58:064 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:58:798 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:41:58:798 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:41:59:622 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:41:59:622 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:00:424 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:00:424 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:01:188 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:42:01:188 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:01:919 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:01:920 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:02:665 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:02:665 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:03:407 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:42:03:407 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:04:155 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:04:156 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:04:947 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:04:948 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:05:688 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:42:05:688 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:06:436 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:06:437 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:07:134 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:07:134 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:07:920 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:42:07:920 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:08:708 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:08:708 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:09:404 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:09:404 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:10:168 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:42:10:168 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:10:926 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:10:927 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:11:632 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:11:632 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:12:400 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:42:12:400 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:13:167 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:13:168 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:13:887 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:13:888 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:14:655 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:42:14:655 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:15:419 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:15:419 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:16:274 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:42:16:274 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:17:174 WARNING Parallel analysis 1:ProcessExecutor.handleExitCode Exit code from /lustre/work/anon/anon/cfc/analyzers/cpachecker/lib/native/x86_64-linux/cbmc was 15
2017-05-11 13:42:17:243 WARNING Parallel analysis 1:CBMCChecker.checkCounterexample Warning: Counterexample found, but feasibility could not be verified (Counterexample could not be analyzed: CBMC could not verify the program (CBMC exit code was 15)!)
2017-05-11 13:42:17:243 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:42:17:390 WARNING ForceTerminationOnShutdown$1.shutdownRequested Shutdown requested (The JVM is shutting down, probably because Ctrl+C was pressed.), waiting for termination.
2017-05-11 13:42:17:390 WARNING AbstractFuture.get Warning: Analysis interrupted
2017-05-11 13:42:17:390 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Analysis was terminated
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
===============================================================================================================================
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.296s
Automaton transfers with branching: 0
Automaton transfer successors: 50364 (count: 50492, min: 0, max: 1, avg: 1.00) [0 x 128, 1 x 50364]
CPA algorithm statistics
------------------------
Number of iterations: 31372
Max size of waitlist: 62
Average size of waitlist: 37
Number of computed successors: 50364
Max successors for one state: 2
Number of times merged: 18084
Number of times stopped: 25985
Number of times breaked: 0
Total time for CPA algorithm: 358.698s (Max: 342.159s)
Time for choose from waitlist: 0.080s
Time for precision adjustment: 0.729s
Time for transfer relation: 12.484s
Time for merge operator: 335.700s
Time for stop operator: 9.018s
Time for adding to reached set: 0.186s
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 0.333
Visited lines: 0
Total lines: 21
Line coverage: 0.000
Visited conditions: 0
Total conditions: 1262
Condition coverage: 0.000
CPAchecker general statistics
-----------------------------
Number of program locations: 919
Number of CFA edges: 1493
Number of relevant variables: 74
Number of functions: 3
Number of loops: 3
Size of reached set: 1
Number of reached locations: 1 (0%)
Avg states per location: 1
Max states per location: 1 (at node N220)
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: 3.113s
Time for loading CPAs: 1.262s
Time for loading parser: 0.491s
Time for CFA construction: 1.284s
Time for parsing file(s): 0.287s
Time for AST to CFA: 0.434s
Time for CFA sanity check: 0.110s
Time for post-processing: 0.401s
Time for var class.: 0.237s
Time for CFA export: 1.175s
Time for Analysis: 362.830s
CPU time for analysis: 798.350s
Total time for CPAchecker: 365.957s
Total CPU time for CPAchecker: 806.900s
Time for statistics: 0.642s
Time for Garbage Collector: 26.150s (in 317 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 694MB ( 662 MiB) max; 374MB ( 357 MiB) avg; 720MB ( 687 MiB) peak
Used non-heap memory: 53MB ( 51 MiB) max; 50MB ( 48 MiB) avg; 54MB ( 52 MiB) peak
Used in PS Old Gen pool: 285MB ( 272 MiB) max; 178MB ( 170 MiB) avg; 285MB ( 272 MiB) peak
Allocated heap memory: 1205MB ( 1150 MiB) max; 952MB ( 908 MiB) avg
Allocated non-heap memory: 57MB ( 54 MiB) max; 55MB ( 52 MiB) avg
Total process virtual memory: 8987MB ( 8570 MiB) max; 8456MB ( 8065 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/for_bounded_loop1_false-unreach-call_true-termination/for_bounded_loop1_false-unreach-call_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/for_bounded_loop1_false-unreach-call_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