Report for /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/pc_sfifo_2_false-unreach-call_false-termination.cil/pc_sfifo_2_false-unreach-call_false-termination.cil.over.instr.c

Generated on 2017-05-11 13:53:18 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_341 = 1; int INPUTS_at_341[1]; int input_at_341_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_341[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
  
6
void error(void)   
7
{   
8
  
9
  {  
10
  __VERIFIER_assume(!((0 == INPUTS_at_341[0])));__VERIFIER_error();  
11
  return;  
12
}  
13
}  
14
  
15
int q_buf_0  ;  
16
int q_free  ;  
17
int q_read_ev  ;  
18
int q_write_ev  ;  
19
int q_req_up  ;  
20
int q_ev  ;  
21
void update_fifo_q(void)   
22
{   
23
  
24
  {  
25
  if ((int )q_free == 0) {  
26
    q_write_ev = 0;  
27
  } else {  
28
  
29
  }  
30
  if ((int )q_free == 1) {  
31
    q_read_ev = 0;  
32
  } else {  
33
  
34
  }  
35
  q_ev = 0;  
36
  q_req_up = 0;  
37
  
38
  return;  
39
}  
40
}  
41
int p_num_write  ;  
42
int p_last_write  ;  
43
int p_dw_st  ;  
44
int p_dw_pc  ;  
45
int p_dw_i  ;  
46
int c_num_read  ;  
47
int c_last_read  ;  
48
int c_dr_st  ;  
49
int c_dr_pc  ;  
50
int c_dr_i  ;  
51
int is_do_write_p_triggered(void)   
52
{ int __retres1 ;  
53
  
54
  {  
55
  if ((int )p_dw_pc == 1) {  
56
    if ((int )q_read_ev == 1) {  
57
      __retres1 = 1;  
58
      goto return_label;  
59
    } else {  
60
  
61
    }  
62
  } else {  
63
  
64
  }  
65
  __retres1 = 0;  
66
  return_label: /* CIL Label */   
67
  return (__retres1);  
68
}  
69
}  
70
int is_do_read_c_triggered(void)   
71
{ int __retres1 ;  
72
  
73
  {  
74
  if ((int )c_dr_pc == 1) {  
75
    if ((int )q_write_ev == 1) {  
76
      __retres1 = 1;  
77
      goto return_label;  
78
    } else {  
79
  
80
    }  
81
  } else {  
82
  
83
  }  
84
  __retres1 = 0;  
85
  return_label: /* CIL Label */   
86
  return (__retres1);  
87
}  
88
}  
89
void immediate_notify_threads(void)   
90
{ int tmp ;  
91
  int tmp___0 ;  
92
  
93
  {  
94
  {  
95
  tmp = is_do_write_p_triggered();  
96
  }  
97
  if (tmp != 0) {  
98
    p_dw_st = 0;  
99
  } else {  
100
  
101
  }  
102
  {  
103
  tmp___0 = is_do_read_c_triggered();  
104
  }  
105
  if (tmp___0 != 0) {  
106
    c_dr_st = 0;  
107
  } else {  
108
  
109
  }  
110
  
111
  return;  
112
}  
113
}  
114
void do_write_p(void)   
115
{   
116
  
117
  {  
118
  if ((int )p_dw_pc == 0) {  
119
    goto DW_ENTRY;  
120
  } else {  
121
    if ((int )p_dw_pc == 1) {  
122
      goto DW_WAIT_READ;  
123
    } else {  
124
  
125
    }  
126
  }  
127
  DW_ENTRY:   
128
  {  
129
  while (1) {  
130
    while_0_continue: /* CIL Label */ ;  
131
    if ((int )q_free == 0) {  
132
      p_dw_st = 2;  
133
      p_dw_pc = 1;  
134
  
135
      goto return_label;  
136
      DW_WAIT_READ: ;  
137
    } else {  
138
  
139
    }  
140
    {  
141
      q_buf_0 = __VERIFIER_nondet_int();  
142
    p_last_write = q_buf_0;  
143
    p_num_write += 1;  
144
    q_free = 0;  
145
    q_req_up = 1;  
146
    }  
147
  }  
148
  while_0_break: /* CIL Label */ ;  
149
  }  
150
  return_label: /* CIL Label */   
151
  return;  
152
}  
153
}  
154
static int a_t  ;  
155
void do_read_c(void)   
156
{ int a ;  
157
  
158
  {  
159
  if ((int )c_dr_pc == 0) {  
160
    goto DR_ENTRY;  
161
  } else {  
162
    if ((int )c_dr_pc == 1) {  
163
      goto DR_WAIT_WRITE;  
164
    } else {  
165
  
166
    }  
167
  }  
168
  DR_ENTRY:   
169
  {  
170
  while (1) {  
171
    while_1_continue: /* CIL Label */ ;  
172
    if ((int )q_free == 1) {  
173
      c_dr_st = 2;  
174
      c_dr_pc = 1;  
175
      a_t = a;  
176
  
177
      goto return_label;  
178
      DR_WAIT_WRITE:   
179
      a = a_t;  
180
    } else {  
181
  
182
    }  
183
    a = q_buf_0;  
184
    c_last_read = a;  
185
    c_num_read += 1;  
186
    q_free = 1;  
187
    q_req_up = 1;  
188
    if (p_last_write == c_last_read) {  
189
      if (p_num_write == c_num_read) {  
190
  
191
      } else {  
192
        {  
193
        error();  
194
        }  
195
      }  
196
    } else {  
197
      {  
198
      error();  
199
      }  
200
    }  
201
  }  
202
  while_1_break: /* CIL Label */ ;  
203
  }  
204
  return_label: /* CIL Label */   
205
  return;  
206
}  
207
}  
208
void update_channels(void)   
209
{   
210
  
211
  {  
212
  if ((int )q_req_up == 1) {  
213
    {  
214
    update_fifo_q();  
215
    }  
216
  } else {  
217
  
218
  }  
219
  
220
  return;  
221
}  
222
}  
223
void init_threads(void)   
224
{   
225
  
226
  {  
227
  if ((int )p_dw_i == 1) {  
228
    p_dw_st = 0;  
229
  } else {  
230
    p_dw_st = 2;  
231
  }  
232
  if ((int )c_dr_i == 1) {  
233
    c_dr_st = 0;  
234
  } else {  
235
    c_dr_st = 2;  
236
  }  
237
  
238
  return;  
239
}  
240
}  
241
int exists_runnable_thread(void)   
242
{ int __retres1 ;  
243
  
244
  {  
245
  if ((int )p_dw_st == 0) {  
246
    __retres1 = 1;  
247
    goto return_label;  
248
  } else {  
249
    if ((int )c_dr_st == 0) {  
250
      __retres1 = 1;  
251
      goto return_label;  
252
    } else {  
253
  
254
    }  
255
  }  
256
  __retres1 = 0;  
257
  return_label: /* CIL Label */   
258
  return (__retres1);  
259
}  
260
}  
261
void fire_delta_events(void)   
262
{   
263
  
264
  {  
265
  if ((int )q_read_ev == 0) {  
266
    q_read_ev = 1;  
267
  } else {  
268
  
269
  }  
270
  if ((int )q_write_ev == 0) {  
271
    q_write_ev = 1;  
272
  } else {  
273
  
274
  }  
275
  
276
  return;  
277
}  
278
}  
279
void reset_delta_events(void)   
280
{   
281
  
282
  {  
283
  if ((int )q_read_ev == 1) {  
284
    q_read_ev = 2;  
285
  } else {  
286
  
287
  }  
288
  if ((int )q_write_ev == 1) {  
289
    q_write_ev = 2;  
290
  } else {  
291
  
292
  }  
293
  
294
  return;  
295
}  
296
}  
297
void activate_threads(void)   
298
{ int tmp ;  
299
  int tmp___0 ;  
300
  
301
  {  
302
  {  
303
  tmp = is_do_write_p_triggered();  
304
  }  
305
  if (tmp != 0) {  
306
    p_dw_st = 0;  
307
  } else {  
308
  
309
  }  
310
  {  
311
  tmp___0 = is_do_read_c_triggered();  
312
  }  
313
  if (tmp___0 != 0) {  
314
    c_dr_st = 0;  
315
  } else {  
316
  
317
  }  
318
  
319
  return;  
320
}  
321
}  
322
void eval(void)   
323
{ int tmp ;  
324
  int tmp___0 ;  
325
  int tmp___1 ;  
326
  
327
  {  
328
  {  
329
  while (1) {  
330
    while_2_continue: /* CIL Label */ ;  
331
    {  
332
    tmp___1 = exists_runnable_thread();  
333
    }  
334
    if (tmp___1 != 0) {  
335
  
336
    } else {  
337
      goto while_2_break;  
338
    }  
339
    if ((int )p_dw_st == 0) {  
340
      {  
341
	tmp = (input_at_341_counter < num_of_inputs_at_341) ? INPUTS_at_341[input_at_341_counter++] : __VERIFIER_nondet_int() ;  
342
      }  
343
      if (tmp != 0) {  
344
        {  
345
        p_dw_st = 1;  
346
        do_write_p();  
347
        }  
348
      } else {  
349
	error();  
350
      }  
351
    } else {  
352
  
353
    }  
354
    if ((int )c_dr_st == 0) {  
355
      {  
356
	tmp___0 = __VERIFIER_nondet_int();  
357
      }  
358
      if (tmp___0 != 0) {  
359
        {  
360
        c_dr_st = 1;  
361
        do_read_c();  
362
        }  
363
      } else {  
364
  
365
      }  
366
    } else {  
367
  
368
    }  
369
  }  
370
  while_2_break: /* CIL Label */ ;  
371
  }  
372
  
373
  return;  
374
}  
375
}  
376
int stop_simulation(void)   
377
{ int tmp ;  
378
  int __retres2 ;  
379
  
380
  {  
381
  {  
382
  tmp = exists_runnable_thread();  
383
  }  
384
  if (tmp != 0) {  
385
    __retres2 = 0;  
386
    goto return_label;  
387
  } else {  
388
  
389
  }  
390
  __retres2 = 1;  
391
  return_label: /* CIL Label */   
392
  return (__retres2);  
393
}  
394
}  
395
void start_simulation(void)   
396
{ int kernel_st ;  
397
  int tmp ;  
398
  
399
  {  
400
  {  
401
  kernel_st = 0;  
402
  update_channels();  
403
  init_threads();  
404
  fire_delta_events();  
405
  activate_threads();  
406
  reset_delta_events();  
407
  }  
408
  {  
409
  while (1) {  
410
    while_3_continue: /* CIL Label */ ;  
411
    {  
412
    kernel_st = 1;  
413
    eval();  
414
    }  
415
    {  
416
    kernel_st = 2;  
417
    update_channels();  
418
    }  
419
    {  
420
    kernel_st = 3;  
421
    fire_delta_events();  
422
    activate_threads();  
423
    reset_delta_events();  
424
    tmp = stop_simulation();  
425
    }  
426
    if (tmp != 0) {  
427
      goto while_3_break;  
428
    } else {  
429
  
430
    }  
431
  }  
432
  while_3_break: /* CIL Label */ ;  
433
  }  
434
  
435
  return;  
436
}  
437
}  
438
void init_model(void)   
439
{   
440
  
441
  {  
442
  q_free = 1;  
443
  q_write_ev = 2;  
444
  q_read_ev = q_write_ev;  
445
  p_num_write = 0;  
446
  p_dw_pc = 0;  
447
  p_dw_i = 1;  
448
  c_num_read = 0;  
449
  c_dr_pc = 0;  
450
  c_dr_i = 1;  
451
  
452
  return;  
453
}  
454
}  
455
int main(void)   
456
{initialize_reads(); int __retres1 ;  
457
  
458
  {  
459
  {  
460
  init_model();  
461
  start_simulation();  
462
  }  
463
  __retres1 = 0;  
464
  return (__retres1);  
465
}  
466
}  
2017-05-11 13:45:43:688	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

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

2017-05-11 13:45:47:184	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

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

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

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

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

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

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

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

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

2017-05-11 13:45:49:509	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 13:45:51:902	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 13:45:51:941	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:45:51:941	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:45:51:969	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 13:45:52:530	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 13:45:52:866	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 13:45:55:561	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 13:45:55:561	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:45:55:561	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:45:58:640	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 13:45:58:640	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:45:58:641	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:03:983	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 5

2017-05-11 13:46:04:000	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:04:000	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:07:387	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 13:46:07:400	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:07:400	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:09:855	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 7

2017-05-11 13:46:09:858	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:09:858	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:11:982	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 13:46:11:983	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

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

2017-05-11 13:46:14:901	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 9

2017-05-11 13:46:14:902	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:14:902	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:18:007	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

2017-05-11 13:46:18:008	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:18:008	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:20:338	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 12

2017-05-11 13:46:20:338	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:20:339	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:21:397	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 13:46:21:398	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:21:398	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:21:603	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 24

2017-05-11 13:46:21:603	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:21:603	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:21:831	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

2017-05-11 13:46:21:839	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:21:839	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:22:090	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 30

2017-05-11 13:46:22:090	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:22:090	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:22:300	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 34

2017-05-11 13:46:22:301	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:22:301	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:23:073	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 36

2017-05-11 13:46:23:073	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:23:074	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:23:415	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 40

2017-05-11 13:46:23:415	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:23:416	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:23:603	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 48

2017-05-11 13:46:23:604	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:23:604	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:46:24:073	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$AbstractionStrategyAdjuster.adjustConditions	Adjusting abstraction strategy to NEVER

2017-05-11 13:46:24:073	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@50c5536

2017-05-11 13:46:24:073	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:53:18:642	WARNING	ForceTerminationOnShutdown$1.shutdownRequested	Shutdown requested (The CPU-time limit of 900s has elapsed.), waiting for termination.

2017-05-11 13:53:18:658	WARNING	AbstractFuture.get	Warning: Analysis interrupted

2017-05-11 13:53:18:662	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.214s
  Time for transition matches:                         0.527s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.007s
Automaton transfers with branching:                0
Automaton transfer successors:                       248242 (count: 249944, min: 0, max: 1, avg: 0.99) [0 x 1702, 1 x 248242]

CPA algorithm statistics
------------------------
Number of iterations:            246067
Max size of waitlist:            26
Average size of waitlist:        1
Number of computed successors:   248242
Max successors for one state:    2
Number of times merged:          4241
Number of times stopped:         5448
Number of times breaked:         0

Total time for CPA algorithm:       447.146s (Max:   414.438s)
  Time for choose from waitlist:      0.196s
  Time for precision adjustment:      3.446s
  Time for transfer relation:        29.109s
  Time for merge operator:          310.827s
  Time for stop operator:           100.231s
  Time for adding to reached set:     1.240s


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

Code Coverage
-----------------------------
  Function coverage:      0.053
  Visited lines:          0
  Total lines:            202
  Line coverage:          0.000
  Visited conditions:     0
  Total conditions:       74
  Condition coverage:     0.000

CPAchecker general statistics
-----------------------------
Number of program locations:     343
Number of CFA edges:             412
Number of relevant variables:    45
Number of functions:             19
Number of loops:                 5
Size of reached set:             1
  Number of reached locations:   1 (0%)
    Avg states per location:     1
    Max states per location:     1 (at node N333)
  Number of reached functions:   1 (5%)
  Number of partitions:          1
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       0
  Size of final wait list        1

Time for analysis setup:          3.331s
  Time for loading CPAs:          0.885s
  Time for loading parser:        0.776s
  Time for CFA construction:      1.575s
    Time for parsing file(s):     0.527s
    Time for AST to CFA:          0.460s
    Time for CFA sanity check:    0.075s
    Time for post-processing:     0.424s
      Time for var class.:        0.245s
    Time for CFA export:          0.592s
Time for Analysis:              451.469s
CPU time for analysis:          894.950s
Total time for CPAchecker:      454.818s
Total CPU time for CPAchecker:  900.040s
Time for statistics:              0.057s

Time for Garbage Collector:      37.187s (in 596 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                597MB (   569 MiB) max;    321MB (   306 MiB) avg;    620MB (   591 MiB) peak
Used non-heap memory:             52MB (    49 MiB) max;     49MB (    46 MiB) avg;     52MB (    50 MiB) peak
Used in PS Old Gen pool:         183MB (   175 MiB) max;    121MB (   115 MiB) avg;    183MB (   175 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    976MB (   931 MiB) avg
Allocated non-heap memory:        53MB (    51 MiB) max;     53MB (    50 MiB) avg
Total process virtual memory:   6462MB (  6163 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_2_false-unreach-call_false-termination.cil/pc_sfifo_2_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_2_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