Report for /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/Problem10_label15_false-unreach-call/Problem10_label15_false-unreach-call.over.instr.c

Generated on 2017-05-11 15:23:31 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_586 = 6; int INPUTS_at_586[6]; int input_at_586_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<6; instrumentation_index++) INPUTS_at_586[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);int calculate_output(int);  
2
extern void __VERIFIER_error(void);  
3
extern int __VERIFIER_nondet_int(void);  
4
extern void exit(int);  
5
  
6
	// inputs  
7
	int inputC = 3;  
8
	int inputD = 4;  
9
	int inputE = 5;  
10
	int inputF = 6;  
11
	int inputB = 2;  
12
  
13
  
14
	 int a1 = 23;  
15
	 int a19 = 9;  
16
	 int a10 = 0;  
17
	 int a12 = 0;  
18
	 int a4 = 14;  
19
  
20
	int calculate_output(int input) {  
21
		if((((((a10==4) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))){  
22
		error_57: exit(0);  
23
		}  
24
		if((((((a10==2) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))){  
25
		error_48: exit(0);  
26
		}  
27
		if((((((a10==0) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6))){  
28
		globalError: exit(0);  
29
		}  
30
		if((((((a10==2) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8))){  
31
		error_50: exit(0);  
32
		}  
33
		if((((((a10==4) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6))){  
34
		error_15:__VERIFIER_assume(!((0 != INPUTS_at_586[2]- 6)));__VERIFIER_assume(!((0 != INPUTS_at_586[0]- 4)));__VERIFIER_error();  
35
		}  
36
		if((((((a10==2) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))){  
37
		error_28: exit(0);  
38
		}  
39
		if((((((a10==3) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))){  
40
		error_12: exit(0);  
41
		}  
42
		if((((((a10==4) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8))){  
43
		error_58: exit(0);  
44
		}  
45
		if((((((a10==1) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))){  
46
		error_24: exit(0);  
47
		}  
48
		if((((((a10==2) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))){  
49
		error_29: exit(0);  
50
		}  
51
		if((((((a10==1) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7))){  
52
		error_26: exit(0);  
53
		}  
54
		if((((((a10==0) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8))){  
55
		error_42: exit(0);  
56
		}  
57
		if((((((a10==4) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8))){  
58
		error_55: exit(0);  
59
		}  
60
		if((((((a10==2) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8))){  
61
		error_47: exit(0);  
62
		}  
63
		if((((((a10==0) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))){  
64
		error_41: exit(0);  
65
		}  
66
		if((((((a10==1) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8))){  
67
		error_46: exit(0);  
68
		}  
69
		if((((((a10==2) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))){  
70
		error_49: exit(0);  
71
		}  
72
		if((((((a10==4) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))){  
73
		error_56: exit(0);  
74
		}  
75
		if((((((a10==1) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6))){  
76
		error_6: exit(0);  
77
		}  
78
		if((((((a10==3) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))){  
79
		error_32: exit(0);  
80
		}  
81
		if((((((a10==0) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8))){  
82
		error_39: exit(0);  
83
		}  
84
		if((((((a10==0) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))){  
85
		error_21: exit(0);  
86
		}  
87
		if((((((a10==0) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))){  
88
		error_20: exit(0);  
89
		}  
90
		if((((((a10==0) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7))){  
91
		error_19: exit(0);  
92
		}  
93
		if((((((a10==4) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))){  
94
		error_17: exit(0);  
95
		}  
96
		if((((((a10==3) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6))){  
97
		error_14: exit(0);  
98
		}  
99
		if((((((a10==4) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7))){  
100
		error_38: exit(0);  
101
		}  
102
		if((((((a10==4) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))){  
103
		error_16: exit(0);  
104
		}  
105
		if((((((a10==2) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7))){  
106
		error_30: exit(0);  
107
		}  
108
		if((((((a10==1) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8))){  
109
		error_43: exit(0);  
110
		}  
111
		if((((((a10==1) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6))){  
112
		error_3: exit(0);  
113
		}  
114
		if((((((a10==0) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7))){  
115
		error_22: exit(0);  
116
		}  
117
		if((((((a10==1) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))){  
118
		error_45: exit(0);  
119
		}  
120
		if((((((a10==4) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))){  
121
		error_36: exit(0);  
122
		}  
123
		if((((((a10==2) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))){  
124
		error_8: exit(0);  
125
		}  
126
		if((((((a10==3) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))){  
127
		error_52: exit(0);  
128
		}  
129
		if((((((a10==3) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))){  
130
		error_53: exit(0);  
131
		}  
132
		if((((((a10==3) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7))){  
133
		error_31: exit(0);  
134
		}  
135
		if((((((a10==3) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))){  
136
		error_33: exit(0);  
137
		}  
138
		if((((((a10==2) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6))){  
139
		error_7: exit(0);  
140
		}  
141
		if((((((a10==1) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7))){  
142
		error_23: exit(0);  
143
		}  
144
		if((((((a10==0) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))){  
145
		error_0: exit(0);  
146
		}  
147
		if((((((a10==2) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6))){  
148
		error_10: exit(0);  
149
		}  
150
		if((((((a10==0) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))){  
151
		error_40: exit(0);  
152
		}  
153
		if((((((a10==3) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==8))){  
154
		error_51: exit(0);  
155
		}  
156
		if((((((a10==4) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7))){  
157
		error_35: exit(0);  
158
		}  
159
		if((((((a10==1) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))){  
160
		error_5: exit(0);  
161
		}  
162
		if((((((a10==0) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))){  
163
		error_1: exit(0);  
164
		}  
165
		if((((((a10==4) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))){  
166
		error_37: exit(0);  
167
		}  
168
		if((((((a10==3) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))){  
169
		error_13: exit(0);  
170
		}  
171
		if((((((a10==2) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))){  
172
		error_9: exit(0);  
173
		}  
174
		if((((((a10==1) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))){  
175
		error_44: exit(0);  
176
		}  
177
		if((((((a10==4) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6))){  
178
		error_18: exit(0);  
179
		}  
180
		if((((((a10==0) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==6))){  
181
		error_2: exit(0);  
182
		}  
183
		if((((((a10==2) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==7))){  
184
		error_27: exit(0);  
185
		}  
186
		if((((((a10==3) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==6))){  
187
		error_11: exit(0);  
188
		}  
189
		if((((((a10==3) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==8))){  
190
		error_54: exit(0);  
191
		}  
192
		if((((((a10==3) && (a12==0)) &&  218 < a1 ) && (a4==14)) && (a19==7))){  
193
		error_34: exit(0);  
194
		}  
195
		if((((((a10==1) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))){  
196
		error_25: exit(0);  
197
		}  
198
		if((((((a10==0) && (a12==0)) &&  a1 <=  -13 ) && (a4==14)) && (a19==9))){  
199
		error_59: exit(0);  
200
		}  
201
		if((((((a10==1) && (a12==0)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))){  
202
		error_4: exit(0);  
203
		}  
204
  
205
	    if((((a10==4) && ( 218 < a1  && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))){  
206
  
207
	    		a10 = 1;   
208
  
209
	    	 return 24;  
210
	    } else if(((a4==14) && (((a12==0) && (((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))){  
211
	    	a1 = (((a1 + -15535) - 211896) / 5);  
212
	    		a10 = 2;   
213
  
214
	    	 return 22;  
215
	    } else if(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) &&  218 < a1 )){  
216
  
217
	    		a19 = 9;   
218
  
219
	    	 return 22;  
220
	    } else if(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1  && (input == 3)) && (a4==14)))))){  
221
  
222
	    		a19 = 10;   
223
  
224
	    	 return 25;  
225
	    } else if(((a19==10) && (((a4==14) && (((((a10==0) &&   ((38 < a1) && (218 >= a1)) ) || ((a10==0) &&  218 < a1 )) || ((a10==1) &&  a1 <=  -13 )) && (input == 5))) && (a12==0)))){  
226
	    	a1 = (((((a1 - 0) * 9)/ 10) % 25)- -12);  
227
	    		a10 = 2;   
228
	    		a19 = 8;   
229
  
230
	    	 return -1;  
231
	    } else if(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ))) && (a10==3))))){  
232
	    	a1 = (((a1 + 513169) / 5) - -374179);  
233
	    		a10 = 0;   
234
  
235
	    	 return 26;  
236
	    } else if(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))){  
237
	    	a1 = (((((a1 % 299993)+ -300005) * 1) + 533674) - 533676);  
238
	    	 return 22;  
239
	    } else if((((a12==0) && (  ((-13 < a1) && (38 >= a1))  && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))){  
240
	    	a1 = ((((a1 - -221565) * 10)/ 9) / 5);  
241
	    		a19 = 9;   
242
  
243
	    	 return 22;  
244
	    } else if((((a19==9) && (((input == 6) && (( 218 < a1  && (a10==0)) || ( a1 <=  -13  && (a10==1)))) && (a4==14))) && (a12==0))){  
245
	    	a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517);  
246
	    		a10 = 3;   
247
  
248
	    	 return 26;  
249
	    } else if((  ((38 < a1) && (218 >= a1))  && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))){  
250
	    	a1 = ((((a1 * 57)/ 10) * 5) * 5);  
251
	    		a19 = 9;   
252
  
253
	    	 return 24;  
254
	    } else if((((a4==14) && ((((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))){  
255
	    	a1 = (((a1 / 5) + 110755) + 220746);  
256
	    		a10 = 1;   
257
	    		a19 = 8;   
258
  
259
	    	 return -1;  
260
	    } else if((((a4==14) && ((((((a10==2) &&   ((38 < a1) && (218 >= a1)) ) || ((a10==2) &&  218 < a1 )) || ( a1 <=  -13  && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))){  
261
	    	a1 = (((((a1 % 299890)- -300108) + 0) + -140588) + 140590);  
262
	    		a10 = 0;   
263
  
264
	    	 return 26;  
265
	    } else if((((a10==1) && (((a12==0) && ((input == 6) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))){  
266
	    	a1 = ((((a1 / 5) - -367248) * 1) - 890938);  
267
	    		a10 = 0;   
268
	    		a19 = 10;   
269
  
270
	    	 return 26;  
271
	    } else if(((((((input == 5) && (a4==14)) &&  218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))){  
272
	    	a1 = (((((a1 % 25)+ -8) * 5) % 25)+ 13);  
273
	    		a10 = 1;   
274
	    		a19 = 7;   
275
  
276
	    	 return -1;  
277
	    } else if(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) &&   ((38 < a1) && (218 >= a1)) ) || ( 218 < a1  && (a10==0))) || ((a10==1) &&  a1 <=  -13 ))))))){  
278
	    	a1 = ((((a1 % 299993)- 300005) * 1) + -3);  
279
	    		a10 = 2;   
280
	    		a19 = 9;   
281
  
282
	    	 return 24;  
283
	    } else if((((a12==0) && ((((a19==9) && (input == 4)) &&  218 < a1 ) && (a10==1))) && (a4==14))){  
284
  
285
	    	 return 22;  
286
	    } else if(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) &&  218 < a1 )))){  
287
	    	a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118);  
288
	    		a19 = 10;   
289
  
290
	    	 return 25;  
291
	    } else if((((a4==14) && (((input == 4) && (((  ((38 < a1) && (218 >= a1))  && (a10==2)) || ((a10==2) &&  218 < a1 )) || ( a1 <=  -13  && (a10==3)))) && (a19==9))) && (a12==0))){  
292
	    	a1 = (((a1 / 5) - -435872) + 13710);  
293
	    		a10 = 0;   
294
  
295
	    	 return -1;  
296
	    } else if(((((a12==0) && ((((a10==0) &&  218 < a1 ) || ((a10==1) &&  a1 <=  -13 )) && (input == 2))) && (a19==9)) && (a4==14))){  
297
	    	a1 = ((((((a1 * 9)/ 10) % 299993)+ -300005) / 5) + -75819);  
298
	    		a10 = 4;   
299
  
300
	    	 return 26;  
301
	    } else if((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) &&  218 < a1 ) || ( a1 <=  -13  && (a10==4)))))) && (a19==9))){  
302
	    	a1 = ((((a1 - 0) - 0) / 5) - 247106);  
303
	    		a10 = 4;   
304
  
305
	    	 return -1;  
306
	    } else if((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) &&   ((-13 < a1) && (38 >= a1)) ) && (a4==14))){  
307
	    	a1 = (((a1 / 5) - 367764) - -191971);  
308
	    		a10 = 2;   
309
	    		a19 = 9;   
310
  
311
	    	 return 24;  
312
	    } else if(((a19==9) && (((a10==4) && ( 218 < a1  && ((a4==14) && (input == 6)))) && (a12==0)))){  
313
  
314
	    		a19 = 8;   
315
  
316
	    	 return -1;  
317
	    } else if((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))){  
318
	    	a1 = ((((a1 % 25)+ 13) / 5) - -2);  
319
	    	 return 26;  
320
	    } else if(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))){  
321
	    	a1 = ((((a1 % 299993)+ -300005) * 1) + -1);  
322
	    	 return 25;  
323
	    } else if((((((a12==0) && ((input == 4) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))){  
324
	    	a1 = (((a1 * 5) - 196556) + 94277);  
325
	    	 return -1;  
326
	    } else if((((a4==14) && (((a12==0) && ( 218 < a1  && (input == 6))) && (a19==10))) && (a10==1))){  
327
	    	a1 = (((a1 - 600149) - 12) + -58);  
328
	    	 return -1;  
329
	    } else if(((((((input == 2) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))){  
330
	    	a1 = ((((a1 % 299890)+ 300108) - -1) + 0);  
331
	    		a10 = 4;   
332
	    		a19 = 9;   
333
  
334
	    	 return -1;  
335
	    } else if((((((( 218 < a1  && (a10==0)) || ((a10==1) &&  a1 <=  -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))){  
336
	    	a1 = ((((((a1 / 5) % 25)+ 13) * 5) % 25)- -12);  
337
	    		a10 = 4;   
338
  
339
	    	 return 22;  
340
	    } else if(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) &&  218 < a1 ) || ( a1 <=  -13  && (a10==4)))) && (a4==14))))){  
341
	    	a1 = ((((a1 + 0) % 299890)+ 300108) + 0);  
342
	    		a10 = 2;   
343
  
344
	    	 return -1;  
345
	    } else if((((a10==3) && (((a19==9) && ((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))){  
346
	    	a1 = ((((a1 - 287698) - 189392) % 89)+ 206);  
347
	    		a10 = 2;   
348
	    		a19 = 7;   
349
  
350
	    	 return -1;  
351
	    } else if((((a12==0) && ((a10==1) && ( 218 < a1  && ((a19==9) && (input == 6))))) && (a4==14))){  
352
  
353
	    	 return 24;  
354
	    } else if(((a10==0) && ((a12==0) && (((( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))){  
355
	    	a1 = (((((a1 % 25)+ 13) - 1) + -16025) - -16025);  
356
	    	 return -1;  
357
	    } else if((((a10==4) && ((((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))){  
358
	    	a1 = (((((a1 - -249982) + 317100) * 1) % 89)- -62);  
359
	    	 return -1;  
360
	    } else if(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && ((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 4))))))){  
361
	    	a1 = ((((a1 - 46038) + -455425) * 10)/ 9);  
362
	    		a19 = 10;   
363
  
364
	    	 return 24;  
365
	    } else if(((a4==14) && ((a19==9) && (((( a1 <=  -13  && (a10==3)) || ((  ((38 < a1) && (218 >= a1))  && (a10==2)) || ((a10==2) &&  218 < a1 ))) && (input == 3)) && (a12==0))))){  
366
	    	a1 = ((((a1 % 299890)- -300108) + 1) * 1);  
367
	    		a10 = 0;   
368
  
369
	    	 return -1;  
370
	    } else if((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) &&   ((38 < a1) && (218 >= a1)) ) && (a19==10))){  
371
	    	a1 = (((a1 - -320095) * 1) - -173480);  
372
	    		a19 = 9;   
373
  
374
	    	 return -1;  
375
	    } else if(((a4==14) && (((a12==0) && ( 218 < a1  && ((a19==9) && (input == 3)))) && (a10==4)))){  
376
  
377
	    	 return 24;  
378
	    } else if((((a4==14) && ((a12==0) && ((((a10==3) &&  218 < a1 ) || ((a10==4) &&  a1 <=  -13 )) && (input == 4)))) && (a19==9))){  
379
	    	a1 = ((((a1 % 89)+ 128) + -1) - 0);  
380
	    		a10 = 3;   
381
  
382
	    	 return -1;  
383
	    } else if((((a12==0) && (((a10==4) && ((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))){  
384
	    	a1 = ((((a1 + -121822) * 4) * 10)/ -9);  
385
	    		a10 = 3;   
386
  
387
	    	 return -1;  
388
	    } else if(((a19==9) && ((a4==14) && (((input == 5) && (((  ((38 < a1) && (218 >= a1))  && (a10==2)) || ((a10==2) &&  218 < a1 )) || ((a10==3) &&  a1 <=  -13 ))) && (a12==0))))){  
389
	    	a1 = ((((a1 % 299890)- -300108) + 2) + 0);  
390
	    		a10 = 2;   
391
  
392
	    	 return 21;  
393
	    } else if(((a12==0) && (((a19==9) && ((((a10==0) &&  218 < a1 ) || ( a1 <=  -13  && (a10==1))) && (input == 5))) && (a4==14)))){  
394
	    	a1 = ((((a1 % 299993)- 300005) + -1) - 1);  
395
	    		a10 = 3;   
396
  
397
	    	 return 21;  
398
	    } else if(( 218 < a1  && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))){  
399
  
400
	    		a10 = 1;   
401
  
402
	    	 return 22;  
403
	    } else if((((a12==0) && ((a19==9) && ((((a10==3) &&  a1 <=  -13 ) || (((a10==2) &&   ((38 < a1) && (218 >= a1)) ) || ( 218 < a1  && (a10==2)))) && (input == 6)))) && (a4==14))){  
404
	    	a1 = ((((a1 - 0) % 299890)- -300108) - -1);  
405
	    		a10 = 2;   
406
  
407
	    	 return -1;  
408
	    } else if(((a19==9) && ((a12==0) && (((( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))){  
409
	    	a1 = ((((a1 % 299890)+ 300108) * 1) * 1);  
410
	    		a10 = 0;   
411
	    		a19 = 8;   
412
  
413
	    	 return -1;  
414
	    } else if((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) &&   ((-13 < a1) && (38 >= a1)) )) && (a4==14))){  
415
	    	a1 = (((a1 - -575828) - -5011) + 9014);  
416
	    		a19 = 9;   
417
  
418
	    	 return 24;  
419
	    } else if(((a12==0) && ((a4==14) && ( 218 < a1  && (((a10==1) && (input == 4)) && (a19==10)))))){  
420
	    	a1 = (((((a1 * 9)/ 10) * -1)/ 10) * 5);  
421
	    		a10 = 2;   
422
	    		a19 = 9;   
423
  
424
	    	 return 24;  
425
	    } else if(((((((input == 3) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))){  
426
	    	a1 = ((((a1 / 5) * 5) / 5) + 505228);  
427
	    		a10 = 1;   
428
  
429
	    	 return 25;  
430
	    } else if((((a4==14) && (((( a1 <=  -13  && (a10==1)) || (((a10==0) &&   ((38 < a1) && (218 >= a1)) ) || ( 218 < a1  && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))){  
431
	    	a1 = (((((a1 * 9)/ 10) % 299993)+ -300005) - 1);  
432
	    		a10 = 2;   
433
	    		a19 = 9;   
434
  
435
	    	 return 24;  
436
	    } else if(((a19==9) && ((((input == 4) && (( 218 < a1  && (a10==0)) || ((a10==1) &&  a1 <=  -13 ))) && (a12==0)) && (a4==14)))){  
437
	    	a1 = (((((a1 / 5) % 89)- -128) / 5) + 34);  
438
	    		a10 = 0;   
439
	    		a19 = 8;   
440
  
441
	    	 return -1;  
442
	    } else if((((a19==10) && ((a12==0) && ((((a10==1) &&  a1 <=  -13 ) || ((  ((38 < a1) && (218 >= a1))  && (a10==0)) || ((a10==0) &&  218 < a1 ))) && (input == 3)))) && (a4==14))){  
443
	    	a1 = ((((a1 % 299993)- 300005) - 0) - 2);  
444
	    		a10 = 2;   
445
	    		a19 = 9;   
446
  
447
	    	 return 22;  
448
	    } else if(((a19==9) && (((a4==14) && ((((a10==3) &&  218 < a1 ) || ( a1 <=  -13  && (a10==4))) && (input == 5))) && (a12==0)))){  
449
	    	a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13);  
450
	    		a10 = 3;   
451
	    		a19 = 6;   
452
  
453
	    	 return -1;  
454
	    } else if((((a12==0) && ((((input == 5) && (a19==10)) &&   ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))){  
455
	    	a1 = ((((a1 + 381077) % 25)- -1) / 5);  
456
	    		a10 = 2;   
457
	    		a19 = 7;   
458
  
459
	    	 return -1;  
460
	    } else if(((a19==9) && ((a4==14) && ((((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))){  
461
	    	a1 = (((a1 / 5) + 105416) + 61704);  
462
	    		a10 = 4;   
463
  
464
	    	 return 24;  
465
	    } else if(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))){  
466
	    	a1 = (((((a1 % 299890)+ 300108) - -1) + -309315) - -309317);  
467
	    		a10 = 1;   
468
	    		a19 = 7;   
469
  
470
	    	 return -1;  
471
	    } else if(( 218 < a1  && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))){  
472
	    	a1 = ((((a1 % 25)- 10) - 1) / 5);  
473
	    		a10 = 0;   
474
  
475
	    	 return -1;  
476
	    } else if((((a12==0) && ((a19==9) && (((input == 3) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))){  
477
	    	a1 = ((((a1 - -133866) + -357620) / 5) + 265622);  
478
	    		a10 = 0;   
479
  
480
	    	 return -1;  
481
	    } else if((((((a4==14) && (  ((38 < a1) && (218 >= a1))  && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))){  
482
	    	a1 = ((((a1 * 10)/ -9) * 5) - 333686);  
483
	    		a10 = 4;   
484
	    		a19 = 6;   
485
  
486
	    	 return -1;  
487
	    } else if((((a19==10) && ((a10==1) && ((a12==0) && (  ((-13 < a1) && (38 >= a1))  && (input == 5))))) && (a4==14))){  
488
	    	a1 = (((a1 + -283353) / 5) + -495232);  
489
	    		a10 = 0;   
490
	    		a19 = 6;   
491
  
492
	    	 return -1;  
493
	    } else if(((((a10==1) && (((input == 5) &&  218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))){  
494
	    	a1 = (((((a1 % 89)- -93) * 5) % 89)- -56);  
495
	    		a10 = 4;   
496
	    		a19 = 8;   
497
  
498
	    	 return -1;  
499
	    } else if((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) &&  218 < a1 ) || ((a10==4) &&  a1 <=  -13 ))))) && (a12==0))){  
500
	    	a1 = ((((a1 % 299993)+ -300005) - 1) - 1);  
501
	    		a10 = 1;   
502
  
503
	    	 return -1;  
504
	    } else if((((a4==14) && (((a19==9) && ((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))){  
505
	    	a1 = (((((a1 % 89)+ 129) - 1134) * -1)/ 10);  
506
	    		a10 = 3;   
507
  
508
	    	 return -1;  
509
	    } else if(((a4==14) && (((a19==9) && (((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))){  
510
	    	a1 = (((a1 - 559222) + -11915) - 28339);  
511
	    		a10 = 1;   
512
  
513
	    	 return -1;  
514
	    } else if((((a4==14) && ((((input == 6) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))){  
515
	    	a1 = (((((a1 + 0) % 299993)- 300005) / 5) - 292229);  
516
	    	 return -1;  
517
	    } else if(((a12==0) && ((a4==14) && (((( a1 <=  -13  && (a10==1)) || (((a10==0) &&   ((38 < a1) && (218 >= a1)) ) || ( 218 < a1  && (a10==0)))) && (input == 2)) && (a19==10))))){  
518
	    	a1 = ((((a1 % 25)+ 12) - -2) / 5);  
519
	    		a10 = 2;   
520
	    		a19 = 9;   
521
  
522
	    	 return 22;  
523
	    } else if((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))){  
524
	    	a1 = ((((a1 / 5) % 25)+ 13) / 5);  
525
	    	 return 25;  
526
	    } else if(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )) && (a10==0)))))){  
527
	    	a1 = (((a1 * 5) + 278443) - -239546);  
528
	    	 return 26;  
529
	    } else if(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )))) && (a4==14)))){  
530
	    	a1 = (((((a1 * 5) + 59655) * 5) % 25)+ 12);  
531
	    		a19 = 10;   
532
  
533
	    	 return 26;  
534
	    } else if(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )) && (a12==0)))))){  
535
	    	a1 = (((a1 + -438195) * 1) * 1);  
536
	    		a10 = 2;   
537
	    		a19 = 8;   
538
  
539
	    	 return -1;  
540
	    } else if(((a12==0) && (((((input == 6) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))){  
541
	    	a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110);  
542
	    		a10 = 1;   
543
  
544
	    	 return 25;  
545
	    } else if(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && (  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) )))) && (a10==4)))){  
546
	    	a1 = (((((a1 - 44798) + -168742) * 2) % 89)+ 207);  
547
	    	 return -1;  
548
	    } else if((((((  ((38 < a1) && (218 >= a1))  && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))){  
549
	    	a1 = ((((a1 * 5) - -287099) - 723016) + 616783);  
550
	    		a10 = 4;   
551
	    		a19 = 9;   
552
  
553
	    	 return -1;  
554
	    } else if((((a4==14) && (((( a1 <=  -13  ||   ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))){  
555
	    	a1 = ((((a1 % 299993)- 300005) * 1) - 3);  
556
	    	 return 24;  
557
	    } else if(((a12==0) && ((( 218 < a1  && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14)))){  
558
	    	a1 = ((((a1 * 9)/ 10) + 58620) - 603783);  
559
	    		a10 = 4;   
560
	    		a19 = 8;   
561
  
562
	    	 return -1;  
563
	    } else if(((a4==14) && (((((  ((-13 < a1) && (38 >= a1))  ||   ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a12==0)) && (a19==9)) && (a10==4)))){  
564
	    	a1 = (((a1 + 566454) + 1842) + 23814);  
565
	    		a10 = 2;   
566
	    		a19 = 8;   
567
  
568
	    	 return -1;  
569
	    } else if(((a12==0) && ((((a10==1) && (  ((-13 < a1) && (38 >= a1))  && (input == 2))) && (a4==14)) && (a19==10)))){  
570
  
571
	    	 return 26;  
572
	    }   
573
	    return -2;  
574
	}  
575
  
576
int main()  
577
{initialize_reads();  
578
    // default output  
579
    int output = -1;  
580
  
581
    // main i/o-loop  
582
    while(1)  
583
    {  
584
        // read input  
585
        int input;  
586
        input = (input_at_586_counter < num_of_inputs_at_586) ? INPUTS_at_586[input_at_586_counter++] : __VERIFIER_nondet_int() ;  
587
        if ((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))   
588
          return -2;  
589
  
590
        // operate eca engine  
591
        output = calculate_output(input);  
592
    }  
593
}  
2017-05-11 15:17:04:901	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 15:17:04:990	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 15:17:07:895	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 15:17:07:926	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 15:17:07:953	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 15:17:08:126	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 15:17:08:764	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 15:17:08:847	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 15:17:08:928	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 15:17:09:324	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 15:17:09:339	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 15:17:09:365	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 15:17:09:394	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 15:17:10:109	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:17:11:380	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:17:11:495	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:17:11:869	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:17:18:955	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 15:17:18:956	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56891cd6

2017-05-11 15:17:18:956	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:17:22:661	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 15:17:22:662	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56891cd6

2017-05-11 15:17:22:662	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:17:25:399	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:17:25:549	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 15:17:25:550	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56891cd6

2017-05-11 15:17:25:550	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:17:32:081	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 5

2017-05-11 15:17:32:082	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56891cd6

2017-05-11 15:17:32:082	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:17:34:734	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 15:17:34:735	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:17:34:743	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:17:34:743	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:17:34:752	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:17:38:950	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:17:49:124	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 15:17:49:126	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:17:49:134	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:17:49:135	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:17:49:144	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:17:53:568	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:18:04:737	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 2

2017-05-11 15:18:04:738	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56891cd6

2017-05-11 15:18:04:738	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:18:13:403	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 15:18:13:403	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:18:13:408	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:18:13:410	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:18:13:424	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:18:19:048	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:18:35:605	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 7

2017-05-11 15:18:35:605	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56891cd6

2017-05-11 15:18:35:606	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:18:44:547	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 15:18:44:547	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:18:44:552	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:18:44:552	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:18:44:568	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:18:51:208	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:19:13:772	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 15:19:13:772	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56891cd6

2017-05-11 15:19:13:773	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:19:28:982	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

2017-05-11 15:19:28:982	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:19:28:986	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:19:28:987	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:19:29:005	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:19:36:883	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:20:20:730	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 7

2017-05-11 15:20:20:730	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:20:23:988	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:21:04:346	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:21:52:370	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:22:01:427	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:22:08:091	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 9

2017-05-11 15:22:08:091	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@56891cd6

2017-05-11 15:22:08:091	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:23:07:075	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 8

2017-05-11 15:23:07:076	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:23:07:714	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:23:31:084	WARNING	AbstractFuture.get	Warning: Analysis interrupted

2017-05-11 15:23:31:084	WARNING	ForceTerminationOnShutdown$1.shutdownRequested	Shutdown requested (The CPU-time limit of 900s has elapsed.), waiting for termination.

2017-05-11 15:23:31:084	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:                  1.388s
  Time for transition matches:                         0.511s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.000s
Automaton transfers with branching:                0
Automaton transfer successors:                       453746 (count: 454660, min: 0, max: 1, avg: 1.00) [0 x 914, 1 x 453746]

CPA algorithm statistics
------------------------
Number of iterations:            421000
Max size of waitlist:            769
Average size of waitlist:        288
Number of computed successors:   453746
Max successors for one state:    2
Number of times merged:          35898
Number of times stopped:         36908
Number of times breaked:         0

Total time for CPA algorithm:       380.165s (Max:   174.198s)
  Time for choose from waitlist:      0.310s
  Time for precision adjustment:      4.031s
  Time for transfer relation:        56.773s
  Time for merge operator:          309.430s
  Time for stop operator:             6.090s
  Time for adding to reached set:     1.560s


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

Code Coverage
-----------------------------
  Function coverage:      0.333
  Visited lines:          0
  Total lines:            441
  Line coverage:          0.000
  Visited conditions:     0
  Total conditions:       1908
  Condition coverage:     0.000

CPAchecker general statistics
-----------------------------
Number of program locations:     1413
Number of CFA edges:             2366
Number of relevant variables:    14
Number of functions:             3
Number of loops:                 2
Size of reached set:             1
  Number of reached locations:   1 (0%)
    Avg states per location:     1
    Max states per location:     1 (at node N1517)
  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:          2.875s
  Time for loading CPAs:          0.862s
  Time for loading parser:        0.476s
  Time for CFA construction:      1.458s
    Time for parsing file(s):     0.346s
    Time for AST to CFA:          0.481s
    Time for CFA sanity check:    0.168s
    Time for post-processing:     0.430s
      Time for var class.:        0.280s
    Time for CFA export:          0.826s
Time for Analysis:              383.186s
CPU time for analysis:          891.930s
Total time for CPAchecker:      386.075s
Total CPU time for CPAchecker:  899.980s
Time for statistics:              0.036s

Time for Garbage Collector:      38.426s (in 304 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                956MB (   912 MiB) max;    484MB (   462 MiB) avg;    985MB (   939 MiB) peak
Used non-heap memory:             50MB (    48 MiB) max;     49MB (    47 MiB) avg;     51MB (    48 MiB) peak
Used in PS Old Gen pool:         550MB (   524 MiB) max;    287MB (   274 MiB) avg;    551MB (   526 MiB) peak
Allocated heap memory:          1253MB (  1195 MiB) max;    971MB (   926 MiB) avg
Allocated non-heap memory:        53MB (    50 MiB) max;     52MB (    50 MiB) avg
Total process virtual memory:  12209MB ( 11644 MiB) max;  10395MB (  9914 MiB) avg

    
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/Problem10_label15_false-unreach-call/Problem10_label15_false-unreach-call.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/Problem10_label15_false-unreach-call/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