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_249 = 3; int INPUTS_at_249[3]; int input_at_249_counter = 0;int num_of_inputs_at_119 = 2; int INPUTS_at_119[2]; int input_at_119_counter = 0;int num_of_inputs_at_264 = 2; int INPUTS_at_264[2]; int input_at_264_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_249[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_119[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_264[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__)); |
2 | |
3 | extern int __VERIFIER_nondet_int(); |
4 | |
5 | void error(void) |
6 | { |
7 | |
8 | { |
9 | __VERIFIER_assume(!((0 == INPUTS_at_249[0])));__VERIFIER_assume(!((0 == INPUTS_at_249[1])));__VERIFIER_assume(!((0 == INPUTS_at_249[2] && 0 != INPUTS_at_119[0] && 0 != INPUTS_at_249[0] && 0 != INPUTS_at_264[1] && 0 != INPUTS_at_249[1])));__VERIFIER_error(); |
10 | return; |
11 | } |
12 | } |
13 | |
14 | int q_buf_0 ; |
15 | int q_free ; |
16 | int q_read_ev ; |
17 | int q_write_ev ; |
18 | int p_num_write ; |
19 | int p_last_write ; |
20 | int p_dw_st ; |
21 | int p_dw_pc ; |
22 | int p_dw_i ; |
23 | int c_num_read ; |
24 | int c_last_read ; |
25 | int c_dr_st ; |
26 | int c_dr_pc ; |
27 | int c_dr_i ; |
28 | int is_do_write_p_triggered(void) |
29 | { int __retres1 ; |
30 | |
31 | { |
32 | if ((int )p_dw_pc == 1) { |
33 | if ((int )q_read_ev == 1) { |
34 | __retres1 = 1; |
35 | goto return_label; |
36 | } else { |
37 | |
38 | } |
39 | } else { |
40 | |
41 | } |
42 | __retres1 = 0; |
43 | return_label: /* CIL Label */ |
44 | return (__retres1); |
45 | } |
46 | } |
47 | int is_do_read_c_triggered(void) |
48 | { int __retres1 ; |
49 | |
50 | { |
51 | if ((int )c_dr_pc == 1) { |
52 | if ((int )q_write_ev == 1) { |
53 | __retres1 = 1; |
54 | goto return_label; |
55 | } else { |
56 | |
57 | } |
58 | } else { |
59 | |
60 | } |
61 | __retres1 = 0; |
62 | return_label: /* CIL Label */ |
63 | return (__retres1); |
64 | } |
65 | } |
66 | void immediate_notify_threads(void) |
67 | { int tmp ; |
68 | int tmp___0 ; |
69 | |
70 | { |
71 | { |
72 | tmp = is_do_write_p_triggered(); |
73 | } |
74 | if (tmp != 0) { |
75 | p_dw_st = 0; |
76 | } else { |
77 | |
78 | } |
79 | { |
80 | tmp___0 = is_do_read_c_triggered(); |
81 | } |
82 | if (tmp___0 != 0) { |
83 | c_dr_st = 0; |
84 | } else { |
85 | |
86 | } |
87 | |
88 | return; |
89 | } |
90 | } |
91 | void do_write_p(void) |
92 | { |
93 | |
94 | |
95 | { |
96 | if ((int )p_dw_pc == 0) { |
97 | goto DW_ENTRY; |
98 | } else { |
99 | if ((int )p_dw_pc == 1) { |
100 | goto DW_WAIT_READ; |
101 | } else { |
102 | |
103 | } |
104 | } |
105 | DW_ENTRY: |
106 | { |
107 | while (1) { |
108 | while_0_continue: /* CIL Label */ ; |
109 | if ((int )q_free == 0) { |
110 | p_dw_st = 2; |
111 | p_dw_pc = 1; |
112 | |
113 | goto return_label; |
114 | DW_WAIT_READ: ; |
115 | } else { |
116 | |
117 | } |
118 | { |
119 | q_buf_0 = (input_at_119_counter < num_of_inputs_at_119) ? INPUTS_at_119[input_at_119_counter++] : __VERIFIER_nondet_int() ; |
120 | p_last_write = q_buf_0; |
121 | p_num_write += 1; |
122 | q_free = 0; |
123 | q_write_ev = 1; |
124 | immediate_notify_threads(); |
125 | q_write_ev = 2; |
126 | } |
127 | } |
128 | while_0_break: /* CIL Label */ ; |
129 | } |
130 | return_label: /* CIL Label */ |
131 | return; |
132 | } |
133 | } |
134 | static int a_t ; |
135 | void do_read_c(void) |
136 | { int a ; |
137 | |
138 | { |
139 | if ((int )c_dr_pc == 0) { |
140 | goto DR_ENTRY; |
141 | } else { |
142 | if ((int )c_dr_pc == 1) { |
143 | goto DR_WAIT_WRITE; |
144 | } else { |
145 | |
146 | } |
147 | } |
148 | DR_ENTRY: |
149 | { |
150 | while (1) { |
151 | while_1_continue: /* CIL Label */ ; |
152 | if ((int )q_free == 1) { |
153 | c_dr_st = 2; |
154 | c_dr_pc = 1; |
155 | a_t = a; |
156 | |
157 | goto return_label; |
158 | DR_WAIT_WRITE: |
159 | a = a_t; |
160 | } else { |
161 | |
162 | } |
163 | { |
164 | a = q_buf_0; |
165 | c_last_read = a; |
166 | c_num_read += 1; |
167 | q_free = 1; |
168 | q_read_ev = 1; |
169 | immediate_notify_threads(); |
170 | q_read_ev = 2; |
171 | } |
172 | if (p_last_write == c_last_read) { |
173 | if (p_num_write == c_num_read) { |
174 | |
175 | } else { |
176 | { |
177 | error(); |
178 | } |
179 | } |
180 | } else { |
181 | { |
182 | error(); |
183 | } |
184 | } |
185 | } |
186 | while_1_break: /* CIL Label */ ; |
187 | } |
188 | return_label: /* CIL Label */ |
189 | return; |
190 | } |
191 | } |
192 | void init_threads(void) |
193 | { |
194 | |
195 | { |
196 | if ((int )p_dw_i == 1) { |
197 | p_dw_st = 0; |
198 | } else { |
199 | p_dw_st = 2; |
200 | } |
201 | if ((int )c_dr_i == 1) { |
202 | c_dr_st = 0; |
203 | } else { |
204 | c_dr_st = 2; |
205 | } |
206 | |
207 | return; |
208 | } |
209 | } |
210 | int exists_runnable_thread(void) |
211 | { int __retres1 ; |
212 | |
213 | { |
214 | if ((int )p_dw_st == 0) { |
215 | __retres1 = 1; |
216 | goto return_label; |
217 | } else { |
218 | if ((int )c_dr_st == 0) { |
219 | __retres1 = 1; |
220 | goto return_label; |
221 | } else { |
222 | |
223 | } |
224 | } |
225 | __retres1 = 0; |
226 | return_label: /* CIL Label */ |
227 | return (__retres1); |
228 | } |
229 | } |
230 | void eval(void) |
231 | { int tmp ; |
232 | int tmp___0 ; |
233 | int tmp___1 ; |
234 | |
235 | { |
236 | { |
237 | while (1) { |
238 | while_2_continue: /* CIL Label */ ; |
239 | { |
240 | tmp___1 = exists_runnable_thread(); |
241 | } |
242 | if (tmp___1 != 0) { |
243 | |
244 | } else { |
245 | goto while_2_break; |
246 | } |
247 | if ((int )p_dw_st == 0) { |
248 | { |
249 | tmp = (input_at_249_counter < num_of_inputs_at_249) ? INPUTS_at_249[input_at_249_counter++] : __VERIFIER_nondet_int() ; |
250 | } |
251 | if (tmp != 0) { |
252 | { |
253 | p_dw_st = 1; |
254 | do_write_p(); |
255 | } |
256 | } else { |
257 | error(); |
258 | } |
259 | } else { |
260 | |
261 | } |
262 | if ((int )c_dr_st == 0) { |
263 | { |
264 | tmp___0 = (input_at_264_counter < num_of_inputs_at_264) ? INPUTS_at_264[input_at_264_counter++] : __VERIFIER_nondet_int() ; |
265 | } |
266 | if (tmp___0 != 0) { |
267 | { |
268 | c_dr_st = 1; |
269 | do_read_c(); |
270 | } |
271 | } else { |
272 | |
273 | } |
274 | } else { |
275 | |
276 | } |
277 | } |
278 | while_2_break: /* CIL Label */ ; |
279 | } |
280 | |
281 | return; |
282 | } |
283 | } |
284 | int stop_simulation(void) |
285 | { int tmp ; |
286 | int __retres2 ; |
287 | |
288 | { |
289 | { |
290 | tmp = exists_runnable_thread(); |
291 | } |
292 | if (tmp != 0) { |
293 | __retres2 = 0; |
294 | goto return_label; |
295 | } else { |
296 | |
297 | } |
298 | __retres2 = 1; |
299 | return_label: /* CIL Label */ |
300 | return (__retres2); |
301 | } |
302 | } |
303 | void start_simulation(void) |
304 | { int kernel_st ; |
305 | int tmp ; |
306 | |
307 | { |
308 | { |
309 | kernel_st = 0; |
310 | init_threads(); |
311 | } |
312 | { |
313 | while (1) { |
314 | while_3_continue: /* CIL Label */ ; |
315 | { |
316 | kernel_st = 1; |
317 | eval(); |
318 | tmp = stop_simulation(); |
319 | } |
320 | if (tmp != 0) { |
321 | goto while_3_break; |
322 | } else { |
323 | |
324 | } |
325 | } |
326 | while_3_break: /* CIL Label */ ; |
327 | } |
328 | |
329 | return; |
330 | } |
331 | } |
332 | void init_model(void) |
333 | { |
334 | |
335 | { |
336 | q_free = 1; |
337 | q_write_ev = 2; |
338 | q_read_ev = q_write_ev; |
339 | p_num_write = 0; |
340 | p_dw_pc = 0; |
341 | p_dw_i = 1; |
342 | c_num_read = 0; |
343 | c_dr_pc = 0; |
344 | c_dr_i = 1; |
345 | |
346 | return; |
347 | } |
348 | } |
349 | int main(void) |
350 | {initialize_reads(); int __retres1 ; |
351 | |
352 | { |
353 | { |
354 | init_model(); |
355 | start_simulation(); |
356 | } |
357 | __retres1 = 0; |
358 | return (__retres1); |
359 | } |
360 | } |
2017-05-11 14:20:04:474 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:20:04:595 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 14:20:07:506 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 14:20:07:536 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:20:07:565 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:20:07:823 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:20:08:512 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:20:08:661 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:20:08:770 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:20:09:200 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:20:09:218 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:20:09:239 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:20:09:270 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:20:09:680 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:20:11:668 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:20:11:682 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:20:12:115 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:20:23:426 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 14:20:23:426 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:20:23:426 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:20:29:439 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 14:20:29:440 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:20:29:440 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:20:32:815 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 4
2017-05-11 14:20:32:822 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:20:32:822 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:20:38:517 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 5
2017-05-11 14:20:38:518 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:20:38:518 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:20:42:059 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 3
2017-05-11 14:20:42:059 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:20:42:059 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:20:43:699 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 7
2017-05-11 14:20:43:700 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:20:43:704 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:20:46:527 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 8
2017-05-11 14:20:46:528 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:20:46:542 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:20:51:361 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 9
2017-05-11 14:20:51:362 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:20:51:362 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:20:54:767 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 11
2017-05-11 14:20:54:768 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:20:54:769 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:20:57:107 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 15
2017-05-11 14:20:57:107 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:20:57:107 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:20:59:996 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 17
2017-05-11 14:20:59:996 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:20:59:997 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:21:00:623 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 21
2017-05-11 14:21:00:624 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:21:00:624 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:21:01:205 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 29
2017-05-11 14:21:01:205 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:21:01:206 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:21:02:098 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 33
2017-05-11 14:21:02:098 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:21:02:099 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:21:02:598 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 41
2017-05-11 14:21:02:598 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:21:02:599 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:21:03:074 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 57
2017-05-11 14:21:03:074 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:21:03:074 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:21:03:937 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$AbstractionStrategyAdjuster.adjustConditions Adjusting abstraction strategy to NEVER
2017-05-11 14:21:03:938 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc5a606
2017-05-11 14:21:03:938 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:27:37:887 WARNING ForceTerminationOnShutdown$1.shutdownRequested Shutdown requested (The CPU-time limit of 900s has elapsed.), waiting for termination.
2017-05-11 14:27:37:888 WARNING AbstractFuture.get Warning: Analysis interrupted
2017-05-11 14:27:37:890 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.191s
Time for transition matches: 0.476s
Time for transition assertions: 0.001s
Time for transition actions: 0.001s
Automaton transfers with branching: 0
Automaton transfer successors: 155787 (count: 157262, min: 0, max: 1, avg: 0.99) [0 x 1475, 1 x 155787]
CPA algorithm statistics
------------------------
Number of iterations: 145796
Max size of waitlist: 75
Average size of waitlist: 8
Number of computed successors: 155787
Max successors for one state: 2
Number of times merged: 14228
Number of times stopped: 19382
Number of times breaked: 0
Total time for CPA algorithm: 447.251s (Max: 393.757s)
Time for choose from waitlist: 0.255s
Time for precision adjustment: 3.805s
Time for transfer relation: 30.854s
Time for merge operator: 307.879s
Time for stop operator: 101.365s
Time for adding to reached set: 1.201s
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 0.071
Visited lines: 0
Total lines: 165
Line coverage: 0.000
Visited conditions: 0
Total conditions: 78
Condition coverage: 0.000
CPAchecker general statistics
-----------------------------
Number of program locations: 315
Number of CFA edges: 371
Number of relevant variables: 55
Number of functions: 14
Number of loops: 7
Size of reached set: 1
Number of reached locations: 1 (0%)
Avg states per location: 1
Max states per location: 1 (at node N299)
Number of reached functions: 1 (7%)
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.877s
Time for loading CPAs: 0.810s
Time for loading parser: 0.707s
Time for CFA construction: 1.264s
Time for parsing file(s): 0.348s
Time for AST to CFA: 0.396s
Time for CFA sanity check: 0.058s
Time for post-processing: 0.354s
Time for var class.: 0.211s
Time for CFA export: 0.557s
Time for Analysis: 450.378s
CPU time for analysis: 895.460s
Total time for CPAchecker: 453.274s
Total CPU time for CPAchecker: 900.270s
Time for statistics: 0.064s
Time for Garbage Collector: 30.130s (in 529 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 594MB ( 567 MiB) max; 336MB ( 320 MiB) avg; 634MB ( 605 MiB) peak
Used non-heap memory: 53MB ( 50 MiB) max; 50MB ( 48 MiB) avg; 53MB ( 51 MiB) peak
Used in PS Old Gen pool: 178MB ( 170 MiB) max; 134MB ( 128 MiB) avg; 178MB ( 170 MiB) peak
Allocated heap memory: 1205MB ( 1150 MiB) max; 981MB ( 935 MiB) avg
Allocated non-heap memory: 54MB ( 52 MiB) max; 53MB ( 51 MiB) avg
Total process virtual memory: 6398MB ( 6102 MiB) max; 6392MB ( 6096 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/pc_sfifo_1_false-unreach-call_false-termination.cil/pc_sfifo_1_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/pc_sfifo_1_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