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

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

2017-05-11 16:53:52:731	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 16:53:54:660	INFO	CFACreationUtils.addEdgeToCFA	line 91: Dead code detected: return (retValue_acc);

2017-05-11 16:53:54:664	INFO	CFACreationUtils.addEdgeToCFA	line 123: Dead code detected: return (retValue_acc);

2017-05-11 16:53:54:670	INFO	CFACreationUtils.addEdgeToCFA	line 137: Dead code detected: return (retValue_acc);

2017-05-11 16:53:54:813	INFO	CFACreationUtils.addEdgeToCFA	line 334: Dead code detected: return (retValue_acc);

2017-05-11 16:53:54:818	INFO	CFACreationUtils.addEdgeToCFA	line 343: Dead code detected: return (retValue_acc);

2017-05-11 16:53:54:843	INFO	CFACreationUtils.addEdgeToCFA	line 398: Dead code detected: return (retValue_acc);

2017-05-11 16:53:54:847	INFO	CFACreationUtils.addEdgeToCFA	line 428: Dead code detected: return (retValue_acc);

2017-05-11 16:53:54:849	INFO	CFACreationUtils.addEdgeToCFA	line 451: Dead code detected: return (retValue_acc);

2017-05-11 16:53:54:861	INFO	CFACreationUtils.addEdgeToCFA	line 547: Dead code detected: return (retValue_acc);

2017-05-11 16:53:54:963	INFO	CFACreationUtils.addEdgeToCFA	line 867: Dead code detected: return (retValue_acc);

2017-05-11 16:53:54:971	INFO	CFACreationUtils.addEdgeToCFA	line 913: Dead code detected: return (retValue_acc);

2017-05-11 16:53:55:177	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 704: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 16:53:56:872	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 16:53:56:904	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 16:53:56:939	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 16:53:57:225	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 16:53:57:989	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 16:53:58:140	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 16:53:58:428	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 16:53:58:852	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 16:53:58:856	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 16:53:58:885	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 16:53:58:907	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 16:53:59:559	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:54:03:662	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:54:03:708	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:54:04:263	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:54:04:401	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 16:54:04:404	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:54:04:414	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:54:11:150	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 16:54:11:151	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

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

2017-05-11 16:54:14:585	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 16:54:14:586	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:54:14:599	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:54:16:788	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 16:54:16:789	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

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

2017-05-11 16:54:19:629	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

2017-05-11 16:54:19:630	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:54:19:630	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:54:21:120	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 16:54:21:121	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:54:21:121	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:54:22:582	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 14

2017-05-11 16:54:22:582	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:54:22:582	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:54:23:641	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 16:54:23:652	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:54:23:654	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:54:24:809	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 17

2017-05-11 16:54:24:810	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:54:24:811	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:54:25:880	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:54:25:909	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 19

2017-05-11 16:54:25:909	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:54:25:910	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:54:26:609	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 23

2017-05-11 16:54:26:623	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:54:26:623	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:54:28:251	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 25

2017-05-11 16:54:28:264	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:54:28:264	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

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

2017-05-11 16:54:29:786	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

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

2017-05-11 16:54:34:480	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 31

2017-05-11 16:54:34:481	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:54:34:481	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:54:37:758	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 35

2017-05-11 16:54:37:767	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:54:37:767	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:54:43:953	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 16:54:43:954	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:54:43:973	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:54:43:974	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:54:44:190	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:54:51:571	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:54:53:158	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 37

2017-05-11 16:54:53:158	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:54:53:159	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:55:04:084	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 16:55:04:085	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:55:04:095	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:55:04:096	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:55:04:142	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:55:11:733	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:55:12:974	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 38

2017-05-11 16:55:12:974	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:55:12:975	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:55:29:105	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 16:55:29:106	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:55:29:124	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:55:29:125	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:55:29:183	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:55:30:306	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 40

2017-05-11 16:55:30:306	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

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

2017-05-11 16:55:39:649	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:55:48:934	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 41

2017-05-11 16:55:48:935	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:55:48:935	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:56:06:171	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 43

2017-05-11 16:56:06:171	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:56:06:171	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:56:06:220	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 16:56:06:221	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:56:06:229	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:56:06:230	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:56:06:305	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:56:19:945	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:56:35:893	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 44

2017-05-11 16:56:35:893	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:56:35:893	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:57:03:398	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 46

2017-05-11 16:57:03:399	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:57:03:399	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:57:30:747	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 50

2017-05-11 16:57:30:749	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

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

2017-05-11 16:58:14:865	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 52

2017-05-11 16:58:14:866	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:58:14:867	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:58:58:466	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 56

2017-05-11 16:58:58:467	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

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

2017-05-11 16:59:41:622	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 64

2017-05-11 16:59:41:623	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 16:59:41:623	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:00:23:424	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 80

2017-05-11 17:00:23:424	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2d54d6b5

2017-05-11 17:00:23:425	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 17:01:26:608	WARNING	AbstractFuture.get	Warning: Analysis interrupted

2017-05-11 17:01:26:615	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 17:01:26:623	WARNING	ForceTerminationOnShutdown$1.shutdownRequested	Shutdown requested (The CPU-time limit of 900s has elapsed.), waiting for termination.

    
Parallel Algorithm statistics
-----------------------------
Number of algorithms used:        2


Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
===================================================================================================================================
Cannot print statistics for this analysis because it is still running.


Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties
===============================================================================================================================
Cannot print statistics for this analysis because it is still running.


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

Code Coverage
-----------------------------
  Function coverage:      0.028
  Visited lines:          0
  Total lines:            411
  Line coverage:          0.000
  Visited conditions:     0
  Total conditions:       154
  Condition coverage:     0.000

CPAchecker general statistics
-----------------------------
Number of program locations:     715
Number of CFA edges:             838
Number of relevant variables:    144
Number of functions:             36
Number of loops:                 9
Size of reached set:             1
  Number of reached locations:   1 (0%)
    Avg states per location:     1
    Max states per location:     1 (at node N388)
  Number of reached functions:   1 (3%)
  Number of partitions:          1
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       0
  Size of final wait list        1

Time for analysis setup:          4.097s
  Time for loading CPAs:          1.046s
  Time for loading parser:        0.707s
  Time for CFA construction:      2.245s
    Time for parsing file(s):     0.606s
    Time for AST to CFA:          0.716s
    Time for CFA sanity check:    0.179s
    Time for post-processing:     0.643s
      Time for var class.:        0.366s
    Time for CFA export:          0.907s
Time for Analysis:              449.732s
CPU time for analysis:          893.720s
Total time for CPAchecker:      453.851s
Total CPU time for CPAchecker:  900.380s
Time for statistics:              0.027s

Time for Garbage Collector:      38.356s (in 376 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                829MB (   791 MiB) max;    434MB (   414 MiB) avg;    853MB (   814 MiB) peak
Used non-heap memory:             53MB (    50 MiB) max;     51MB (    49 MiB) avg;     53MB (    51 MiB) peak
Used in PS Old Gen pool:         418MB (   398 MiB) max;    236MB (   225 MiB) avg;    418MB (   398 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    962MB (   918 MiB) avg
Allocated non-heap memory:        55MB (    53 MiB) max;     54MB (    52 MiB) avg
Total process virtual memory:   6795MB (  6480 MiB) max;   6665MB (  6357 MiB) avg

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