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_217 = 3; int INPUTS_at_217[3]; int input_at_217_counter = 0;int num_of_inputs_at_203 = 3; int INPUTS_at_203[3]; int input_at_203_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_217[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_203[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__)); |
2 | |
3 | extern int __VERIFIER_nondet_int(); |
4 | /* Generated by CIL v. 1.3.6 */ |
5 | /* print_CIL_Input is true */ |
6 | |
7 | void error(void) |
8 | { |
9 | |
10 | { |
11 | __VERIFIER_assume(!((0 != INPUTS_at_217[1])));__VERIFIER_assume(!((0 != INPUTS_at_203[1])));__VERIFIER_assume(!((0 != INPUTS_at_203[1])));__VERIFIER_error(); |
12 | return; |
13 | } |
14 | } |
15 | int m_pc = 0; |
16 | int t1_pc = 0; |
17 | int m_st ; |
18 | int t1_st ; |
19 | int m_i ; |
20 | int t1_i ; |
21 | int M_E = 2; |
22 | int T1_E = 2; |
23 | int E_1 = 2; |
24 | int is_master_triggered(void) ; |
25 | int is_transmit1_triggered(void) ; |
26 | void immediate_notify(void) ; |
27 | void master(void) |
28 | { |
29 | |
30 | { |
31 | if (m_pc == 0) { |
32 | goto M_ENTRY; |
33 | } else { |
34 | if (m_pc == 1) { |
35 | goto M_WAIT; |
36 | } else { |
37 | |
38 | } |
39 | } |
40 | M_ENTRY: ; |
41 | { |
42 | while (1) { |
43 | while_0_continue: /* CIL Label */ ; |
44 | { |
45 | E_1 = 1; |
46 | immediate_notify(); |
47 | E_1 = 2; |
48 | } |
49 | { |
50 | while (1) { |
51 | while_1_continue: /* CIL Label */ ; |
52 | m_pc = 1; |
53 | m_st = 2; |
54 | |
55 | goto return_label; |
56 | M_WAIT: ; |
57 | } |
58 | while_1_break: /* CIL Label */ ; |
59 | } |
60 | } |
61 | while_0_break: /* CIL Label */ ; |
62 | } |
63 | |
64 | return_label: /* CIL Label */ |
65 | return; |
66 | } |
67 | } |
68 | void transmit1(void) |
69 | { |
70 | |
71 | { |
72 | if (t1_pc == 0) { |
73 | goto T1_ENTRY; |
74 | } else { |
75 | if (t1_pc == 1) { |
76 | goto T1_WAIT; |
77 | } else { |
78 | |
79 | } |
80 | } |
81 | T1_ENTRY: ; |
82 | { |
83 | while (1) { |
84 | while_2_continue: /* CIL Label */ ; |
85 | t1_pc = 1; |
86 | t1_st = 2; |
87 | |
88 | goto return_label; |
89 | T1_WAIT: |
90 | { |
91 | error(); |
92 | } |
93 | } |
94 | while_2_break: /* CIL Label */ ; |
95 | } |
96 | |
97 | return_label: /* CIL Label */ |
98 | return; |
99 | } |
100 | } |
101 | int is_master_triggered(void) |
102 | { int __retres1 ; |
103 | |
104 | { |
105 | if (m_pc == 1) { |
106 | if (M_E == 1) { |
107 | __retres1 = 1; |
108 | goto return_label; |
109 | } else { |
110 | |
111 | } |
112 | } else { |
113 | |
114 | } |
115 | __retres1 = 0; |
116 | return_label: /* CIL Label */ |
117 | return (__retres1); |
118 | } |
119 | } |
120 | int is_transmit1_triggered(void) |
121 | { int __retres1 ; |
122 | |
123 | { |
124 | if (t1_pc == 1) { |
125 | if (E_1 == 1) { |
126 | __retres1 = 1; |
127 | goto return_label; |
128 | } else { |
129 | |
130 | } |
131 | } else { |
132 | |
133 | } |
134 | __retres1 = 0; |
135 | return_label: /* CIL Label */ |
136 | return (__retres1); |
137 | } |
138 | } |
139 | void update_channels(void) |
140 | { |
141 | |
142 | { |
143 | |
144 | return; |
145 | } |
146 | } |
147 | void init_threads(void) |
148 | { |
149 | |
150 | { |
151 | if (m_i == 1) { |
152 | m_st = 0; |
153 | } else { |
154 | m_st = 2; |
155 | } |
156 | if (t1_i == 1) { |
157 | t1_st = 0; |
158 | } else { |
159 | t1_st = 2; |
160 | } |
161 | |
162 | return; |
163 | } |
164 | } |
165 | int exists_runnable_thread(void) |
166 | { int __retres1 ; |
167 | |
168 | { |
169 | if (m_st == 0) { |
170 | __retres1 = 1; |
171 | goto return_label; |
172 | } else { |
173 | if (t1_st == 0) { |
174 | __retres1 = 1; |
175 | goto return_label; |
176 | } else { |
177 | |
178 | } |
179 | } |
180 | __retres1 = 0; |
181 | return_label: /* CIL Label */ |
182 | return (__retres1); |
183 | } |
184 | } |
185 | void eval(void) |
186 | { |
187 | int tmp ; |
188 | |
189 | { |
190 | { |
191 | while (1) { |
192 | while_3_continue: /* CIL Label */ ; |
193 | { |
194 | tmp = exists_runnable_thread(); |
195 | } |
196 | if (tmp != 0) { |
197 | |
198 | } else { |
199 | goto while_3_break; |
200 | } |
201 | if (m_st == 0) { |
202 | int tmp_ndt_1; |
203 | tmp_ndt_1 = (input_at_203_counter < num_of_inputs_at_203) ? INPUTS_at_203[input_at_203_counter++] : __VERIFIER_nondet_int() ; |
204 | if (tmp_ndt_1 != 0) { |
205 | { |
206 | m_st = 1; |
207 | master(); |
208 | } |
209 | } else { |
210 | |
211 | } |
212 | } else { |
213 | |
214 | } |
215 | if (t1_st == 0) { |
216 | int tmp_ndt_2; |
217 | tmp_ndt_2 = (input_at_217_counter < num_of_inputs_at_217) ? INPUTS_at_217[input_at_217_counter++] : __VERIFIER_nondet_int() ; |
218 | if (tmp_ndt_2 != 0) { |
219 | { |
220 | t1_st = 1; |
221 | transmit1(); |
222 | } |
223 | } else { |
224 | |
225 | } |
226 | } else { |
227 | |
228 | } |
229 | } |
230 | while_3_break: /* CIL Label */ ; |
231 | } |
232 | |
233 | return; |
234 | } |
235 | } |
236 | void fire_delta_events(void) |
237 | { |
238 | |
239 | { |
240 | if (M_E == 0) { |
241 | M_E = 1; |
242 | } else { |
243 | |
244 | } |
245 | if (T1_E == 0) { |
246 | T1_E = 1; |
247 | } else { |
248 | |
249 | } |
250 | if (E_1 == 0) { |
251 | E_1 = 1; |
252 | } else { |
253 | |
254 | } |
255 | |
256 | return; |
257 | } |
258 | } |
259 | void reset_delta_events(void) |
260 | { |
261 | |
262 | { |
263 | if (M_E == 1) { |
264 | M_E = 2; |
265 | } else { |
266 | |
267 | } |
268 | if (T1_E == 1) { |
269 | T1_E = 2; |
270 | } else { |
271 | |
272 | } |
273 | if (E_1 == 1) { |
274 | E_1 = 2; |
275 | } else { |
276 | |
277 | } |
278 | |
279 | return; |
280 | } |
281 | } |
282 | void activate_threads(void) |
283 | { int tmp ; |
284 | int tmp___0 ; |
285 | |
286 | { |
287 | { |
288 | tmp = is_master_triggered(); |
289 | } |
290 | if (tmp != 0) { |
291 | m_st = 0; |
292 | } else { |
293 | |
294 | } |
295 | { |
296 | tmp___0 = is_transmit1_triggered(); |
297 | } |
298 | if (tmp___0 != 0) { |
299 | t1_st = 0; |
300 | } else { |
301 | |
302 | } |
303 | |
304 | return; |
305 | } |
306 | } |
307 | void immediate_notify(void) |
308 | { |
309 | |
310 | { |
311 | { |
312 | activate_threads(); |
313 | } |
314 | |
315 | return; |
316 | } |
317 | } |
318 | void fire_time_events(void) |
319 | { |
320 | |
321 | { |
322 | M_E = 1; |
323 | |
324 | return; |
325 | } |
326 | } |
327 | void reset_time_events(void) |
328 | { |
329 | |
330 | { |
331 | if (M_E == 1) { |
332 | M_E = 2; |
333 | } else { |
334 | |
335 | } |
336 | if (T1_E == 1) { |
337 | T1_E = 2; |
338 | } else { |
339 | |
340 | } |
341 | if (E_1 == 1) { |
342 | E_1 = 2; |
343 | } else { |
344 | |
345 | } |
346 | |
347 | return; |
348 | } |
349 | } |
350 | void init_model(void) |
351 | { |
352 | |
353 | { |
354 | m_i = 1; |
355 | t1_i = 1; |
356 | |
357 | return; |
358 | } |
359 | } |
360 | int stop_simulation(void) |
361 | { int tmp ; |
362 | int __retres2 ; |
363 | |
364 | { |
365 | { |
366 | tmp = exists_runnable_thread(); |
367 | } |
368 | if (tmp != 0) { |
369 | __retres2 = 0; |
370 | goto return_label; |
371 | } else { |
372 | |
373 | } |
374 | __retres2 = 1; |
375 | return_label: /* CIL Label */ |
376 | return (__retres2); |
377 | } |
378 | } |
379 | void start_simulation(void) |
380 | { int kernel_st ; |
381 | int tmp ; |
382 | int tmp___0 ; |
383 | |
384 | { |
385 | { |
386 | kernel_st = 0; |
387 | update_channels(); |
388 | init_threads(); |
389 | fire_delta_events(); |
390 | activate_threads(); |
391 | reset_delta_events(); |
392 | } |
393 | { |
394 | while (1) { |
395 | while_4_continue: /* CIL Label */ ; |
396 | { |
397 | kernel_st = 1; |
398 | eval(); |
399 | } |
400 | { |
401 | kernel_st = 2; |
402 | update_channels(); |
403 | } |
404 | { |
405 | kernel_st = 3; |
406 | fire_delta_events(); |
407 | activate_threads(); |
408 | reset_delta_events(); |
409 | } |
410 | { |
411 | tmp = exists_runnable_thread(); |
412 | } |
413 | if (tmp == 0) { |
414 | { |
415 | kernel_st = 4; |
416 | fire_time_events(); |
417 | activate_threads(); |
418 | reset_time_events(); |
419 | } |
420 | } else { |
421 | |
422 | } |
423 | { |
424 | tmp___0 = stop_simulation(); |
425 | } |
426 | if (tmp___0 != 0) { |
427 | goto while_4_break; |
428 | } else { |
429 | |
430 | } |
431 | } |
432 | while_4_break: /* CIL Label */ ; |
433 | } |
434 | |
435 | return; |
436 | } |
437 | } |
438 | int main(void) |
439 | {initialize_reads(); int __retres1 ; |
440 | |
441 | { |
442 | { |
443 | init_model(); |
444 | start_simulation(); |
445 | } |
446 | __retres1 = 0; |
447 | return (__retres1); |
448 | } |
449 | } |
2017-05-11 14:49:27:579 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:49:27:672 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 14:49:29:634 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 14:49:29:658 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:49:29:682 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:49:29:891 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 14:49:30:479 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 14:49:30:572 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 14:49:30:669 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 14:49:30:923 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 14:49:30:925 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 14:49:30:935 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 14:49:30:943 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 14:49:31:186 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:49:32:366 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 14:49:32:368 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:32:368 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:32:734 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:49:32:764 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:49:33:163 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:49:33:217 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 14:49:33:218 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:33:218 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:34:719 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 3
2017-05-11 14:49:34:719 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:34:720 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:37:223 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 4
2017-05-11 14:49:37:230 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:37:230 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:39:282 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 6
2017-05-11 14:49:39:286 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:39:286 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:40:360 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 10
2017-05-11 14:49:40:361 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:40:361 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:42:706 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 12
2017-05-11 14:49:42:706 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:42:707 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:43:600 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 3
2017-05-11 14:49:43:601 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:43:601 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:44:022 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 16
2017-05-11 14:49:44:022 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:44:022 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:44:504 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 18
2017-05-11 14:49:44:505 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:44:505 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:44:989 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 19
2017-05-11 14:49:44:989 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:44:990 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:45:342 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 21
2017-05-11 14:49:45:343 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:45:343 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:45:862 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 22
2017-05-11 14:49:45:863 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:45:863 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:45:966 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:49:46:386 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 23
2017-05-11 14:49:46:386 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:46:386 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:46:744 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 25
2017-05-11 14:49:46:744 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:46:745 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:47:083 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 29
2017-05-11 14:49:47:084 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:47:084 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:47:515 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 31
2017-05-11 14:49:47:515 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:47:516 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:47:862 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 35
2017-05-11 14:49:47:863 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:47:863 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:48:910 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 37
2017-05-11 14:49:48:911 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:48:911 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:49:869 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 41
2017-05-11 14:49:49:869 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:49:869 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:51:200 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$AbstractionStrategyAdjuster.adjustConditions Adjusting abstraction strategy to NEVER
2017-05-11 14:49:51:201 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@27dbe592
2017-05-11 14:49:51:201 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:51:914 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:49:51:919 INFO ParallelAlgorithm.handleFutureResults /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties finished without usable result.
2017-05-11 14:50:12:787 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 2
2017-05-11 14:50:12:787 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:50:12:793 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:50:12:794 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:50:12:802 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:50:23:689 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:50:33:033 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 3
2017-05-11 14:50:33:033 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:50:33:038 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:50:33:038 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:50:33:048 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:50:45:794 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:50:56:392 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 4
2017-05-11 14:50:56:393 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:50:56:729 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:50:57:092 INFO Parallel analysis 1:BMCAlgorithm.analyzeCounterexample Error found, creating error path
2017-05-11 14:50:57:137 WARNING Parallel analysis 1:PredicateCPA:PathFormulaManagerImpl.buildBranchingFormula ARG branching without AssumeEdge at ARG node 38190.
2017-05-11 14:50:57:137 WARNING Parallel analysis 1:BMCAlgorithm.analyzeCounterexample Could not create error path because of missing branching information!
2017-05-11 14:50:57:216 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:50:57:615 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:50:57:616 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:50:57:888 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:50:57:888 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:50:58:238 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 14:50:58:239 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:50:58:492 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:50:58:492 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:50:58:811 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:50:58:811 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:50:59:125 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:50:59:126 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:50:59:430 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:50:59:432 INFO ParallelAlgorithm.handleFutureResults /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.
2017-05-11 14:50:59:435 INFO CPAchecker.runAlgorithm Stopping analysis ...
Parallel Algorithm statistics
-----------------------------
Number of algorithms used: 2
Successful analysis: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
===================================================================================================================================
PredicateCPA statistics
-----------------------
Number of abstractions: 7 (0% of all post computations)
Times abstraction was reused: 0
Because of function entry/exit: 0 (0%)
Because of loop head: 0 (0%)
Because of join nodes: 0 (0%)
Because of threshold: 0 (0%)
Because of target state: 7 (100%)
Times precision was empty: 7 (100%)
Times precision was {false}: 0 (0%)
Times result was cached: 0 (0%)
Times cartesian abs was used: 0 (0%)
Times boolean abs was used: 0 (0%)
Times result was 'false': 0 (0%)
Number of strengthen sat checks: 0
Number of coverage checks: 380
BDD entailment checks: 0
Number of SMT sat checks: 0
trivial: 0
cached: 0
Max ABE block size: 313
Number of predicates discovered: 0
Time for post operator: 1.015s
Time for path formula creation: 1.009s
Time for strengthen operator: 0.008s
Time for prec operator: 0.005s
Time for abstraction: 0.000s (Max: 0.000s, Count: 7)
Solving time: 0.000s (Max: 0.000s)
Model enumeration time: 0.000s
Time for BDD construction: 0.000s (Max: 0.000s)
Time for merge operator: 0.025s
Time for coverage check: 0.000s
Total time for SMT solver (w/o itp): 0.000s
Total number of created targets for pointer analysis: 36
Number of created targets for uf: *signed_int is 19
PrecisionBootstrap statistics
-----------------------------
Init. function predicates: 0
Init. global predicates: 0
Init. location predicates: 0
Invariant Generation statistics
-------------------------------
Bounds CPA statistics
---------------------
Bound k: 4
Maximum loop iteration reached: 5
ValueAnalysisCPA statistics
---------------------------
Number of variables: 26337 (count: 2431, min: 0, max: 18, avg: 10.83)
Number of global variables: 21331 (count: 2431, min: 0, max: 13, avg: 8.77)
ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations: 2623
Total time for liveness abstraction: 0.000s
Total time for abstraction computation: 0.022s
Total time for path thresholds: 0.000s
Number of tracked memory locations: 37
ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions: 768
Number of deterministic Assumptions: 356
Level of Determinism: 46%
ConstraintsStrengthenOperator statistics
----------------------------------------
Total time for strengthening by ConstraintsCPA: 0.000s
Replaced symbolic expressions: 0
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.007s
Automaton transfers with branching: 0
Automaton transfer successors: 2623 (count: 2630, min: 0, max: 1, avg: 1.00) [0 x 7, 1 x 2623]
CPA algorithm statistics
------------------------
Number of iterations: 2454
Max size of waitlist: 16
Average size of waitlist: 6
Number of computed successors: 2623
Max successors for one state: 2
Number of times merged: 190
Number of times stopped: 190
Number of times breaked: 0
Total time for CPA algorithm: 1.862s (Max: 1.523s)
Time for choose from waitlist: 0.001s
Time for precision adjustment: 0.074s
Time for transfer relation: 1.711s
Time for merge operator: 0.029s
Time for stop operator: 0.006s
Time for adding to reached set: 0.011s
BMC algorithm statistics
------------------------
Time for BMC formula creation: 1.866s
Time for final sat check: 0.375s
Time for error path creation: 0.045s
Time for bounding assertions check: 0.206s
Time for induction formula creation: 36.413s
Time for induction check: 46.712s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 6 (600%)
Time for counterexample checks: 2.214s
Time for running CBMC: 2.096s
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.269s
Automaton transfers with branching: 0
Automaton transfer successors: 39005 (count: 39086, min: 0, max: 1, avg: 1.00) [0 x 81, 1 x 39005]
CPA algorithm statistics
------------------------
Number of iterations: 37788
Max size of waitlist: 24
Average size of waitlist: 5
Number of computed successors: 39005
Max successors for one state: 2
Number of times merged: 5991
Number of times stopped: 6615
Number of times breaked: 0
Total time for CPA algorithm: 19.215s (Max: 2.340s)
Time for choose from waitlist: 0.050s
Time for precision adjustment: 1.066s
Time for transfer relation: 6.717s
Time for merge operator: 9.781s
Time for stop operator: 0.790s
Time for adding to reached set: 0.277s
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 1.000
Visited lines: 166
Total lines: 177
Line coverage: 0.938
Visited conditions: 64
Total conditions: 76
Condition coverage: 0.842
CPAchecker general statistics
-----------------------------
Number of program locations: 335
Number of CFA edges: 404
Number of relevant variables: 42
Number of functions: 20
Number of loops: 4
Size of reached set: 2431
Number of reached locations: 311 (93%)
Avg states per location: 7
Max states per location: 23 (at node N83)
Number of reached functions: 20 (100%)
Number of partitions: 2431
Avg size of partitions: 1
Max size of partitions: 1
Number of target states: 7
Time for analysis setup: 1.935s
Time for loading CPAs: 0.413s
Time for loading parser: 0.471s
Time for CFA construction: 0.976s
Time for parsing file(s): 0.266s
Time for AST to CFA: 0.330s
Time for CFA sanity check: 0.051s
Time for post-processing: 0.266s
Time for var class.: 0.165s
Time for CFA export: 0.297s
Time for Analysis: 89.798s
CPU time for analysis: 162.520s
Time for analyzing result: 0.002s
Total time for CPAchecker: 91.746s
Total CPU time for CPAchecker: 166.810s
Time for statistics: 2.299s
Time for Garbage Collector: 5.198s (in 54 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 447MB ( 426 MiB) max; 217MB ( 206 MiB) avg; 466MB ( 444 MiB) peak
Used non-heap memory: 52MB ( 50 MiB) max; 49MB ( 47 MiB) avg; 59MB ( 56 MiB) peak
Used in PS Old Gen pool: 43MB ( 41 MiB) max; 27MB ( 26 MiB) avg; 43MB ( 41 MiB) peak
Allocated heap memory: 1205MB ( 1150 MiB) max; 954MB ( 910 MiB) avg
Allocated non-heap memory: 54MB ( 52 MiB) max; 52MB ( 49 MiB) avg
Total process virtual memory: 8298MB ( 7914 MiB) max; 8041MB ( 7668 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/transmitter.01_false-unreach-call_false-termination.cil/transmitter.01_false-unreach-call_false-termination.cil.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/transmitter.01_false-unreach-call_false-termination.cil/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