Report for /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/transmitter.02_false-unreach-call_false-termination.cil/transmitter.02_false-unreach-call_false-termination.cil.over.instr.c (Counterexample 1)

Generated on 2017-05-11 15:31:37 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_273 = 2; int INPUTS_at_273[2]; int input_at_273_counter = 0;int num_of_inputs_at_301 = 2; int INPUTS_at_301[2]; int input_at_301_counter = 0;int num_of_inputs_at_287 = 2; int INPUTS_at_287[2]; int input_at_287_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_273[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_301[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_287[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_273[0])));__VERIFIER_error();  
12
  return;  
13
}  
14
}  
15
int m_pc  =    0;  
16
int t1_pc  =    0;  
17
int t2_pc  =    0;  
18
int m_st  ;  
19
int t1_st  ;  
20
int t2_st  ;  
21
int m_i  ;  
22
int t1_i  ;  
23
int t2_i  ;  
24
int M_E  =    2;  
25
int T1_E  =    2;  
26
int T2_E  =    2;  
27
int E_1  =    2;  
28
int E_2  =    2;  
29
int is_master_triggered(void) ;  
30
int is_transmit1_triggered(void) ;  
31
int is_transmit2_triggered(void) ;  
32
void immediate_notify(void) ;  
33
void master(void)   
34
{   
35
  
36
  {  
37
  if (m_pc == 0) {  
38
    goto M_ENTRY;  
39
  } else {  
40
    if (m_pc == 1) {  
41
      goto M_WAIT;  
42
    } else {  
43
  
44
    }  
45
  }  
46
  M_ENTRY: ;  
47
  {  
48
  while (1) {  
49
    while_0_continue: /* CIL Label */ ;  
50
    {  
51
    E_1 = 1;  
52
    immediate_notify();  
53
    E_1 = 2;  
54
    }  
55
    {  
56
    while (1) {  
57
      while_1_continue: /* CIL Label */ ;  
58
      m_pc = 1;  
59
      m_st = 2;  
60
  
61
      goto return_label;  
62
      M_WAIT: ;  
63
    }  
64
    while_1_break: /* CIL Label */ ;  
65
    }  
66
  }  
67
  while_0_break: /* CIL Label */ ;  
68
  }  
69
  
70
  return_label: /* CIL Label */   
71
  return;  
72
}  
73
}  
74
void transmit1(void)   
75
{   
76
  
77
  {  
78
  if (t1_pc == 0) {  
79
    goto T1_ENTRY;  
80
  } else {  
81
    if (t1_pc == 1) {  
82
      goto T1_WAIT;  
83
    } else {  
84
  
85
    }  
86
  }  
87
  T1_ENTRY: ;  
88
  {  
89
  while (1) {  
90
    while_2_continue: /* CIL Label */ ;  
91
    t1_pc = 1;  
92
    t1_st = 2;  
93
  
94
    goto return_label;  
95
    T1_WAIT:   
96
    {  
97
    E_2 = 1;  
98
    immediate_notify();  
99
    E_2 = 2;  
100
    }  
101
  }  
102
  while_2_break: /* CIL Label */ ;  
103
  }  
104
  
105
  return_label: /* CIL Label */   
106
  return;  
107
}  
108
}  
109
void transmit2(void)   
110
{   
111
  
112
  {  
113
  if (t2_pc == 0) {  
114
    goto T2_ENTRY;  
115
  } else {  
116
    if (t2_pc == 1) {  
117
      goto T2_WAIT;  
118
    } else {  
119
  
120
    }  
121
  }  
122
  T2_ENTRY: ;  
123
  {  
124
  while (1) {  
125
    while_3_continue: /* CIL Label */ ;  
126
    t2_pc = 1;  
127
    t2_st = 2;  
128
  
129
    goto return_label;  
130
    T2_WAIT:   
131
    {  
132
    error();  
133
    }  
134
  }  
135
  while_3_break: /* CIL Label */ ;  
136
  }  
137
  
138
  return_label: /* CIL Label */   
139
  return;  
140
}  
141
}  
142
int is_master_triggered(void)   
143
{ int __retres1 ;  
144
  
145
  {  
146
  if (m_pc == 1) {  
147
    if (M_E == 1) {  
148
      __retres1 = 1;  
149
      goto return_label;  
150
    } else {  
151
  
152
    }  
153
  } else {  
154
  
155
  }  
156
  __retres1 = 0;  
157
  return_label: /* CIL Label */   
158
  return (__retres1);  
159
}  
160
}  
161
int is_transmit1_triggered(void)   
162
{ int __retres1 ;  
163
  
164
  {  
165
  if (t1_pc == 1) {  
166
    if (E_1 == 1) {  
167
      __retres1 = 1;  
168
      goto return_label;  
169
    } else {  
170
  
171
    }  
172
  } else {  
173
  
174
  }  
175
  __retres1 = 0;  
176
  return_label: /* CIL Label */   
177
  return (__retres1);  
178
}  
179
}  
180
int is_transmit2_triggered(void)   
181
{ int __retres1 ;  
182
  
183
  {  
184
  if (t2_pc == 1) {  
185
    if (E_2 == 1) {  
186
      __retres1 = 1;  
187
      goto return_label;  
188
    } else {  
189
  
190
    }  
191
  } else {  
192
  
193
  }  
194
  __retres1 = 0;  
195
  return_label: /* CIL Label */   
196
  return (__retres1);  
197
}  
198
}  
199
void update_channels(void)   
200
{   
201
  
202
  {  
203
  
204
  return;  
205
}  
206
}  
207
void init_threads(void)   
208
{   
209
  
210
  {  
211
  if (m_i == 1) {  
212
    m_st = 0;  
213
  } else {  
214
    m_st = 2;  
215
  }  
216
  if (t1_i == 1) {  
217
    t1_st = 0;  
218
  } else {  
219
    t1_st = 2;  
220
  }  
221
  if (t2_i == 1) {  
222
    t2_st = 0;  
223
  } else {  
224
    t2_st = 2;  
225
  }  
226
  
227
  return;  
228
}  
229
}  
230
int exists_runnable_thread(void)   
231
{ int __retres1 ;  
232
  
233
  {  
234
  if (m_st == 0) {  
235
    __retres1 = 1;  
236
    goto return_label;  
237
  } else {  
238
    if (t1_st == 0) {  
239
      __retres1 = 1;  
240
      goto return_label;  
241
    } else {  
242
      if (t2_st == 0) {  
243
        __retres1 = 1;  
244
        goto return_label;  
245
      } else {  
246
  
247
      }  
248
    }  
249
  }  
250
  __retres1 = 0;  
251
  return_label: /* CIL Label */   
252
  return (__retres1);  
253
}  
254
}  
255
void eval(void)   
256
{  
257
  int tmp ;  
258
  
259
  {  
260
  {  
261
  while (1) {  
262
    while_4_continue: /* CIL Label */ ;  
263
    {  
264
    tmp = exists_runnable_thread();  
265
    }  
266
    if (tmp != 0) {  
267
  
268
    } else {  
269
      goto while_4_break;  
270
    }  
271
    if (m_st == 0) {  
272
      int tmp_ndt_1;  
273
      tmp_ndt_1 = (input_at_273_counter < num_of_inputs_at_273) ? INPUTS_at_273[input_at_273_counter++] : __VERIFIER_nondet_int() ;  
274
      if (tmp_ndt_1 != 0) {  
275
        {  
276
        m_st = 1;  
277
        master();  
278
        }  
279
      } else {  
280
  
281
      }  
282
    } else {  
283
  
284
    }  
285
    if (t1_st == 0) {  
286
      int tmp_ndt_2;  
287
      tmp_ndt_2 = (input_at_287_counter < num_of_inputs_at_287) ? INPUTS_at_287[input_at_287_counter++] : __VERIFIER_nondet_int() ;  
288
      if (tmp_ndt_2 != 0) {  
289
        {  
290
        t1_st = 1;  
291
        transmit1();  
292
        }  
293
      } else {  
294
  
295
      }  
296
    } else {  
297
  
298
    }  
299
    if (t2_st == 0) {  
300
      int tmp_ndt_3;  
301
      tmp_ndt_3 = (input_at_301_counter < num_of_inputs_at_301) ? INPUTS_at_301[input_at_301_counter++] : __VERIFIER_nondet_int() ;  
302
      if (tmp_ndt_3 != 0) {  
303
        {  
304
        t2_st = 1;  
305
        transmit2();  
306
        }  
307
      } else {  
308
  
309
      }  
310
    } else {  
311
  
312
    }  
313
  }  
314
  while_4_break: /* CIL Label */ ;  
315
  }  
316
  
317
  return;  
318
}  
319
}  
320
void fire_delta_events(void)   
321
{   
322
  
323
  {  
324
  if (M_E == 0) {  
325
    M_E = 1;  
326
  } else {  
327
  
328
  }  
329
  if (T1_E == 0) {  
330
    T1_E = 1;  
331
  } else {  
332
  
333
  }  
334
  if (T2_E == 0) {  
335
    T2_E = 1;  
336
  } else {  
337
  
338
  }  
339
  if (E_1 == 0) {  
340
    E_1 = 1;  
341
  } else {  
342
  
343
  }  
344
  if (E_2 == 0) {  
345
    E_2 = 1;  
346
  } else {  
347
  
348
  }  
349
  
350
  return;  
351
}  
352
}  
353
void reset_delta_events(void)   
354
{   
355
  
356
  {  
357
  if (M_E == 1) {  
358
    M_E = 2;  
359
  } else {  
360
  
361
  }  
362
  if (T1_E == 1) {  
363
    T1_E = 2;  
364
  } else {  
365
  
366
  }  
367
  if (T2_E == 1) {  
368
    T2_E = 2;  
369
  } else {  
370
  
371
  }  
372
  if (E_1 == 1) {  
373
    E_1 = 2;  
374
  } else {  
375
  
376
  }  
377
  if (E_2 == 1) {  
378
    E_2 = 2;  
379
  } else {  
380
  
381
  }  
382
  
383
  return;  
384
}  
385
}  
386
void activate_threads(void)   
387
{ int tmp ;  
388
  int tmp___0 ;  
389
  int tmp___1 ;  
390
  
391
  {  
392
  {  
393
  tmp = is_master_triggered();  
394
  }  
395
  if (tmp != 0) {  
396
    m_st = 0;  
397
  } else {  
398
  
399
  }  
400
  {  
401
  tmp___0 = is_transmit1_triggered();  
402
  }  
403
  if (tmp___0 != 0) {  
404
    t1_st = 0;  
405
  } else {  
406
  
407
  }  
408
  {  
409
  tmp___1 = is_transmit2_triggered();  
410
  }  
411
  if (tmp___1 != 0) {  
412
    t2_st = 0;  
413
  } else {  
414
  
415
  }  
416
  
417
  return;  
418
}  
419
}  
420
void immediate_notify(void)   
421
{   
422
  
423
  {  
424
  {  
425
  activate_threads();  
426
  }  
427
  
428
  return;  
429
}  
430
}  
431
void fire_time_events(void)   
432
{   
433
  
434
  {  
435
  M_E = 1;  
436
  
437
  return;  
438
}  
439
}  
440
void reset_time_events(void)   
441
{   
442
  
443
  {  
444
  if (M_E == 1) {  
445
    M_E = 2;  
446
  } else {  
447
  
448
  }  
449
  if (T1_E == 1) {  
450
    T1_E = 2;  
451
  } else {  
452
  
453
  }  
454
  if (T2_E == 1) {  
455
    T2_E = 2;  
456
  } else {  
457
  
458
  }  
459
  if (E_1 == 1) {  
460
    E_1 = 2;  
461
  } else {  
462
  
463
  }  
464
  if (E_2 == 1) {  
465
    E_2 = 2;  
466
  } else {  
467
  
468
  }  
469
  
470
  return;  
471
}  
472
}  
473
void init_model(void)   
474
{   
475
  
476
  {  
477
  m_i = 1;  
478
  t1_i = 1;  
479
  t2_i = 1;  
480
  
481
  return;  
482
}  
483
}  
484
int stop_simulation(void)   
485
{ int tmp ;  
486
  int __retres2 ;  
487
  
488
  {  
489
  {  
490
  tmp = exists_runnable_thread();  
491
  }  
492
  if (tmp != 0) {  
493
    __retres2 = 0;  
494
    goto return_label;  
495
  } else {  
496
  
497
  }  
498
  __retres2 = 1;  
499
  return_label: /* CIL Label */   
500
  return (__retres2);  
501
}  
502
}  
503
void start_simulation(void)   
504
{ int kernel_st ;  
505
  int tmp ;  
506
  int tmp___0 ;  
507
  
508
  {  
509
  {  
510
  kernel_st = 0;  
511
  update_channels();  
512
  init_threads();  
513
  fire_delta_events();  
514
  activate_threads();  
515
  reset_delta_events();  
516
  }  
517
  {  
518
  while (1) {  
519
    while_5_continue: /* CIL Label */ ;  
520
    {  
521
    kernel_st = 1;  
522
    eval();  
523
    }  
524
    {  
525
    kernel_st = 2;  
526
    update_channels();  
527
    }  
528
    {  
529
    kernel_st = 3;  
530
    fire_delta_events();  
531
    activate_threads();  
532
    reset_delta_events();  
533
    }  
534
    {  
535
    tmp = exists_runnable_thread();  
536
    }  
537
    if (tmp == 0) {  
538
      {  
539
      kernel_st = 4;  
540
      fire_time_events();  
541
      activate_threads();  
542
      reset_time_events();  
543
      }  
544
    } else {  
545
  
546
    }  
547
    {  
548
    tmp___0 = stop_simulation();  
549
    }  
550
    if (tmp___0 != 0) {  
551
      goto while_5_break;  
552
    } else {  
553
  
554
    }  
555
  }  
556
  while_5_break: /* CIL Label */ ;  
557
  }  
558
  
559
  return;  
560
}  
561
}  
562
int main(void)   
563
{initialize_reads(); int __retres1 ;  
564
  
565
  {  
566
  {  
567
  init_model();  
568
  start_simulation();  
569
  }  
570
  __retres1 = 0;  
571
  return (__retres1);  
572
}  
573
}  
2017-05-11 15:29:30:760	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

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

2017-05-11 15:29:32:875	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 15:29:33:092	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:29:33:591	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:29:33:681	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:29:33:767	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:29:34:018	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:29:34:021	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:29:34:042	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:29:34:076	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:29:34:418	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:29:35:141	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:29:35:195	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

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

2017-05-11 15:29:36:407	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 15:29:36:408	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:29:36:411	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:29:39:022	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 15:29:39:022	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:29:39:022	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:29:42:058	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 3

2017-05-11 15:29:42:062	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:29:42:062	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:29:44:318	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 5

2017-05-11 15:29:44:319	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:29:44:319	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:29:46:667	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 6

2017-05-11 15:29:46:668	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

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

2017-05-11 15:29:47:853	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 15:29:47:854	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:29:47:854	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:29:48:746	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 15:29:48:747	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:29:48:747	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:29:49:986	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 9

2017-05-11 15:29:49:987	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:29:49:987	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

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

2017-05-11 15:29:51:862	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

2017-05-11 15:29:51:862	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:29:51:862	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:29:54:873	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 11

2017-05-11 15:29:54:873	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:29:54:873	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:29:57:205	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 13

2017-05-11 15:29:57:205	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:29:57:205	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:29:59:303	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 17

2017-05-11 15:29:59:304	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:29:59:304	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:30:01:508	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 19

2017-05-11 15:30:01:509	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:30:01:509	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:30:03:632	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 23

2017-05-11 15:30:03:632	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:30:03:632	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:30:05:592	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 31

2017-05-11 15:30:05:593	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

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

2017-05-11 15:30:07:505	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 47

2017-05-11 15:30:07:506	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:30:07:506	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:30:09:651	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 55

2017-05-11 15:30:09:652	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

2017-05-11 15:30:09:652	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:30:13:969	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$AbstractionStrategyAdjuster.adjustConditions	Adjusting abstraction strategy to NEVER

2017-05-11 15:30:13:969	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5763a992

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

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

2017-05-11 15:30:15:356	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties finished without usable result.

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

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

2017-05-11 15:30:53:742	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

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

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

2017-05-11 15:31:14:166	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:31:32:700	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 15:31:32:700	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:31:32:994	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:31:33:592	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 15:31:34:561	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:31:34:874	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 15:31:34:875	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:31:35:271	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 15:31:35:271	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:31:35:596	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 15:31:35:598	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.

2017-05-11 15:31:35:601	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:            3 (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:         3 (100%)
  Times precision was empty:       3 (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:         228
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

Max ABE block size:                       365
Number of predicates discovered:          0

Time for post operator:                  0.523s
  Time for path formula creation:        0.522s
Time for strengthen operator:            0.005s
Time for prec operator:                  0.003s
  Time for abstraction:                  0.000s (Max:     0.000s, Count: 3)
    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.026s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 72
   Number of created targets for uf: *signed_int is 25



PrecisionBootstrap statistics
-----------------------------
Init. function predicates:                         0
Init. global predicates:                           0
Init. location predicates:                         0

Invariant Generation statistics
-------------------------------

Bounds CPA statistics
---------------------
Bound k:                                           3
Maximum loop iteration reached:                    4


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  29132 (count: 1730, min: 0, max: 26, avg: 16.84)
Number of global variables:                           25012 (count: 1730, min: 0, max: 20, avg: 14.46)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    1845
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.025s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                49

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  576
Number of deterministic Assumptions:                    324
Level of Determinism:                              56%

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.002s
Automaton transfers with branching:                0
Automaton transfer successors:                         1845 (count: 1848, min: 0, max: 1, avg: 1.00) [0 x 3, 1 x 1845]

CPA algorithm statistics
------------------------
Number of iterations:            1734
Max size of waitlist:            10
Average size of waitlist:        4
Number of computed successors:   1845
Max successors for one state:    2
Number of times merged:          114
Number of times stopped:         114
Number of times breaked:         0

Total time for CPA algorithm:         1.010s (Max:     0.713s)
  Time for choose from waitlist:      0.000s
  Time for precision adjustment:      0.079s
  Time for transfer relation:         0.868s
  Time for merge operator:            0.031s
  Time for stop operator:             0.004s
  Time for adding to reached set:     0.008s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           1.018s
Time for final sat check:                0.629s
Time for error path creation:            0.903s
Time for bounding assertions check:      0.036s
Time for induction formula creation:    36.793s
Time for induction check:               80.464s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         1 (100%)
Time for counterexample checks:         1.035s
Time for running CBMC:                  0.953s


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.320s
Automaton transfers with branching:                0
Automaton transfer successors:                        68351 (count: 68421, min: 0, max: 1, avg: 1.00) [0 x 70, 1 x 68351]

CPA algorithm statistics
------------------------
Number of iterations:            65440
Max size of waitlist:            35
Average size of waitlist:        9
Number of computed successors:   68351
Max successors for one state:    2
Number of times merged:          11040
Number of times stopped:         12374
Number of times breaked:         0

Total time for CPA algorithm:        39.766s (Max:     4.142s)
  Time for choose from waitlist:      0.128s
  Time for precision adjustment:      0.856s
  Time for transfer relation:         9.842s
  Time for merge operator:           26.135s
  Time for stop operator:             1.867s
  Time for adding to reached set:     0.338s


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

Code Coverage
-----------------------------
  Function coverage:      1.000
  Visited lines:          216
  Total lines:            234
  Line coverage:          0.923
  Visited conditions:     88
  Total conditions:       106
  Condition coverage:     0.830

CPAchecker general statistics
-----------------------------
Number of program locations:     435
Number of CFA edges:             525
Number of relevant variables:    58
Number of functions:             22
Number of loops:                 5
Size of reached set:             1730
  Number of reached locations:   398 (91%)
    Avg states per location:     4
    Max states per location:     14 (at node N115)
  Number of reached functions:   22 (100%)
  Number of partitions:          1730
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       3

Time for analysis setup:          1.996s
  Time for loading CPAs:          0.477s
  Time for loading parser:        0.450s
  Time for CFA construction:      0.998s
    Time for parsing file(s):     0.268s
    Time for AST to CFA:          0.320s
    Time for CFA sanity check:    0.071s
    Time for post-processing:     0.280s
      Time for var class.:        0.180s
    Time for CFA export:          0.426s
Time for Analysis:              122.724s
CPU time for analysis:          216.810s
Time for analyzing result:        0.001s
Total time for CPAchecker:      124.735s
Total CPU time for CPAchecker:  221.330s
Time for statistics:              1.816s

Time for Garbage Collector:       7.701s (in 88 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                481MB (   458 MiB) max;    254MB (   242 MiB) avg;    521MB (   497 MiB) peak
Used non-heap memory:             52MB (    50 MiB) max;     49MB (    47 MiB) avg;     58MB (    55 MiB) peak
Used in PS Old Gen pool:          94MB (    90 MiB) max;     64MB (    61 MiB) avg;     94MB (    90 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    976MB (   931 MiB) avg
Allocated non-heap memory:        54MB (    51 MiB) max;     52MB (    49 MiB) avg
Total process virtual memory:   8298MB (  7914 MiB) max;   8045MB (  7672 MiB) avg

    
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/transmitter.02_false-unreach-call_false-termination.cil/transmitter.02_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.02_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