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

Generated on 2017-05-11 15:04:08 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_482 = 4; int INPUTS_at_482[4]; int input_at_482_counter = 0;int num_of_inputs_at_472 = 4; int INPUTS_at_472[4]; int input_at_472_counter = 0;int num_of_inputs_at_488 = 2; int INPUTS_at_488[2]; int input_at_488_counter = 0;int num_of_inputs_at_462 = 4; int INPUTS_at_462[4]; int input_at_462_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<4; instrumentation_index++) INPUTS_at_482[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<4; instrumentation_index++) INPUTS_at_472[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_488[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<4; instrumentation_index++) INPUTS_at_462[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__));  
2
  
3
extern int __VERIFIER_nondet_int(void);  
4
//extern int printf (__const char *__restrict __format, ...);  
5
/* Generated by CIL v. 1.3.7 */  
6
/* print_CIL_Input is true */  
7
  
8
struct JoinPoint {  
9
   void **(*fp)(struct JoinPoint * ) ;  
10
   void **args ;  
11
   int argsCount ;  
12
   char const   **argsType ;  
13
   void *(*arg)(int  , struct JoinPoint * ) ;  
14
   char const   *(*argType)(int  , struct JoinPoint * ) ;  
15
   void **retValue ;  
16
   char const   *retType ;  
17
   char const   *funcName ;  
18
   char const   *targetName ;  
19
   char const   *fileName ;  
20
   char const   *kind ;  
21
   void *excep_return ;  
22
};  
23
struct __UTAC__CFLOW_FUNC {  
24
   int (*func)(int  , int  ) ;  
25
   int val ;  
26
   struct __UTAC__CFLOW_FUNC *next ;  
27
};  
28
struct __UTAC__EXCEPTION {  
29
   void *jumpbuf ;  
30
   unsigned long long prtValue ;  
31
   int pops ;  
32
   struct __UTAC__CFLOW_FUNC *cflowfuncs ;  
33
};  
34
typedef unsigned int size_t;  
35
struct __ACC__ERR {  
36
   void *v ;  
37
   struct __ACC__ERR *next ;  
38
};  
39
#pragma merger(0,"Test.i","")  
40
int cleanupTimeShifts  =    4;  
41
void timeShift(void) ;  
42
void cleanup(void)   
43
{ int i ;  
44
  int __cil_tmp2 ;  
45
  
46
  {  
47
  {  
48
  timeShift();  
49
  i = 0;  
50
  }  
51
  {  
52
  while (1) {  
53
    while_0_continue: /* CIL Label */ ;  
54
    {  
55
    __cil_tmp2 = cleanupTimeShifts - 1;  
56
    if (i < __cil_tmp2) {  
57
  
58
    } else {  
59
      goto while_0_break;  
60
    }  
61
    }  
62
    {  
63
    timeShift();  
64
    i = i + 1;  
65
    }  
66
  }  
67
  while_0_break: /* CIL Label */ ;  
68
  }  
69
  return;  
70
}  
71
}  
72
void printPump(void) ;  
73
void waterRise(void) ;  
74
void changeMethaneLevel(void) ;  
75
void Specification2(void)   
76
{   
77
  
78
  {  
79
  {  
80
  timeShift();  
81
  printPump();  
82
  timeShift();  
83
  printPump();  
84
  timeShift();  
85
  printPump();  
86
  waterRise();  
87
  printPump();  
88
  timeShift();  
89
  printPump();  
90
  changeMethaneLevel();  
91
  printPump();  
92
  timeShift();  
93
  printPump();  
94
  cleanup();  
95
  }  
96
  return;  
97
}  
98
}  
99
void setup(void)   
100
{   
101
  
102
  {  
103
  return;  
104
}  
105
}  
106
void test(void) ;  
107
void runTest(void)   
108
{   
109
  
110
  {  
111
  {  
112
  test();  
113
  }  
114
  return;  
115
}  
116
}  
117
void select_helpers(void) ;  
118
void select_features(void) ;  
119
int valid_product(void) ;  
120
int main(void)   
121
{initialize_reads(); int retValue_acc ;  
122
  int tmp ;  
123
  
124
  {  
125
  {  
126
  select_helpers();  
127
  select_features();  
128
  tmp = valid_product();  
129
  }  
130
  if (tmp != 0) {  
131
    {  
132
    setup();  
133
    runTest();  
134
    }  
135
  } else {  
136
  
137
  }  
138
  retValue_acc = 0;  
139
  return (retValue_acc);  
140
  return (retValue_acc);  
141
}  
142
}  
143
#pragma merger(0,"featureselect.i","")  
144
int select_one(void) ;  
145
int select_one(void)   
146
{ int retValue_acc ;  
147
  int choice = __VERIFIER_nondet_int();  
148
  
149
  {  
150
  retValue_acc = choice;  
151
  return (retValue_acc);  
152
  return (retValue_acc);  
153
}  
154
}  
155
void select_features(void)   
156
{   
157
  
158
  {  
159
  return;  
160
}  
161
}  
162
void select_helpers(void)   
163
{   
164
  
165
  {  
166
  return;  
167
}  
168
}  
169
int valid_product(void)   
170
{ int retValue_acc ;  
171
  
172
  {  
173
  retValue_acc = 1;  
174
  return (retValue_acc);  
175
  return (retValue_acc);  
176
}  
177
}  
178
#pragma merger(0,"MinePump.i","")  
179
void lowerWaterLevel(void) ;  
180
int isMethaneLevelCritical(void) ;  
181
void printEnvironment(void) ;  
182
int isHighWaterSensorDry(void) ;  
183
int isLowWaterSensorDry(void) ;  
184
void activatePump(void) ;  
185
void deactivatePump(void) ;  
186
int isPumpRunning(void) ;  
187
void stopSystem(void) ;  
188
int pumpRunning  =    0;  
189
int systemActive  =    1;  
190
void __utac_acc__Specification3_spec__1(void) ;  
191
void processEnvironment(void) ;  
192
void timeShift(void)   
193
{   
194
  
195
  {  
196
  if (pumpRunning != 0) {  
197
    {  
198
    lowerWaterLevel();  
199
    }  
200
  } else {  
201
  
202
  }  
203
  if (systemActive != 0) {  
204
    {  
205
    processEnvironment();  
206
    }  
207
  } else {  
208
  
209
  }  
210
  {  
211
  __utac_acc__Specification3_spec__1();  
212
  }  
213
  return;  
214
}  
215
}  
216
void processEnvironment__wrappee__base(void)   
217
{   
218
  
219
  {  
220
  return;  
221
}  
222
}  
223
int isHighWaterLevel(void) ;  
224
void processEnvironment__wrappee__highWaterSensor(void)   
225
{ int tmp ;  
226
  
227
  {  
228
  if (! pumpRunning) {  
229
    {  
230
    tmp = isHighWaterLevel();  
231
    }  
232
    if (tmp != 0) {  
233
      {  
234
      activatePump();  
235
      }  
236
    } else {  
237
      {  
238
      processEnvironment__wrappee__base();  
239
      }  
240
    }  
241
  } else {  
242
    {  
243
    processEnvironment__wrappee__base();  
244
    }  
245
  }  
246
  return;  
247
}  
248
}  
249
int isLowWaterLevel(void) ;  
250
void processEnvironment__wrappee__methaneQuery(void)   
251
{ int tmp ;  
252
  
253
  {  
254
  if (pumpRunning != 0) {  
255
    {  
256
    tmp = isLowWaterLevel();  
257
    }  
258
    if (tmp != 0) {  
259
      {  
260
      deactivatePump();  
261
      }  
262
    } else {  
263
      {  
264
      processEnvironment__wrappee__highWaterSensor();  
265
      }  
266
    }  
267
  } else {  
268
    {  
269
    processEnvironment__wrappee__highWaterSensor();  
270
    }  
271
  }  
272
  return;  
273
}  
274
}  
275
int isMethaneAlarm(void) ;  
276
void processEnvironment(void)   
277
{ int tmp ;  
278
  
279
  {  
280
  if (pumpRunning != 0) {  
281
    {  
282
    tmp = isMethaneAlarm();  
283
    }  
284
    if (tmp != 0) {  
285
      {  
286
      deactivatePump();  
287
      }  
288
    } else {  
289
      {  
290
      processEnvironment__wrappee__methaneQuery();  
291
      }  
292
    }  
293
  } else {  
294
    {  
295
    processEnvironment__wrappee__methaneQuery();  
296
    }  
297
  }  
298
  return;  
299
}  
300
}  
301
void activatePump__wrappee__lowWaterSensor(void)   
302
{   
303
  
304
  {  
305
  pumpRunning = 1;  
306
  return;  
307
}  
308
}  
309
void activatePump(void)   
310
{ int tmp ;  
311
  
312
  {  
313
  {  
314
  tmp = isMethaneAlarm();  
315
  }  
316
  if (tmp != 0) {  
317
  
318
  } else {  
319
    {  
320
    activatePump__wrappee__lowWaterSensor();  
321
    }  
322
  }  
323
  return;  
324
}  
325
}  
326
void deactivatePump(void)   
327
{   
328
  
329
  {  
330
  pumpRunning = 0;  
331
  return;  
332
}  
333
}  
334
int isMethaneAlarm(void)   
335
{ int retValue_acc ;  
336
  
337
  {  
338
  {  
339
  retValue_acc = isMethaneLevelCritical();  
340
  }  
341
  return (retValue_acc);  
342
  return (retValue_acc);  
343
}  
344
}  
345
int isPumpRunning(void)   
346
{ int retValue_acc ;  
347
  
348
  {  
349
  retValue_acc = pumpRunning;  
350
  return (retValue_acc);  
351
  return (retValue_acc);  
352
}  
353
}  
354
void printPump(void)   
355
{   
356
  
357
  {  
358
  {  
359
//  printf("Pump(System:");  
360
  }  
361
  if (systemActive != 0) {  
362
    {  
363
//    printf("On");  
364
    }  
365
  } else {  
366
    {  
367
//    printf("Off");  
368
    }  
369
  }  
370
  {  
371
//  printf(",Pump:");  
372
  }  
373
  if (pumpRunning != 0) {  
374
    {  
375
//    printf("On");  
376
    }  
377
  } else {  
378
    {  
379
//    printf("Off");  
380
    }  
381
  }  
382
  {  
383
//  printf(") ");  
384
  printEnvironment();  
385
//  printf("\n");  
386
  }  
387
  return;  
388
}  
389
}  
390
int isHighWaterLevel(void)   
391
{ int retValue_acc ;  
392
  int tmp ;  
393
  int tmp___0 ;  
394
  
395
  {  
396
  {  
397
  tmp = isHighWaterSensorDry();  
398
  }  
399
  if (tmp != 0) {  
400
    tmp___0 = 0;  
401
  } else {  
402
    tmp___0 = 1;  
403
  }  
404
  retValue_acc = tmp___0;  
405
  return (retValue_acc);  
406
  return (retValue_acc);  
407
}  
408
}  
409
int isLowWaterLevel(void)   
410
{ int retValue_acc ;  
411
  int tmp ;  
412
  int tmp___0 ;  
413
  
414
  {  
415
  {  
416
  tmp = isLowWaterSensorDry();  
417
  }  
418
  if (tmp != 0) {  
419
    tmp___0 = 0;  
420
  } else {  
421
    tmp___0 = 1;  
422
  }  
423
  retValue_acc = tmp___0;  
424
  return (retValue_acc);  
425
  return (retValue_acc);  
426
}  
427
}  
428
void stopSystem(void)   
429
{   
430
  
431
  {  
432
  if (pumpRunning != 0) {  
433
    {  
434
    deactivatePump();  
435
    }  
436
  } else {  
437
  
438
  }  
439
  systemActive = 0;  
440
  return;  
441
}  
442
}  
443
#pragma merger(0,"scenario.i","")  
444
void test(void)   
445
{ int splverifierCounter ;  
446
  int tmp ;  
447
  int tmp___0 ;  
448
  int tmp___1 ;  
449
  int tmp___2 ;  
450
  
451
  {  
452
  splverifierCounter = 0;  
453
  {  
454
  while (1) {  
455
    while_1_continue: /* CIL Label */ ;  
456
    if (splverifierCounter < 4) {  
457
  
458
    } else {  
459
      goto while_1_break;  
460
    }  
461
    {  
462
    tmp = (input_at_462_counter < num_of_inputs_at_462) ? INPUTS_at_462[input_at_462_counter++] : __VERIFIER_nondet_int() ;  
463
    }  
464
    if (tmp != 0) {  
465
      {  
466
      waterRise();  
467
      }  
468
    } else {  
469
  
470
    }  
471
    {  
472
    tmp___0 = (input_at_472_counter < num_of_inputs_at_472) ? INPUTS_at_472[input_at_472_counter++] : __VERIFIER_nondet_int() ;  
473
    }  
474
    if (tmp___0 != 0) {  
475
      {  
476
      changeMethaneLevel();  
477
      }  
478
    } else {  
479
  
480
    }  
481
    {  
482
    tmp___2 = (input_at_482_counter < num_of_inputs_at_482) ? INPUTS_at_482[input_at_482_counter++] : __VERIFIER_nondet_int() ;  
483
    }  
484
    if (tmp___2 != 0) {  
485
  
486
    } else {  
487
      {  
488
      tmp___1 = (input_at_488_counter < num_of_inputs_at_488) ? INPUTS_at_488[input_at_488_counter++] : __VERIFIER_nondet_int() ;  
489
      }  
490
      if (tmp___1 != 0) {  
491
        {  
492
        stopSystem();  
493
        }  
494
      } else {  
495
  
496
      }  
497
    }  
498
    {  
499
    timeShift();  
500
    }  
501
  }  
502
  while_1_break: /* CIL Label */ ;  
503
  }  
504
  {  
505
  cleanup();  
506
  }  
507
  return;  
508
}  
509
}  
510
#pragma merger(0,"Environment.i","")  
511
int getWaterLevel(void) ;  
512
int waterLevel  =    1;  
513
int methaneLevelCritical  =    0;  
514
void lowerWaterLevel(void)   
515
{   
516
  
517
  {  
518
  if (waterLevel > 0) {  
519
    waterLevel = waterLevel - 1;  
520
  } else {  
521
  
522
  }  
523
  return;  
524
}  
525
}  
526
void waterRise(void)   
527
{   
528
  
529
  {  
530
  if (waterLevel < 2) {  
531
    waterLevel = waterLevel + 1;  
532
  } else {  
533
  
534
  }  
535
  return;  
536
}  
537
}  
538
void changeMethaneLevel(void)   
539
{   
540
  
541
  {  
542
  if (methaneLevelCritical != 0) {  
543
    methaneLevelCritical = 0;  
544
  } else {  
545
    methaneLevelCritical = 1;  
546
  }  
547
  return;  
548
}  
549
}  
550
int isMethaneLevelCritical(void)   
551
{ int retValue_acc ;  
552
  
553
  {  
554
  retValue_acc = methaneLevelCritical;  
555
  return (retValue_acc);  
556
  return (retValue_acc);  
557
}  
558
}  
559
void printEnvironment(void)   
560
{   
561
  
562
  {  
563
  {  
564
//  printf("Env(Water:%i", waterLevel);  
565
//  printf(",Meth:");  
566
  }  
567
  if (methaneLevelCritical != 0) {  
568
    {  
569
//    printf("CRIT");  
570
    }  
571
  } else {  
572
    {  
573
//    printf("OK");  
574
    }  
575
  }  
576
  {  
577
//  printf(")");  
578
  }  
579
  return;  
580
}  
581
}  
582
int getWaterLevel(void)   
583
{ int retValue_acc ;  
584
  
585
  {  
586
  retValue_acc = waterLevel;  
587
  return (retValue_acc);  
588
  return (retValue_acc);  
589
}  
590
}  
591
int isHighWaterSensorDry(void)   
592
{ int retValue_acc ;  
593
  
594
  {  
595
  if (waterLevel < 2) {  
596
    retValue_acc = 1;  
597
    return (retValue_acc);  
598
  } else {  
599
    retValue_acc = 0;  
600
    return (retValue_acc);  
601
  }  
602
  return (retValue_acc);  
603
}  
604
}  
605
int isLowWaterSensorDry(void)   
606
{ int retValue_acc ;  
607
  
608
  {  
609
  retValue_acc = waterLevel == 0;  
610
  return (retValue_acc);  
611
  return (retValue_acc);  
612
}  
613
}  
614
#pragma merger(0,"wsllib_check.i","")  
615
void __automaton_fail(void)   
616
{   
617
  
618
  {  
619
  __VERIFIER_assume(!((0 == INPUTS_at_472[0])));__VERIFIER_assume(!((0 == INPUTS_at_462[1] && 0 != INPUTS_at_482[1])));__VERIFIER_assume(!((0 == INPUTS_at_472[1] && 0 != INPUTS_at_472[0])));__VERIFIER_assume(!((0 != INPUTS_at_472[1] && 0 == INPUTS_at_462[1])));__VERIFIER_assume(!((0 != INPUTS_at_462[0])));__VERIFIER_assume(!((0 == INPUTS_at_482[1])));__VERIFIER_assume(!((0 == INPUTS_at_482[2] && 0 != INPUTS_at_472[0])));__VERIFIER_error();  
620
  return;  
621
}  
622
}  
623
#pragma merger(0,"Specification3_spec.i","")  
624
void __utac_acc__Specification3_spec__1(void)   
625
{ int tmp ;  
626
  int tmp___0 ;  
627
  int tmp___1 ;  
628
  
629
  {  
630
  {  
631
  tmp = isMethaneLevelCritical();  
632
  }  
633
  if (tmp != 0) {  
634
  
635
  } else {  
636
    {  
637
    tmp___0 = getWaterLevel();  
638
    }  
639
    if (tmp___0 == 2) {  
640
      {  
641
      tmp___1 = isPumpRunning();  
642
      }  
643
      if (tmp___1 != 0) {  
644
  
645
      } else {  
646
        {  
647
        __automaton_fail();  
648
        }  
649
      }  
650
    } else {  
651
  
652
    }  
653
  }  
654
  return;  
655
}  
656
}  
657
#pragma merger(0,"libacc.i","")  
658
extern  __attribute__((__nothrow__, __noreturn__)) void __assert_fail(char const   *__assertion ,  
659
                                                                      char const   *__file ,  
660
                                                                      unsigned int __line ,  
661
                                                                      char const   *__function ) ;  
662
extern  __attribute__((__nothrow__)) void *malloc(size_t __size )  __attribute__((__malloc__)) ;  
663
extern  __attribute__((__nothrow__)) void free(void *__ptr ) ;  
664
void __utac__exception__cf_handler_set(void *exception , int (*cflow_func)(int  ,  
665
                                                                           int  ) ,  
666
                                       int val )   
667
{ struct __UTAC__EXCEPTION *excep ;  
668
  struct __UTAC__CFLOW_FUNC *cf ;  
669
  void *tmp ;  
670
  unsigned long __cil_tmp7 ;  
671
  unsigned long __cil_tmp8 ;  
672
  unsigned long __cil_tmp9 ;  
673
  unsigned long __cil_tmp10 ;  
674
  unsigned long __cil_tmp11 ;  
675
  unsigned long __cil_tmp12 ;  
676
  unsigned long __cil_tmp13 ;  
677
  unsigned long __cil_tmp14 ;  
678
  int (**mem_15)(int  , int  ) ;  
679
  int *mem_16 ;  
680
  struct __UTAC__CFLOW_FUNC **mem_17 ;  
681
  struct __UTAC__CFLOW_FUNC **mem_18 ;  
682
  struct __UTAC__CFLOW_FUNC **mem_19 ;  
683
  
684
  {  
685
  {  
686
  excep = (struct __UTAC__EXCEPTION *)exception;  
687
  tmp = malloc(24UL);  
688
  cf = (struct __UTAC__CFLOW_FUNC *)tmp;  
689
  mem_15 = (int (**)(int  , int  ))cf;  
690
  *mem_15 = cflow_func;  
691
  __cil_tmp7 = (unsigned long )cf;  
692
  __cil_tmp8 = __cil_tmp7 + 8;  
693
  mem_16 = (int *)__cil_tmp8;  
694
  *mem_16 = val;  
695
  __cil_tmp9 = (unsigned long )cf;  
696
  __cil_tmp10 = __cil_tmp9 + 16;  
697
  __cil_tmp11 = (unsigned long )excep;  
698
  __cil_tmp12 = __cil_tmp11 + 24;  
699
  mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp10;  
700
  mem_18 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp12;  
701
  *mem_17 = *mem_18;  
702
  __cil_tmp13 = (unsigned long )excep;  
703
  __cil_tmp14 = __cil_tmp13 + 24;  
704
  mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14;  
705
  *mem_19 = cf;  
706
  }  
707
  return;  
708
}  
709
}  
710
void __utac__exception__cf_handler_free(void *exception )   
711
{ struct __UTAC__EXCEPTION *excep ;  
712
  struct __UTAC__CFLOW_FUNC *cf ;  
713
  struct __UTAC__CFLOW_FUNC *tmp ;  
714
  unsigned long __cil_tmp5 ;  
715
  unsigned long __cil_tmp6 ;  
716
  struct __UTAC__CFLOW_FUNC *__cil_tmp7 ;  
717
  unsigned long __cil_tmp8 ;  
718
  unsigned long __cil_tmp9 ;  
719
  unsigned long __cil_tmp10 ;  
720
  unsigned long __cil_tmp11 ;  
721
  void *__cil_tmp12 ;  
722
  unsigned long __cil_tmp13 ;  
723
  unsigned long __cil_tmp14 ;  
724
  struct __UTAC__CFLOW_FUNC **mem_15 ;  
725
  struct __UTAC__CFLOW_FUNC **mem_16 ;  
726
  struct __UTAC__CFLOW_FUNC **mem_17 ;  
727
  
728
  {  
729
  excep = (struct __UTAC__EXCEPTION *)exception;  
730
  __cil_tmp5 = (unsigned long )excep;  
731
  __cil_tmp6 = __cil_tmp5 + 24;  
732
  mem_15 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6;  
733
  cf = *mem_15;  
734
  {  
735
  while (1) {  
736
    while_2_continue: /* CIL Label */ ;  
737
    {  
738
    __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0;  
739
    __cil_tmp8 = (unsigned long )__cil_tmp7;  
740
    __cil_tmp9 = (unsigned long )cf;  
741
    if (__cil_tmp9 != __cil_tmp8) {  
742
  
743
    } else {  
744
      goto while_2_break;  
745
    }  
746
    }  
747
    {  
748
    tmp = cf;  
749
    __cil_tmp10 = (unsigned long )cf;  
750
    __cil_tmp11 = __cil_tmp10 + 16;  
751
    mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp11;  
752
    cf = *mem_16;  
753
    __cil_tmp12 = (void *)tmp;  
754
    free(__cil_tmp12);  
755
    }  
756
  }  
757
  while_2_break: /* CIL Label */ ;  
758
  }  
759
  __cil_tmp13 = (unsigned long )excep;  
760
  __cil_tmp14 = __cil_tmp13 + 24;  
761
  mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14;  
762
  *mem_17 = (struct __UTAC__CFLOW_FUNC *)0;  
763
  return;  
764
}  
765
}  
766
void __utac__exception__cf_handler_reset(void *exception )   
767
{ struct __UTAC__EXCEPTION *excep ;  
768
  struct __UTAC__CFLOW_FUNC *cf ;  
769
  unsigned long __cil_tmp5 ;  
770
  unsigned long __cil_tmp6 ;  
771
  struct __UTAC__CFLOW_FUNC *__cil_tmp7 ;  
772
  unsigned long __cil_tmp8 ;  
773
  unsigned long __cil_tmp9 ;  
774
  int (*__cil_tmp10)(int  , int  ) ;  
775
  unsigned long __cil_tmp11 ;  
776
  unsigned long __cil_tmp12 ;  
777
  int __cil_tmp13 ;  
778
  unsigned long __cil_tmp14 ;  
779
  unsigned long __cil_tmp15 ;  
780
  struct __UTAC__CFLOW_FUNC **mem_16 ;  
781
  int (**mem_17)(int  , int  ) ;  
782
  int *mem_18 ;  
783
  struct __UTAC__CFLOW_FUNC **mem_19 ;  
784
  
785
  {  
786
  excep = (struct __UTAC__EXCEPTION *)exception;  
787
  __cil_tmp5 = (unsigned long )excep;  
788
  __cil_tmp6 = __cil_tmp5 + 24;  
789
  mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6;  
790
  cf = *mem_16;  
791
  {  
792
  while (1) {  
793
    while_3_continue: /* CIL Label */ ;  
794
    {  
795
    __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0;  
796
    __cil_tmp8 = (unsigned long )__cil_tmp7;  
797
    __cil_tmp9 = (unsigned long )cf;  
798
    if (__cil_tmp9 != __cil_tmp8) {  
799
  
800
    } else {  
801
      goto while_3_break;  
802
    }  
803
    }  
804
    {  
805
    mem_17 = (int (**)(int  , int  ))cf;  
806
    __cil_tmp10 = *mem_17;  
807
    __cil_tmp11 = (unsigned long )cf;  
808
    __cil_tmp12 = __cil_tmp11 + 8;  
809
    mem_18 = (int *)__cil_tmp12;  
810
    __cil_tmp13 = *mem_18;  
811
    (*__cil_tmp10)(4, __cil_tmp13);  
812
    __cil_tmp14 = (unsigned long )cf;  
813
    __cil_tmp15 = __cil_tmp14 + 16;  
814
    mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp15;  
815
    cf = *mem_19;  
816
    }  
817
  }  
818
  while_3_break: /* CIL Label */ ;  
819
  }  
820
  {  
821
  __utac__exception__cf_handler_free(exception);  
822
  }  
823
  return;  
824
}  
825
}  
826
void *__utac__error_stack_mgt(void *env , int mode , int count ) ;  
827
static struct __ACC__ERR *head  =    (struct __ACC__ERR *)0;  
828
void *__utac__error_stack_mgt(void *env , int mode , int count )   
829
{ void *retValue_acc ;  
830
  struct __ACC__ERR *new ;  
831
  void *tmp ;  
832
  struct __ACC__ERR *temp ;  
833
  struct __ACC__ERR *next ;  
834
  void *excep ;  
835
  unsigned long __cil_tmp10 ;  
836
  unsigned long __cil_tmp11 ;  
837
  unsigned long __cil_tmp12 ;  
838
  unsigned long __cil_tmp13 ;  
839
  void *__cil_tmp14 ;  
840
  unsigned long __cil_tmp15 ;  
841
  unsigned long __cil_tmp16 ;  
842
  void *__cil_tmp17 ;  
843
  void **mem_18 ;  
844
  struct __ACC__ERR **mem_19 ;  
845
  struct __ACC__ERR **mem_20 ;  
846
  void **mem_21 ;  
847
  struct __ACC__ERR **mem_22 ;  
848
  void **mem_23 ;  
849
  void **mem_24 ;  
850
  
851
  {  
852
  if (count == 0) {  
853
    return (retValue_acc);  
854
  } else {  
855
  
856
  }  
857
  if (mode == 0) {  
858
    {  
859
    tmp = malloc(16UL);  
860
    new = (struct __ACC__ERR *)tmp;  
861
    mem_18 = (void **)new;  
862
    *mem_18 = env;  
863
    __cil_tmp10 = (unsigned long )new;  
864
    __cil_tmp11 = __cil_tmp10 + 8;  
865
    mem_19 = (struct __ACC__ERR **)__cil_tmp11;  
866
    *mem_19 = head;  
867
    head = new;  
868
    retValue_acc = (void *)new;  
869
    }  
870
    return (retValue_acc);  
871
  } else {  
872
  
873
  }  
874
  if (mode == 1) {  
875
    temp = head;  
876
    {  
877
    while (1) {  
878
      while_4_continue: /* CIL Label */ ;  
879
      if (count > 1) {  
880
  
881
      } else {  
882
        goto while_4_break;  
883
      }  
884
      {  
885
      __cil_tmp12 = (unsigned long )temp;  
886
      __cil_tmp13 = __cil_tmp12 + 8;  
887
      mem_20 = (struct __ACC__ERR **)__cil_tmp13;  
888
      next = *mem_20;  
889
      mem_21 = (void **)temp;  
890
      excep = *mem_21;  
891
      __cil_tmp14 = (void *)temp;  
892
      free(__cil_tmp14);  
893
      __utac__exception__cf_handler_reset(excep);  
894
      temp = next;  
895
      count = count - 1;  
896
      }  
897
    }  
898
    while_4_break: /* CIL Label */ ;  
899
    }  
900
    {  
901
    __cil_tmp15 = (unsigned long )temp;  
902
    __cil_tmp16 = __cil_tmp15 + 8;  
903
    mem_22 = (struct __ACC__ERR **)__cil_tmp16;  
904
    head = *mem_22;  
905
    mem_23 = (void **)temp;  
906
    excep = *mem_23;  
907
    __cil_tmp17 = (void *)temp;  
908
    free(__cil_tmp17);  
909
    __utac__exception__cf_handler_reset(excep);  
910
    retValue_acc = excep;  
911
    }  
912
    return (retValue_acc);  
913
  } else {  
914
  
915
  }  
916
  if (mode == 2) {  
917
    if (head != 0) {  
918
      mem_24 = (void **)head;  
919
      retValue_acc = *mem_24;  
920
      return (retValue_acc);  
921
    } else {  
922
      retValue_acc = (void *)0;  
923
      return (retValue_acc);  
924
    }  
925
  } else {  
926
  
927
  }  
928
  return (retValue_acc);  
929
}  
930
}  
931
void *__utac__get_this_arg(int i , struct JoinPoint *this )   
932
{ void *retValue_acc ;  
933
  unsigned long __cil_tmp4 ;  
934
  unsigned long __cil_tmp5 ;  
935
  int __cil_tmp6 ;  
936
  int __cil_tmp7 ;  
937
  unsigned long __cil_tmp8 ;  
938
  unsigned long __cil_tmp9 ;  
939
  void **__cil_tmp10 ;  
940
  void **__cil_tmp11 ;  
941
  int *mem_12 ;  
942
  void ***mem_13 ;  
943
  
944
  {  
945
  if (i > 0) {  
946
    {  
947
    __cil_tmp4 = (unsigned long )this;  
948
    __cil_tmp5 = __cil_tmp4 + 16;  
949
    mem_12 = (int *)__cil_tmp5;  
950
    __cil_tmp6 = *mem_12;  
951
    if (i <= __cil_tmp6) {  
952
  
953
    } else {  
954
      {  
955
      __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
956
                    123U, "__utac__get_this_arg");  
957
      }  
958
    }  
959
    }  
960
  } else {  
961
    {  
962
    __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
963
                  123U, "__utac__get_this_arg");  
964
    }  
965
  }  
966
  __cil_tmp7 = i - 1;  
967
  __cil_tmp8 = (unsigned long )this;  
968
  __cil_tmp9 = __cil_tmp8 + 8;  
969
  mem_13 = (void ***)__cil_tmp9;  
970
  __cil_tmp10 = *mem_13;  
971
  __cil_tmp11 = __cil_tmp10 + __cil_tmp7;  
972
  retValue_acc = *__cil_tmp11;  
973
  return (retValue_acc);  
974
  return (retValue_acc);  
975
}  
976
}  
977
char const   *__utac__get_this_argtype(int i , struct JoinPoint *this )   
978
{ char const   *retValue_acc ;  
979
  unsigned long __cil_tmp4 ;  
980
  unsigned long __cil_tmp5 ;  
981
  int __cil_tmp6 ;  
982
  int __cil_tmp7 ;  
983
  unsigned long __cil_tmp8 ;  
984
  unsigned long __cil_tmp9 ;  
985
  char const   **__cil_tmp10 ;  
986
  char const   **__cil_tmp11 ;  
987
  int *mem_12 ;  
988
  char const   ***mem_13 ;  
989
  
990
  {  
991
  if (i > 0) {  
992
    {  
993
    __cil_tmp4 = (unsigned long )this;  
994
    __cil_tmp5 = __cil_tmp4 + 16;  
995
    mem_12 = (int *)__cil_tmp5;  
996
    __cil_tmp6 = *mem_12;  
997
    if (i <= __cil_tmp6) {  
998
  
999
    } else {  
1000
      {  
1001
      __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
1002
                    131U, "__utac__get_this_argtype");  
1003
      }  
1004
    }  
1005
    }  
1006
  } else {  
1007
    {  
1008
    __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
1009
                  131U, "__utac__get_this_argtype");  
1010
    }  
1011
  }  
1012
  __cil_tmp7 = i - 1;  
1013
  __cil_tmp8 = (unsigned long )this;  
1014
  __cil_tmp9 = __cil_tmp8 + 24;  
1015
  mem_13 = (char const   ***)__cil_tmp9;  
1016
  __cil_tmp10 = *mem_13;  
1017
  __cil_tmp11 = __cil_tmp10 + __cil_tmp7;  
1018
  retValue_acc = *__cil_tmp11;  
1019
  return (retValue_acc);  
1020
  return (retValue_acc);  
1021
}  
1022
}  
2017-05-11 15:00:36:576	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

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

2017-05-11 15:00:38:517	INFO	CFACreationUtils.addEdgeToCFA	line 140: Dead code detected: return (retValue_acc);

2017-05-11 15:00:38:523	INFO	CFACreationUtils.addEdgeToCFA	line 152: Dead code detected: return (retValue_acc);

2017-05-11 15:00:38:527	INFO	CFACreationUtils.addEdgeToCFA	line 175: Dead code detected: return (retValue_acc);

2017-05-11 15:00:38:555	INFO	CFACreationUtils.addEdgeToCFA	line 342: Dead code detected: return (retValue_acc);

2017-05-11 15:00:38:556	INFO	CFACreationUtils.addEdgeToCFA	line 351: Dead code detected: return (retValue_acc);

2017-05-11 15:00:38:569	INFO	CFACreationUtils.addEdgeToCFA	line 406: Dead code detected: return (retValue_acc);

2017-05-11 15:00:38:574	INFO	CFACreationUtils.addEdgeToCFA	line 425: Dead code detected: return (retValue_acc);

2017-05-11 15:00:38:634	INFO	CFACreationUtils.addEdgeToCFA	line 556: Dead code detected: return (retValue_acc);

2017-05-11 15:00:38:638	INFO	CFACreationUtils.addEdgeToCFA	line 588: Dead code detected: return (retValue_acc);

2017-05-11 15:00:38:646	INFO	CFACreationUtils.addEdgeToCFA	line 602: Dead code detected: return (retValue_acc);

2017-05-11 15:00:38:649	INFO	CFACreationUtils.addEdgeToCFA	line 611: Dead code detected: return (retValue_acc);

2017-05-11 15:00:38:783	INFO	CFACreationUtils.addEdgeToCFA	line 974: Dead code detected: return (retValue_acc);

2017-05-11 15:00:38:795	INFO	CFACreationUtils.addEdgeToCFA	line 1020: Dead code detected: return (retValue_acc);

2017-05-11 15:00:39:011	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 811: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 15:00:40:706	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 15:00:41:149	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:00:41:907	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:00:42:047	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:00:42:180	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:00:42:879	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:00:42:883	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:00:42:907	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:00:42:935	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:00:44:169	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:00:48:162	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:00:48:229	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

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

2017-05-11 15:00:52:547	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 15:00:52:547	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:00:57:294	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 15:00:57:295	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:01:01:234	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 15:01:01:236	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:01:03:213	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 15:01:03:214	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:01:04:766	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 15:01:04:772	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:01:07:136	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 20

2017-05-11 15:01:07:147	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:01:08:790	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 15:01:08:791	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

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

2017-05-11 15:01:09:968	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

2017-05-11 15:01:09:979	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:01:15:867	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 15:01:15:879	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:01:23:900	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

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

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

2017-05-11 15:01:23:910	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:01:23:937	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:01:24:086	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 34

2017-05-11 15:01:24:094	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

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

2017-05-11 15:01:36:113	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 35

2017-05-11 15:01:36:121	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:01:43:845	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 37

2017-05-11 15:01:43:845	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:01:50:601	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 41

2017-05-11 15:01:50:607	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:01:57:520	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 43

2017-05-11 15:01:57:521	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:02:04:590	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 44

2017-05-11 15:02:04:591	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:02:11:431	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 46

2017-05-11 15:02:11:443	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:02:18:794	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 47

2017-05-11 15:02:18:794	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:02:29:196	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 15:02:29:197	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

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

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

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

2017-05-11 15:02:35:532	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:02:43:126	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 48

2017-05-11 15:02:43:127	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:03:01:193	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 15:03:01:194	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:03:01:204	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:03:01:204	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:03:01:254	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:03:08:258	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 49

2017-05-11 15:03:08:260	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

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

2017-05-11 15:03:31:109	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 51

2017-05-11 15:03:31:110	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@7cc70f8e

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

2017-05-11 15:03:53:147	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

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

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

2017-05-11 15:03:57:785	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 15:03:59:661	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:04:00:170	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 15:04:00:170	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:04:00:717	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 15:04:00:718	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:04:01:433	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 15:04:01:433	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:04:02:442	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 15:04:02:443	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:04:03:733	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

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

2017-05-11 15:04:03:747	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 15:04:03:748	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:            5 (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:         5 (100%)
  Times precision was empty:       5 (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:         350
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  2.765s
  Time for path formula creation:        2.764s
Time for strengthen operator:            0.010s
Time for prec operator:                  0.001s
  Time for abstraction:                  0.001s (Max:     0.001s, Count: 5)
    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.042s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 392
   Number of created targets for uf: *signed_int is 113



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

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

Bounds CPA statistics
---------------------
Bound k:                                           5
Maximum loop iteration reached:                    6


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  31680 (count: 2037, min: 0, max: 22, avg: 15.55)
Number of global variables:                           19972 (count: 2037, min: 0, max: 14, avg: 9.80)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    2215
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.229s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                53

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  548
Number of deterministic Assumptions:                    118
Level of Determinism:                              22%

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.005s
Automaton transfers with branching:                0
Automaton transfer successors:                         2215 (count: 2220, min: 0, max: 1, avg: 1.00) [0 x 5, 1 x 2215]

CPA algorithm statistics
------------------------
Number of iterations:            2045
Max size of waitlist:            11
Average size of waitlist:        4
Number of computed successors:   2215
Max successors for one state:    2
Number of times merged:          175
Number of times stopped:         175
Number of times breaked:         0

Total time for CPA algorithm:         4.547s (Max:     3.873s)
  Time for choose from waitlist:      0.002s
  Time for precision adjustment:      0.280s
  Time for transfer relation:         4.101s
  Time for merge operator:            0.074s
  Time for stop operator:             0.011s
  Time for adding to reached set:     0.057s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           4.553s
Time for final sat check:                3.997s
Time for error path creation:            1.428s
Time for bounding assertions check:      0.555s
Time for induction formula creation:    52.847s
Time for induction check:              130.958s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         4 (400%)
Time for counterexample checks:         4.072s
Time for running CBMC:                  3.601s


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.028s
  Time for transition matches:                         0.381s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.001s
Automaton transfers with branching:                0
Automaton transfer successors:                       206837 (count: 207505, min: 0, max: 1, avg: 1.00) [0 x 668, 1 x 206837]

CPA algorithm statistics
------------------------
Number of iterations:            196024
Max size of waitlist:            372
Average size of waitlist:        70
Number of computed successors:   206837
Max successors for one state:    2
Number of times merged:          38262
Number of times stopped:         43163
Number of times breaked:         0

Total time for CPA algorithm:       198.492s (Max:    32.599s)
  Time for choose from waitlist:      0.275s
  Time for precision adjustment:      2.823s
  Time for transfer relation:        37.095s
  Time for merge operator:          144.728s
  Time for stop operator:            10.548s
  Time for adding to reached set:     1.476s


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

Code Coverage
-----------------------------
  Function coverage:      0.732
  Visited lines:          153
  Total lines:            447
  Line coverage:          0.342
  Visited conditions:     94
  Total conditions:       128
  Condition coverage:     0.734

CPAchecker general statistics
-----------------------------
Number of program locations:     750
Number of CFA edges:             882
Number of relevant variables:    160
Number of functions:             41
Number of loops:                 9
Size of reached set:             2037
  Number of reached locations:   397 (53%)
    Avg states per location:     5
    Max states per location:     22 (at node N353)
  Number of reached functions:   30 (73%)
  Number of partitions:          2037
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       5

Time for analysis setup:          3.976s
  Time for loading CPAs:          1.119s
  Time for loading parser:        0.783s
  Time for CFA construction:      1.979s
    Time for parsing file(s):     0.486s
    Time for AST to CFA:          0.653s
    Time for CFA sanity check:    0.200s
    Time for post-processing:     0.597s
      Time for var class.:        0.301s
    Time for CFA export:          1.026s
Time for Analysis:              203.038s
CPU time for analysis:          399.780s
Time for analyzing result:        0.002s
Total time for CPAchecker:      207.033s
Total CPU time for CPAchecker:  406.780s
Time for statistics:              4.672s

Time for Garbage Collector:      23.197s (in 173 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                728MB (   694 MiB) max;    344MB (   328 MiB) avg;    752MB (   717 MiB) peak
Used non-heap memory:             53MB (    50 MiB) max;     49MB (    47 MiB) avg;     58MB (    56 MiB) peak
Used in PS Old Gen pool:         320MB (   305 MiB) max;    152MB (   145 MiB) avg;    320MB (   305 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    969MB (   924 MiB) avg
Allocated non-heap memory:        55MB (    52 MiB) max;     52MB (    50 MiB) avg
Total process virtual memory:   6869MB (  6551 MiB) max;   6503MB (  6201 MiB) avg

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