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

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

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

2017-05-11 16:42:09:648	INFO	CFACreationUtils.addEdgeToCFA	line 356: Dead code detected: return (retValue_acc);

2017-05-11 16:42:09:656	INFO	CFACreationUtils.addEdgeToCFA	line 402: Dead code detected: return (retValue_acc);

2017-05-11 16:42:09:663	INFO	CFACreationUtils.addEdgeToCFA	line 501: Dead code detected: return (retValue_acc);

2017-05-11 16:42:09:664	INFO	CFACreationUtils.addEdgeToCFA	line 510: Dead code detected: return (retValue_acc);

2017-05-11 16:42:09:668	INFO	CFACreationUtils.addEdgeToCFA	line 565: Dead code detected: return (retValue_acc);

2017-05-11 16:42:09:690	INFO	CFACreationUtils.addEdgeToCFA	line 705: Dead code detected: return (retValue_acc);

2017-05-11 16:42:09:693	INFO	CFACreationUtils.addEdgeToCFA	line 728: Dead code detected: return (retValue_acc);

2017-05-11 16:42:09:716	INFO	CFACreationUtils.addEdgeToCFA	line 834: Dead code detected: return (retValue_acc);

2017-05-11 16:42:09:720	INFO	CFACreationUtils.addEdgeToCFA	line 883: Dead code detected: return (retValue_acc);

2017-05-11 16:42:09:722	INFO	CFACreationUtils.addEdgeToCFA	line 915: Dead code detected: return (retValue_acc);

2017-05-11 16:42:09:725	INFO	CFACreationUtils.addEdgeToCFA	line 929: Dead code detected: return (retValue_acc);

2017-05-11 16:42:09:843	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 193: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 16:42:10:760	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 16:42:11:002	WARNING	Parallel analysis 1:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 16:42:11:416	INFO	Parallel analysis 1:PredicateCPA:PredicateCPA.<init>	Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).

2017-05-11 16:42:11:506	WARNING	Parallel analysis 1:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 16:42:11:591	WARNING	Parallel analysis 1:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 16:42:11:830	WARNING	Parallel analysis 1:InductionStepCase:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 16:42:11:833	INFO	Parallel analysis 1:InductionStepCase:PredicateCPA:PredicateCPA.<init>	Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).

2017-05-11 16:42:11:843	WARNING	Parallel analysis 1:InductionStepCase:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 16:42:11:856	WARNING	Parallel analysis 1:InductionStepCase:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 16:42:12:185	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:42:13:106	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:42:13:119	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:42:13:363	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:42:14:121	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

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

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

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

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

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

2017-05-11 16:42:18:755	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 16:42:18:770	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@ec65cdd

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

2017-05-11 16:42:19:762	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

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

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

2017-05-11 16:42:21:038	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

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

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

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

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

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

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

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

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

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

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

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

2017-05-11 16:42:23:476	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 20

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

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

2017-05-11 16:42:24:230	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:42:24:621	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 22

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

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

2017-05-11 16:42:25:402	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 26

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

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

2017-05-11 16:42:26:446	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

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

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

2017-05-11 16:42:28:157	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 29

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

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

2017-05-11 16:42:30:392	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 30

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

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

2017-05-11 16:42:32:404	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 16:42:32:405	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@ec65cdd

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

2017-05-11 16:42:34:638	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 33

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

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

2017-05-11 16:42:36:675	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 35

2017-05-11 16:42:36:675	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@ec65cdd

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

2017-05-11 16:42:38:759	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 36

2017-05-11 16:42:38:759	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@ec65cdd

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

2017-05-11 16:42:42:454	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 37

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

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

2017-05-11 16:42:42:458	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 16:42:42:458	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:42:42:468	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:42:42:468	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:42:42:490	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:42:45:187	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:42:48:374	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 16:42:48:375	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:42:48:381	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:42:48:381	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:42:48:410	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:42:49:884	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 38

2017-05-11 16:42:49:884	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@ec65cdd

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

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

2017-05-11 16:43:02:285	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

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

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

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

2017-05-11 16:43:02:328	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:43:08:799	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:43:13:223	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 39

2017-05-11 16:43:13:223	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@ec65cdd

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

2017-05-11 16:43:33:276	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

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

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

2017-05-11 16:43:34:814	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 16:43:35:095	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 41

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

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

2017-05-11 16:43:35:973	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:43:36:324	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:43:36:325	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:43:36:650	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:43:36:650	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:43:37:010	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:43:37:010	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:43:37:423	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:43:37:434	WARNING	Parallel analysis 1:ExceptionHandlingAlgorithm.handleExceptionWithErrorPath	Infeasible counterexample found, but could not remove it from the ARG. Therefore, we cannot prove safety.

2017-05-11 16:43:37:437	INFO	Parallel analysis 1:ExceptionHandlingAlgorithm.handleExceptionWithErrorPath	Another infeasible counterexample found which could not be removed from the ARG.

2017-05-11 16:43:37:449	INFO	Parallel analysis 1:ExceptionHandlingAlgorithm.handleExceptionWithErrorPath	Another infeasible counterexample found which could not be removed from the ARG.

2017-05-11 16:43:37:452	INFO	Parallel analysis 1:ExceptionHandlingAlgorithm.handleExceptionWithErrorPath	Another infeasible counterexample found which could not be removed from the ARG.

2017-05-11 16:43:37:458	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished without usable result.

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

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

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

2017-05-11 16:44:30:168	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 47

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

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

2017-05-11 16:45:38:647	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 48

2017-05-11 16:45:38:648	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@ec65cdd

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

2017-05-11 16:46:45:896	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 50

2017-05-11 16:46:45:896	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@ec65cdd

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

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

2017-05-11 16:47:52:925	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@ec65cdd

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

2017-05-11 16:48:58:168	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 62

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

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

2017-05-11 16:50:00:873	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 78

2017-05-11 16:50:00:873	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@ec65cdd

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

2017-05-11 16:53:10:378	WARNING	AbstractFuture.get	Warning: Analysis interrupted

2017-05-11 16:53:10:379	WARNING	ForceTerminationOnShutdown$1.shutdownRequested	Shutdown requested (The CPU-time limit of 900s has elapsed.), waiting for termination.

2017-05-11 16:53:10:378	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

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


Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
===================================================================================================================================

PredicateCPA statistics
-----------------------
Number of abstractions:            4 (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:         4 (100%)
  Times precision was empty:       4 (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:         260
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  0.684s
  Time for path formula creation:        0.682s
Time for strengthen operator:            0.002s
Time for prec operator:                  0.000s
  Time for abstraction:                  0.000s (Max:     0.000s, Count: 4)
    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.018s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 450
   Number of created targets for uf: *signed_int is 91



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

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

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


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  16883 (count: 1117, min: 0, max: 25, avg: 15.11)
Number of global variables:                           11756 (count: 1117, min: 0, max: 19, avg: 10.52)

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

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  450
Number of deterministic Assumptions:                    150
Level of Determinism:                              33%

ConstraintsStrengthenOperator statistics
----------------------------------------
Total time for strengthening by ConstraintsCPA:     0.000s
Replaced symbolic expressions: 0

AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states:                                  1
Total time for successor computation:                  0.005s
Automaton transfers with branching:                0
Automaton transfer successors:                         1258 (count: 1262, min: 0, max: 1, avg: 1.00) [0 x 4, 1 x 1258]

CPA algorithm statistics
------------------------
Number of iterations:            1133
Max size of waitlist:            9
Average size of waitlist:        2
Number of computed successors:   1258
Max successors for one state:    2
Number of times merged:          130
Number of times stopped:         130
Number of times breaked:         0

Total time for CPA algorithm:         1.159s (Max:     0.912s)
  Time for choose from waitlist:      0.002s
  Time for precision adjustment:      0.051s
  Time for transfer relation:         1.066s
  Time for merge operator:            0.024s
  Time for stop operator:             0.005s
  Time for adding to reached set:     0.005s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           1.166s
Time for final sat check:                1.306s
Time for error path creation:            0.969s
Time for bounding assertions check:      0.150s
Time for induction formula creation:    25.965s
Time for induction check:               53.767s

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


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.909s
  Time for transition matches:                         0.365s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.002s
Automaton transfers with branching:                0
Automaton transfer successors:                       296825 (count: 297106, min: 0, max: 1, avg: 1.00) [0 x 281, 1 x 296825]

CPA algorithm statistics
------------------------
Number of iterations:            276866
Max size of waitlist:            538
Average size of waitlist:        109
Number of computed successors:   296825
Max successors for one state:    2
Number of times merged:          63163
Number of times stopped:         68516
Number of times breaked:         0

Total time for CPA algorithm:       656.338s (Max:   189.280s)
  Time for choose from waitlist:      0.223s
  Time for precision adjustment:      2.477s
  Time for transfer relation:        30.589s
  Time for merge operator:          581.393s
  Time for stop operator:            39.516s
  Time for adding to reached set:     0.705s


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

Code Coverage
-----------------------------
  Function coverage:      0.027
  Visited lines:          0
  Total lines:            419
  Line coverage:          0.000
  Visited conditions:     0
  Total conditions:       164
  Condition coverage:     0.000

CPAchecker general statistics
-----------------------------
Number of program locations:     720
Number of CFA edges:             852
Number of relevant variables:    142
Number of functions:             37
Number of loops:                 9
Size of reached set:             1
  Number of reached locations:   1 (0%)
    Avg states per location:     1
    Max states per location:     1 (at node N637)
  Number of reached functions:   1 (3%)
  Number of partitions:          1
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       0
  Size of final wait list        1

Time for analysis setup:          2.347s
  Time for loading CPAs:          0.556s
  Time for loading parser:        0.434s
  Time for CFA construction:      1.284s
    Time for parsing file(s):     0.344s
    Time for AST to CFA:          0.408s
    Time for CFA sanity check:    0.093s
    Time for post-processing:     0.367s
      Time for var class.:        0.223s
    Time for CFA export:          0.515s
Time for Analysis:              659.615s
CPU time for analysis:          894.010s
Total time for CPAchecker:      661.975s
Total CPU time for CPAchecker:  900.160s
Time for statistics:              1.635s

Time for Garbage Collector:      35.297s (in 515 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                818MB (   780 MiB) max;    472MB (   450 MiB) avg;    839MB (   800 MiB) peak
Used non-heap memory:             55MB (    52 MiB) max;     54MB (    51 MiB) avg;     60MB (    57 MiB) peak
Used in PS Old Gen pool:         403MB (   385 MiB) max;    269MB (   257 MiB) avg;    403MB (   385 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    928MB (   885 MiB) avg
Allocated non-heap memory:        57MB (    54 MiB) max;     56MB (    54 MiB) avg
Total process virtual memory:   8436MB (  8045 MiB) max;   8392MB (  8004 MiB) avg

    
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec2_product35_false-unreach-call_false-termination.cil/minepump_spec2_product35_false-unreach-call_false-termination.cil.over.instr.c
analysis.summaryEdges = true
analysis.useParallelAnalyses = true
cfa.allowBranchSwapping = false
cfa.simplifyCfa = false
limits.time.cpu = 900
log.level = INFO
output.path = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec2_product35_false-unreach-call_false-termination.cil/cpa_output
overflow.config = sv-comp16--k-induction-overflow.properties
parallelAlgorithm.configFiles = components/kInduction/svcomp16-kInduction.properties, components/invariantGeneration-no-out.properties::supply-reached-refinable
specification = /work/anon/anon/cfc/analyzers/cpachecker/config/specification/sv-comp-reachability.spc