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

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

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

2017-05-11 15:09:27:160	INFO	CFACreationUtils.addEdgeToCFA	line 91: Dead code detected: return (retValue_acc);

2017-05-11 15:09:27:162	INFO	CFACreationUtils.addEdgeToCFA	line 123: Dead code detected: return (retValue_acc);

2017-05-11 15:09:27:164	INFO	CFACreationUtils.addEdgeToCFA	line 132: Dead code detected: return (retValue_acc);

2017-05-11 15:09:27:185	INFO	CFACreationUtils.addEdgeToCFA	line 287: Dead code detected: return (retValue_acc);

2017-05-11 15:09:27:189	INFO	CFACreationUtils.addEdgeToCFA	line 296: Dead code detected: return (retValue_acc);

2017-05-11 15:09:27:194	INFO	CFACreationUtils.addEdgeToCFA	line 351: Dead code detected: return (retValue_acc);

2017-05-11 15:09:27:238	INFO	CFACreationUtils.addEdgeToCFA	line 533: Dead code detected: return (retValue_acc);

2017-05-11 15:09:27:315	INFO	CFACreationUtils.addEdgeToCFA	line 862: Dead code detected: return (retValue_acc);

2017-05-11 15:09:27:320	INFO	CFACreationUtils.addEdgeToCFA	line 908: Dead code detected: return (retValue_acc);

2017-05-11 15:09:27:322	INFO	CFACreationUtils.addEdgeToCFA	line 920: Dead code detected: return (retValue_acc);

2017-05-11 15:09:27:323	INFO	CFACreationUtils.addEdgeToCFA	line 943: Dead code detected: return (retValue_acc);

2017-05-11 15:09:27:466	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 699: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 15:09:28:415	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 15:09:28:656	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:09:29:261	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:09:29:355	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:09:29:458	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:09:29:773	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:09:29:776	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:09:29:785	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:09:29:793	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:09:30:103	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:09:31:808	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 15:09:31:811	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

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

2017-05-11 15:09:32:667	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:09:33:308	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:09:34:718	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 15:09:34:719	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:09:36:140	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 15:09:36:155	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:09:37:281	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 15:09:37:282	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:09:38:076	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 15:09:38:077	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:09:39:360	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 20

2017-05-11 15:09:39:360	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:09:39:947	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 15:09:39:950	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

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

2017-05-11 15:09:40:292	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:09:41:391	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 15:09:41:401	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

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

2017-05-11 15:09:44:667	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 34

2017-05-11 15:09:44:667	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:09:49:264	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 15:09:49:265	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:09:49:272	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:09:49:273	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:09:49:298	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 35

2017-05-11 15:09:49:299	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

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

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

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

2017-05-11 15:09:55:408	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:09:59:412	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 38

2017-05-11 15:09:59:413	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:10:03:202	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 42

2017-05-11 15:10:03:202	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:10:07:030	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 44

2017-05-11 15:10:07:030	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:10:10:813	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 48

2017-05-11 15:10:10:813	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:10:19:417	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 15:10:19:418	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:10:19:425	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:10:19:425	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:10:19:457	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:10:23:020	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:10:24:892	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 50

2017-05-11 15:10:24:893	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:10:37:386	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 15:10:37:387	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:10:37:393	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:10:37:394	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:10:37:435	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:10:38:086	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 54

2017-05-11 15:10:38:087	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:10:42:850	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

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

2017-05-11 15:10:51:186	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:10:59:630	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 15:10:59:631	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:10:59:638	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:10:59:639	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:10:59:690	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

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

2017-05-11 15:11:34:779	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 66

2017-05-11 15:11:34:779	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@e99499a

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

2017-05-11 15:11:55:133	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

2017-05-11 15:11:55:134	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:11:55:428	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

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

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

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

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

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

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

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

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

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

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

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

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

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

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

2017-05-11 15:12:00:832	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 15:12:00:833	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:            6 (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:         6 (100%)
  Times precision was empty:       6 (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:         294
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  1.965s
  Time for path formula creation:        1.963s
Time for strengthen operator:            0.005s
Time for prec operator:                  0.004s
  Time for abstraction:                  0.000s (Max:     0.000s, Count: 6)
    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.012s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 578
   Number of created targets for uf: *signed_int is 69



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

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

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


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  21588 (count: 1255, min: 0, max: 30, avg: 17.20)
Number of global variables:                           13969 (count: 1255, min: 0, max: 18, avg: 11.13)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    1406
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.048s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                52

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  608
Number of deterministic Assumptions:                    170
Level of Determinism:                              28%

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.004s
Automaton transfers with branching:                0
Automaton transfer successors:                         1406 (count: 1412, min: 0, max: 1, avg: 1.00) [0 x 6, 1 x 1406]

CPA algorithm statistics
------------------------
Number of iterations:            1265
Max size of waitlist:            14
Average size of waitlist:        3
Number of computed successors:   1406
Max successors for one state:    2
Number of times merged:          147
Number of times stopped:         147
Number of times breaked:         0

Total time for CPA algorithm:         2.796s (Max:     2.478s)
  Time for choose from waitlist:      0.002s
  Time for precision adjustment:      0.079s
  Time for transfer relation:         2.665s
  Time for merge operator:            0.020s
  Time for stop operator:             0.005s
  Time for adding to reached set:     0.004s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           2.819s
Time for final sat check:                1.900s
Time for error path creation:            1.093s
Time for bounding assertions check:      0.398s
Time for induction formula creation:    34.903s
Time for induction check:              106.681s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         5 (500%)
Time for counterexample checks:         2.173s
Time for running CBMC:                  2.021s


Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties
===============================================================================================================================

AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states:                                  1
Total time for successor computation:                  0.625s
  Time for transition matches:                         0.214s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.001s
Automaton transfers with branching:                0
Automaton transfer successors:                       144330 (count: 144918, min: 0, max: 1, avg: 1.00) [0 x 588, 1 x 144330]

CPA algorithm statistics
------------------------
Number of iterations:            131985
Max size of waitlist:            538
Average size of waitlist:        118
Number of computed successors:   144330
Max successors for one state:    2
Number of times merged:          32597
Number of times stopped:         35215
Number of times breaked:         0

Total time for CPA algorithm:       149.382s (Max:    43.565s)
  Time for choose from waitlist:      0.141s
  Time for precision adjustment:      1.436s
  Time for transfer relation:        19.722s
  Time for merge operator:          117.391s
  Time for stop operator:             9.353s
  Time for adding to reached set:     0.522s


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

Code Coverage
-----------------------------
  Function coverage:      0.541
  Visited lines:          93
  Total lines:            419
  Line coverage:          0.222
  Visited conditions:     96
  Total conditions:       144
  Condition coverage:     0.667

CPAchecker general statistics
-----------------------------
Number of program locations:     722
Number of CFA edges:             848
Number of relevant variables:    151
Number of functions:             37
Number of loops:                 9
Size of reached set:             1255
  Number of reached locations:   311 (43%)
    Avg states per location:     4
    Max states per location:     7 (at node N215)
  Number of reached functions:   20 (54%)
  Number of partitions:          1255
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       6

Time for analysis setup:          2.421s
  Time for loading CPAs:          0.584s
  Time for loading parser:        0.447s
  Time for CFA construction:      1.316s
    Time for parsing file(s):     0.326s
    Time for AST to CFA:          0.448s
    Time for CFA sanity check:    0.113s
    Time for post-processing:     0.380s
      Time for var class.:        0.214s
    Time for CFA export:          0.501s
Time for Analysis:              152.415s
CPU time for analysis:          377.100s
Time for analyzing result:        0.001s
Total time for CPAchecker:      154.850s
Total CPU time for CPAchecker:  383.230s
Time for statistics:              2.492s

Time for Garbage Collector:      15.048s (in 150 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                650MB (   620 MiB) max;    335MB (   319 MiB) avg;    685MB (   653 MiB) peak
Used non-heap memory:             55MB (    52 MiB) max;     51MB (    49 MiB) avg;     60MB (    57 MiB) peak
Used in PS Old Gen pool:         256MB (   244 MiB) max;    144MB (   138 MiB) avg;    258MB (   246 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    965MB (   920 MiB) avg
Allocated non-heap memory:        56MB (    54 MiB) max;     53MB (    51 MiB) avg
Total process virtual memory:   8570MB (  8173 MiB) max;   8205MB (  7825 MiB) avg

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