Source file aorai_utils.ml
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
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
open Cil
open Logic_const
open Logic_utils
open Data_for_aorai
open Cil_types
open Cil_datatype
open Automaton_ast
open Bool3
let func_body_dkey = Aorai_option.register_category "func-body"
let action_dkey = Aorai_option.register_category "action"
let rename_pred v1 v2 p =
let r =
object
inherit Visitor.frama_c_copy (Project.current())
method! vlogic_var_use v =
if Cil_datatype.Logic_var.equal v v1 then Cil.ChangeTo v2
else Cil.JustCopy
end
in
Visitor.visitFramacPredicate r p
(** Given a transition a function name and a function status (call or
return) it returns if the cross condition can be satisfied with
only function status.
*)
let isCrossable tr func st =
let rec isCross p =
match p with
| TOr (c1, c2) -> bool3or (isCross c1) (isCross c2)
| TAnd (c1, c2) -> bool3and (isCross c1) (isCross c2)
| TNot c1 -> bool3not (isCross c1)
| TCall (kf,None) when Kernel_function.equal func kf && st=Call -> True
| TCall (kf, Some _) when Kernel_function.equal func kf && st=Call ->
Undefined
| TCall _ -> False
| TReturn kf when Kernel_function.equal func kf && st=Return -> True
| TReturn _ -> False
| TTrue -> True
| TFalse -> False
| TRel _ -> Undefined
in
let res = isCross tr.cross <> False in
Aorai_option.debug ~level:2 "Function %a %s-state, \
transition %s -> %s is%s possible" Kernel_function.pretty func
(if st=Call then "pre" else "post")
tr.start.Automaton_ast.name
tr.stop.Automaton_ast.name
(if res then "" else " NOT");
res
(** Returns the lval associated to the curState generated variable *)
let state_lval () =
Cil.var (get_varinfo curState)
let find_enum, set_enum =
let module H =
State_builder.Int_hashtbl
(Cil_datatype.Enumitem)
(struct
let name = "ltl_states_enum"
let size = 17
let dependencies =
[ Ast.self; Aorai_option.Ya.self ]
end)
in
(fun n ->
try H.find n
with Not_found ->
Aorai_option.fatal
"Could not find the enum item corresponding to a state"),
(List.iter (fun (n,item) -> H.add n item))
(** Given a transition a function name and a function status (call or return)
it returns if the cross condition can be satisfied with only
function status. *)
let isCrossableAtInit tr func =
let eval_term_at_init t =
if Kernel.LibEntry.get() then t
else begin
let bool_res test =
if test then Cil.lconstant Integer.one else Cil.lzero ()
in
let bool3_res dft test =
match test with
| True -> bool_res true
| False -> bool_res false
| Undefined -> dft
in
let is_true t =
match t with
| TConst(Integer(i,_)) ->
Bool3.bool3_of_bool (not (Integer.is_zero i))
| TConst(LChr c) -> Bool3.bool3_of_bool (not (Char.code c <> 0))
| TConst(LReal r) -> Bool3.bool3_of_bool (not (r.r_nearest <> 0.))
| TConst(LStr _ | LWStr _) -> Bool3.True
| _ -> Bool3.Undefined
in
let rec aux t =
match t.term_node with
| TConst (LEnum ei) ->
aux (Logic_utils.expr_to_term ei.eival)
| TLval lv ->
(match aux_lv lv with
| Some t -> t
| None -> t)
| TUnOp(op,t1) ->
let t1 = aux t1 in
(match op,t1.term_node with
| Neg, TConst(Integer(i,_)) ->
{ t with term_node = TConst(Integer(Integer.neg i,None)) }
| Neg, TConst(LReal r) ->
let f = ~-. (r.r_nearest) in
let r = {
r_literal = string_of_float f ;
r_nearest = f ;
r_upper = ~-. (r.r_lower) ;
r_lower = ~-. (r.r_upper) ;
} in
{ t with term_node = TConst(LReal r) }
| LNot, t1 -> bool3_res t (is_true t1)
| _ -> t)
| TBinOp(op,t1,t2) ->
let t1 = aux t1 in
let t2 = aux t2 in
let rec comparison comp t1 t2 =
match t1.term_node,t2.term_node with
| TConst (Integer(i1,_)), TConst (Integer(i2,_)) ->
bool_res (comp (Integer.compare i1 i2))
| TConst (LChr c1), TConst (LChr c2) ->
bool_res (comp (Char.compare c1 c2))
| TConst(LReal r1), TConst (LReal r2) ->
bool_res (comp (compare r1.r_nearest r2.r_nearest))
| TCast (false, Ctype ty1,t1), TCast (false, Ctype ty2,t2)
when Cil_datatype.Typ.equal ty1 ty2 ->
comparison comp t1 t2
| _ -> t
in
(match op, t1.term_node, t2.term_node with
| PlusA, TConst(Integer(i1,_)), TConst(Integer(i2,_)) ->
{ t with term_node =
TConst(Integer(Integer.add i1 i2,None))}
| MinusA, TConst(Integer(i1,_)), TConst(Integer(i2,_)) ->
{ t with term_node =
TConst(Integer(Integer.sub i1 i2,None)) }
| Mult, TConst(Integer(i1,_)), TConst(Integer(i2,_)) ->
{ t with term_node =
TConst(Integer(Integer.mul i1 i2,None)) }
| Div, TConst(Integer(i1,_)), TConst(Integer(i2,_)) ->
(try
{ t with term_node =
TConst(Integer(Integer.c_div i1 i2,None)) }
with Division_by_zero -> t)
| Mod, TConst(Integer(i1,_)), TConst(Integer(i2,_)) ->
(try
{ t with term_node =
TConst(Integer(Integer.c_rem i1 i2,None)) }
with Division_by_zero -> t)
| Shiftlt, TConst(Integer(i1,_)), TConst(Integer(i2,_)) ->
{ t with term_node =
TConst(Integer(Integer.shift_left i1 i2,None)) }
| Shiftrt, TConst(Integer(i1,_)), TConst(Integer(i2,_)) ->
{ t with term_node =
TConst(Integer(Integer.shift_right i1 i2,None)) }
| Lt, _, _ -> comparison ((<) 0) t1 t2
| Gt, _, _ -> comparison ((>) 0) t1 t2
| Le, _, _ -> comparison ((<=) 0) t1 t2
| Ge, _, _ -> comparison ((>=) 0) t1 t2
| Eq, _, _ -> comparison ((=) 0) t1 t2
| Ne, _, _ -> comparison ((<>) 0) t1 t2
| LAnd, t1, t2 ->
bool3_res t (Bool3.bool3and (is_true t1) (is_true t2))
| LOr, t1, t2 ->
bool3_res t (Bool3.bool3or (is_true t1) (is_true t2))
| _ -> t)
| TCast (false, Ctype ty,t1) ->
let t1 = aux t1 in
(match t1.term_type with
| Ctype ty1 when Cil_datatype.Typ.equal ty ty1 -> t1
| _ -> { t with term_node = TCast (false, Ctype ty,t1) })
| _ -> t
and aux_lv (base,off) =
match base with
| TVar v ->
(try
Option.bind
v.lv_origin
(fun v ->
let init = Globals.Vars.find v in
let init = match init.Cil_types.init with
None -> Cil.makeZeroInit ~loc:v.vdecl v.vtype
| Some i -> i
in
aux_init off init)
with Not_found -> None)
| TMem t ->
(match (aux t).term_node with
| TAddrOf lv -> aux_lv (Logic_const.addTermOffsetLval off lv)
| _ -> None)
| TResult _ -> None
and aux_init off initinfo =
match off, initinfo with
| TNoOffset, SingleInit e ->
Some (aux (Logic_utils.expr_to_term e))
| TIndex(t,oth), CompoundInit (ct,initl) ->
(match (aux t).term_node with
| TConst(Integer(i1,_)) ->
Cil.foldLeftCompound ~implicit:true
~doinit:
(fun o i _ t ->
match o with
| Index({ enode = Const(CInt64(i2,_,_))},_)
when Integer.equal i1 i2 -> aux_init oth i
| _ -> t)
~ct ~initl ~acc:None
| _ -> None)
| TField(f1,oth), CompoundInit(ct,initl) ->
Cil.foldLeftCompound ~implicit:true
~doinit:
(fun o i _ t ->
match o with
| Field(f2,_) when Cil_datatype.Fieldinfo.equal f1 f2 ->
aux_init oth i
| _ -> t)
~ct ~initl ~acc:None
| _ -> None
in
aux t
end
in
let eval_rel_at_init rel t1 t2 =
let t1 = eval_term_at_init (Cil.constFoldTerm t1) in
let t2 = eval_term_at_init (Cil.constFoldTerm t2) in
let comp =
match rel with
| Req -> ((=) 0)
| Rneq -> ((<>) 0)
| Rge -> ((>=) 0)
| Rgt -> ((>) 0)
| Rle -> ((<=) 0)
| Rlt -> ((<) 0)
in
let rec comparison t1 t2 =
match t1.term_node,t2.term_node with
| TConst (Integer(i1,_)), TConst (Integer(i2,_)) ->
Bool3.bool3_of_bool (comp (Integer.compare i1 i2))
| TConst (LChr c1), TConst (LChr c2) ->
Bool3.bool3_of_bool (comp (Char.compare c1 c2))
| TConst(LReal r1), TConst (LReal r2) ->
Bool3.bool3_of_bool (comp (compare r1.r_nearest r2.r_nearest))
| TCast (false, Ctype ty1,t1), TCast (false, Ctype ty2,t2)
when Cil_datatype.Typ.equal ty1 ty2 ->
comparison t1 t2
| _ -> Bool3.Undefined
in
comparison t1 t2
in
let rec isCross = function
| TOr (c1, c2) -> Bool3.bool3or (isCross c1) (isCross c2)
| TAnd (c1, c2) -> Bool3.bool3and (isCross c1) (isCross c2)
| TNot (c1) -> Bool3.bool3not (isCross c1)
| TCall (s,None) -> Bool3.bool3_of_bool (Kernel_function.equal s func)
| TCall (s, Some _) when Kernel_function.equal s func -> Undefined
| TCall _ -> Bool3.False
| TReturn _ -> Bool3.False
| TTrue -> Bool3.True
| TFalse -> Bool3.False
| TRel(rel,t1,t2) -> eval_rel_at_init rel t1 t2
in
if Data_for_aorai.isObservableFunction func then begin
match isCross tr.cross with
| Bool3.True | Bool3.Undefined -> true
| Bool3.False -> false
end else true
(** {b Expressions management} *)
(** Returns an int constant expression which represents the given int value. *)
let mk_int_exp value =
new_exp ~loc:Cil_datatype.Location.unknown
(Const(CInt64(Integer.of_int value,IInt,Some(string_of_int value))))
(** This function rewrites a cross condition into an ACSL expression.
Moreover, by giving current operation name and its status (call or
return) the generation simplifies the generated expression.
*)
let crosscond_to_pred cross curr_f curr_status =
let check_current_event f status pred =
if Kernel_function.equal curr_f f && curr_status = status then pred
else (Bool3.False, pfalse)
in
let rec convert =
function
| TOr (c1, c2) ->
begin
let (c1_val,c1_pred) = convert c1 in
match c1_val with
| Bool3.True -> (c1_val,c1_pred)
| Bool3.False -> convert c2
| Undefined ->
let (c2_val,c2_pred) = convert c2 in
match c2_val with
| Bool3.True -> (c2_val,c2_pred)
| Bool3.False -> (c1_val,c1_pred)
| Undefined -> (Undefined,Logic_const.por(c1_pred, c2_pred))
end
| TAnd (c1, c2) ->
begin
let (c1_val,c1_pred) = convert c1 in
match c1_val with
| Bool3.True -> convert c2
| Bool3.False -> (c1_val,c1_pred)
| Undefined ->
let (c2_val,c2_pred) = convert c2 in
match c2_val with
| Bool3.True -> (c1_val,c1_pred)
| Bool3.False -> (c2_val,c2_pred)
| Undefined -> (Undefined,Logic_const.pand(c1_pred, c2_pred))
end
| TNot (c1) ->
begin
let (c1_val,c1_pred) = convert c1 in
match c1_val with
| Bool3.True -> (Bool3.False,pfalse)
| Bool3.False -> (Bool3.True,ptrue)
| Undefined -> (c1_val,Logic_const.pnot(c1_pred))
end
| TCall (f,b) ->
let pred = match b with
None -> Bool3.True, ptrue
| Some b ->
(Bool3.Undefined,
Logic_const.pands
(List.map Logic_const.pred_of_id_pred b.b_assumes))
in
check_current_event f Automaton_ast.Call pred
| TReturn f ->
check_current_event f Automaton_ast.Return (Bool3.True, ptrue)
| TTrue -> (Bool3.True, ptrue)
| TFalse -> (Bool3.False, pfalse)
| TRel(rel,t1,t2) ->
(Bool3.Undefined, Logic_const.prel (rel,t1,t2))
in
snd (convert cross)
let rec term_to_exp t res =
let loc = t.term_loc in
match t.term_node with
| TConst (Integer (value,repr)) -> Cil.kinteger64 ~loc ?repr value
| TConst (LStr str) -> new_exp ~loc (Const (CStr str))
| TConst (LWStr l) -> new_exp ~loc (Const (CWStr l))
| TConst (LChr c) -> new_exp ~loc (Const (CChr c))
| TConst (LReal l_real) ->
let fk,_ = Floating_point.parse l_real.r_literal in
let cst =
if Cil.isExactFloat fk l_real then
(CReal (l_real.r_nearest, fk, Some l_real.r_literal))
else
(CReal (l_real.r_nearest, FDouble, None))
in
new_exp ~loc (Const cst)
| TConst (LEnum e) -> new_exp ~loc (Const (CEnum e))
| TLval tlval -> new_exp ~loc (Lval (tlval_to_lval tlval res))
| TSizeOf ty -> new_exp ~loc (SizeOf ty)
| TSizeOfE t -> new_exp ~loc (SizeOfE(term_to_exp t res))
| TSizeOfStr s -> new_exp ~loc (SizeOfStr s)
| TAlignOf ty -> new_exp ~loc (AlignOf ty)
| TAlignOfE t -> new_exp ~loc (AlignOfE (term_to_exp t res))
| TUnOp (unop, t) ->
new_exp ~loc (UnOp (unop, term_to_exp t res, Cil.intType))
| TBinOp (binop, t1, t2)->
new_exp ~loc
(BinOp(binop, term_to_exp t1 res, term_to_exp t2 res, Cil.intType))
| TCast (false, Ctype ty, {term_node = TConst(LReal lreal)}) when Cil.isFloatingType ty ->
(match Cil.unrollType ty with
| TFloat(fk,_) ->
new_exp ~loc
(Const (CReal (lreal.r_nearest,fk,Some lreal.r_literal)))
| _ ->
Aorai_option.fatal
"A floating-point type was expected, got %a." Printer.pp_typ ty)
| TCast (false, Ctype ty, t) -> new_exp ~loc (CastE (ty, term_to_exp t res))
| TAddrOf tlval -> new_exp ~loc (AddrOf (tlval_to_lval tlval res))
| TStartOf tlval -> new_exp ~loc (StartOf (tlval_to_lval tlval res))
| TCast (true, _,t) -> term_to_exp t res
| _ ->
Aorai_option.fatal
"Term %a cannot be transformed into exp."
Printer.pp_term t
and tlval_to_lval (tlhost, toffset) res =
let rec t_to_loffset t_offset = match t_offset with
TNoOffset -> NoOffset
| TField (f_i,t_off) -> Field(f_i, t_to_loffset t_off)
| TIndex (t, t_off) -> Index (term_to_exp t res, t_to_loffset t_off)
| TModel _ -> Aorai_option.fatal "TModel cannot be treated as exp."
in
match tlhost with
| TVar l_var ->
let v_info =
begin
match l_var.lv_origin with
| Some vinfo -> vinfo
| None -> Aorai_option.fatal "TVar not coming from a C Variable"
end
in
(Var v_info, t_to_loffset toffset)
|TMem t -> mkMem ~addr:(term_to_exp t res) ~off:(t_to_loffset toffset)
|TResult _ ->
(match res with
| Some res -> Var res, t_to_loffset toffset
| None -> Aorai_option.fatal "Unexpected \\result")
module Kf_bhv_cache =
Datatype.Pair_with_collections(Cil_datatype.Kf)(Datatype.String)
(struct let module_name = "Aorai_utils.Kf_bhv_cache" end)
let bhv_aux_functions_table = Kf_bhv_cache.Hashtbl.create 7
let get_bhv_aux_fct kf bhv =
match
Kf_bhv_cache.Hashtbl.find_opt bhv_aux_functions_table (kf,bhv.b_name)
with
| Some vi -> vi, false
| None ->
let loc = Cil_datatype.Location.unknown in
let ovi = Kernel_function.get_vi kf in
let vi = Cil_const.copy_with_new_vid ovi in
vi.vname <- Data_for_aorai.get_fresh (ovi.vname ^ "_bhv_" ^ bhv.b_name);
vi.vdefined <- false;
vi.vghost <- true;
let (_,args,varargs,_) = Cil.splitFunctionTypeVI ovi in
let typ = TFun(Cil.intType, args, varargs,[]) in
Cil.update_var_type vi typ;
Cil.setFormalsDecl vi typ;
vi.vattr <- [];
let assoc =
List.combine (Kernel_function.get_formals kf) (Cil.getFormalsDecl vi)
in
let vis = object
inherit Visitor.frama_c_copy (Project.current())
method! vlogic_var_use lv =
match lv.lv_origin with
| None -> JustCopy
| Some vi ->
(match
List.find_opt (fun (x,_) -> Cil_datatype.Varinfo.equal vi x) assoc
with
| None -> JustCopy
| Some (_,nvi) -> ChangeTo (Cil.cvar_to_lvar nvi))
end
in
let assumes = Visitor.visitFramacPredicates vis bhv.b_assumes in
let assumes = List.map Logic_const.refresh_predicate assumes in
let assigns = Writes [] in
let ret_typ = Cil.typeAddGhost Cil.intType in
let post_cond =
[Normal,
Logic_const.(
new_predicate
(prel (Req, tlogic_coerce (tresult ret_typ) Linteger,lone())))]
in
let bhv_in =
Cil.mk_behavior ~name:bhv.b_name ~assumes ~assigns ~post_cond ()
in
let name = bhv.b_name ^ "_out" in
let assumes =
[ Logic_const.(
new_predicate (pnot (pands (List.map pred_of_id_pred assumes))))]
in
let assigns = Writes [] in
let post_cond =
[ Normal,
Logic_const.(
new_predicate
(prel
(Req, tlogic_coerce (tresult ret_typ) Linteger, lzero())))]
in
let bhv_out = Cil.mk_behavior ~name ~assumes ~assigns ~post_cond () in
Globals.Functions.replace_by_declaration (Cil.empty_funspec()) vi loc;
let my_kf = Globals.Functions.get vi in
Annotations.add_behaviors
~register_children:true Aorai_option.emitter my_kf [bhv_in; bhv_out];
Annotations.add_assigns
~keep_empty:false Aorai_option.emitter my_kf (Writes []);
Annotations.add_complete Aorai_option.emitter my_kf
[bhv_in.b_name; bhv_out.b_name];
Annotations.add_disjoint Aorai_option.emitter my_kf
[bhv_in.b_name; bhv_out.b_name];
vi, true
(** create a new abstract function call to decide whether we are in the
corresponding behavior or not. *)
let mk_behavior_call generated_kf kf bhv =
let aux,generated = get_bhv_aux_fct kf bhv in
let res =
Cil.makeLocalVar
(Kernel_function.get_definition generated_kf)
~ghost:true ~referenced:true ~insert:false
(get_fresh "bhv_aux") Cil.intType
in
let stmt =
Cil.mkStmtOneInstr
~ghost:true
~valid_sid:true
(Cil_types.Call (
Some (Var res, NoOffset),
Cil.evar aux,
List.map (fun x -> Cil.evar x) (Kernel_function.get_formals kf),
Cil_datatype.Location.unknown))
in
(res, stmt,
if generated then Cil_datatype.Varinfo.Set.singleton aux
else Cil_datatype.Varinfo.Set.empty)
let crosscond_to_exp generated_kf curr_f curr_status loc cond res =
let check_current_event f status =
Kernel_function.equal curr_f f && curr_status = status
in
let rel_convert = function
| Rlt -> Lt
| Rgt -> Gt
| Rle -> Le
| Rge -> Ge
| Req -> Eq
| Rneq -> Ne
in
let rec expnode_convert =
function
| TOr (c1, c2) ->
let stmts1, vars1, defs1, e1 = expnode_convert c1 in
(match Cil.isInteger e1 with
| None ->
let stmts2, vars2, defs2, e2 = expnode_convert c2 in
stmts1 @ stmts2, vars1 @ vars2,
Cil_datatype.Varinfo.Set.union defs1 defs2,
Cil.mkBinOp ~loc LOr e1 e2
| Some i when Integer.is_zero i -> expnode_convert c2
| Some _ -> [], [], Cil_datatype.Varinfo.Set.empty,e1)
| TAnd (c1, c2) ->
let stmts1, vars1, defs1, e1 = expnode_convert c1 in
(match Cil.isInteger e1 with
| None ->
let stmts2, vars2, defs2, e2 = expnode_convert c2 in
stmts1 @ stmts2, vars1 @vars2,
Cil_datatype.Varinfo.Set.union defs1 defs2,
Cil.mkBinOp ~loc LAnd e1 e2
| Some i when Integer.is_zero i ->
[], [], Cil_datatype.Varinfo.Set.empty, e1
| Some _ -> expnode_convert c2)
| TNot (c1) ->
let stmts1, vars1, defs1, e1 = expnode_convert c1 in
(match Cil.isInteger e1 with
| None ->
stmts1, vars1, defs1, Cil.new_exp ~loc (UnOp(LNot, e1,Cil.intType))
| Some i when Integer.is_zero i ->
[], [], Cil_datatype.Varinfo.Set.empty, Cil.one ~loc
| Some _ -> [], [], Cil_datatype.Varinfo.Set.empty, Cil.zero ~loc)
| TCall (f,None) ->
if check_current_event f Automaton_ast.Call then
[], [], Cil_datatype.Varinfo.Set.empty, Cil.one ~loc
else
[], [], Cil_datatype.Varinfo.Set.empty, Cil.zero ~loc
| TCall (f, Some bhv) ->
if check_current_event f Automaton_ast.Call then begin
let res, stmt, new_kf = mk_behavior_call generated_kf f bhv in
[ stmt ], [res], new_kf, Cil.evar res
end else
[], [], Cil_datatype.Varinfo.Set.empty, Cil.zero ~loc
| TReturn f ->
if check_current_event f Automaton_ast.Return then
[], [], Cil_datatype.Varinfo.Set.empty, Cil.one ~loc
else
[], [], Cil_datatype.Varinfo.Set.empty, Cil.zero ~loc
| TTrue -> [], [], Cil_datatype.Varinfo.Set.empty, Cil.one ~loc
| TFalse -> [], [], Cil_datatype.Varinfo.Set.empty, Cil.zero ~loc
| TRel(rel,t1,t2) ->
[], [], Cil_datatype.Varinfo.Set.empty,
Cil.mkBinOp
~loc (rel_convert rel) (term_to_exp t1 res) (term_to_exp t2 res)
in
expnode_convert cond
(** {b Globals management} *)
(** Local copy of the file pointer *)
let file = ref Cil.dummyFile
let initFunction kf =
let fname = Kernel_function.get_name kf in
List.iter
(fun vi -> set_paraminfo fname vi.vname vi)
(Kernel_function.get_formals kf);
match (Kernel_function.find_return kf).skind with
| Cil_types.Return (Some { enode = Lval (Var vi,NoOffset) },_) ->
set_returninfo fname vi
| exception Kernel_function.No_Statement | _ -> ()
(** Copy the file pointer locally in the class in order to ease globals
management and initializes some tables. *)
let initFile f =
file := f;
Data_for_aorai.setCData ();
Globals.Vars.iter (fun vi _ -> set_varinfo vi.vname vi);
Globals.Functions.iter initFunction
(** List of globals awaiting for adding into C file globals *)
let globals_queue = ref []
(** Flush all queued globals declarations into C file globals. *)
let flush_globals () =
let before, after =
List.fold_left
(fun (b,a) elem ->
match elem with
| GFun(f,loc) as func ->
let b =
if f.svar.vaddrof then GFunDecl(Cil.empty_funspec(),f.svar,loc) :: b
else b
in
b, func :: a
| other -> other :: b, a)
([], [])
!file.globals
in
!file.globals <- List.rev before @ List.rev !globals_queue @ List.rev after;
Kernel_function.clear_sid_info ();
globals_queue := []
let add_global glob = globals_queue := glob :: !globals_queue
let add_gvar ?init vi =
let initinfo = {Cil_types.init} in
vi.vstorage <- NoStorage;
add_global (GVar(vi,initinfo,vi.vdecl));
Globals.Vars.add vi initinfo;
set_varinfo vi.vname vi
let add_gvar_zeroinit vi =
add_gvar ~init:(Cil.makeZeroInit ~loc:(Current_loc.get()) vi.vtype) vi
let mk_gvar ?init ~ty name =
let vi =
try
let ty' = typeAddAttributes [Attr ("ghost", [])] ty in
let vi = Globals.Vars.find_from_astinfo name Global in
if not (Cil_datatype.Typ.equal vi.vtype ty') then
Aorai_option.abort "Global %s is declared with type %a instead of %a"
name Cil_printer.pp_typ vi.vtype Cil_printer.pp_typ ty';
Globals.Vars.remove vi;
vi
with Not_found ->
Cil.makeGlobalVar ~ghost:true name ty
in
add_gvar ?init vi
let mk_gvar_scalar ~init ?(ty = Cil.typeOf init) name =
mk_gvar ~init:(SingleInit init) ~ty name
let mk_integer value =
Cil.integer ~loc:(Current_loc.get()) value
let mk_global_c_enum_type_tagged name elements_l =
let einfo =
{ eorig_name = name;
ename = name;
eitems = [];
eattr = [];
ereferenced = true;
ekind = IInt; }
in
let l =
List.map
(fun (e,i) ->
{ eiorig_name = e;
einame = e;
eival = mk_integer i;
eiloc = Location.unknown;
eihost = einfo})
elements_l
in
einfo.eitems <- l;
set_usedinfo name einfo;
add_global (GEnumTag(einfo, Location.unknown));
einfo
let mk_global_c_enum_type name elements =
let _,elements =
List.fold_left (fun (i,l) x -> (i+1,(x,i)::l)) (0,[]) elements
in
ignore (mk_global_c_enum_type_tagged name elements)
let mk_gvar_enum ?init name name_enuminfo =
mk_gvar ?init ~ty:(TEnum(get_usedinfo name_enuminfo,[])) name
(** {b Terms management / computation} *)
(** Return an integer constant term from the given value. *)
let mk_int_term value = Cil.lconstant (Integer.of_int value)
(** Returns a term representing the variable associated to the given varinfo *)
let mk_term_from_vi vi =
Logic_const.term
(TLval((Logic_utils.lval_to_term_lval (Cil.var vi))))
(Ctype Cil.intType)
(** Given an lval term 'host' and an integer value 'off', it returns a lval term host[off]. *)
let mk_offseted_array host off =
Logic_const.term
(TLval(Logic_const.addTermOffsetLval (TIndex(mk_int_term (off),TNoOffset)) host))
(Ctype Cil.intType)
let int2enumstate nums =
let enum = find_enum nums in
Logic_const.term (TConst (LEnum enum)) (Ctype (TEnum (enum.eihost,[])))
let int2enumstate_exp loc nums = new_exp ~loc (Const (CEnum (find_enum nums)))
(** Given an lval term 'host' and an integer value 'off', it returns a lval term host[off]. *)
let mk_offseted_array_states_as_enum host off =
let enum = find_enum off in
Logic_const.term
(TLval
(Logic_const.addTermOffsetLval
(TIndex(Logic_const.term
(TConst(LEnum enum)) (Ctype (TEnum (enum.eihost,[]))),
TNoOffset))
host))
(Ctype Cil.intType)
(** Returns a lval term associated to the curState generated variable. *)
let host_state_term() = lval_to_term_lval (state_lval())
let state_term () =
Logic_const.tvar (Cil.cvar_to_lvar (get_varinfo curState))
let is_state_pred state =
if Aorai_option.Deterministic.get () then
Logic_const.prel (Req,state_term(),int2enumstate state.nums)
else
Logic_const.prel
(Req,Cil.lone (),
Logic_const.tvar (Data_for_aorai.get_state_logic_var state))
let is_state_non_det_stmt (_,copy) loc =
mkStmtOneInstr ~ghost:true (Set (Cil.var copy, Cil.one ~loc, loc))
let is_state_det_stmt state loc =
let var = Data_for_aorai.get_varinfo curState in
mkStmtOneInstr
~ghost:true (Set (Cil.var var, int2enumstate_exp loc state.nums, loc))
let is_state_exp state loc =
if Aorai_option.Deterministic.get ()
then
Cil.mkBinOp
~loc Eq
(int2enumstate_exp loc state.nums)
(Cil.evar ~loc (Data_for_aorai.get_varinfo curState))
else
Cil.mkBinOp
~loc Eq (Cil.evar (Data_for_aorai.get_state_var state)) (Cil.one ~loc)
let is_out_of_state_pred state =
if Aorai_option.Deterministic.get () then
Logic_const.prel (Rneq,state_term(),int2enumstate state.nums)
else
Logic_const.prel
(Req,Cil.lzero (),
Logic_const.tvar (Data_for_aorai.get_state_logic_var state))
let is_out_of_state_stmt (_,copy) loc =
if Aorai_option.Deterministic.get ()
then
Aorai_option.fatal
"Deterministic automaton sync functions can't have out-of-state stmt. \
Maybe this should use `is_out_of_state_exp' instead."
else mkStmtOneInstr ~ghost:true (Set(Cil.var copy , mk_int_exp 0 , loc ))
let is_out_of_state_exp state loc =
if Aorai_option.Deterministic.get ()
then
Cil.mkBinOp
~loc Ne
(int2enumstate_exp loc state.nums)
(evar ~loc (Data_for_aorai.get_varinfo curState))
else
Cil.mkBinOp
~loc Eq
(Cil.evar (Data_for_aorai.get_state_var state))
(mk_int_exp 0)
let assert_alive_automaton kf stmt =
let pred =
if Aorai_option.Deterministic.get() then
let reject_state = Data_for_aorai.get_reject_state() in
is_out_of_state_pred reject_state
else begin
let valid_states =
List.filter
(fun x -> not (Data_for_aorai.is_reject_state x))
(fst (Data_for_aorai.getGraph ()))
in
let valid_preds = List.map is_state_pred valid_states in
Logic_const.pors valid_preds
end
in
let pred = { pred with pred_name = "aorai_smoke_test" :: pred.pred_name } in
Annotations.add_assert Aorai_option.emitter ~kf stmt pred
let txt = add_global (GText (txt))
(** {b Initialization management / computation} *)
let mk_global_states_init root =
let (states,_ as auto) = Data_for_aorai.getGraph () in
let states = List.sort Data_for_aorai.Aorai_state.compare states in
let is_possible_init state =
state.Automaton_ast.init = Bool3.True &&
(let trans = Path_analysis.get_transitions_of_state state auto in
List.exists (fun tr -> isCrossableAtInit tr root) trans)
in
List.iter
(fun state ->
let init =
if is_possible_init state then mk_int_exp 1 else mk_int_exp 0
in
let init = SingleInit init in
let var = Data_for_aorai.get_state_var state in
add_gvar ~init var)
states
class visit_decl_loops_init () =
object(self)
inherit Visitor.frama_c_inplace
method! vstmt_aux stmt =
begin
match stmt.skind with
| Loop _ ->
let scope = Kernel_function.find_enclosing_block stmt in
let f = Option.get self#current_func in
let name = Data_for_aorai.loopInit ^ "_" ^ (string_of_int stmt.sid) in
let typ =
Cil.typeAddAttributes
[Attr (Cil.frama_c_ghost_formal,[])] Cil.intType
in
let var = Cil.makeLocalVar ~ghost:true f ~scope name typ in
Data_for_aorai.set_varinfo name var
| _ -> ()
end;
Cil.DoChildren
end
let mk_decl_loops_init () =
let visitor = new visit_decl_loops_init () in
Cil.visitCilFile (visitor :> Cil.cilVisitor) !file
let change_vars subst subst_res kf label pred =
let add_label t = ChangeDoChildrenPost(t,fun t -> tat(t,label)) in
let visitor =
object
inherit Visitor.frama_c_copy (Project.current())
method! vterm t =
match t.term_node with
TLval (TVar { lv_origin = Some v},_) when v.vglob -> add_label t
| TLval (TMem _,_) -> add_label t
| _ -> DoChildren
method! vterm_lhost = function
| TResult ty ->
(match kf with
None -> Aorai_option.fatal
"found \\result without being at a Return event"
| Some kf ->
(try
ChangeTo (TVar (Kernel_function.Hashtbl.find subst_res kf))
with Not_found ->
let new_lv =
Cil_const.make_logic_var_quant
("__retres_" ^ (Kernel_function.get_name kf)) (Ctype ty)
in
Kernel_function.Hashtbl.add subst_res kf new_lv;
ChangeTo (TVar new_lv)))
| TMem _ | TVar _ -> DoChildren
method! vlogic_var_use lv =
match lv.lv_origin with
| Some v when not v.vglob ->
(try
ChangeTo (Cil_datatype.Logic_var.Hashtbl.find subst lv)
with Not_found ->
let new_lv =
Cil_const.make_logic_var_quant lv.lv_name lv.lv_type
in
Cil_datatype.Logic_var.Hashtbl.add subst lv new_lv;
ChangeTo new_lv)
| Some _ | None -> DoChildren
end
in Visitor.visitFramacPredicateNode visitor pred
let pred_of_condition subst subst_res label cond =
let mk_func_event f =
let op = tat (mk_term_from_vi (get_varinfo curOp),label) in
let f =
term
(TConst (constant_to_lconstant (func_to_cenum f)))
(Ctype (func_enum_type ()))
in
prel (Req,op,f)
in
let mk_func_status f status =
let curr = tat (mk_term_from_vi (get_varinfo curOpStatus),label) in
let call =
term
(TConst (constant_to_lconstant (op_status_to_cenum status)))
(Ctype (status_enum_type()))
in
Logic_const.pand (mk_func_event f, prel(Req,curr,call))
in
let mk_func_start f = mk_func_status f Automaton_ast.Call in
let mk_func_return f = mk_func_status f Automaton_ast.Return in
let rec aux kf is_or = function
| TOr(c1,c2) ->
let kf, c1 = aux kf true c1 in
let kf, c2 = aux kf true c2 in
kf, Logic_const.por (c1, c2)
| TAnd(c1,c2) ->
let kf, c1 = aux kf false c1 in
let kf, c2 = aux kf false c2 in
kf, Logic_const.pand (c1, c2)
| TNot c ->
let kf, c = aux kf (not is_or) c in kf, Logic_const.pnot c
| TCall (s,b) ->
let pred = mk_func_start (Kernel_function.get_name s) in
let pred =
match b with
| None -> pred
| Some b ->
Logic_const.pands
(pred :: (List.map Logic_const.pred_of_id_pred b.b_assumes))
in
kf, pred
| TReturn s ->
let kf = if is_or then kf else Some s in
kf, mk_func_return (Kernel_function.get_name s)
| TTrue -> kf, ptrue
| TFalse -> kf, pfalse
| TRel(rel,t1,t2) ->
kf,
unamed (change_vars subst subst_res kf label (prel (rel,t1,t2)).pred_content)
in
snd (aux None true cond)
let mk_deterministic_lemma () =
let automaton = Data_for_aorai.getGraph () in
let make_one_lemma state =
let label = Cil_types.FormalLabel "L" in
let disjoint_guards acc trans1 trans2 =
if trans1.numt <= trans2.numt then acc
else
let subst = Cil_datatype.Logic_var.Hashtbl.create 5 in
let subst_res = Kernel_function.Hashtbl.create 5 in
let guard1 =
pred_of_condition subst subst_res label trans1.cross
in
let guard2 =
pred_of_condition subst subst_res label trans2.cross
in
let pred = Logic_const.pnot (Logic_const.pand (guard1, guard2)) in
let quants =
Cil_datatype.Logic_var.Hashtbl.fold
(fun _ lv acc -> lv :: acc) subst []
in
let quants = Kernel_function.Hashtbl.fold
(fun _ lv acc -> lv :: acc) subst_res quants
in
let quants =
List.sort (fun v1 v2 -> String.compare v1.lv_name v2.lv_name) quants
in
Logic_const.pand (acc, (pforall (quants, pred)))
in
let trans = Path_analysis.get_transitions_of_state state automaton in
let prop = Extlib.product_fold disjoint_guards ptrue trans trans in
let prop = Logic_const.toplevel_predicate ~kind:Check prop in
let name = state.Automaton_ast.name ^ "_deterministic_trans" in
let lemma =
Dlemma (name, [label],[],prop,[],Cil_datatype.Location.unknown)
in
Annotations.add_global Aorai_option.emitter lemma
in
List.iter make_one_lemma (fst automaton)
let make_enum_states () =
let state_list =fst (Data_for_aorai.getGraph()) in
let state_list =
List.map (fun x -> (x.Automaton_ast.name, x.Automaton_ast.nums)) state_list
in
let enum = mk_global_c_enum_type_tagged states state_list in
let mapping =
List.map
(fun (name,id) ->
let item =
List.find (fun y -> y.einame = name) enum.eitems
in
(id, item))
state_list
in
set_enum mapping;
enum
let getInitialState () =
let loc = Cil_datatype.Location.unknown in
let states = fst (Data_for_aorai.getGraph()) in
let s = List.find (fun x -> x.Automaton_ast.init = Bool3.True) states in
Cil.new_exp ~loc (Const (CEnum (find_enum s.nums)))
(** This function computes all newly introduced globals (variables, enumeration structure, invariants, etc. *)
let initGlobals root complete =
mk_global_comment "//****************";
mk_global_comment "//* BEGIN Primitives generated for Aorai verification";
mk_global_comment "//* ";
mk_global_comment "//* ";
mk_global_comment "//* Some constants";
let states_typ =
if Aorai_option.Deterministic.get ()
then Some (TEnum (make_enum_states (), []))
else None
in
mk_global_c_enum_type
listOp
(List.map
(fun kf -> func_to_op_func (Kernel_function.get_name kf))
(getObservablesFunctions() @ getIgnoredFunctions()));
mk_gvar_enum curOp listOp;
mk_global_c_enum_type listStatus (callStatus::[termStatus]);
mk_gvar_enum curOpStatus listStatus;
mk_global_comment "//* ";
mk_global_comment "//* States and Trans Variables";
if Aorai_option.Deterministic.get () then begin
mk_gvar_scalar ?ty:states_typ ~init:(getInitialState()) curState;
let init = getInitialState()
and history = Data_for_aorai.whole_history () in
List.iter (fun name -> mk_gvar_scalar ~init name) history
end else
mk_global_states_init root;
if complete then begin
mk_global_comment "//* ";
mk_global_comment "//* Loops management";
mk_decl_loops_init ();
end;
mk_global_comment "//* ";
mk_global_comment "//****************** ";
mk_global_comment "//* Auxiliary variables used in transition conditions";
mk_global_comment "//*";
List.iter add_gvar_zeroinit (Data_for_aorai.aux_variables());
let auto = Data_for_aorai.getAutomata () in
mk_global_comment "//* ";
mk_global_comment "//****************** ";
mk_global_comment "//* Metavariables";
mk_global_comment "//*";
Datatype.String.Map.iter (fun _ -> add_gvar_zeroinit) auto.metavariables;
if Aorai_option.Deterministic.get () &&
Aorai_option.GenerateDeterministicLemmas.get () then begin
flush_globals ();
mk_deterministic_lemma ();
end;
(match Data_for_aorai.abstract_logic_info () with
| [] -> ()
| l ->
let annot =
Daxiomatic
("Aorai_pebble_axiomatic",
List.map
(fun li -> Dfun_or_pred(li,Cil_datatype.Location.unknown)) l,
[],
Cil_datatype.Location.unknown)
in
Annotations.add_global Aorai_option.emitter annot);
mk_global_comment "//* ";
mk_global_comment "//* END Primitives generated for Aorai verification";
mk_global_comment "//****************";
flush_globals ()
(** {b Pre/post management} *)
let automaton_locations loc =
let auto_state =
if Aorai_option.Deterministic.get () then
[ Logic_const.new_identified_term (state_term()), FromAny ]
else
List.map
(fun state ->
Logic_const.new_identified_term
(Logic_const.tvar
(Data_for_aorai.get_state_logic_var state)), FromAny)
(fst (Data_for_aorai.getGraph()))
in
(Logic_const.new_identified_term
(Logic_const.tvar ~loc
(Data_for_aorai.get_logic_var Data_for_aorai.curOpStatus)),
FromAny) ::
(Logic_const.new_identified_term
(Logic_const.tvar ~loc
(Data_for_aorai.get_logic_var Data_for_aorai.curOp)),
FromAny) ::
auto_state
let acc term =
let acc = ref acc in
let vis =
object
inherit Visitor.frama_c_inplace
method! vterm_lval lv =
acc := Cil_datatype.Term_lval.Set.add lv !acc;
DoChildren
end
in
ignore (Visitor.visitFramacTerm vis term);
!acc
let add_lval cond kf st acc =
let rec aux cond acc =
match cond with
| TOr (c1,c2) ->
(match aux c1 acc with
| TTrue, _ -> TTrue, acc
| TFalse, _ -> aux c2 acc
| _, acc -> aux c2 acc)
| TAnd (c1,c2) ->
(match aux c1 acc with
| TTrue, _ -> aux c2 acc
| TFalse, _ -> TFalse, acc
| _, acc -> aux c2 acc)
| TNot c ->
(match aux c acc with
| TTrue, _ -> TFalse, acc
| TFalse, _ -> TTrue, acc
| res -> res)
| TCall (kf', _) ->
if Kernel_function.equal kf' kf && st = Automaton_ast.Call then begin
TTrue, acc
end else begin
TFalse, acc
end
| TReturn kf' ->
if Kernel_function.equal kf' kf && st = Automaton_ast.Return then
TTrue, acc
else
TFalse, acc
| TTrue -> TTrue, acc
| TFalse -> TFalse, acc
| TRel(_,t1,t2) -> cond, extract_lval (extract_lval acc t1) t2
in
snd (aux cond.cross acc)
let automaton_assigns kf st loc =
let assigns = automaton_locations loc in
let from_automaton, _ = List.split assigns in
let vars =
List.fold_left
(fun acc tr ->
add_lval tr kf st acc)
Cil_datatype.Term_lval.Set.empty
(Data_for_aorai.getAutomata()).trans
in
let from_vars =
Cil_datatype.Term_lval.Set.fold
(fun x acc ->
Logic_const.new_identified_term
(Logic_const.term ~loc (TLval x) (Cil.typeOfTermLval x))
::acc)
vars []
in
let refresh () =
List.map Logic_const.refresh_identified_term (from_automaton @ from_vars)
in
Writes (List.map (fun (x,_) -> (x, From (refresh()))) assigns)
let aorai_assigns state loc =
let merged_states =
Aorai_state.Map.fold
(fun _ state acc -> Data_for_aorai.merge_end_state state acc)
state Aorai_state.Map.empty
in
let bindings =
Aorai_state.Map.fold
(fun _ (_,_,b) acc -> Data_for_aorai.merge_bindings b acc)
merged_states Cil_datatype.Term.Map.empty
in
let elements =
Cil_datatype.Term.Map.fold
(fun t _ acc -> (Logic_const.new_identified_term t,FromAny)::acc)
bindings []
in
Writes (automaton_locations loc @ elements)
let action_assigns trans =
let add_if_needed v lv (known_vars, assigns as acc) =
if Cil_datatype.Varinfo.Set.mem v known_vars then acc
else
Cil_datatype.Varinfo.Set.add v known_vars,
(Logic_const.new_identified_term lv, FromAny)::assigns
in
let treat_one_action acc =
function
| Counter_init (host,off) | Counter_incr (host,off)
| Copy_value ((host,off),_) ->
let my_var =
match host with
| TVar ({ lv_origin = Some v}) -> v
| _ -> Aorai_option.fatal "Auxiliary variable is not a C global"
in
let my_off =
match off with
| TNoOffset -> TNoOffset
| TIndex _ -> TIndex(Logic_const.trange (None,None), TNoOffset)
| TField _ | TModel _ ->
Aorai_option.fatal "Unexpected offset in auxiliary variable"
in
add_if_needed my_var
(Logic_const.term (TLval(host,my_off))
(Cil.typeOfTermLval (host,my_off)))
acc
| Pebble_init(_,v,c) ->
let cc = Option.get c.lv_origin in
let cv = Option.get v.lv_origin in
add_if_needed cv (Logic_const.tvar v)
(add_if_needed cc (Logic_const.tvar c) acc)
| Pebble_move(_,v1,_,v2) ->
let cv1 = Option.get v1.lv_origin in
let cv2 = Option.get v2.lv_origin in
add_if_needed cv1 (Logic_const.tvar v1)
(add_if_needed cv2 (Logic_const.tvar v2) acc)
in
let empty = (Cil_datatype.Varinfo.Set.empty,[]) in
let empty_pebble =
match trans.start.multi_state, trans.stop.multi_state with
| Some(_,aux), None ->
let caux = Option.get aux.lv_origin in
add_if_needed caux (Logic_const.tvar aux) empty
| _ -> empty
in
let _,res = List.fold_left treat_one_action empty_pebble trans.actions in
Writes res
let get_reachable_trans state st auto current_state =
match st with
| Automaton_ast.Call ->
(try
let reach = Data_for_aorai.Aorai_state.Map.find state current_state in
let treat_one_state end_state _ l =
Path_analysis.get_edges state end_state auto @ l
in
Data_for_aorai.Aorai_state.Map.fold treat_one_state reach []
with Not_found -> [])
| Automaton_ast.Return ->
let treat_one_state end_state (_,last,_) l =
if Data_for_aorai.Aorai_state.Set.mem state last then
Path_analysis.get_edges state end_state auto @ l
else l
in
let treat_one_start _ map l =
Data_for_aorai.Aorai_state.Map.fold treat_one_state map l
in
Data_for_aorai.Aorai_state.Map.fold treat_one_start current_state []
let get_reachable_trans_to state st auto current_state =
match st with
| Automaton_ast.Call ->
let treat_one_start start map acc =
if Data_for_aorai.Aorai_state.Map.mem state map then
Path_analysis.get_edges start state auto @ acc
else acc
in
Data_for_aorai.Aorai_state.Map.fold treat_one_start current_state []
| Automaton_ast.Return ->
let treat_one_state _ map acc =
try
let (_,last,_) = Data_for_aorai.Aorai_state.Map.find state map in
Data_for_aorai.Aorai_state.Set.fold
(fun start acc -> Path_analysis.get_edges start state auto @ acc)
last acc
with Not_found -> acc
in Data_for_aorai.Aorai_state.Map.fold treat_one_state current_state []
let force_transition loc f st current_state =
let (states, _ as auto) = Data_for_aorai.getGraph () in
let aux (impossible_states,possible_states,has_crossable_trans) state =
let reachable_trans = get_reachable_trans state st auto current_state in
let add_one_trans (has_crossable_trans, crossable_non_reject) trans =
let has_crossable_trans =
Logic_simplification.tor has_crossable_trans trans.cross
in
let crossable_non_reject =
crossable_non_reject ||
(isCrossable trans f st
&& not (Data_for_aorai.is_reject_state trans.stop))
in has_crossable_trans, crossable_non_reject
in
let cond, crossable_non_reject =
List.fold_left add_one_trans (Automaton_ast.TFalse, false) reachable_trans
in
let cond = fst (Logic_simplification.simplifyCond cond) in
let cond = crosscond_to_pred cond f st in
let start = is_state_pred state in
if Logic_utils.is_trivially_false cond then begin
let not_start = is_out_of_state_pred state in
Logic_const.pand ~loc (impossible_states,not_start),
possible_states,
has_crossable_trans
end else begin
let has_crossable_trans =
if Logic_utils.is_trivially_true cond then has_crossable_trans
else
Logic_const.new_predicate
(pimplies ~loc (start,cond)) :: has_crossable_trans
in
let possible_states =
match st with
| Automaton_ast.Return ->
if Data_for_aorai.is_reject_state state then possible_states
else Logic_const.por ~loc (possible_states,start)
| Automaton_ast.Call ->
if crossable_non_reject then
Logic_const.por ~loc (possible_states, start)
else possible_states
in
impossible_states, possible_states, has_crossable_trans
end
in
let impossible_states, possible_states, crossable_trans =
List.fold_left aux (ptrue, pfalse,[]) states
in
let states =
if Aorai_option.Deterministic.get() then
possible_states
else
Logic_const.pand ~loc (possible_states, impossible_states)
in
Logic_const.new_predicate states :: (List.rev crossable_trans)
let partition_action trans =
let add_state t st map =
let old =
try Cil_datatype.Term_lval.Map.find t map
with Not_found -> Data_for_aorai.Aorai_state.Set.empty
in
let new_set = Data_for_aorai.Aorai_state.Set.add st old in
Cil_datatype.Term_lval.Map.add t new_set map
in
let treat_one_action st acc =
function
| Counter_init t | Counter_incr t | Copy_value (t,_) -> add_state t st acc
| Pebble_init _ | Pebble_move _ -> acc
in
let treat_one_trans acc tr =
List.fold_left (treat_one_action tr.start) acc tr.actions
in
List.fold_left treat_one_trans Cil_datatype.Term_lval.Map.empty trans
let disjoint_states loc _ states precond =
let states = Data_for_aorai.Aorai_state.Set.elements states in
let rec product acc l =
match l with
| [] -> acc
| hd::tl ->
let pairs = List.map (fun x -> (hd,x)) tl in
product (pairs @ acc) tl
in
let disjoint = product [] states in
List.fold_left
(fun acc (st1, st2) ->
Logic_const.new_predicate
(Logic_const.por ~loc
(is_out_of_state_pred st1,is_out_of_state_pred st2)) :: acc)
precond
disjoint
let incompatible_states loc st current_state =
let (states,_ as auto) = Data_for_aorai.getGraph () in
let aux precond state =
let trans = get_reachable_trans_to state st auto current_state in
let actions = partition_action trans in
Cil_datatype.Term_lval.Map.fold (disjoint_states loc) actions precond
in
List.fold_left aux [] states
let auto_func_preconditions loc f st current_state =
force_transition loc f st current_state @
incompatible_states loc st current_state
let find_pebble_origin lab actions =
let rec aux = function
| [] -> Aorai_option.fatal "Transition to multi-state has no pebble action"
| Pebble_init (_,_,count) :: _ ->
Logic_const.term
(TLval (TVar count, TNoOffset))
(Logic_const.make_set_type count.lv_type)
| Pebble_move (_,_,set,_) :: _-> Data_for_aorai.pebble_set_at set lab
| _ :: tl -> aux tl
in aux actions
let mk_sub ~loc pebble_set v =
let sub = List.hd (Logic_env.find_all_logic_functions "\\subset") in
Logic_const.papp ~loc
(sub,[],
[Logic_const.term ~loc (TLval (TVar v,TNoOffset)) pebble_set.term_type;
pebble_set])
let pebble_guard ~loc pebble_set aux_var guard =
let v = Cil_const.make_logic_var_quant aux_var.lv_name aux_var.lv_type in
let g = rename_pred aux_var v guard in
let g = Logic_const.pand ~loc (mk_sub ~loc pebble_set v, g) in
Logic_const.pexists ~loc ([v], g)
let pebble_guard_neg ~loc pebble_set aux_var guard =
let v = Cil_const.make_logic_var_quant aux_var.lv_name aux_var.lv_type in
let g = rename_pred aux_var v guard in
let g =
Logic_const.pimplies ~loc
(mk_sub ~loc pebble_set v, Logic_const.pnot ~loc g)
in
Logic_const.pforall ~loc ([v], g)
let pebble_post ~loc pebble_set aux_var guard =
let v = Cil_const.make_logic_var_quant aux_var.lv_name aux_var.lv_type in
let g = rename_pred aux_var v guard in
let g = Logic_const.pimplies ~loc (mk_sub ~loc pebble_set v, g) in
Logic_const.pforall ~loc ([v], g)
let add_behavior_pebble_actions ~loc f st behaviors state trans =
match state.multi_state with
| None -> behaviors
| Some (set,aux) ->
let name = Printf.sprintf "pebble_%s" state.name in
let assumes =
List.fold_left
(fun acc b ->
let assumes = List.map pred_of_id_pred b.b_assumes in
Logic_const.por ~loc (acc, Logic_const.pands assumes))
pfalse behaviors
in
let assumes = [ Logic_const.new_predicate assumes ] in
let set = Data_for_aorai.pebble_set_at set Logic_const.here_label in
let treat_action guard res action =
match action with
| Copy_value _ | Counter_incr _ | Counter_init _ ->
res
| Pebble_init (_,_,v) ->
let a = Cil_const.make_logic_var_quant aux.lv_name aux.lv_type in
let guard = rename_pred aux a guard in
let guard =
Logic_const.pand ~loc
(Logic_const.prel
~loc (Req,Logic_const.tvar a,Logic_const.tvar v),
guard)
in
Logic_const.term ~loc
(Tcomprehension (Logic_const.tvar a,[a], Some guard))
set.term_type
:: res
| Pebble_move(_,_,s1,_) ->
let a = Cil_const.make_logic_var_quant aux.lv_name aux.lv_type in
let guard = rename_pred aux a guard in
let in_s =
mk_sub ~loc
(Data_for_aorai.pebble_set_at s1 Logic_const.pre_label) a
in
let guard = Logic_const.pand ~loc (in_s,guard) in
Logic_const.term ~loc
(Tcomprehension (Logic_const.tvar a,[a], Some guard))
set.term_type
:: res
in
let treat_one_trans acc tr =
let guard = crosscond_to_pred tr.cross f st in
let guard = Logic_const.pold guard in
List.fold_left (treat_action guard) acc tr.actions
in
let res = List.fold_left treat_one_trans [] trans in
let res = Logic_const.term (Tunion res) set.term_type in
let post_cond =
[ Normal, Logic_const.new_predicate (Logic_const.prel (Req,set,res))]
in
Cil.mk_behavior ~name ~assumes ~post_cond () :: behaviors
let make_old loc init t =
let vis =
object(self)
inherit Visitor.frama_c_inplace
val is_old = Stack.create ()
method private is_old =
if Stack.is_empty is_old then false else Stack.top is_old
method! vterm t =
match t.term_node with
| TLval lv ->
if Cil_datatype.Term_lval.Set.mem lv init then begin
if self#is_old then begin
Stack.push false is_old;
DoChildrenPost
(fun t ->
ignore (Stack.pop is_old);
Logic_const.(tat ~loc (t,here_label)))
end else DoChildren
end
else begin
if not self#is_old then begin
Stack.push true is_old;
DoChildrenPost
(fun t ->
ignore (Stack.pop is_old);
Logic_const.told ~loc t)
end else DoChildren
end
| _ -> DoChildren
end
in Visitor.visitFramacTerm vis t
let mk_action ~loc init a =
let term_lval lv =
Logic_const.term ~loc (TLval lv) (Cil.typeOfTermLval lv)
in
let add_lv lv = Cil_datatype.Term_lval.Set.add lv init in
match a with
| Counter_init lv ->
[Logic_const.prel ~loc
(Req, term_lval lv, Logic_const.tinteger ~loc 1)],
add_lv lv
| Counter_incr lv ->
[Logic_const.prel ~loc
(Req, term_lval lv,
Logic_const.term ~loc
(TBinOp (PlusA,
Logic_const.told ~loc (term_lval lv),
Logic_const.tinteger ~loc 1))
(Cil.typeOfTermLval lv))],
add_lv lv
| Pebble_init _ | Pebble_move _ -> [],init
| Copy_value (lv,t) ->
[Logic_const.prel ~loc
(Req, term_lval lv, make_old loc init t)],
add_lv lv
let is_reachable state status =
let treat_one_state _ map = Data_for_aorai.Aorai_state.Map.mem state map in
Data_for_aorai.Aorai_state.Map.exists treat_one_state status
let concat_assigns a1 a2 =
match a1,a2 with
| WritesAny, _ -> a2
| _, WritesAny -> a1
| Writes l1, Writes l2 ->
Writes
(List.fold_left
(fun acc (loc,_ as elt) ->
if List.exists
(fun (x,_) ->
Cil_datatype.Term.equal x.it_content loc.it_content)
l2
then
acc
else
elt :: acc)
l2 l1)
let get_accessible_transitions auto state status =
let treat_one_state curr_state (_,last,_) acc =
if Data_for_aorai.Aorai_state.equal curr_state state then
Data_for_aorai.Aorai_state.Set.union last acc
else acc
in
let treat_start_state _ map acc =
Data_for_aorai.Aorai_state.Map.fold treat_one_state map acc
in
let previous_set =
Data_for_aorai.Aorai_state.Map.fold
treat_start_state status Data_for_aorai.Aorai_state.Set.empty
in
Data_for_aorai.Aorai_state.Set.fold
(fun s acc -> Path_analysis.get_edges s state auto @ acc) previous_set []
let get_aux_var_bhv_name = function
| TVar v, _ ->
Data_for_aorai.get_fresh (v.lv_name ^ "_unchanged")
| lv ->
Aorai_option.fatal "unexpected lval for action variable: %a"
Printer.pp_term_lval lv
let mk_unchanged_aux_vars_bhvs loc f st status =
let (states,_ as auto) = Data_for_aorai.getGraph() in
let add_state_trans acc state =
let trans = get_reachable_trans state st auto status in
List.rev_append trans acc
in
let crossable_trans =
List.fold_left add_state_trans [] states
in
let add_trans_aux_var trans map = function
| Counter_init lv | Counter_incr lv | Copy_value (lv,_) ->
let other_trans =
match Cil_datatype.Term_lval.Map.find_opt lv map with
| Some l -> l
| None -> []
in
Cil_datatype.Term_lval.Map.add lv (trans :: other_trans) map
| Pebble_init _ | Pebble_move _ -> map
in
let add_trans_aux_vars map trans =
List.fold_left (add_trans_aux_var trans) map trans.actions
in
let possible_actions =
List.fold_left add_trans_aux_vars
Cil_datatype.Term_lval.Map.empty
crossable_trans
in
let out_trans trans =
Logic_const.new_predicate
(Logic_const.por ~loc
(is_out_of_state_pred trans.start,
Logic_const.pnot (crosscond_to_pred trans.cross f st)))
in
let mk_behavior lv trans acc =
let name = get_aux_var_bhv_name lv in
let assumes = List.map out_trans trans in
let t = Data_for_aorai.tlval lv in
let ot = Logic_const.told t in
let p = Logic_const.prel (Req,t,ot) in
let post_cond = [Normal, Logic_const.new_predicate p] in
Cil.mk_behavior ~name ~assumes ~post_cond () :: acc
in
Cil_datatype.Term_lval.Map.fold mk_behavior possible_actions []
let mk_behavior ~loc auto kf e status state =
Aorai_option.debug "analysis of state %s (%d)"
state.Automaton_ast.name state.nums;
if is_reachable state status then begin
Aorai_option.debug "state %s is reachable" state.Automaton_ast.name;
let my_trans = get_accessible_transitions auto state status in
let rec treat_trans
((in_assumes, out_assumes, assigns, action_bhvs) as acc) l =
match l with
| [] -> acc
| trans :: tl ->
let consider, others =
List.partition (fun x -> x.start.nums = trans.start.nums) tl
in
let start = is_state_pred trans.start in
let not_start = is_out_of_state_pred trans.start in
let in_guard, out_guard, assigns, my_action_bhvs =
List.fold_left
(fun (in_guard, out_guard, all_assigns, action_bhvs) trans ->
Aorai_option.debug "examining transition %d" trans.numt;
Aorai_option.debug "transition %d is active" trans.numt;
let guard = crosscond_to_pred trans.cross kf e in
let my_in_guard,my_out_guard =
match state.multi_state with
| None -> guard, Logic_const.pnot ~loc guard
| Some (_,aux) ->
let set =
find_pebble_origin Logic_const.here_label trans.actions
in
pebble_guard ~loc set aux guard,
pebble_guard_neg ~loc set aux guard
in
let out_guard =
Logic_const.pand ~loc (out_guard, my_out_guard)
in
let in_guard, all_assigns, action_bhvs =
match trans.actions with
| [] ->
(Logic_const.por ~loc (in_guard,my_in_guard),
all_assigns,
action_bhvs)
| _ ->
let name =
Printf.sprintf "buch_state_%s_in_%d"
state.name (List.length action_bhvs)
in
Aorai_option.debug "Name is %s" name;
let assumes = [
Logic_const.new_predicate
(Logic_const.pand ~loc (start,my_in_guard))
]
in
let post_cond =
Normal,
Logic_const.new_predicate (is_state_pred state)
in
let treat_one_action (other_posts, init) a =
let posts, init = mk_action ~loc init a in
match state.multi_state with
| None ->
other_posts @
List.map
(fun x ->
(Normal, Logic_const.new_predicate x))
posts,
init
| Some (_,aux) ->
let set =
find_pebble_origin
Logic_const.pre_label trans.actions
in
other_posts @
List.map
(fun x ->
(Normal,
Logic_const.new_predicate
(pebble_post ~loc set aux x)))
posts,
init
in
let post_cond,_ =
List.fold_left treat_one_action
([post_cond], Cil_datatype.Term_lval.Set.empty)
trans.actions
in
let assigns = action_assigns trans in
let all_assigns = concat_assigns assigns all_assigns in
let bhv =
Cil.mk_behavior ~name ~assumes ~post_cond ()
in
in_guard, all_assigns, bhv :: action_bhvs
in
in_guard, out_guard, all_assigns, action_bhvs)
(pfalse,ptrue,assigns, action_bhvs) (trans::consider)
in
treat_trans
(Logic_const.por ~loc
(in_assumes, (Logic_const.pand ~loc (start, in_guard))),
Logic_const.pand ~loc
(out_assumes,
(Logic_const.por ~loc (not_start, out_guard))),
assigns,
my_action_bhvs
)
others
in
let my_trans = List.filter (fun x -> isCrossable x kf e) my_trans in
let in_assumes, out_assumes, assigns, action_behaviors =
treat_trans (pfalse, ptrue, WritesAny, []) my_trans
in
let behaviors =
if Logic_utils.is_trivially_false in_assumes then action_behaviors
else begin
let behavior_in =
Cil.mk_behavior
~name:(Printf.sprintf "buch_state_%s_in" state.Automaton_ast.name)
~assumes:[Logic_const.new_predicate in_assumes]
~post_cond:
[Normal, Logic_const.new_predicate (is_state_pred state)]
()
in behavior_in :: action_behaviors
end
in
let behaviors =
add_behavior_pebble_actions ~loc kf e behaviors state my_trans
in
let behaviors =
if Logic_utils.is_trivially_false out_assumes then behaviors
else begin
let post_cond =
match state.multi_state with
| None -> []
| Some (set,_) ->
let set =
Data_for_aorai.pebble_set_at set Logic_const.here_label
in
[Normal,
Logic_const.new_predicate
(Logic_const.prel ~loc
(Req,set,
Logic_const.term ~loc Tempty_set set.term_type))]
in
let post_cond =
(Normal, (Logic_const.new_predicate (is_out_of_state_pred state)))
:: post_cond
in
let behavior_out =
Cil.mk_behavior
~name:(Printf.sprintf "buch_state_%s_out" state.Automaton_ast.name)
~assumes:[Logic_const.new_predicate out_assumes]
~post_cond ()
in behavior_out :: behaviors
end
in
assigns, behaviors
end else begin
Aorai_option.debug "state %s is not reachable" state.Automaton_ast.name;
let name = Printf.sprintf "buch_state_%s_out" state.Automaton_ast.name in
let post_cond =
match state.multi_state with
| None -> []
| Some (set,_) ->
let set =
Data_for_aorai.pebble_set_at set Logic_const.here_label
in [Normal,
Logic_const.new_predicate
(Logic_const.prel ~loc
(Req,set,
Logic_const.term ~loc Tempty_set set.term_type))]
in
let post_cond =
(Normal, Logic_const.new_predicate (is_out_of_state_pred state))
::post_cond
in
WritesAny,[mk_behavior ~name ~post_cond ()]
end
let auto_func_behaviors loc f st state =
let call_or_ret =
match st with
| Automaton_ast.Call -> "call"
| Automaton_ast.Return -> "return"
in
Aorai_option.debug
"func behavior for %a (%s)" Kernel_function.pretty f call_or_ret;
let (states, _) as auto = Data_for_aorai.getGraph() in
let requires = auto_func_preconditions loc f st state in
let post_cond =
let called_pre =
Logic_const.new_predicate
(Logic_const.prel ~loc
(Req,
Logic_const.tvar ~loc
(Data_for_aorai.get_logic_var Data_for_aorai.curOpStatus),
(Logic_const.term
(TConst (constant_to_lconstant
(Data_for_aorai.op_status_to_cenum st)))
(Ctype Cil.intType))))
in
let called_pre_2 =
Logic_const.new_predicate
(Logic_const.prel ~loc
(Req,
Logic_const.tvar ~loc
(Data_for_aorai.get_logic_var Data_for_aorai.curOp),
(Logic_const.term
(TConst((constant_to_lconstant
(Data_for_aorai.func_to_cenum
(Kernel_function.get_name f)))))
(Ctype Cil.intType))))
in
[(Normal, called_pre); (Normal, called_pre_2)]
in
let mk_behavior (assigns, behaviors) status =
let new_assigns, new_behaviors =
mk_behavior ~loc auto f st state status
in
concat_assigns new_assigns assigns, new_behaviors @ behaviors
in
let assigns = automaton_assigns f st loc in
let assigns, behaviors = (List.fold_left mk_behavior (assigns,[]) states) in
let global_behavior =
Cil.mk_behavior ~requires ~post_cond ~assigns ()
in
let non_action_behaviors =
mk_unchanged_aux_vars_bhvs loc f st state
in
global_behavior :: (List.rev_append behaviors non_action_behaviors)
let mk_acceptance_pred () =
let (st,_) = Data_for_aorai.getGraph () in
List.fold_left
(fun acc s ->
match s.acceptation with
Bool3.True -> Logic_const.por (acc, is_state_pred s)
| Bool3.False | Bool3.Undefined -> acc)
Logic_const.pfalse st
let mk_acceptance_bhv () =
let accept = Logic_const.new_predicate (mk_acceptance_pred()) in
let post_cond = [Normal, accept] in
let name = "aorai_acceptance" in
Cil.mk_behavior ~name ~post_cond ()
let act_convert loc act res =
let treat_one_act =
function
| Counter_init t_lval ->
Cil.mkStmtOneInstr
~ghost:true (Set (tlval_to_lval t_lval res, Cil.one ~loc, loc))
| Counter_incr t_lval ->
let my_lval = tlval_to_lval t_lval res in
Cil.mkStmtOneInstr ~ghost:true
(Set
(my_lval,
(Cil.mkBinOp
~loc
PlusA
(Cil.new_exp ~loc (Lval my_lval))
(Cil.one ~loc)),
loc))
| Copy_value (t_lval, t) ->
Cil.mkStmtOneInstr ~ghost:true
(Set (tlval_to_lval t_lval res, term_to_exp t res, loc))
| _ ->
Aorai_option.fatal "Peebles not treated yet."
in
List.map treat_one_act act
let mk_transitions_stmt generated_kf loc f st res trans =
List.fold_right
(fun trans
(aux_stmts, aux_vars, new_funcs, exp_from_trans, stmt_from_action) ->
let (tr_stmts, tr_vars, tr_funcs, exp) =
crosscond_to_exp generated_kf f st loc trans.cross res
in
let cond = Cil.mkBinOp ~loc LAnd (is_state_exp trans.start loc) exp in
(tr_stmts @ aux_stmts,
tr_vars @ aux_vars,
Cil_datatype.Varinfo.Set.union tr_funcs new_funcs,
Cil.mkBinOp ~loc LOr exp_from_trans cond,
(Cil.copy_exp cond, act_convert loc trans.actions res)
:: stmt_from_action))
trans
([],[],Cil_datatype.Varinfo.Set.empty, Cil.zero ~loc, [])
let mk_goto loc b =
let ghost = true in
match b.bstmts with
| [] -> Cil.mkBlock []
| [ { skind = Instr i } ] ->
let s = mkStmtOneInstr ~ghost i in
Cil.mkBlock [s]
| [ { skind = Goto (s,_) }] ->
let s' = mkStmt ~ghost (Goto (ref !s,loc)) in
Cil.mkBlock [s']
| s::_ ->
s.labels <-
(Label(Data_for_aorai.get_fresh "__aorai_label",loc,false)):: s.labels;
let s' = mkStmt ~ghost (Goto (ref s,loc)) in
Cil.mkBlock [s']
let normalize_condition loc cond block1 block2 =
let rec aux cond b1 b2 =
match cond.enode with
| UnOp(LNot,e,_) -> aux e b2 b1
| BinOp(LAnd,e1,e2,_) ->
let b2' = mk_goto loc b2 in
let b1'= Cil.mkBlock [aux e2 b1 b2'] in
aux e1 b1' b2
| BinOp(LOr,e1,e2,_) ->
let b1' = mk_goto loc b1 in
let b2' = Cil.mkBlock [aux e2 b1' b2] in
aux e1 b1 b2'
| _ ->
Cil.mkStmt ~ghost:true (If(cond,b1,b2,loc))
in
aux cond block1 block2
let mkIfStmt loc exp1 block1 block2 =
if Kernel.LogicalOperators.get() then
Cil.mkStmt ~ghost:true (If (exp1, block1, block2, loc))
else
normalize_condition loc exp1 block1 block2
let mk_deterministic_stmt
generated_kf loc auto f fst status ret state
(other_stmts, other_funcs, other_vars, trans_stmts as res) =
if is_reachable state status then begin
let trans = get_accessible_transitions auto state status in
let aux_stmts, aux_vars, aux_funcs, _, stmt_from_action =
mk_transitions_stmt generated_kf loc f fst ret trans
in
let stmts =
List.fold_left
(fun acc (cond, stmt_act) ->
[mkIfStmt loc cond
(mkBlock (is_state_det_stmt state loc :: stmt_act))
(mkBlock acc)])
trans_stmts
(List.rev stmt_from_action)
in
aux_stmts @ other_stmts,
Cil_datatype.Varinfo.Set.union aux_funcs other_funcs,
aux_vars @ other_vars,
stmts
end else res
let mk_non_deterministic_stmt
generated_kf loc (states, tr) f fst status ((st,_) as state) res =
if is_reachable st status then begin
let useful_trans = get_accessible_transitions (states,tr) st status in
let aux_stmts, new_vars, new_funcs, cond,stmt_from_action =
mk_transitions_stmt generated_kf loc f fst res useful_trans
in
let then_stmt = is_state_non_det_stmt state loc in
let else_stmt = [is_out_of_state_stmt state loc] in
let trans_stmts =
let actions =
List.fold_left
(fun acc (cond, stmt_act) ->
if stmt_act = [] then acc
else
(mkIfStmt loc cond (mkBlock stmt_act) (mkBlock []))::acc)
[]
(List.rev stmt_from_action)
in
mkIfStmt loc cond (mkBlock [then_stmt]) (mkBlock else_stmt) :: actions
in
new_funcs, new_vars, aux_stmts @ trans_stmts
end else
Cil_datatype.Varinfo.Set.empty, [], [is_out_of_state_stmt state loc]
let equalsStmt lval exp loc =
Cil.mkStmtOneInstr ~ghost:true (Set (lval, exp, loc))
let mk_deterministic_body generated_kf loc f st status res =
let (states, _ as auto) = Data_for_aorai.getGraph() in
let aux_stmts, aux_funcs, aux_vars, trans_stmts =
List.fold_right
(mk_deterministic_stmt generated_kf loc auto f st status res)
states
([], Cil_datatype.Varinfo.Set.empty, [],
[is_state_det_stmt (Data_for_aorai.get_reject_state()) loc])
in
aux_funcs, aux_vars, aux_stmts @ trans_stmts
let mk_non_deterministic_body generated_kf loc f st status res =
let (states, _) as auto = Data_for_aorai.getGraph() in
let copies, local_var =
let bindings =
List.map
(fun st ->
let state_var = Data_for_aorai.get_state_var st in
let copy = Cil.copyVarinfo state_var (state_var.vname ^ "_tmp") in
copy.vglob <- false;
(st,copy))
states
in bindings, snd (List.split bindings)
in
let copies_update =
List.map
(fun (st,copy) ->
equalsStmt (Cil.var copy)
(Cil.evar ~loc (Data_for_aorai.get_state_var st)) loc)
copies
in
let new_funcs, local_var, main_stmt =
List.fold_left
(fun (new_funcs, aux_vars, stmts) state ->
let my_funcs, my_vars, my_stmts =
mk_non_deterministic_stmt generated_kf loc auto f st status state res
in
Cil_datatype.Varinfo.Set.union my_funcs new_funcs,
my_vars @ aux_vars,
my_stmts@stmts )
(Cil_datatype.Varinfo.Set.empty, local_var, [])
copies
in
let stvar_update =
List.map
(fun (state,copy) ->
equalsStmt
(Cil.var (Data_for_aorai.get_state_var state))
(Cil.evar ~loc copy) loc)
copies
in
new_funcs, local_var, copies_update @ main_stmt @ stvar_update
let auto_func_block generated_kf loc f st status res =
let dkey = func_body_dkey in
let call_or_ret =
match st with
| Automaton_ast.Call -> "call"
| Automaton_ast.Return -> "return"
in
Aorai_option.debug
~dkey "func code for %a (%s)" Kernel_function.pretty f call_or_ret;
let stmt_begin_list =
[
equalsStmt
(Cil.var (Data_for_aorai.get_varinfo Data_for_aorai.curOpStatus))
(Cil.new_exp ~loc (Const (Data_for_aorai.op_status_to_cenum st))) loc;
equalsStmt
(Cil.var (Data_for_aorai.get_varinfo Data_for_aorai.curOp))
(Cil.new_exp ~loc
(Const (Data_for_aorai.func_to_cenum (Kernel_function.get_name f))))
loc
]
and stmt_history_update =
if Aorai_option.Deterministic.get () then
let history = Data_for_aorai.whole_history ()
and cur_state = Data_for_aorai.(get_varinfo curState) in
let add_stmt (src,acc) dst_name =
let dst = Data_for_aorai.get_varinfo dst_name in
let stmt = equalsStmt (Cil.var dst) (Cil.evar ~loc src) loc in
dst, stmt :: acc
in
snd (List.fold_left add_stmt (cur_state,[]) history)
else if Aorai_option.InstrumentationHistory.get () > 0 then
Aorai_option.fatal "history is not implemented for non-deterministic \
automaton"
else []
in
let new_funcs, local_var, main_stmt =
if Aorai_option.Deterministic.get() then
mk_deterministic_body generated_kf loc f st status res
else
mk_non_deterministic_body generated_kf loc f st status res
in
let ret =
Cil.mkStmt ~ghost:true ~valid_sid:true (Cil_types.Return(None,loc))
in
if Aorai_option.SmokeTests.get () then begin
assert_alive_automaton generated_kf ret;
end;
let res_block =
(Cil.mkBlock
( stmt_begin_list @ stmt_history_update @ main_stmt @ [ret]))
in
res_block.blocals <- local_var;
Aorai_option.debug ~dkey "Generated body is:@\n%a"
Printer.pp_block res_block;
new_funcs,res_block,local_var
let get_preds_wrt_params_reachable_states state f status =
let auto = Data_for_aorai.getGraph () in
let treat_one_trans acc tr = Logic_simplification.tor acc tr.cross in
let find_trans state prev tr =
Path_analysis.get_edges prev state auto @ tr
in
let treat_one_state state (_,last,_) acc =
let my_trans =
Data_for_aorai.Aorai_state.Set.fold (find_trans state) last []
in
let cond = List.fold_left treat_one_trans TFalse my_trans in
let (_,dnf) = Logic_simplification.simplifyCond cond in
let cond = Logic_simplification.simplifyDNFwrtCtx dnf f status in
let pred = crosscond_to_pred cond f status in
Logic_const.pand (acc, pimplies (is_state_pred state, pred))
in
Data_for_aorai.Aorai_state.Map.fold treat_one_state state ptrue
let get_preds_wrt_params_reachable_states state f status =
let merge_reachable_state _ = Data_for_aorai.merge_end_state in
let reachable_states =
Data_for_aorai.Aorai_state.Map.fold
merge_reachable_state state Data_for_aorai.Aorai_state.Map.empty
in
get_preds_wrt_params_reachable_states reachable_states f status
let get_preds_pre_wrt_params f =
let pre = Data_for_aorai.get_kf_init_state f in
get_preds_wrt_params_reachable_states pre f Automaton_ast.Call
let get_preds_post_bc_wrt_params f =
let post = Data_for_aorai.get_kf_return_state f in
get_preds_wrt_params_reachable_states post f Automaton_ast.Return
let treat_val loc base range pred =
let add term =
if Cil.isLogicZero base then term
else Logic_const.term
(TBinOp (PlusA, Logic_const.tat (base,Logic_const.pre_label), term))
Linteger
in
let add_cst i = add (Logic_const.tinteger i) in
let res =
match range with
| Fixed i -> Logic_const.prel (Req,loc, add_cst i)
| Interval(min,max) ->
let min = Logic_const.prel (Rle, add_cst min, loc) in
let max = Logic_const.prel (Rle, loc, add_cst max) in
Logic_const.pand (min,max)
| Bounded (min,max) ->
let min = Logic_const.prel (Rle, add_cst min, loc) in
let max = Logic_const.prel (Rle, loc, add max) in
Logic_const.pand (min,max)
| Unbounded min -> Logic_const.prel (Rle, add_cst min, loc)
| Unknown -> Logic_const.ptrue
in
Aorai_option.debug ~dkey:action_dkey "Action predicate: %a"
Printer.pp_predicate res;
Logic_const.por(pred,res)
let possible_states_preds state =
let treat_one_state start map acc =
let make_possible_state state _ acc =
Logic_const.por (acc,is_state_pred state)
in
let possible_states =
Data_for_aorai.Aorai_state.Map.fold make_possible_state map pfalse
in
Logic_const.pimplies
(Logic_const.pat (is_state_pred start,Logic_const.pre_label),
possible_states)
:: acc
in
Data_for_aorai.Aorai_state.Map.fold treat_one_state state []
let update_to_pred ~start ~pre_state ~post_state location bindings =
let loc = Cil_datatype.Location.unknown in
let intv =
Cil_datatype.Term.Map.fold
(treat_val location) bindings Logic_const.pfalse
in
let pred =
match post_state.multi_state with
| None -> intv
| Some(set,aux) ->
let set = Data_for_aorai.pebble_set_at set Logic_const.here_label in
pebble_post ~loc set aux intv
in
let guard =
Logic_const.pand ~loc
(Logic_const.pat ~loc (is_state_pred pre_state, start),
is_state_pred post_state)
in
Logic_const.pimplies ~loc (guard, pred)
let action_to_pred ~start ~pre_state ~post_state bindings =
let treat_one_loc loc vals acc =
update_to_pred ~start ~pre_state ~post_state loc vals :: acc
in
Cil_datatype.Term.Map.fold treat_one_loc bindings []
let all_actions_preds start state =
let treat_current_state pre_state post_state (_,_,bindings) acc =
let my_bindings =
action_to_pred ~start ~pre_state ~post_state bindings
in
my_bindings @ acc
in
let treat_start_state pre_state map acc =
Data_for_aorai.Aorai_state.Map.fold
(treat_current_state pre_state) map acc
in
Data_for_aorai.Aorai_state.Map.fold treat_start_state state []