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

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

2017-05-11 22:47:12:403	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 22:47:14:155	INFO	CFACreationUtils.addEdgeToCFA	line 253: Dead code detected: return (retValue_acc);

2017-05-11 22:47:14:157	INFO	CFACreationUtils.addEdgeToCFA	line 262: Dead code detected: return (retValue_acc);

2017-05-11 22:47:14:161	INFO	CFACreationUtils.addEdgeToCFA	line 317: Dead code detected: return (retValue_acc);

2017-05-11 22:47:14:165	INFO	CFACreationUtils.addEdgeToCFA	line 336: Dead code detected: return (retValue_acc);

2017-05-11 22:47:14:244	INFO	CFACreationUtils.addEdgeToCFA	line 715: Dead code detected: return (retValue_acc);

2017-05-11 22:47:14:248	INFO	CFACreationUtils.addEdgeToCFA	line 761: Dead code detected: return (retValue_acc);

2017-05-11 22:47:14:262	INFO	CFACreationUtils.addEdgeToCFA	line 785: Dead code detected: return (retValue_acc);

2017-05-11 22:47:14:264	INFO	CFACreationUtils.addEdgeToCFA	line 808: Dead code detected: return (retValue_acc);

2017-05-11 22:47:14:274	INFO	CFACreationUtils.addEdgeToCFA	line 856: Dead code detected: return (retValue_acc);

2017-05-11 22:47:14:276	INFO	CFACreationUtils.addEdgeToCFA	line 888: Dead code detected: return (retValue_acc);

2017-05-11 22:47:14:277	INFO	CFACreationUtils.addEdgeToCFA	line 902: Dead code detected: return (retValue_acc);

2017-05-11 22:47:14:278	INFO	CFACreationUtils.addEdgeToCFA	line 911: Dead code detected: return (retValue_acc);

2017-05-11 22:47:14:285	INFO	CFACreationUtils.addEdgeToCFA	line 1007: Dead code detected: return (retValue_acc);

2017-05-11 22:47:14:410	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 552: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 22:47:16:776	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 22:47:17:475	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 22:47:18:098	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 22:47:18:236	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 22:47:18:480	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 22:47:18:955	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 22:47:18:958	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 22:47:18:981	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 22:47:19:020	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 22:47:19:867	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:47:23:558	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:47:23:586	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:47:24:132	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:47:32:937	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 22:47:32:938	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:47:32:938	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:47:38:966	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 22:47:38:971	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:47:38:972	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:47:41:953	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 22:47:41:955	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:47:41:955	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:47:45:069	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 5

2017-05-11 22:47:45:069	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:47:45:069	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

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

2017-05-11 22:47:47:378	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

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

2017-05-11 22:47:48:776	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:47:49:353	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 7

2017-05-11 22:47:49:354	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:47:49:357	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:47:50:531	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 22:47:50:531	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:47:50:531	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:47:51:249	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

2017-05-11 22:47:51:249	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:47:51:249	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:47:52:374	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 11

2017-05-11 22:47:52:374	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:47:52:375	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:47:53:216	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 13

2017-05-11 22:47:53:216	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:47:53:217	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

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

2017-05-11 22:47:54:081	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

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

2017-05-11 22:47:54:113	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 22:47:54:114	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:47:54:142	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:47:54:148	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:47:54:194	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:47:56:253	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 15

2017-05-11 22:47:56:253	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:47:56:254	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:47:59:327	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 22:47:59:328	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:47:59:328	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:48:00:535	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 18

2017-05-11 22:48:00:535	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:48:00:536	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:48:01:275	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:48:01:764	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 19

2017-05-11 22:48:01:764	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

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

2017-05-11 22:48:02:567	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 21

2017-05-11 22:48:02:567	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

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

2017-05-11 22:48:04:008	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 22

2017-05-11 22:48:04:016	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:48:04:016	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:48:05:833	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 23

2017-05-11 22:48:05:839	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

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

2017-05-11 22:48:07:450	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 25

2017-05-11 22:48:07:451	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:48:07:451	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:48:09:091	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 26

2017-05-11 22:48:09:091	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:48:09:092	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:48:10:720	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

2017-05-11 22:48:10:720	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

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

2017-05-11 22:48:13:172	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 29

2017-05-11 22:48:13:184	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

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

2017-05-11 22:48:15:120	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 31

2017-05-11 22:48:15:120	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

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

2017-05-11 22:48:19:424	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 22:48:19:424	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:48:19:425	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:48:23:840	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 33

2017-05-11 22:48:23:840	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:48:23:840	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:48:28:236	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 35

2017-05-11 22:48:28:236	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:48:28:236	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:48:32:440	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 39

2017-05-11 22:48:32:441	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:48:32:441	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:48:36:598	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 47

2017-05-11 22:48:36:599	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:48:36:599	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:48:47:358	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 22:48:47:358	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:48:47:367	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:48:47:368	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:48:47:427	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:48:49:329	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 51

2017-05-11 22:48:49:337	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:48:49:345	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:48:58:820	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:49:09:025	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 53

2017-05-11 22:49:09:026	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

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

2017-05-11 22:49:27:634	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 22:49:27:635	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:49:27:643	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:49:27:644	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:49:27:717	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:49:28:193	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 57

2017-05-11 22:49:28:194	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:49:28:194	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:49:38:492	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:50:00:247	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 22:50:00:248	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:50:00:256	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:50:00:256	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:50:00:350	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:50:12:394	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:50:34:405	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 59

2017-05-11 22:50:34:405	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

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

2017-05-11 22:50:34:861	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

2017-05-11 22:50:34:862	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:50:34:869	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:50:34:870	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 22:50:34:971	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 22:51:04:847	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 22:51:41:088	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 60

2017-05-11 22:51:41:089	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:51:41:089	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:52:47:225	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 62

2017-05-11 22:52:47:225	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:52:47:225	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:53:54:357	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 7

2017-05-11 22:53:54:358	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 22:53:55:036	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 22:53:55:829	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 63

2017-05-11 22:53:55:829	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@480bcb3

2017-05-11 22:53:55:829	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 22:54:05:482	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 22:54:09:398	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:54:10:067	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 22:54:10:067	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:54:10:630	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 22:54:10:630	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:54:11:417	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 22:54:11:417	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:54:12:208	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 22:54:12:208	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 22:54:13:234	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 22:54:13:235	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

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

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

2017-05-11 22:54:17:018	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 22:54:17:022	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.

2017-05-11 22:54:17:028	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 22:54:17:028	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:            7 (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:         7 (100%)
  Times precision was empty:       7 (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:         630
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  3.030s
  Time for path formula creation:        3.024s
Time for strengthen operator:            0.013s
Time for prec operator:                  0.007s
  Time for abstraction:                  0.002s (Max:     0.001s, Count: 7)
    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.073s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 882
   Number of created targets for uf: *signed_int is 127



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

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

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


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  40003 (count: 2523, min: 0, max: 25, avg: 15.86)
Number of global variables:                           24681 (count: 2523, min: 0, max: 14, avg: 9.78)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    2843
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.040s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                58

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  904
Number of deterministic Assumptions:                    134
Level of Determinism:                              15%

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

CPA algorithm statistics
------------------------
Number of iterations:            2535
Max size of waitlist:            13
Average size of waitlist:        3
Number of computed successors:   2843
Max successors for one state:    2
Number of times merged:          315
Number of times stopped:         315
Number of times breaked:         0

Total time for CPA algorithm:         4.365s (Max:     3.663s)
  Time for choose from waitlist:      0.003s
  Time for precision adjustment:      0.135s
  Time for transfer relation:         4.030s
  Time for merge operator:            0.107s
  Time for stop operator:             0.010s
  Time for adding to reached set:     0.011s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           4.389s
Time for final sat check:               10.447s
Time for error path creation:            2.881s
Time for bounding assertions check:      0.630s
Time for induction formula creation:    95.656s
Time for induction check:              293.666s

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


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

AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states:                                  1
Total time for successor computation:                  1.813s
  Time for transition matches:                         0.630s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.003s
Automaton transfers with branching:                0
Automaton transfer successors:                       407614 (count: 408607, min: 0, max: 1, avg: 1.00) [0 x 993, 1 x 407614]

CPA algorithm statistics
------------------------
Number of iterations:            377808
Max size of waitlist:            479
Average size of waitlist:        127
Number of computed successors:   407614
Max successors for one state:    2
Number of times merged:          69993
Number of times stopped:         77584
Number of times breaked:         0

Total time for CPA algorithm:       415.245s (Max:    68.573s)
  Time for choose from waitlist:      0.440s
  Time for precision adjustment:      5.138s
  Time for transfer relation:        67.478s
  Time for merge operator:          312.458s
  Time for stop operator:            25.532s
  Time for adding to reached set:     1.882s


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

Code Coverage
-----------------------------
  Function coverage:      0.732
  Visited lines:          148
  Total lines:            442
  Line coverage:          0.335
  Visited conditions:     122
  Total conditions:       156
  Condition coverage:     0.782

CPAchecker general statistics
-----------------------------
Number of program locations:     765
Number of CFA edges:             903
Number of relevant variables:    161
Number of functions:             41
Number of loops:                 9
Size of reached set:             2523
  Number of reached locations:   412 (54%)
    Avg states per location:     6
    Max states per location:     20 (at node N652)
  Number of reached functions:   30 (73%)
  Number of partitions:          2523
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       7

Time for analysis setup:          4.329s
  Time for loading CPAs:          1.908s
  Time for loading parser:        0.684s
  Time for CFA construction:      1.619s
    Time for parsing file(s):     0.483s
    Time for AST to CFA:          0.527s
    Time for CFA sanity check:    0.096s
    Time for post-processing:     0.446s
      Time for var class.:        0.257s
    Time for CFA export:          1.578s
Time for Analysis:              420.249s
CPU time for analysis:          829.800s
Time for analyzing result:        0.002s
Total time for CPAchecker:      424.597s
Total CPU time for CPAchecker:  837.320s
Time for statistics:              4.782s

Time for Garbage Collector:      54.126s (in 351 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                970MB (   925 MiB) max;    497MB (   474 MiB) avg;   1003MB (   956 MiB) peak
Used non-heap memory:             54MB (    52 MiB) max;     51MB (    48 MiB) avg;     60MB (    58 MiB) peak
Used in PS Old Gen pool:         565MB (   538 MiB) max;    302MB (   288 MiB) avg;    569MB (   542 MiB) peak
Allocated heap memory:          1248MB (  1191 MiB) max;    997MB (   951 MiB) avg
Allocated non-heap memory:        56MB (    53 MiB) max;     53MB (    51 MiB) avg
Total process virtual memory:   7071MB (  6743 MiB) max;   6711MB (  6400 MiB) avg

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