This repository has been archived by the owner on Oct 3, 2021. It is now read-only.
/
pals_lcr.8_false-unreach-call.1.ufo.BOUNDED-16.pals_true-termination.c
719 lines (690 loc) · 27.6 KB
/
pals_lcr.8_false-unreach-call.1.ufo.BOUNDED-16.pals_true-termination.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
extern void __VERIFIER_error() __attribute__ ((__noreturn__));
/**********************************************************************
Copyright (c) 2013 Carnegie Mellon University. All Rights Reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following acknowledgments and
disclaimers.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The names "Carnegie Mellon University," "SEI" and/or "Software
Engineering Institute" shall not be used to endorse or promote
products derived from this software without prior written
permission. For written permission, please contact
permission@sei.cmu.edu.
4. Products derived from this software may not be called "SEI" nor may
"SEI" appear in their names without prior written permission of
permission@sei.cmu.edu.
5. Redistributions of any form whatsoever must retain the following
acknowledgment:
This material is based upon work funded and supported by the
Department of Defense under Contract No. FA8721-05-C-0003 with
Carnegie Mellon University for the operation of the Software
Engineering Institute, a federally funded research and development
center.
Any opinions, findings and conclusions or recommendations expressed in
this material are those of the author(s) and do not necessarily
reflect the views of the United States Department of Defense.
NO WARRANTY. THIS CARNEGIE MELLON UNIVERSITY AND SOFTWARE ENGINEERING
INSTITUTE MATERIAL IS FURNISHEDON AN "AS-IS" BASIS. CARNEGIE MELLON
UNIVERSITY MAKES NO WARRANTIES OF ANY KIND, EITHER EXPRESSED OR
IMPLIED, AS TO ANY MATTER INCLUDING, BUT NOT LIMITED TO, WARRANTY OF
FITNESS FOR PURPOSE OR MERCHANTABILITY, EXCLUSIVITY, OR RESULTS
OBTAINED FROM USE OF THE MATERIAL. CARNEGIE MELLON UNIVERSITY DOES NOT
MAKE ANY WARRANTY OF ANY KIND WITH RESPECT TO FREEDOM FROM PATENT,
TRADEMARK, OR COPYRIGHT INFRINGEMENT.
This material has been approved for public release and unlimited
distribution.
DM-0000575
**********************************************************************/
/* Generated by CIL v. 1.6.0 */
/* print_CIL_Input is true */
_Bool __VERIFIER_nondet_bool(void) ;
char __VERIFIER_nondet_char(void) ;
char __VERIFIER_nondet_char(void) ;
void assert(_Bool arg ) ;
void __VERIFIER_assume(int arg ) ;
typedef char msg_t;
typedef int port_t;
extern void read(port_t p , msg_t m ) ;
extern void write(port_t p , msg_t m ) ;
msg_t nomsg = (msg_t )-1;
char r1 ;
port_t p1 ;
char p1_old ;
char p1_new ;
char id1 ;
char st1 ;
msg_t send1 ;
_Bool mode1 ;
port_t p2 ;
char p2_old ;
char p2_new ;
char id2 ;
char st2 ;
msg_t send2 ;
_Bool mode2 ;
port_t p3 ;
char p3_old ;
char p3_new ;
char id3 ;
char st3 ;
msg_t send3 ;
_Bool mode3 ;
port_t p4 ;
char p4_old ;
char p4_new ;
char id4 ;
char st4 ;
msg_t send4 ;
_Bool mode4 ;
port_t p5 ;
char p5_old ;
char p5_new ;
char id5 ;
char st5 ;
msg_t send5 ;
_Bool mode5 ;
port_t p6 ;
char p6_old ;
char p6_new ;
char id6 ;
char st6 ;
msg_t send6 ;
_Bool mode6 ;
port_t p7 ;
char p7_old ;
char p7_new ;
char id7 ;
char st7 ;
msg_t send7 ;
_Bool mode7 ;
port_t p8 ;
char p8_old ;
char p8_new ;
char id8 ;
char st8 ;
msg_t send8 ;
_Bool mode8 ;
void node1(void)
{
msg_t m1 ;
{
m1 = nomsg;
if (mode1) {
r1 = (char )((int )r1 + 1);
m1 = p8_old;
p8_old = nomsg;
if ((int )m1 != (int )nomsg) {
if ((int )m1 > (int )id1) {
send1 = m1;
} else
if ((int )m1 == (int )id1) {
st1 = (char)1;
} else {
send1 = m1;
}
}
mode1 = (_Bool)0;
} else {
p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new;
mode1 = (_Bool)1;
}
return;
}
}
void node2(void)
{
msg_t m2 ;
{
m2 = nomsg;
if (mode2) {
m2 = p1_old;
p1_old = nomsg;
if ((int )m2 != (int )nomsg) {
if ((int )m2 > (int )id2) {
send2 = m2;
} else
if ((int )m2 == (int )id2) {
st2 = (char)1;
}
}
mode2 = (_Bool)0;
} else {
p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new;
mode2 = (_Bool)1;
}
return;
}
}
void node3(void)
{
msg_t m3 ;
{
m3 = nomsg;
if (mode3) {
m3 = p2_old;
p2_old = nomsg;
if ((int )m3 != (int )nomsg) {
if ((int )m3 > (int )id3) {
send3 = m3;
} else
if ((int )m3 == (int )id3) {
st3 = (char)1;
}
}
mode3 = (_Bool)0;
} else {
p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new;
mode3 = (_Bool)1;
}
return;
}
}
void node4(void)
{
msg_t m4 ;
{
m4 = nomsg;
if (mode4) {
m4 = p3_old;
p3_old = nomsg;
if ((int )m4 != (int )nomsg) {
if ((int )m4 > (int )id4) {
send4 = m4;
} else
if ((int )m4 == (int )id4) {
st4 = (char)1;
}
}
mode4 = (_Bool)0;
} else {
p4_new = send4 != nomsg && p4_new == nomsg ? send4 : p4_new;
mode4 = (_Bool)1;
}
return;
}
}
void node5(void)
{
msg_t m5 ;
{
m5 = nomsg;
if (mode5) {
m5 = p4_old;
p4_old = nomsg;
if ((int )m5 != (int )nomsg) {
if ((int )m5 > (int )id5) {
send5 = m5;
} else
if ((int )m5 == (int )id5) {
st5 = (char)1;
}
}
mode5 = (_Bool)0;
} else {
p5_new = send5 != nomsg && p5_new == nomsg ? send5 : p5_new;
mode5 = (_Bool)1;
}
return;
}
}
void node6(void)
{
msg_t m6 ;
{
m6 = nomsg;
if (mode6) {
m6 = p5_old;
p5_old = nomsg;
if ((int )m6 != (int )nomsg) {
if ((int )m6 > (int )id6) {
send6 = m6;
} else
if ((int )m6 == (int )id6) {
st6 = (char)1;
}
}
mode6 = (_Bool)0;
} else {
p6_new = send6 != nomsg && p6_new == nomsg ? send6 : p6_new;
mode6 = (_Bool)1;
}
return;
}
}
void node7(void)
{
msg_t m7 ;
{
m7 = nomsg;
if (mode7) {
m7 = p6_old;
p6_old = nomsg;
if ((int )m7 != (int )nomsg) {
if ((int )m7 > (int )id7) {
send7 = m7;
} else
if ((int )m7 == (int )id7) {
st7 = (char)1;
}
}
mode7 = (_Bool)0;
} else {
p7_new = send7 != nomsg && p7_new == nomsg ? send7 : p7_new;
mode7 = (_Bool)1;
}
return;
}
}
void node8(void)
{
msg_t m8 ;
{
m8 = nomsg;
if (mode8) {
m8 = p7_old;
p7_old = nomsg;
if ((int )m8 != (int )nomsg) {
if ((int )m8 > (int )id8) {
send8 = m8;
} else
if ((int )m8 == (int )id8) {
st8 = (char)1;
}
}
mode8 = (_Bool)0;
} else {
p8_new = send8 != nomsg && p8_new == nomsg ? send8 : p8_new;
mode8 = (_Bool)1;
}
return;
}
}
void (*nodes[8])(void) =
{ & node1, & node2, & node3, & node4,
& node5, & node6, & node7, & node8};
int init(void)
{
int tmp ;
{
if ((int )r1 == 0) {
if ((int )id1 >= 0) {
if ((int )st1 == 0) {
if ((int )send1 == (int )id1) {
if ((int )mode1 == 0) {
if ((int )id2 >= 0) {
if ((int )st2 == 0) {
if ((int )send2 == (int )id2) {
if ((int )mode2 == 0) {
if ((int )id3 >= 0) {
if ((int )st3 == 0) {
if ((int )send3 == (int )id3) {
if ((int )mode3 == 0) {
if ((int )id4 >= 0) {
if ((int )st4 == 0) {
if ((int )send4 == (int )id4) {
if ((int )mode4 == 0) {
if ((int )id5 >= 0) {
if ((int )st5 == 0) {
if ((int )send5 == (int )id5) {
if ((int )mode5 == 0) {
if ((int )id6 >= 0) {
if ((int )st6 == 0) {
if ((int )send6 == (int )id6) {
if ((int )mode6 == 0) {
if ((int )id7 >= 0) {
if ((int )st7 == 0) {
if ((int )send7 == (int )id7) {
if ((int )mode7 == 0) {
if ((int )id8 >= 0) {
if ((int )st8 == 0) {
if ((int )send8 == (int )id8) {
if ((int )mode8 == 0) {
if ((int )id1 != (int )id2) {
if ((int )id1 != (int )id3) {
if ((int )id1 != (int )id4) {
if ((int )id1 != (int )id5) {
if ((int )id1 != (int )id6) {
if ((int )id1 != (int )id7) {
if ((int )id1 != (int )id8) {
if ((int )id2 != (int )id3) {
if ((int )id2 != (int )id4) {
if ((int )id2 != (int )id5) {
if ((int )id2 != (int )id6) {
if ((int )id2 != (int )id7) {
if ((int )id2 != (int )id8) {
if ((int )id3 != (int )id4) {
if ((int )id3 != (int )id5) {
if ((int )id3 != (int )id6) {
if ((int )id3 != (int )id7) {
if ((int )id3 != (int )id8) {
if ((int )id4 != (int )id5) {
if ((int )id4 != (int )id6) {
if ((int )id4 != (int )id7) {
if ((int )id4 != (int )id8) {
if ((int )id5 != (int )id6) {
if ((int )id5 != (int )id7) {
if ((int )id5 != (int )id8) {
if ((int )id6 != (int )id7) {
if ((int )id6 != (int )id8) {
if ((int )id7 != (int )id8) {
tmp = 1;
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
return (tmp);
}
}
int check(void)
{
int tmp ;
{
if ((((((((int )st1 + (int )st2) + (int )st3) + (int )st4) + (int )st5) + (int )st6) + (int )st7) + (int )st8 <= 1) {
if ((int )r1 >= 8) {
goto _L;
} else
if ((((((((int )st1 + (int )st2) + (int )st3) + (int )st4) + (int )st5) + (int )st6) + (int )st7) + (int )st8 == 0) {
_L: /* CIL Label */
if ((int )r1 < 8) {
tmp = 1;
} else
if ((((((((int )st1 + (int )st2) + (int )st3) + (int )st4) + (int )st5) + (int )st6) + (int )st7) + (int )st8 == 1) {
tmp = 1;
} else {
tmp = 0;
}
} else {
tmp = 0;
}
} else {
tmp = 0;
}
return (tmp);
}
}
int main(void)
{
int c1 ;
int i2 ;
{
c1 = 0;
r1 = __VERIFIER_nondet_char();
id1 = __VERIFIER_nondet_char();
st1 = __VERIFIER_nondet_char();
send1 = __VERIFIER_nondet_char();
mode1 = __VERIFIER_nondet_bool();
id2 = __VERIFIER_nondet_char();
st2 = __VERIFIER_nondet_char();
send2 = __VERIFIER_nondet_char();
mode2 = __VERIFIER_nondet_bool();
id3 = __VERIFIER_nondet_char();
st3 = __VERIFIER_nondet_char();
send3 = __VERIFIER_nondet_char();
mode3 = __VERIFIER_nondet_bool();
id4 = __VERIFIER_nondet_char();
st4 = __VERIFIER_nondet_char();
send4 = __VERIFIER_nondet_char();
mode4 = __VERIFIER_nondet_bool();
id5 = __VERIFIER_nondet_char();
st5 = __VERIFIER_nondet_char();
send5 = __VERIFIER_nondet_char();
mode5 = __VERIFIER_nondet_bool();
id6 = __VERIFIER_nondet_char();
st6 = __VERIFIER_nondet_char();
send6 = __VERIFIER_nondet_char();
mode6 = __VERIFIER_nondet_bool();
id7 = __VERIFIER_nondet_char();
st7 = __VERIFIER_nondet_char();
send7 = __VERIFIER_nondet_char();
mode7 = __VERIFIER_nondet_bool();
id8 = __VERIFIER_nondet_char();
st8 = __VERIFIER_nondet_char();
send8 = __VERIFIER_nondet_char();
mode8 = __VERIFIER_nondet_bool();
i2 = init();
__VERIFIER_assume(i2);
p1_old = nomsg;
p1_new = nomsg;
p2_old = nomsg;
p2_new = nomsg;
p3_old = nomsg;
p3_new = nomsg;
p4_old = nomsg;
p4_new = nomsg;
p5_old = nomsg;
p5_new = nomsg;
p6_old = nomsg;
p6_new = nomsg;
p7_old = nomsg;
p7_new = nomsg;
p8_old = nomsg;
p8_new = nomsg;
i2 = 0;
while (i2 < 16) {
{
node1();
node2();
node3();
node4();
node5();
node6();
node7();
node8();
p1_old = p1_new;
p1_new = nomsg;
p2_old = p2_new;
p2_new = nomsg;
p3_old = p3_new;
p3_new = nomsg;
p4_old = p4_new;
p4_new = nomsg;
p5_old = p5_new;
p5_new = nomsg;
p6_old = p6_new;
p6_new = nomsg;
p7_old = p7_new;
p7_new = nomsg;
p8_old = p8_new;
p8_new = nomsg;
c1 = check();
assert(c1);
i2 ++;
}
}
}
return 0;
}
void assert(_Bool arg )
{
{
if (! arg) {
{
ERROR: __VERIFIER_error();
}
}
}
}