Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856419400796.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S16C08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400796
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.8M
-rw-r--r-- 1 mcc users 15K Feb 26 03:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 03:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 03:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 26 03:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 03:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 26 03:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 03:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.3M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679616483444

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 00:08:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 00:08:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 00:08:05] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2023-03-24 00:08:05] [INFO ] Transformed 6876 places.
[2023-03-24 00:08:05] [INFO ] Transformed 9571 transitions.
[2023-03-24 00:08:05] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 6876 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 6840 transition count 9571
Discarding 2154 places :
Symmetric choice reduction at 1 with 2154 rule applications. Total rules 2190 place count 4686 transition count 7417
Iterating global reduction 1 with 2154 rules applied. Total rules applied 4344 place count 4686 transition count 7417
Discarding 1891 places :
Symmetric choice reduction at 1 with 1891 rule applications. Total rules 6235 place count 2795 transition count 5526
Iterating global reduction 1 with 1891 rules applied. Total rules applied 8126 place count 2795 transition count 5526
Discarding 219 places :
Symmetric choice reduction at 1 with 219 rule applications. Total rules 8345 place count 2576 transition count 3774
Iterating global reduction 1 with 219 rules applied. Total rules applied 8564 place count 2576 transition count 3774
Applied a total of 8564 rules in 1440 ms. Remains 2576 /6876 variables (removed 4300) and now considering 3774/9571 (removed 5797) transitions.
[2023-03-24 00:08:07] [INFO ] Flow matrix only has 3502 transitions (discarded 272 similar events)
// Phase 1: matrix 3502 rows 2576 cols
[2023-03-24 00:08:07] [INFO ] Computed 613 place invariants in 195 ms
[2023-03-24 00:08:10] [INFO ] Implicit Places using invariants in 3445 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 26, 28, 33, 40, 49, 60, 73, 88, 104, 120, 124, 128, 130, 134, 136, 149, 162, 171, 178, 185, 190, 225, 232, 235, 236, 237, 238, 239, 240, 241, 242, 243, 246, 251, 258, 267, 278, 291, 305, 319, 320, 321, 322, 323, 324, 325, 326, 327, 338, 347, 354, 359, 362, 364, 399, 406, 409, 410, 411, 412, 413, 414, 415, 416, 417, 419, 422, 427, 434, 443, 454, 466, 478, 479, 480, 481, 482, 483, 484, 485, 486, 495, 502, 507, 510, 512, 514, 549, 556, 559, 560, 561, 562, 563, 564, 565, 566, 567, 570, 572, 575, 580, 587, 596, 606, 616, 617, 618, 619, 620, 621, 623, 624, 631, 636, 639, 644, 646, 648, 683, 690, 693, 694, 695, 696, 697, 698, 699, 700, 701, 703, 705, 708, 711, 716, 723, 731, 739, 740, 741, 742, 743, 744, 745, 746, 747, 752, 755, 757, 759, 761, 763, 805, 808, 809, 810, 811, 812, 813, 814, 815, 816, 818, 820, 822, 824, 827, 832, 838, 844, 845, 846, 847, 849, 850, 851, 852, 855, 857, 859, 864, 866, 868, 903, 910, 913, 914, 915, 917, 918, 919, 920, 921, 923, 925, 931, 933, 936, 940, 944, 945, 946, 947, 948, 949, 950, 951, 952, 954, 956, 958, 960, 962, 964, 999, 1006, 1009, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1019, 1021, 1023, 1025, 1027, 1029, 1031, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1044, 1046, 1048, 1050, 1053, 1055, 1090, 1092, 1096, 1099, 1100, 1101, 1103, 1104, 1105, 1106, 1107, 1109, 1114, 1116, 1118, 1120, 1122, 1124, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1134, 1135, 1137, 1139, 1141, 1143, 1145, 1147, 1182, 1189, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1199, 1200, 1202, 1204, 1206, 1208, 1210, 1212, 1214, 1217, 1218, 1219, 1220, 1221, 1222, 1224, 1225, 1229, 1231, 1233, 1235, 1237, 1239, 1274, 1281, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1294, 1296, 1298, 1300, 1302, 1304, 1307, 1312, 1313, 1314, 1315, 1316, 1317, 1318, 1319, 1320, 1323, 1325, 1327, 1329, 1331, 1333, 1368, 1375, 1378, 1379, 1380, 1381, 1382, 1383, 1384, 1386, 1391, 1393, 1395, 1397, 1399, 1402, 1407, 1414, 1415, 1416, 1417, 1418, 1419, 1420, 1421, 1422, 1427, 1430, 1432, 1434, 1436, 1438, 1473, 1480, 1483, 1484, 1485, 1486, 1487, 1488, 1489, 1490, 1491, 1493, 1496, 1498, 1500, 1503, 1508, 1515, 1524, 1526, 1527, 1528, 1529, 1530, 1531, 1532, 1539, 1546, 1549, 1551, 1553, 1555, 1590, 1597, 1600, 1601, 1602, 1603, 1604, 1605, 1606, 1607, 1608, 1610, 1612, 1614, 1617, 1622, 1629, 1638, 1649, 1650, 1651, 1652, 1653, 1655, 1656, 1657, 1667, 1677, 1682, 1685, 1687, 1689, 1724, 1731, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1744, 1746, 1749, 1754, 1761, 1770, 1781, 1794, 1795, 1796, 1798, 1799, 1800, 1801, 1802, 1815, 1824, 1831, 1836, 1839, 1841, 1876, 1883, 1886, 1888, 1889, 1890, 1891, 1892, 1893, 1894, 1899, 1903, 1908, 1915, 1924, 1935, 1948, 1963, 1964, 1965, 1966, 1967, 1968, 1969, 1970, 1971, 1984, 1995, 2004, 2011, 2016, 2019, 2054, 2056, 2060, 2063, 2064, 2065, 2066, 2067, 2068, 2069, 2070, 2071, 2074, 2079, 2086, 2095, 2106, 2119, 2134, 2151, 2152, 2153, 2154, 2155, 2156, 2157, 2158, 2159, 2174, 2187, 2198, 2207, 2214, 2219, 2255]
Discarding 549 places :
Implicit Place search using SMT only with invariants took 3479 ms to find 549 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2027/6876 places, 3774/9571 transitions.
Discarding 243 places :
Symmetric choice reduction at 0 with 243 rule applications. Total rules 243 place count 1784 transition count 3531
Iterating global reduction 0 with 243 rules applied. Total rules applied 486 place count 1784 transition count 3531
Discarding 241 places :
Symmetric choice reduction at 0 with 241 rule applications. Total rules 727 place count 1543 transition count 3290
Iterating global reduction 0 with 241 rules applied. Total rules applied 968 place count 1543 transition count 3290
Discarding 240 places :
Symmetric choice reduction at 0 with 240 rule applications. Total rules 1208 place count 1303 transition count 3050
Iterating global reduction 0 with 240 rules applied. Total rules applied 1448 place count 1303 transition count 3050
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 1466 place count 1285 transition count 2906
Iterating global reduction 0 with 18 rules applied. Total rules applied 1484 place count 1285 transition count 2906
Applied a total of 1484 rules in 220 ms. Remains 1285 /2027 variables (removed 742) and now considering 2906/3774 (removed 868) transitions.
[2023-03-24 00:08:10] [INFO ] Flow matrix only has 2634 transitions (discarded 272 similar events)
// Phase 1: matrix 2634 rows 1285 cols
[2023-03-24 00:08:11] [INFO ] Computed 64 place invariants in 42 ms
[2023-03-24 00:08:11] [INFO ] Implicit Places using invariants in 997 ms returned []
[2023-03-24 00:08:11] [INFO ] Flow matrix only has 2634 transitions (discarded 272 similar events)
[2023-03-24 00:08:11] [INFO ] Invariant cache hit.
[2023-03-24 00:08:12] [INFO ] State equation strengthened by 1063 read => feed constraints.
[2023-03-24 00:08:25] [INFO ] Implicit Places using invariants and state equation in 13104 ms returned []
Implicit Place search using SMT with State Equation took 14109 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1285/6876 places, 2906/9571 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19250 ms. Remains : 1285/6876 places, 2906/9571 transitions.
Support contains 60 out of 1285 places after structural reductions.
[2023-03-24 00:08:25] [INFO ] Flatten gal took : 205 ms
[2023-03-24 00:08:25] [INFO ] Flatten gal took : 130 ms
[2023-03-24 00:08:25] [INFO ] Input system was already deterministic with 2906 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 32) seen :15
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-24 00:08:26] [INFO ] Flow matrix only has 2634 transitions (discarded 272 similar events)
[2023-03-24 00:08:26] [INFO ] Invariant cache hit.
[2023-03-24 00:08:27] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-24 00:08:27] [INFO ] [Real]Absence check using 31 positive and 33 generalized place invariants in 30 ms returned sat
[2023-03-24 00:08:30] [INFO ] After 2329ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:14
[2023-03-24 00:08:30] [INFO ] State equation strengthened by 1063 read => feed constraints.
[2023-03-24 00:08:30] [INFO ] After 211ms SMT Verify possible using 1063 Read/Feed constraints in real domain returned unsat :1 sat :0 real:15
[2023-03-24 00:08:30] [INFO ] After 3541ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:15
[2023-03-24 00:08:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-24 00:08:30] [INFO ] [Nat]Absence check using 31 positive and 33 generalized place invariants in 39 ms returned sat
[2023-03-24 00:08:33] [INFO ] After 2309ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2023-03-24 00:08:37] [INFO ] After 3865ms SMT Verify possible using 1063 Read/Feed constraints in natural domain returned unsat :1 sat :15
[2023-03-24 00:08:38] [INFO ] Deduced a trap composed of 280 places in 613 ms of which 11 ms to minimize.
[2023-03-24 00:08:39] [INFO ] Deduced a trap composed of 362 places in 593 ms of which 2 ms to minimize.
[2023-03-24 00:08:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1658 ms
[2023-03-24 00:08:40] [INFO ] Deduced a trap composed of 327 places in 700 ms of which 3 ms to minimize.
[2023-03-24 00:08:41] [INFO ] Deduced a trap composed of 183 places in 642 ms of which 3 ms to minimize.
[2023-03-24 00:08:42] [INFO ] Deduced a trap composed of 281 places in 654 ms of which 2 ms to minimize.
[2023-03-24 00:08:43] [INFO ] Deduced a trap composed of 130 places in 621 ms of which 1 ms to minimize.
[2023-03-24 00:08:44] [INFO ] Deduced a trap composed of 186 places in 650 ms of which 2 ms to minimize.
[2023-03-24 00:08:44] [INFO ] Deduced a trap composed of 204 places in 640 ms of which 2 ms to minimize.
[2023-03-24 00:08:45] [INFO ] Deduced a trap composed of 184 places in 631 ms of which 1 ms to minimize.
[2023-03-24 00:08:46] [INFO ] Deduced a trap composed of 185 places in 602 ms of which 1 ms to minimize.
[2023-03-24 00:08:47] [INFO ] Deduced a trap composed of 167 places in 621 ms of which 1 ms to minimize.
[2023-03-24 00:08:47] [INFO ] Deduced a trap composed of 132 places in 613 ms of which 3 ms to minimize.
[2023-03-24 00:08:48] [INFO ] Deduced a trap composed of 153 places in 636 ms of which 3 ms to minimize.
[2023-03-24 00:08:49] [INFO ] Deduced a trap composed of 141 places in 636 ms of which 1 ms to minimize.
[2023-03-24 00:08:50] [INFO ] Deduced a trap composed of 378 places in 591 ms of which 1 ms to minimize.
[2023-03-24 00:08:50] [INFO ] Deduced a trap composed of 173 places in 628 ms of which 1 ms to minimize.
[2023-03-24 00:08:51] [INFO ] Deduced a trap composed of 119 places in 615 ms of which 1 ms to minimize.
[2023-03-24 00:08:53] [INFO ] Deduced a trap composed of 424 places in 603 ms of which 1 ms to minimize.
[2023-03-24 00:08:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 13472 ms
[2023-03-24 00:08:54] [INFO ] Deduced a trap composed of 306 places in 583 ms of which 1 ms to minimize.
[2023-03-24 00:08:55] [INFO ] Deduced a trap composed of 137 places in 611 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 00:08:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:08:55] [INFO ] After 25133ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:15
Fused 16 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 26 out of 1285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1285 transition count 2879
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1258 transition count 2879
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 54 place count 1258 transition count 2858
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 96 place count 1237 transition count 2858
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 107 place count 1226 transition count 2812
Iterating global reduction 2 with 11 rules applied. Total rules applied 118 place count 1226 transition count 2812
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 1220 transition count 2778
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 1220 transition count 2778
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 1218 transition count 2762
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 1218 transition count 2762
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 192 place count 1189 transition count 2733
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 197 place count 1184 transition count 2728
Iterating global reduction 2 with 5 rules applied. Total rules applied 202 place count 1184 transition count 2728
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 207 place count 1179 transition count 2688
Iterating global reduction 2 with 5 rules applied. Total rules applied 212 place count 1179 transition count 2688
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 2 with 132 rules applied. Total rules applied 344 place count 1179 transition count 3613
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 476 place count 1047 transition count 3613
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 485 place count 1047 transition count 3613
Applied a total of 485 rules in 901 ms. Remains 1047 /1285 variables (removed 238) and now considering 3613/2906 (removed -707) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 902 ms. Remains : 1047/1285 places, 3613/2906 transitions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-24 00:08:57] [INFO ] Flow matrix only has 3228 transitions (discarded 385 similar events)
// Phase 1: matrix 3228 rows 1047 cols
[2023-03-24 00:08:57] [INFO ] Computed 64 place invariants in 54 ms
[2023-03-24 00:08:57] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-24 00:08:57] [INFO ] [Real]Absence check using 31 positive and 33 generalized place invariants in 27 ms returned sat
[2023-03-24 00:08:59] [INFO ] After 2118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:10
[2023-03-24 00:08:59] [INFO ] State equation strengthened by 2008 read => feed constraints.
[2023-03-24 00:09:00] [INFO ] After 608ms SMT Verify possible using 2008 Read/Feed constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-24 00:09:00] [INFO ] After 3359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-24 00:09:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-24 00:09:00] [INFO ] [Nat]Absence check using 31 positive and 33 generalized place invariants in 24 ms returned sat
[2023-03-24 00:09:03] [INFO ] After 1947ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-24 00:09:07] [INFO ] After 4700ms SMT Verify possible using 2008 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-24 00:09:10] [INFO ] Deduced a trap composed of 100 places in 597 ms of which 1 ms to minimize.
[2023-03-24 00:09:12] [INFO ] Deduced a trap composed of 108 places in 562 ms of which 1 ms to minimize.
[2023-03-24 00:09:12] [INFO ] Deduced a trap composed of 103 places in 539 ms of which 1 ms to minimize.
[2023-03-24 00:09:14] [INFO ] Deduced a trap composed of 106 places in 584 ms of which 1 ms to minimize.
[2023-03-24 00:09:14] [INFO ] Deduced a trap composed of 107 places in 539 ms of which 1 ms to minimize.
[2023-03-24 00:09:16] [INFO ] Deduced a trap composed of 98 places in 602 ms of which 1 ms to minimize.
[2023-03-24 00:09:17] [INFO ] Deduced a trap composed of 111 places in 534 ms of which 1 ms to minimize.
[2023-03-24 00:09:17] [INFO ] Deduced a trap composed of 78 places in 536 ms of which 1 ms to minimize.
[2023-03-24 00:09:19] [INFO ] Deduced a trap composed of 102 places in 572 ms of which 1 ms to minimize.
[2023-03-24 00:09:19] [INFO ] Deduced a trap composed of 92 places in 552 ms of which 1 ms to minimize.
[2023-03-24 00:09:20] [INFO ] Deduced a trap composed of 97 places in 556 ms of which 1 ms to minimize.
[2023-03-24 00:09:21] [INFO ] Deduced a trap composed of 101 places in 601 ms of which 1 ms to minimize.
[2023-03-24 00:09:22] [INFO ] Deduced a trap composed of 93 places in 597 ms of which 1 ms to minimize.
[2023-03-24 00:09:23] [INFO ] Deduced a trap composed of 120 places in 601 ms of which 1 ms to minimize.
[2023-03-24 00:09:24] [INFO ] Deduced a trap composed of 100 places in 633 ms of which 6 ms to minimize.
[2023-03-24 00:09:25] [INFO ] Deduced a trap composed of 85 places in 602 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 00:09:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:09:25] [INFO ] After 25084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 24 out of 1047 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1047/1047 places, 3613/3613 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1046 transition count 3612
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 15 place count 1046 transition count 4313
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 28 place count 1033 transition count 4313
Applied a total of 28 rules in 280 ms. Remains 1033 /1047 variables (removed 14) and now considering 4313/3613 (removed -700) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 1033/1047 places, 4313/3613 transitions.
Incomplete random walk after 10000 steps, including 204 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-24 00:09:27] [INFO ] Flow matrix only has 3916 transitions (discarded 397 similar events)
// Phase 1: matrix 3916 rows 1033 cols
[2023-03-24 00:09:27] [INFO ] Computed 64 place invariants in 34 ms
[2023-03-24 00:09:27] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-24 00:09:27] [INFO ] [Real]Absence check using 33 positive and 31 generalized place invariants in 6 ms returned sat
[2023-03-24 00:09:30] [INFO ] After 2281ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:7
[2023-03-24 00:09:30] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:09:30] [INFO ] After 705ms SMT Verify possible using 2722 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-24 00:09:30] [INFO ] After 3461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-24 00:09:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-24 00:09:31] [INFO ] [Nat]Absence check using 33 positive and 31 generalized place invariants in 10 ms returned sat
[2023-03-24 00:09:33] [INFO ] After 2172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-24 00:09:38] [INFO ] After 5359ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-24 00:09:40] [INFO ] Deduced a trap composed of 103 places in 662 ms of which 1 ms to minimize.
[2023-03-24 00:09:42] [INFO ] Deduced a trap composed of 117 places in 601 ms of which 1 ms to minimize.
[2023-03-24 00:09:42] [INFO ] Deduced a trap composed of 95 places in 651 ms of which 1 ms to minimize.
[2023-03-24 00:09:43] [INFO ] Deduced a trap composed of 81 places in 674 ms of which 1 ms to minimize.
[2023-03-24 00:09:44] [INFO ] Deduced a trap composed of 107 places in 652 ms of which 1 ms to minimize.
[2023-03-24 00:09:46] [INFO ] Deduced a trap composed of 113 places in 672 ms of which 1 ms to minimize.
[2023-03-24 00:09:46] [INFO ] Deduced a trap composed of 87 places in 666 ms of which 1 ms to minimize.
[2023-03-24 00:09:47] [INFO ] Deduced a trap composed of 101 places in 686 ms of which 1 ms to minimize.
[2023-03-24 00:09:48] [INFO ] Deduced a trap composed of 105 places in 672 ms of which 1 ms to minimize.
[2023-03-24 00:09:49] [INFO ] Deduced a trap composed of 93 places in 664 ms of which 1 ms to minimize.
[2023-03-24 00:09:50] [INFO ] Deduced a trap composed of 95 places in 655 ms of which 1 ms to minimize.
[2023-03-24 00:09:51] [INFO ] Deduced a trap composed of 100 places in 635 ms of which 2 ms to minimize.
[2023-03-24 00:09:52] [INFO ] Deduced a trap composed of 96 places in 643 ms of which 1 ms to minimize.
[2023-03-24 00:09:53] [INFO ] Deduced a trap composed of 89 places in 653 ms of which 1 ms to minimize.
[2023-03-24 00:09:54] [INFO ] Deduced a trap composed of 86 places in 604 ms of which 1 ms to minimize.
[2023-03-24 00:09:55] [INFO ] Deduced a trap composed of 97 places in 616 ms of which 1 ms to minimize.
[2023-03-24 00:09:56] [INFO ] Deduced a trap composed of 92 places in 648 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 00:09:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:09:56] [INFO ] After 25547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 55 ms.
Support contains 20 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 4313/4313 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1033 transition count 4311
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1031 transition count 4311
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1029 transition count 4309
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1029 transition count 4309
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1029 transition count 4309
Applied a total of 10 rules in 438 ms. Remains 1029 /1033 variables (removed 4) and now considering 4309/4313 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 1029/1033 places, 4309/4313 transitions.
Incomplete random walk after 10000 steps, including 205 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 56609 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{2=1, 8=1}
Probabilistic random walk after 56609 steps, saw 23979 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :2
Running SMT prover for 8 properties.
[2023-03-24 00:10:01] [INFO ] Flow matrix only has 3912 transitions (discarded 397 similar events)
// Phase 1: matrix 3912 rows 1029 cols
[2023-03-24 00:10:01] [INFO ] Computed 64 place invariants in 52 ms
[2023-03-24 00:10:01] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-24 00:10:01] [INFO ] [Real]Absence check using 33 positive and 31 generalized place invariants in 6 ms returned sat
[2023-03-24 00:10:03] [INFO ] After 1830ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-24 00:10:03] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:10:04] [INFO ] After 468ms SMT Verify possible using 2722 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-24 00:10:04] [INFO ] After 2704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-24 00:10:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-24 00:10:04] [INFO ] [Nat]Absence check using 33 positive and 31 generalized place invariants in 17 ms returned sat
[2023-03-24 00:10:06] [INFO ] After 1894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-24 00:10:10] [INFO ] After 3844ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-24 00:10:11] [INFO ] Deduced a trap composed of 95 places in 678 ms of which 1 ms to minimize.
[2023-03-24 00:10:12] [INFO ] Deduced a trap composed of 93 places in 647 ms of which 1 ms to minimize.
[2023-03-24 00:10:14] [INFO ] Deduced a trap composed of 88 places in 613 ms of which 1 ms to minimize.
[2023-03-24 00:10:15] [INFO ] Deduced a trap composed of 98 places in 607 ms of which 11 ms to minimize.
[2023-03-24 00:10:16] [INFO ] Deduced a trap composed of 98 places in 674 ms of which 1 ms to minimize.
[2023-03-24 00:10:17] [INFO ] Deduced a trap composed of 97 places in 670 ms of which 1 ms to minimize.
[2023-03-24 00:10:18] [INFO ] Deduced a trap composed of 90 places in 664 ms of which 1 ms to minimize.
[2023-03-24 00:10:19] [INFO ] Deduced a trap composed of 92 places in 625 ms of which 1 ms to minimize.
[2023-03-24 00:10:19] [INFO ] Deduced a trap composed of 88 places in 571 ms of which 1 ms to minimize.
[2023-03-24 00:10:20] [INFO ] Deduced a trap composed of 108 places in 600 ms of which 1 ms to minimize.
[2023-03-24 00:10:21] [INFO ] Deduced a trap composed of 66 places in 618 ms of which 2 ms to minimize.
[2023-03-24 00:10:22] [INFO ] Deduced a trap composed of 102 places in 643 ms of which 3 ms to minimize.
[2023-03-24 00:10:22] [INFO ] Deduced a trap composed of 103 places in 653 ms of which 1 ms to minimize.
[2023-03-24 00:10:23] [INFO ] Deduced a trap composed of 103 places in 671 ms of which 1 ms to minimize.
[2023-03-24 00:10:23] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 12741 ms
[2023-03-24 00:10:25] [INFO ] Deduced a trap composed of 93 places in 639 ms of which 1 ms to minimize.
[2023-03-24 00:10:26] [INFO ] Deduced a trap composed of 253 places in 549 ms of which 1 ms to minimize.
[2023-03-24 00:10:27] [INFO ] Deduced a trap composed of 78 places in 653 ms of which 1 ms to minimize.
[2023-03-24 00:10:28] [INFO ] Deduced a trap composed of 102 places in 638 ms of which 0 ms to minimize.
[2023-03-24 00:10:28] [INFO ] Deduced a trap composed of 89 places in 638 ms of which 1 ms to minimize.
[2023-03-24 00:10:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3736 ms
[2023-03-24 00:10:29] [INFO ] After 22761ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-24 00:10:29] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 10 ms.
Support contains 17 out of 1029 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1029/1029 places, 4309/4309 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1029 transition count 4308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1028 transition count 4308
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1028 transition count 4307
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1027 transition count 4307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1026 transition count 4306
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1026 transition count 4306
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1026 transition count 4306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 1025 transition count 4305
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 1025 transition count 4305
Applied a total of 10 rules in 327 ms. Remains 1025 /1029 variables (removed 4) and now considering 4305/4309 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 1025/1029 places, 4305/4309 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 453 stabilizing places and 1273 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1264 transition count 2843
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1264 transition count 2843
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 57 place count 1249 transition count 2779
Iterating global reduction 0 with 15 rules applied. Total rules applied 72 place count 1249 transition count 2779
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 1241 transition count 2715
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 1241 transition count 2715
Applied a total of 88 rules in 192 ms. Remains 1241 /1285 variables (removed 44) and now considering 2715/2906 (removed 191) transitions.
[2023-03-24 00:10:30] [INFO ] Flow matrix only has 2443 transitions (discarded 272 similar events)
// Phase 1: matrix 2443 rows 1241 cols
[2023-03-24 00:10:30] [INFO ] Computed 64 place invariants in 29 ms
[2023-03-24 00:10:31] [INFO ] Implicit Places using invariants in 1300 ms returned [103, 106, 435, 502, 530, 550, 554, 603, 638, 684, 746, 806, 884, 928]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1315 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1227/1285 places, 2715/2906 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1215 transition count 2703
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1215 transition count 2703
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1203 transition count 2691
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1203 transition count 2691
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1191 transition count 2679
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1191 transition count 2679
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1181 transition count 2599
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1181 transition count 2599
Applied a total of 92 rules in 259 ms. Remains 1181 /1227 variables (removed 46) and now considering 2599/2715 (removed 116) transitions.
[2023-03-24 00:10:31] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1181 cols
[2023-03-24 00:10:31] [INFO ] Computed 50 place invariants in 24 ms
[2023-03-24 00:10:32] [INFO ] Implicit Places using invariants in 988 ms returned []
[2023-03-24 00:10:32] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
[2023-03-24 00:10:32] [INFO ] Invariant cache hit.
[2023-03-24 00:10:33] [INFO ] State equation strengthened by 846 read => feed constraints.
[2023-03-24 00:10:40] [INFO ] Implicit Places using invariants and state equation in 7281 ms returned []
Implicit Place search using SMT with State Equation took 8271 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1181/1285 places, 2599/2906 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10042 ms. Remains : 1181/1285 places, 2599/2906 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s152 1) (LT s183 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1203 reset in 598 ms.
Entered a terminal (fully accepting) state of product in 9750 steps with 117 reset in 49 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 finished in 10948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(X(p0))))||X((X(p1) U p2))))'
Support contains 6 out of 1285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1265 transition count 2851
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1265 transition count 2851
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 55 place count 1250 transition count 2780
Iterating global reduction 0 with 15 rules applied. Total rules applied 70 place count 1250 transition count 2780
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 1243 transition count 2724
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 1243 transition count 2724
Applied a total of 84 rules in 211 ms. Remains 1243 /1285 variables (removed 42) and now considering 2724/2906 (removed 182) transitions.
[2023-03-24 00:10:41] [INFO ] Flow matrix only has 2452 transitions (discarded 272 similar events)
// Phase 1: matrix 2452 rows 1243 cols
[2023-03-24 00:10:41] [INFO ] Computed 64 place invariants in 47 ms
[2023-03-24 00:10:42] [INFO ] Implicit Places using invariants in 1040 ms returned [103, 106, 110, 433, 500, 528, 548, 552, 639, 685, 747, 807, 886, 930]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1042 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1229/1285 places, 2724/2906 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1217 transition count 2712
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1217 transition count 2712
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1205 transition count 2700
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1205 transition count 2700
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1193 transition count 2688
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1193 transition count 2688
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1183 transition count 2608
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1183 transition count 2608
Applied a total of 92 rules in 261 ms. Remains 1183 /1229 variables (removed 46) and now considering 2608/2724 (removed 116) transitions.
[2023-03-24 00:10:42] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
// Phase 1: matrix 2336 rows 1183 cols
[2023-03-24 00:10:42] [INFO ] Computed 50 place invariants in 39 ms
[2023-03-24 00:10:43] [INFO ] Implicit Places using invariants in 959 ms returned []
[2023-03-24 00:10:43] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
[2023-03-24 00:10:43] [INFO ] Invariant cache hit.
[2023-03-24 00:10:44] [INFO ] State equation strengthened by 853 read => feed constraints.
[2023-03-24 00:10:50] [INFO ] Implicit Places using invariants and state equation in 7559 ms returned []
Implicit Place search using SMT with State Equation took 8521 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1183/1285 places, 2608/2906 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10037 ms. Remains : 1183/1285 places, 2608/2906 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s799 1) (GEQ s985 1) (GEQ s986 1)), p1:(AND (GEQ s761 1) (GEQ s1145 1)), p0:(GEQ s582 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01 finished in 10352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (p0&&G(F((p1 U (p2||G(p1))))))))'
Support contains 6 out of 1285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1265 transition count 2844
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1265 transition count 2844
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 1251 transition count 2774
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 1251 transition count 2774
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 1245 transition count 2726
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 1245 transition count 2726
Applied a total of 80 rules in 185 ms. Remains 1245 /1285 variables (removed 40) and now considering 2726/2906 (removed 180) transitions.
[2023-03-24 00:10:51] [INFO ] Flow matrix only has 2454 transitions (discarded 272 similar events)
// Phase 1: matrix 2454 rows 1245 cols
[2023-03-24 00:10:51] [INFO ] Computed 64 place invariants in 39 ms
[2023-03-24 00:10:52] [INFO ] Implicit Places using invariants in 980 ms returned [103, 106, 110, 433, 551, 604, 639, 685, 747, 888, 932]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 983 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1234/1285 places, 2726/2906 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1223 transition count 2715
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1223 transition count 2715
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1212 transition count 2704
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1212 transition count 2704
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1201 transition count 2693
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1201 transition count 2693
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 1192 transition count 2621
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 1192 transition count 2621
Applied a total of 84 rules in 235 ms. Remains 1192 /1234 variables (removed 42) and now considering 2621/2726 (removed 105) transitions.
[2023-03-24 00:10:52] [INFO ] Flow matrix only has 2349 transitions (discarded 272 similar events)
// Phase 1: matrix 2349 rows 1192 cols
[2023-03-24 00:10:52] [INFO ] Computed 53 place invariants in 31 ms
[2023-03-24 00:10:53] [INFO ] Implicit Places using invariants in 955 ms returned []
[2023-03-24 00:10:53] [INFO ] Flow matrix only has 2349 transitions (discarded 272 similar events)
[2023-03-24 00:10:53] [INFO ] Invariant cache hit.
[2023-03-24 00:10:54] [INFO ] State equation strengthened by 860 read => feed constraints.
[2023-03-24 00:11:03] [INFO ] Implicit Places using invariants and state equation in 9476 ms returned [1147]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10434 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1191/1285 places, 2621/2906 transitions.
Applied a total of 0 rules in 48 ms. Remains 1191 /1191 variables (removed 0) and now considering 2621/2621 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11886 ms. Remains : 1191/1285 places, 2621/2906 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p0), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s790 1), p2:(AND (GEQ s2 1) (GEQ s486 1) (GEQ s539 1) (GEQ s540 1) (LT s522 1)), p1:(LT s522 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02 finished in 12146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U p1))'
Support contains 5 out of 1285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1285 transition count 2880
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1259 transition count 2880
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 52 place count 1259 transition count 2856
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 100 place count 1235 transition count 2856
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 115 place count 1220 transition count 2799
Iterating global reduction 2 with 15 rules applied. Total rules applied 130 place count 1220 transition count 2799
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 130 place count 1220 transition count 2797
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 134 place count 1218 transition count 2797
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 143 place count 1209 transition count 2732
Iterating global reduction 2 with 9 rules applied. Total rules applied 152 place count 1209 transition count 2732
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 1208 transition count 2724
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 1208 transition count 2724
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 214 place count 1178 transition count 2694
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 219 place count 1173 transition count 2689
Iterating global reduction 2 with 5 rules applied. Total rules applied 224 place count 1173 transition count 2689
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 229 place count 1168 transition count 2649
Iterating global reduction 2 with 5 rules applied. Total rules applied 234 place count 1168 transition count 2649
Applied a total of 234 rules in 592 ms. Remains 1168 /1285 variables (removed 117) and now considering 2649/2906 (removed 257) transitions.
[2023-03-24 00:11:03] [INFO ] Flow matrix only has 2377 transitions (discarded 272 similar events)
// Phase 1: matrix 2377 rows 1168 cols
[2023-03-24 00:11:04] [INFO ] Computed 64 place invariants in 39 ms
[2023-03-24 00:11:04] [INFO ] Implicit Places using invariants in 994 ms returned [93, 94, 95, 397, 462, 489, 507, 511, 557, 590, 696, 754, 830, 872]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 998 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1154/1285 places, 2649/2906 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1147 transition count 2642
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1147 transition count 2642
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1140 transition count 2635
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1140 transition count 2635
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1135 transition count 2595
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1135 transition count 2595
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1130 transition count 2590
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 1125 transition count 2585
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 1125 transition count 2585
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 1120 transition count 2545
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 1120 transition count 2545
Applied a total of 68 rules in 405 ms. Remains 1120 /1154 variables (removed 34) and now considering 2545/2649 (removed 104) transitions.
[2023-03-24 00:11:05] [INFO ] Flow matrix only has 2273 transitions (discarded 272 similar events)
// Phase 1: matrix 2273 rows 1120 cols
[2023-03-24 00:11:05] [INFO ] Computed 50 place invariants in 27 ms
[2023-03-24 00:11:06] [INFO ] Implicit Places using invariants in 971 ms returned []
[2023-03-24 00:11:06] [INFO ] Flow matrix only has 2273 transitions (discarded 272 similar events)
[2023-03-24 00:11:06] [INFO ] Invariant cache hit.
[2023-03-24 00:11:07] [INFO ] State equation strengthened by 853 read => feed constraints.
[2023-03-24 00:11:14] [INFO ] Implicit Places using invariants and state equation in 8275 ms returned []
Implicit Place search using SMT with State Equation took 9251 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1120/1285 places, 2545/2906 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11247 ms. Remains : 1120/1285 places, 2545/2906 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s1083 1) (GEQ s1085 1) (GEQ s1115 1)), p0:(OR (GEQ s613 1) (GEQ s1076 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 finished in 11322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 4 out of 1285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1265 transition count 2851
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1265 transition count 2851
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 55 place count 1250 transition count 2787
Iterating global reduction 0 with 15 rules applied. Total rules applied 70 place count 1250 transition count 2787
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 1242 transition count 2723
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 1242 transition count 2723
Applied a total of 86 rules in 202 ms. Remains 1242 /1285 variables (removed 43) and now considering 2723/2906 (removed 183) transitions.
[2023-03-24 00:11:14] [INFO ] Flow matrix only has 2451 transitions (discarded 272 similar events)
// Phase 1: matrix 2451 rows 1242 cols
[2023-03-24 00:11:14] [INFO ] Computed 64 place invariants in 34 ms
[2023-03-24 00:11:15] [INFO ] Implicit Places using invariants in 1070 ms returned [103, 110, 435, 503, 531, 551, 555, 604, 639, 685, 747, 807, 885, 929]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1076 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1228/1285 places, 2723/2906 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1216 transition count 2711
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1216 transition count 2711
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1204 transition count 2699
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1204 transition count 2699
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1192 transition count 2687
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1192 transition count 2687
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1182 transition count 2607
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1182 transition count 2607
Applied a total of 92 rules in 252 ms. Remains 1182 /1228 variables (removed 46) and now considering 2607/2723 (removed 116) transitions.
[2023-03-24 00:11:16] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1182 cols
[2023-03-24 00:11:16] [INFO ] Computed 50 place invariants in 24 ms
[2023-03-24 00:11:17] [INFO ] Implicit Places using invariants in 982 ms returned []
[2023-03-24 00:11:17] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2023-03-24 00:11:17] [INFO ] Invariant cache hit.
[2023-03-24 00:11:18] [INFO ] State equation strengthened by 853 read => feed constraints.
[2023-03-24 00:11:25] [INFO ] Implicit Places using invariants and state equation in 8193 ms returned []
Implicit Place search using SMT with State Equation took 9177 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1182/1285 places, 2607/2906 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10711 ms. Remains : 1182/1285 places, 2607/2906 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s454 1) (LT s1119 1)), p0:(OR (LT s134 1) (LT s171 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1205 reset in 539 ms.
Product exploration explored 100000 steps with 1204 reset in 477 ms.
Computed a total of 350 stabilizing places and 974 stable transitions
Computed a total of 350 stabilizing places and 974 stable transitions
Detected a total of 350/1182 stabilizing places and 974/2607 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 00:11:27] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2023-03-24 00:11:27] [INFO ] Invariant cache hit.
[2023-03-24 00:11:27] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2023-03-24 00:11:27] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 19 ms returned sat
[2023-03-24 00:11:28] [INFO ] After 1187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 00:11:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-24 00:11:28] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 10 ms returned sat
[2023-03-24 00:11:29] [INFO ] After 759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 00:11:29] [INFO ] State equation strengthened by 853 read => feed constraints.
[2023-03-24 00:11:29] [INFO ] After 191ms SMT Verify possible using 853 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 00:11:29] [INFO ] Deduced a trap composed of 210 places in 482 ms of which 1 ms to minimize.
[2023-03-24 00:11:30] [INFO ] Deduced a trap composed of 73 places in 503 ms of which 1 ms to minimize.
[2023-03-24 00:11:31] [INFO ] Deduced a trap composed of 91 places in 518 ms of which 1 ms to minimize.
[2023-03-24 00:11:31] [INFO ] Deduced a trap composed of 108 places in 534 ms of which 1 ms to minimize.
[2023-03-24 00:11:32] [INFO ] Deduced a trap composed of 112 places in 492 ms of which 1 ms to minimize.
[2023-03-24 00:11:32] [INFO ] Deduced a trap composed of 144 places in 488 ms of which 1 ms to minimize.
[2023-03-24 00:11:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3683 ms
[2023-03-24 00:11:33] [INFO ] After 3935ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-24 00:11:33] [INFO ] After 4955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1182 transition count 2576
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1151 transition count 2576
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 62 place count 1151 transition count 2560
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 94 place count 1135 transition count 2560
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 1134 transition count 2552
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 1134 transition count 2552
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 132 place count 1116 transition count 2534
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 2 with 133 rules applied. Total rules applied 265 place count 1116 transition count 4277
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 2 with 133 rules applied. Total rules applied 398 place count 983 transition count 4277
Applied a total of 398 rules in 401 ms. Remains 983 /1182 variables (removed 199) and now considering 4277/2607 (removed -1670) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 983/1182 places, 4277/2607 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Finished Best-First random walk after 4450 steps, including 13 resets, run visited all 1 properties in 17 ms. (steps per millisecond=261 )
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Applied a total of 0 rules in 45 ms. Remains 1182 /1182 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
[2023-03-24 00:11:34] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2023-03-24 00:11:34] [INFO ] Invariant cache hit.
[2023-03-24 00:11:35] [INFO ] Implicit Places using invariants in 918 ms returned []
[2023-03-24 00:11:35] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2023-03-24 00:11:35] [INFO ] Invariant cache hit.
[2023-03-24 00:11:36] [INFO ] State equation strengthened by 853 read => feed constraints.
[2023-03-24 00:11:43] [INFO ] Implicit Places using invariants and state equation in 7709 ms returned []
Implicit Place search using SMT with State Equation took 8642 ms to find 0 implicit places.
[2023-03-24 00:11:43] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2023-03-24 00:11:43] [INFO ] Invariant cache hit.
[2023-03-24 00:11:44] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9818 ms. Remains : 1182/1182 places, 2607/2607 transitions.
Computed a total of 350 stabilizing places and 974 stable transitions
Computed a total of 350 stabilizing places and 974 stable transitions
Detected a total of 350/1182 stabilizing places and 974/2607 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 258 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 00:11:44] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2023-03-24 00:11:44] [INFO ] Invariant cache hit.
[2023-03-24 00:11:44] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2023-03-24 00:11:44] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 11 ms returned sat
[2023-03-24 00:11:45] [INFO ] After 802ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 00:11:45] [INFO ] State equation strengthened by 853 read => feed constraints.
[2023-03-24 00:11:45] [INFO ] After 213ms SMT Verify possible using 853 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 00:11:45] [INFO ] After 1201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 00:11:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-24 00:11:46] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 10 ms returned sat
[2023-03-24 00:11:46] [INFO ] After 794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 00:11:47] [INFO ] After 200ms SMT Verify possible using 853 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 00:11:47] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-24 00:11:47] [INFO ] After 1363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1182 transition count 2576
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1151 transition count 2576
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 62 place count 1151 transition count 2559
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 96 place count 1134 transition count 2559
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 1133 transition count 2558
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 1133 transition count 2558
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 98 place count 1133 transition count 2557
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 1132 transition count 2557
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 1131 transition count 2549
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 1131 transition count 2549
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 136 place count 1114 transition count 2532
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 2 with 132 rules applied. Total rules applied 268 place count 1114 transition count 4276
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 400 place count 982 transition count 4276
Applied a total of 400 rules in 397 ms. Remains 982 /1182 variables (removed 200) and now considering 4276/2607 (removed -1669) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 982/1182 places, 4276/2607 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 65696 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65696 steps, saw 27711 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 00:11:50] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
// Phase 1: matrix 3878 rows 982 cols
[2023-03-24 00:11:50] [INFO ] Computed 50 place invariants in 31 ms
[2023-03-24 00:11:51] [INFO ] [Real]Absence check using 31 positive place invariants in 41 ms returned sat
[2023-03-24 00:11:51] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2023-03-24 00:11:52] [INFO ] After 1224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 00:11:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-24 00:11:52] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-24 00:11:53] [INFO ] After 1084ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 00:11:53] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:11:54] [INFO ] After 565ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 00:11:54] [INFO ] After 722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-24 00:11:54] [INFO ] After 2091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 982 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4276/4276 transitions.
Applied a total of 0 rules in 120 ms. Remains 982 /982 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 982/982 places, 4276/4276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4276/4276 transitions.
Applied a total of 0 rules in 112 ms. Remains 982 /982 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
[2023-03-24 00:11:54] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
[2023-03-24 00:11:54] [INFO ] Invariant cache hit.
[2023-03-24 00:11:55] [INFO ] Implicit Places using invariants in 1174 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1196 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 981/982 places, 4276/4276 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 980 transition count 4275
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 980 transition count 4275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 979 transition count 4274
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 979 transition count 4274
Applied a total of 4 rules in 195 ms. Remains 979 /981 variables (removed 2) and now considering 4274/4276 (removed 2) transitions.
[2023-03-24 00:11:55] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
// Phase 1: matrix 3876 rows 979 cols
[2023-03-24 00:11:55] [INFO ] Computed 49 place invariants in 27 ms
[2023-03-24 00:11:57] [INFO ] Implicit Places using invariants in 1222 ms returned []
[2023-03-24 00:11:57] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2023-03-24 00:11:57] [INFO ] Invariant cache hit.
[2023-03-24 00:11:58] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:12:19] [INFO ] Implicit Places using invariants and state equation in 22759 ms returned []
Implicit Place search using SMT with State Equation took 23996 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/982 places, 4274/4276 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25500 ms. Remains : 979/982 places, 4274/4276 transitions.
Finished random walk after 1433 steps, including 30 resets, run visited all 1 properties in 28 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1205 reset in 411 ms.
Product exploration explored 100000 steps with 1204 reset in 439 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1182 transition count 2607
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 31 place count 1182 transition count 2607
Deduced a syphon composed of 47 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 47 place count 1182 transition count 2607
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 1167 transition count 2592
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 1167 transition count 2592
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 95 place count 1167 transition count 2592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 1166 transition count 2591
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 1166 transition count 2591
Deduced a syphon composed of 49 places in 2 ms
Applied a total of 97 rules in 546 ms. Remains 1166 /1182 variables (removed 16) and now considering 2591/2607 (removed 16) transitions.
[2023-03-24 00:12:22] [INFO ] Redundant transitions in 269 ms returned []
[2023-03-24 00:12:22] [INFO ] Flow matrix only has 2319 transitions (discarded 272 similar events)
// Phase 1: matrix 2319 rows 1166 cols
[2023-03-24 00:12:22] [INFO ] Computed 50 place invariants in 30 ms
[2023-03-24 00:12:23] [INFO ] Dead Transitions using invariants and state equation in 1396 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1166/1182 places, 2591/2607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2248 ms. Remains : 1166/1182 places, 2591/2607 transitions.
Support contains 4 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Applied a total of 0 rules in 39 ms. Remains 1182 /1182 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
[2023-03-24 00:12:23] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1182 cols
[2023-03-24 00:12:23] [INFO ] Computed 50 place invariants in 18 ms
[2023-03-24 00:12:25] [INFO ] Implicit Places using invariants in 1173 ms returned []
[2023-03-24 00:12:25] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2023-03-24 00:12:25] [INFO ] Invariant cache hit.
[2023-03-24 00:12:25] [INFO ] State equation strengthened by 853 read => feed constraints.
[2023-03-24 00:12:32] [INFO ] Implicit Places using invariants and state equation in 7777 ms returned []
Implicit Place search using SMT with State Equation took 8952 ms to find 0 implicit places.
[2023-03-24 00:12:32] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2023-03-24 00:12:32] [INFO ] Invariant cache hit.
[2023-03-24 00:12:33] [INFO ] Dead Transitions using invariants and state equation in 1110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10112 ms. Remains : 1182/1182 places, 2607/2607 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 finished in 79746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G(p1))))'
Support contains 4 out of 1285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1264 transition count 2850
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1264 transition count 2850
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 58 place count 1248 transition count 2778
Iterating global reduction 0 with 16 rules applied. Total rules applied 74 place count 1248 transition count 2778
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 1240 transition count 2714
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 1240 transition count 2714
Applied a total of 90 rules in 173 ms. Remains 1240 /1285 variables (removed 45) and now considering 2714/2906 (removed 192) transitions.
[2023-03-24 00:12:34] [INFO ] Flow matrix only has 2442 transitions (discarded 272 similar events)
// Phase 1: matrix 2442 rows 1240 cols
[2023-03-24 00:12:34] [INFO ] Computed 64 place invariants in 36 ms
[2023-03-24 00:12:35] [INFO ] Implicit Places using invariants in 1133 ms returned [103, 106, 110, 433, 500, 528, 548, 552, 602, 637, 683, 745, 805, 883, 927]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1155 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1225/1285 places, 2714/2906 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1212 transition count 2701
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1212 transition count 2701
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1199 transition count 2688
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1199 transition count 2688
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1186 transition count 2675
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1186 transition count 2675
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 1175 transition count 2587
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 1175 transition count 2587
Applied a total of 100 rules in 194 ms. Remains 1175 /1225 variables (removed 50) and now considering 2587/2714 (removed 127) transitions.
[2023-03-24 00:12:35] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1175 cols
[2023-03-24 00:12:36] [INFO ] Computed 49 place invariants in 16 ms
[2023-03-24 00:12:36] [INFO ] Implicit Places using invariants in 987 ms returned []
[2023-03-24 00:12:36] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
[2023-03-24 00:12:36] [INFO ] Invariant cache hit.
[2023-03-24 00:12:37] [INFO ] State equation strengthened by 839 read => feed constraints.
[2023-03-24 00:12:47] [INFO ] Implicit Places using invariants and state equation in 10130 ms returned [1132]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1174/1285 places, 2587/2906 transitions.
Applied a total of 0 rules in 39 ms. Remains 1174 /1174 variables (removed 0) and now considering 2587/2587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12696 ms. Remains : 1174/1285 places, 2587/2906 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s567 1) (LT s1139 1)), p0:(AND (GEQ s645 1) (GEQ s760 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07 finished in 12885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 4 out of 1285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1264 transition count 2843
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1264 transition count 2843
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 57 place count 1249 transition count 2779
Iterating global reduction 0 with 15 rules applied. Total rules applied 72 place count 1249 transition count 2779
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 1241 transition count 2715
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 1241 transition count 2715
Applied a total of 88 rules in 156 ms. Remains 1241 /1285 variables (removed 44) and now considering 2715/2906 (removed 191) transitions.
[2023-03-24 00:12:47] [INFO ] Flow matrix only has 2443 transitions (discarded 272 similar events)
// Phase 1: matrix 2443 rows 1241 cols
[2023-03-24 00:12:47] [INFO ] Computed 64 place invariants in 23 ms
[2023-03-24 00:12:48] [INFO ] Implicit Places using invariants in 1098 ms returned [103, 106, 110, 433, 500, 528, 554, 603, 638, 684, 746, 806, 884, 928]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1100 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1227/1285 places, 2715/2906 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1215 transition count 2703
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1215 transition count 2703
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1203 transition count 2691
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1203 transition count 2691
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1191 transition count 2679
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1191 transition count 2679
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1181 transition count 2599
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1181 transition count 2599
Applied a total of 92 rules in 191 ms. Remains 1181 /1227 variables (removed 46) and now considering 2599/2715 (removed 116) transitions.
[2023-03-24 00:12:48] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1181 cols
[2023-03-24 00:12:48] [INFO ] Computed 50 place invariants in 28 ms
[2023-03-24 00:12:49] [INFO ] Implicit Places using invariants in 966 ms returned []
[2023-03-24 00:12:49] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
[2023-03-24 00:12:49] [INFO ] Invariant cache hit.
[2023-03-24 00:12:50] [INFO ] State equation strengthened by 846 read => feed constraints.
[2023-03-24 00:12:57] [INFO ] Implicit Places using invariants and state equation in 7625 ms returned []
Implicit Place search using SMT with State Equation took 8612 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1181/1285 places, 2599/2906 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10059 ms. Remains : 1181/1285 places, 2599/2906 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s507 1) (GEQ s622 1)), p1:(AND (GEQ s534 1) (GEQ s552 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 finished in 10215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 4 out of 1285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1285 transition count 2878
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1257 transition count 2878
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 56 place count 1257 transition count 2853
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 106 place count 1232 transition count 2853
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 121 place count 1217 transition count 2803
Iterating global reduction 2 with 15 rules applied. Total rules applied 136 place count 1217 transition count 2803
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 136 place count 1217 transition count 2801
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 1215 transition count 2801
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 150 place count 1205 transition count 2735
Iterating global reduction 2 with 10 rules applied. Total rules applied 160 place count 1205 transition count 2735
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 162 place count 1203 transition count 2719
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 1203 transition count 2719
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 222 place count 1174 transition count 2690
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 228 place count 1168 transition count 2684
Iterating global reduction 2 with 6 rules applied. Total rules applied 234 place count 1168 transition count 2684
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 240 place count 1162 transition count 2636
Iterating global reduction 2 with 6 rules applied. Total rules applied 246 place count 1162 transition count 2636
Applied a total of 246 rules in 394 ms. Remains 1162 /1285 variables (removed 123) and now considering 2636/2906 (removed 270) transitions.
[2023-03-24 00:12:57] [INFO ] Flow matrix only has 2364 transitions (discarded 272 similar events)
// Phase 1: matrix 2364 rows 1162 cols
[2023-03-24 00:12:57] [INFO ] Computed 64 place invariants in 24 ms
[2023-03-24 00:12:58] [INFO ] Implicit Places using invariants in 1024 ms returned [93, 94, 95, 395, 460, 487, 505, 509, 555, 588, 631, 691, 749, 825, 867]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1026 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1147/1285 places, 2636/2906 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1140 transition count 2629
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1140 transition count 2629
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1133 transition count 2622
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1133 transition count 2622
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1128 transition count 2582
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1128 transition count 2582
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 1122 transition count 2576
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 1116 transition count 2570
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 1116 transition count 2570
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 1110 transition count 2522
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 1110 transition count 2522
Applied a total of 74 rules in 307 ms. Remains 1110 /1147 variables (removed 37) and now considering 2522/2636 (removed 114) transitions.
[2023-03-24 00:12:59] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2023-03-24 00:12:59] [INFO ] Computed 49 place invariants in 26 ms
[2023-03-24 00:13:00] [INFO ] Implicit Places using invariants in 926 ms returned []
[2023-03-24 00:13:00] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2023-03-24 00:13:00] [INFO ] Invariant cache hit.
[2023-03-24 00:13:00] [INFO ] State equation strengthened by 839 read => feed constraints.
[2023-03-24 00:13:08] [INFO ] Implicit Places using invariants and state equation in 8198 ms returned []
Implicit Place search using SMT with State Equation took 9144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1110/1285 places, 2522/2906 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10873 ms. Remains : 1110/1285 places, 2522/2906 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s346 1) (GEQ s1082 1)), p1:(AND (GEQ s452 1) (GEQ s733 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09 finished in 10995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||X(p1)))))))'
Support contains 4 out of 1285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1264 transition count 2850
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1264 transition count 2850
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 58 place count 1248 transition count 2778
Iterating global reduction 0 with 16 rules applied. Total rules applied 74 place count 1248 transition count 2778
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 1240 transition count 2714
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 1240 transition count 2714
Applied a total of 90 rules in 157 ms. Remains 1240 /1285 variables (removed 45) and now considering 2714/2906 (removed 192) transitions.
[2023-03-24 00:13:08] [INFO ] Flow matrix only has 2442 transitions (discarded 272 similar events)
// Phase 1: matrix 2442 rows 1240 cols
[2023-03-24 00:13:08] [INFO ] Computed 64 place invariants in 32 ms
[2023-03-24 00:13:09] [INFO ] Implicit Places using invariants in 1041 ms returned [103, 106, 110, 433, 500, 528, 548, 552, 601, 636, 682, 745, 805, 883, 927]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1045 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1225/1285 places, 2714/2906 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1212 transition count 2701
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1212 transition count 2701
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1199 transition count 2688
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1199 transition count 2688
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1186 transition count 2675
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1186 transition count 2675
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 1175 transition count 2587
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 1175 transition count 2587
Applied a total of 100 rules in 201 ms. Remains 1175 /1225 variables (removed 50) and now considering 2587/2714 (removed 127) transitions.
[2023-03-24 00:13:09] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1175 cols
[2023-03-24 00:13:09] [INFO ] Computed 49 place invariants in 24 ms
[2023-03-24 00:13:10] [INFO ] Implicit Places using invariants in 970 ms returned []
[2023-03-24 00:13:10] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
[2023-03-24 00:13:10] [INFO ] Invariant cache hit.
[2023-03-24 00:13:11] [INFO ] State equation strengthened by 839 read => feed constraints.
[2023-03-24 00:13:21] [INFO ] Implicit Places using invariants and state equation in 10229 ms returned [1156]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11204 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1174/1285 places, 2587/2906 transitions.
Applied a total of 0 rules in 40 ms. Remains 1174 /1174 variables (removed 0) and now considering 2587/2587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12647 ms. Remains : 1174/1285 places, 2587/2906 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s348 1) (GEQ s440 1)), p0:(AND (GEQ s685 1) (GEQ s1119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10 finished in 12846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1264 transition count 2843
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1264 transition count 2843
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 57 place count 1249 transition count 2779
Iterating global reduction 0 with 15 rules applied. Total rules applied 72 place count 1249 transition count 2779
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 1241 transition count 2715
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 1241 transition count 2715
Applied a total of 88 rules in 156 ms. Remains 1241 /1285 variables (removed 44) and now considering 2715/2906 (removed 191) transitions.
[2023-03-24 00:13:21] [INFO ] Flow matrix only has 2443 transitions (discarded 272 similar events)
// Phase 1: matrix 2443 rows 1241 cols
[2023-03-24 00:13:21] [INFO ] Computed 64 place invariants in 33 ms
[2023-03-24 00:13:22] [INFO ] Implicit Places using invariants in 1066 ms returned [103, 106, 110, 433, 500, 528, 548, 552, 601, 636, 682, 806, 884, 928]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1079 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1227/1285 places, 2715/2906 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1215 transition count 2703
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1215 transition count 2703
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1203 transition count 2691
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1203 transition count 2691
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1191 transition count 2679
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1191 transition count 2679
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1181 transition count 2599
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1181 transition count 2599
Applied a total of 92 rules in 194 ms. Remains 1181 /1227 variables (removed 46) and now considering 2599/2715 (removed 116) transitions.
[2023-03-24 00:13:22] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1181 cols
[2023-03-24 00:13:22] [INFO ] Computed 50 place invariants in 24 ms
[2023-03-24 00:13:23] [INFO ] Implicit Places using invariants in 939 ms returned []
[2023-03-24 00:13:23] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
[2023-03-24 00:13:23] [INFO ] Invariant cache hit.
[2023-03-24 00:13:24] [INFO ] State equation strengthened by 846 read => feed constraints.
[2023-03-24 00:13:34] [INFO ] Implicit Places using invariants and state equation in 11177 ms returned [1137]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1180/1285 places, 2599/2906 transitions.
Applied a total of 0 rules in 37 ms. Remains 1180 /1180 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13604 ms. Remains : 1180/1285 places, 2599/2906 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s720 1) (GEQ s728 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 finished in 13691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((F(p1)&&F(p2)&&p0))) U G(p3)))'
Support contains 5 out of 1285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1285 transition count 2879
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1258 transition count 2879
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 54 place count 1258 transition count 2855
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 102 place count 1234 transition count 2855
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 117 place count 1219 transition count 2798
Iterating global reduction 2 with 15 rules applied. Total rules applied 132 place count 1219 transition count 2798
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 132 place count 1219 transition count 2796
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 1217 transition count 2796
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 145 place count 1208 transition count 2738
Iterating global reduction 2 with 9 rules applied. Total rules applied 154 place count 1208 transition count 2738
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 156 place count 1206 transition count 2722
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 1206 transition count 2722
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 214 place count 1178 transition count 2694
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 219 place count 1173 transition count 2689
Iterating global reduction 2 with 5 rules applied. Total rules applied 224 place count 1173 transition count 2689
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 229 place count 1168 transition count 2649
Iterating global reduction 2 with 5 rules applied. Total rules applied 234 place count 1168 transition count 2649
Applied a total of 234 rules in 391 ms. Remains 1168 /1285 variables (removed 117) and now considering 2649/2906 (removed 257) transitions.
[2023-03-24 00:13:35] [INFO ] Flow matrix only has 2377 transitions (discarded 272 similar events)
// Phase 1: matrix 2377 rows 1168 cols
[2023-03-24 00:13:35] [INFO ] Computed 64 place invariants in 25 ms
[2023-03-24 00:13:36] [INFO ] Implicit Places using invariants in 1077 ms returned [93, 94, 95, 394, 459, 486, 505, 509, 555, 634, 694, 752, 828]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1079 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1155/1285 places, 2649/2906 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1149 transition count 2643
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1149 transition count 2643
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1143 transition count 2637
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1143 transition count 2637
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1139 transition count 2605
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1139 transition count 2605
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 1134 transition count 2600
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 1129 transition count 2595
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 1129 transition count 2595
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1124 transition count 2555
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1124 transition count 2555
Applied a total of 62 rules in 341 ms. Remains 1124 /1155 variables (removed 31) and now considering 2555/2649 (removed 94) transitions.
[2023-03-24 00:13:36] [INFO ] Flow matrix only has 2283 transitions (discarded 272 similar events)
// Phase 1: matrix 2283 rows 1124 cols
[2023-03-24 00:13:36] [INFO ] Computed 51 place invariants in 24 ms
[2023-03-24 00:13:37] [INFO ] Implicit Places using invariants in 940 ms returned []
[2023-03-24 00:13:37] [INFO ] Flow matrix only has 2283 transitions (discarded 272 similar events)
[2023-03-24 00:13:37] [INFO ] Invariant cache hit.
[2023-03-24 00:13:38] [INFO ] State equation strengthened by 860 read => feed constraints.
[2023-03-24 00:13:46] [INFO ] Implicit Places using invariants and state equation in 9027 ms returned []
Implicit Place search using SMT with State Equation took 10009 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1124/1285 places, 2555/2906 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11821 ms. Remains : 1124/1285 places, 2555/2906 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p3), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s570 1) (GEQ s578 1)), p0:(AND (GEQ s486 1) (GEQ s768 1)), p1:(LT s841 1), p2:(AND (GEQ s486 1) (GEQ s768 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 finished in 12015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p1&&X((G(!p0)||(!p0&&G(F(p2)))))))))'
Support contains 5 out of 1285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1265 transition count 2851
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1265 transition count 2851
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 55 place count 1250 transition count 2780
Iterating global reduction 0 with 15 rules applied. Total rules applied 70 place count 1250 transition count 2780
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 1243 transition count 2724
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 1243 transition count 2724
Applied a total of 84 rules in 159 ms. Remains 1243 /1285 variables (removed 42) and now considering 2724/2906 (removed 182) transitions.
[2023-03-24 00:13:47] [INFO ] Flow matrix only has 2452 transitions (discarded 272 similar events)
// Phase 1: matrix 2452 rows 1243 cols
[2023-03-24 00:13:47] [INFO ] Computed 64 place invariants in 33 ms
[2023-03-24 00:13:48] [INFO ] Implicit Places using invariants in 1047 ms returned [103, 106, 110, 435, 502, 530, 550, 554, 603, 638, 684, 746, 806, 884, 928]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1063 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1228/1285 places, 2724/2906 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1215 transition count 2711
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1215 transition count 2711
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1202 transition count 2698
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1202 transition count 2698
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1189 transition count 2685
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1189 transition count 2685
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 1178 transition count 2597
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 1178 transition count 2597
Applied a total of 100 rules in 196 ms. Remains 1178 /1228 variables (removed 50) and now considering 2597/2724 (removed 127) transitions.
[2023-03-24 00:13:48] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
// Phase 1: matrix 2325 rows 1178 cols
[2023-03-24 00:13:48] [INFO ] Computed 49 place invariants in 19 ms
[2023-03-24 00:13:49] [INFO ] Implicit Places using invariants in 943 ms returned []
[2023-03-24 00:13:49] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
[2023-03-24 00:13:49] [INFO ] Invariant cache hit.
[2023-03-24 00:13:50] [INFO ] State equation strengthened by 846 read => feed constraints.
[2023-03-24 00:13:59] [INFO ] Implicit Places using invariants and state equation in 10040 ms returned []
Implicit Place search using SMT with State Equation took 11000 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1178/1285 places, 2597/2906 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12419 ms. Remains : 1178/1285 places, 2597/2906 transitions.
Stuttering acceptance computed with spot in 142 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s880 1) (GEQ s1118 1) (GEQ s1148 1)) (AND (GEQ s880 1) (GEQ s1118 1))), p0:(AND (GEQ s880 1) (GEQ s1118 1)), p2:(AND (GEQ s489 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1203 reset in 424 ms.
Product exploration explored 100000 steps with 1205 reset in 449 ms.
Computed a total of 346 stabilizing places and 964 stable transitions
Computed a total of 346 stabilizing places and 964 stable transitions
Detected a total of 346/1178 stabilizing places and 964/2597 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 823 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 00:14:01] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
[2023-03-24 00:14:01] [INFO ] Invariant cache hit.
[2023-03-24 00:14:02] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 17 factoid took 962 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 168 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 5 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 2597/2597 transitions.
Applied a total of 0 rules in 36 ms. Remains 1178 /1178 variables (removed 0) and now considering 2597/2597 (removed 0) transitions.
[2023-03-24 00:14:03] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
[2023-03-24 00:14:03] [INFO ] Invariant cache hit.
[2023-03-24 00:14:04] [INFO ] Implicit Places using invariants in 931 ms returned []
[2023-03-24 00:14:04] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
[2023-03-24 00:14:04] [INFO ] Invariant cache hit.
[2023-03-24 00:14:05] [INFO ] State equation strengthened by 846 read => feed constraints.
[2023-03-24 00:14:14] [INFO ] Implicit Places using invariants and state equation in 10527 ms returned []
Implicit Place search using SMT with State Equation took 11490 ms to find 0 implicit places.
[2023-03-24 00:14:14] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
[2023-03-24 00:14:14] [INFO ] Invariant cache hit.
[2023-03-24 00:14:15] [INFO ] Dead Transitions using invariants and state equation in 1073 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12599 ms. Remains : 1178/1178 places, 2597/2597 transitions.
Computed a total of 346 stabilizing places and 964 stable transitions
Computed a total of 346 stabilizing places and 964 stable transitions
Detected a total of 346/1178 stabilizing places and 964/2597 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 383 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Finished random walk after 2539 steps, including 30 resets, run visited all 4 properties in 59 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (AND p0 (NOT p2))), (F p1)]
Knowledge based reduction with 9 factoid took 435 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1204 reset in 431 ms.
Product exploration explored 100000 steps with 1205 reset in 464 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 141 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 5 out of 1178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1178/1178 places, 2597/2597 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1178 transition count 2597
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 31 place count 1178 transition count 2597
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 47 place count 1178 transition count 2597
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 1163 transition count 2582
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 1163 transition count 2582
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 95 place count 1163 transition count 2582
Deduced a syphon composed of 50 places in 1 ms
Applied a total of 95 rules in 176 ms. Remains 1163 /1178 variables (removed 15) and now considering 2582/2597 (removed 15) transitions.
[2023-03-24 00:14:18] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-24 00:14:18] [INFO ] Flow matrix only has 2310 transitions (discarded 272 similar events)
// Phase 1: matrix 2310 rows 1163 cols
[2023-03-24 00:14:18] [INFO ] Computed 49 place invariants in 23 ms
[2023-03-24 00:14:20] [INFO ] Dead Transitions using invariants and state equation in 1104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1163/1178 places, 2582/2597 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1388 ms. Remains : 1163/1178 places, 2582/2597 transitions.
Support contains 5 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 2597/2597 transitions.
Applied a total of 0 rules in 37 ms. Remains 1178 /1178 variables (removed 0) and now considering 2597/2597 (removed 0) transitions.
[2023-03-24 00:14:20] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
// Phase 1: matrix 2325 rows 1178 cols
[2023-03-24 00:14:20] [INFO ] Computed 49 place invariants in 24 ms
[2023-03-24 00:14:21] [INFO ] Implicit Places using invariants in 979 ms returned []
[2023-03-24 00:14:21] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
[2023-03-24 00:14:21] [INFO ] Invariant cache hit.
[2023-03-24 00:14:21] [INFO ] State equation strengthened by 846 read => feed constraints.
[2023-03-24 00:14:31] [INFO ] Implicit Places using invariants and state equation in 10065 ms returned []
Implicit Place search using SMT with State Equation took 11058 ms to find 0 implicit places.
[2023-03-24 00:14:31] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
[2023-03-24 00:14:31] [INFO ] Invariant cache hit.
[2023-03-24 00:14:32] [INFO ] Dead Transitions using invariants and state equation in 1340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12436 ms. Remains : 1178/1178 places, 2597/2597 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 finished in 45540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1||(G((X(X(G(p3)))&&p2)) U p0))))'
Support contains 6 out of 1285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1265 transition count 2844
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1265 transition count 2844
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 1251 transition count 2788
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 1251 transition count 2788
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 1243 transition count 2724
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 1243 transition count 2724
Applied a total of 84 rules in 157 ms. Remains 1243 /1285 variables (removed 42) and now considering 2724/2906 (removed 182) transitions.
[2023-03-24 00:14:32] [INFO ] Flow matrix only has 2452 transitions (discarded 272 similar events)
// Phase 1: matrix 2452 rows 1243 cols
[2023-03-24 00:14:32] [INFO ] Computed 64 place invariants in 31 ms
[2023-03-24 00:14:33] [INFO ] Implicit Places using invariants in 1032 ms returned [106, 110, 435, 504, 532, 552, 556, 605, 640, 686, 748, 808, 886, 930]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1035 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1229/1285 places, 2724/2906 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1217 transition count 2712
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1217 transition count 2712
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1205 transition count 2700
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1205 transition count 2700
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1193 transition count 2688
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1193 transition count 2688
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1183 transition count 2608
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1183 transition count 2608
Applied a total of 92 rules in 190 ms. Remains 1183 /1229 variables (removed 46) and now considering 2608/2724 (removed 116) transitions.
[2023-03-24 00:14:34] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
// Phase 1: matrix 2336 rows 1183 cols
[2023-03-24 00:14:34] [INFO ] Computed 50 place invariants in 31 ms
[2023-03-24 00:14:35] [INFO ] Implicit Places using invariants in 1003 ms returned []
[2023-03-24 00:14:35] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
[2023-03-24 00:14:35] [INFO ] Invariant cache hit.
[2023-03-24 00:14:35] [INFO ] State equation strengthened by 853 read => feed constraints.
[2023-03-24 00:14:44] [INFO ] Implicit Places using invariants and state equation in 9541 ms returned []
Implicit Place search using SMT with State Equation took 10545 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1183/1285 places, 2608/2906 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11927 ms. Remains : 1183/1285 places, 2608/2906 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (OR (NOT p2) (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p2 p3), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2 p3), acceptance={0} source=4 dest: 5}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND p2 p3), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(AND (GEQ s298 1) (GEQ s445 1)), p0:(AND (GEQ s492 1) (GEQ s1145 1)), p2:(AND (GEQ s154 1) (GEQ s163 1)), p3:(AND (GEQ s154 1) (GEQ s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15 finished in 12236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1285 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1285 transition count 2878
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1257 transition count 2878
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 56 place count 1257 transition count 2854
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 104 place count 1233 transition count 2854
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 118 place count 1219 transition count 2805
Iterating global reduction 2 with 14 rules applied. Total rules applied 132 place count 1219 transition count 2805
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 132 place count 1219 transition count 2804
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 1218 transition count 2804
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 143 place count 1209 transition count 2746
Iterating global reduction 2 with 9 rules applied. Total rules applied 152 place count 1209 transition count 2746
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 1207 transition count 2730
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 1207 transition count 2730
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 216 place count 1177 transition count 2700
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 222 place count 1171 transition count 2694
Iterating global reduction 2 with 6 rules applied. Total rules applied 228 place count 1171 transition count 2694
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 1165 transition count 2646
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 1165 transition count 2646
Applied a total of 240 rules in 430 ms. Remains 1165 /1285 variables (removed 120) and now considering 2646/2906 (removed 260) transitions.
[2023-03-24 00:14:45] [INFO ] Flow matrix only has 2374 transitions (discarded 272 similar events)
// Phase 1: matrix 2374 rows 1165 cols
[2023-03-24 00:14:45] [INFO ] Computed 64 place invariants in 31 ms
[2023-03-24 00:14:46] [INFO ] Implicit Places using invariants in 1137 ms returned [93, 96, 398, 464, 491, 509, 513, 559, 592, 635, 695, 753, 829, 871]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1153 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1151/1285 places, 2646/2906 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1146 transition count 2641
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1146 transition count 2641
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 1141 transition count 2636
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 1141 transition count 2636
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 1138 transition count 2612
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 1138 transition count 2612
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 40 place count 1131 transition count 2605
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 1124 transition count 2598
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 1124 transition count 2598
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 1117 transition count 2542
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 1117 transition count 2542
Applied a total of 68 rules in 314 ms. Remains 1117 /1151 variables (removed 34) and now considering 2542/2646 (removed 104) transitions.
[2023-03-24 00:14:46] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2023-03-24 00:14:47] [INFO ] Computed 50 place invariants in 28 ms
[2023-03-24 00:14:47] [INFO ] Implicit Places using invariants in 966 ms returned []
[2023-03-24 00:14:47] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2023-03-24 00:14:47] [INFO ] Invariant cache hit.
[2023-03-24 00:14:48] [INFO ] State equation strengthened by 853 read => feed constraints.
[2023-03-24 00:14:57] [INFO ] Implicit Places using invariants and state equation in 9348 ms returned []
Implicit Place search using SMT with State Equation took 10329 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1117/1285 places, 2542/2906 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 12237 ms. Remains : 1117/1285 places, 2542/2906 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s418 1) (LT s1071 1)), p0:(OR (LT s118 1) (LT s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1710 reset in 510 ms.
Product exploration explored 100000 steps with 1709 reset in 531 ms.
Computed a total of 302 stabilizing places and 926 stable transitions
Computed a total of 302 stabilizing places and 926 stable transitions
Detected a total of 302/1117 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 00:14:58] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2023-03-24 00:14:58] [INFO ] Invariant cache hit.
[2023-03-24 00:14:58] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2023-03-24 00:14:58] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-24 00:14:59] [INFO ] After 898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 00:14:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-24 00:14:59] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 11 ms returned sat
[2023-03-24 00:15:00] [INFO ] After 703ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 00:15:00] [INFO ] State equation strengthened by 853 read => feed constraints.
[2023-03-24 00:15:00] [INFO ] After 145ms SMT Verify possible using 853 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 00:15:01] [INFO ] Deduced a trap composed of 64 places in 454 ms of which 1 ms to minimize.
[2023-03-24 00:15:01] [INFO ] Deduced a trap composed of 78 places in 458 ms of which 1 ms to minimize.
[2023-03-24 00:15:02] [INFO ] Deduced a trap composed of 65 places in 472 ms of which 1 ms to minimize.
[2023-03-24 00:15:02] [INFO ] Deduced a trap composed of 261 places in 467 ms of which 1 ms to minimize.
[2023-03-24 00:15:03] [INFO ] Deduced a trap composed of 299 places in 468 ms of which 1 ms to minimize.
[2023-03-24 00:15:04] [INFO ] Deduced a trap composed of 67 places in 446 ms of which 1 ms to minimize.
[2023-03-24 00:15:04] [INFO ] Deduced a trap composed of 83 places in 455 ms of which 1 ms to minimize.
[2023-03-24 00:15:05] [INFO ] Deduced a trap composed of 305 places in 448 ms of which 1 ms to minimize.
[2023-03-24 00:15:05] [INFO ] Deduced a trap composed of 82 places in 505 ms of which 1 ms to minimize.
[2023-03-24 00:15:06] [INFO ] Deduced a trap composed of 87 places in 474 ms of which 1 ms to minimize.
[2023-03-24 00:15:06] [INFO ] Deduced a trap composed of 120 places in 477 ms of which 1 ms to minimize.
[2023-03-24 00:15:07] [INFO ] Deduced a trap composed of 90 places in 477 ms of which 1 ms to minimize.
[2023-03-24 00:15:07] [INFO ] Deduced a trap composed of 80 places in 464 ms of which 1 ms to minimize.
[2023-03-24 00:15:08] [INFO ] Deduced a trap composed of 92 places in 449 ms of which 1 ms to minimize.
[2023-03-24 00:15:09] [INFO ] Deduced a trap composed of 137 places in 447 ms of which 1 ms to minimize.
[2023-03-24 00:15:09] [INFO ] Deduced a trap composed of 99 places in 462 ms of which 1 ms to minimize.
[2023-03-24 00:15:10] [INFO ] Deduced a trap composed of 98 places in 456 ms of which 1 ms to minimize.
[2023-03-24 00:15:10] [INFO ] Deduced a trap composed of 101 places in 481 ms of which 1 ms to minimize.
[2023-03-24 00:15:11] [INFO ] Deduced a trap composed of 263 places in 452 ms of which 1 ms to minimize.
[2023-03-24 00:15:11] [INFO ] Deduced a trap composed of 69 places in 466 ms of which 1 ms to minimize.
[2023-03-24 00:15:12] [INFO ] Deduced a trap composed of 82 places in 475 ms of which 1 ms to minimize.
[2023-03-24 00:15:12] [INFO ] Deduced a trap composed of 295 places in 458 ms of which 1 ms to minimize.
[2023-03-24 00:15:13] [INFO ] Deduced a trap composed of 93 places in 458 ms of which 1 ms to minimize.
[2023-03-24 00:15:14] [INFO ] Deduced a trap composed of 92 places in 453 ms of which 1 ms to minimize.
[2023-03-24 00:15:14] [INFO ] Deduced a trap composed of 264 places in 485 ms of which 1 ms to minimize.
[2023-03-24 00:15:15] [INFO ] Deduced a trap composed of 80 places in 458 ms of which 1 ms to minimize.
[2023-03-24 00:15:16] [INFO ] Deduced a trap composed of 65 places in 464 ms of which 1 ms to minimize.
[2023-03-24 00:15:16] [INFO ] Deduced a trap composed of 110 places in 489 ms of which 1 ms to minimize.
[2023-03-24 00:15:17] [INFO ] Deduced a trap composed of 391 places in 458 ms of which 1 ms to minimize.
[2023-03-24 00:15:17] [INFO ] Deduced a trap composed of 76 places in 551 ms of which 1 ms to minimize.
[2023-03-24 00:15:18] [INFO ] Deduced a trap composed of 66 places in 467 ms of which 1 ms to minimize.
[2023-03-24 00:15:19] [INFO ] Deduced a trap composed of 67 places in 493 ms of which 1 ms to minimize.
[2023-03-24 00:15:19] [INFO ] Deduced a trap composed of 99 places in 472 ms of which 1 ms to minimize.
[2023-03-24 00:15:20] [INFO ] Deduced a trap composed of 76 places in 496 ms of which 1 ms to minimize.
[2023-03-24 00:15:21] [INFO ] Deduced a trap composed of 68 places in 465 ms of which 1 ms to minimize.
[2023-03-24 00:15:21] [INFO ] Deduced a trap composed of 90 places in 472 ms of which 1 ms to minimize.
[2023-03-24 00:15:22] [INFO ] Deduced a trap composed of 85 places in 465 ms of which 1 ms to minimize.
[2023-03-24 00:15:23] [INFO ] Deduced a trap composed of 78 places in 474 ms of which 1 ms to minimize.
[2023-03-24 00:15:23] [INFO ] Deduced a trap composed of 69 places in 469 ms of which 1 ms to minimize.
[2023-03-24 00:15:24] [INFO ] Deduced a trap composed of 70 places in 468 ms of which 0 ms to minimize.
[2023-03-24 00:15:24] [INFO ] Trap strengthening (SAT) tested/added 40/40 trap constraints in 23990 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 00:15:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:15:24] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1116 transition count 2534
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1116 transition count 2534
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 135 place count 1116 transition count 4277
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 268 place count 983 transition count 4277
Applied a total of 268 rules in 239 ms. Remains 983 /1117 variables (removed 134) and now considering 4277/2542 (removed -1735) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 983/1117 places, 4277/2542 transitions.
Incomplete random walk after 10000 steps, including 211 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 65630 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65630 steps, saw 27675 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 00:15:28] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2023-03-24 00:15:28] [INFO ] Computed 50 place invariants in 27 ms
[2023-03-24 00:15:28] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-24 00:15:28] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 10 ms returned sat
[2023-03-24 00:15:29] [INFO ] After 1139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 00:15:29] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2023-03-24 00:15:29] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 10 ms returned sat
[2023-03-24 00:15:30] [INFO ] After 947ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 00:15:30] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:15:31] [INFO ] After 545ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 00:15:31] [INFO ] Deduced a trap composed of 89 places in 601 ms of which 1 ms to minimize.
[2023-03-24 00:15:32] [INFO ] Deduced a trap composed of 157 places in 593 ms of which 14 ms to minimize.
[2023-03-24 00:15:33] [INFO ] Deduced a trap composed of 184 places in 601 ms of which 1 ms to minimize.
[2023-03-24 00:15:34] [INFO ] Deduced a trap composed of 154 places in 583 ms of which 1 ms to minimize.
[2023-03-24 00:15:34] [INFO ] Deduced a trap composed of 57 places in 585 ms of which 1 ms to minimize.
[2023-03-24 00:15:35] [INFO ] Deduced a trap composed of 210 places in 604 ms of which 1 ms to minimize.
[2023-03-24 00:15:36] [INFO ] Deduced a trap composed of 90 places in 588 ms of which 1 ms to minimize.
[2023-03-24 00:15:37] [INFO ] Deduced a trap composed of 69 places in 597 ms of which 1 ms to minimize.
[2023-03-24 00:15:38] [INFO ] Deduced a trap composed of 89 places in 618 ms of which 1 ms to minimize.
[2023-03-24 00:15:38] [INFO ] Deduced a trap composed of 94 places in 631 ms of which 1 ms to minimize.
[2023-03-24 00:15:39] [INFO ] Deduced a trap composed of 87 places in 605 ms of which 1 ms to minimize.
[2023-03-24 00:15:40] [INFO ] Deduced a trap composed of 74 places in 591 ms of which 1 ms to minimize.
[2023-03-24 00:15:40] [INFO ] Deduced a trap composed of 82 places in 607 ms of which 1 ms to minimize.
[2023-03-24 00:15:41] [INFO ] Deduced a trap composed of 71 places in 605 ms of which 1 ms to minimize.
[2023-03-24 00:15:42] [INFO ] Deduced a trap composed of 74 places in 600 ms of which 1 ms to minimize.
[2023-03-24 00:15:43] [INFO ] Deduced a trap composed of 71 places in 579 ms of which 1 ms to minimize.
[2023-03-24 00:15:44] [INFO ] Deduced a trap composed of 86 places in 580 ms of which 1 ms to minimize.
[2023-03-24 00:15:44] [INFO ] Deduced a trap composed of 70 places in 617 ms of which 1 ms to minimize.
[2023-03-24 00:15:46] [INFO ] Deduced a trap composed of 55 places in 586 ms of which 1 ms to minimize.
[2023-03-24 00:15:46] [INFO ] Deduced a trap composed of 75 places in 567 ms of which 1 ms to minimize.
[2023-03-24 00:15:47] [INFO ] Deduced a trap composed of 80 places in 600 ms of which 1 ms to minimize.
[2023-03-24 00:15:48] [INFO ] Deduced a trap composed of 103 places in 621 ms of which 2 ms to minimize.
[2023-03-24 00:15:49] [INFO ] Deduced a trap composed of 79 places in 590 ms of which 1 ms to minimize.
[2023-03-24 00:15:50] [INFO ] Deduced a trap composed of 81 places in 622 ms of which 1 ms to minimize.
[2023-03-24 00:15:51] [INFO ] Deduced a trap composed of 104 places in 599 ms of which 1 ms to minimize.
[2023-03-24 00:15:52] [INFO ] Deduced a trap composed of 75 places in 570 ms of which 1 ms to minimize.
[2023-03-24 00:15:52] [INFO ] Deduced a trap composed of 86 places in 632 ms of which 1 ms to minimize.
[2023-03-24 00:15:53] [INFO ] Deduced a trap composed of 77 places in 595 ms of which 1 ms to minimize.
[2023-03-24 00:15:54] [INFO ] Deduced a trap composed of 92 places in 608 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 00:15:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:15:54] [INFO ] After 25369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 111 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 115 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2023-03-24 00:15:54] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2023-03-24 00:15:54] [INFO ] Invariant cache hit.
[2023-03-24 00:15:56] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2023-03-24 00:15:56] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2023-03-24 00:15:56] [INFO ] Invariant cache hit.
[2023-03-24 00:15:57] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-24 00:16:19] [INFO ] Implicit Places using invariants and state equation in 23505 ms returned []
Implicit Place search using SMT with State Equation took 24683 ms to find 0 implicit places.
[2023-03-24 00:16:19] [INFO ] Redundant transitions in 262 ms returned []
[2023-03-24 00:16:19] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2023-03-24 00:16:19] [INFO ] Invariant cache hit.
[2023-03-24 00:16:21] [INFO ] Dead Transitions using invariants and state equation in 1569 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26652 ms. Remains : 983/983 places, 4277/4277 transitions.
Graph (trivial) has 1054 edges and 983 vertex of which 17 / 983 are part of one of the 1 SCC in 23 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4853 edges and 967 vertex of which 953 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1295.t1502 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 936 transition count 3508
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 839 transition count 3315
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 743 transition count 3147
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 671 transition count 3005
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 601 transition count 2885
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 551 transition count 2787
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 503 transition count 2707
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 471 transition count 2645
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 441 transition count 2597
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 423 transition count 2563
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 407 transition count 2539
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 399 transition count 2525
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 393 transition count 2517
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 390 transition count 2515
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 16 Pre rules applied. Total rules applied 1640 place count 390 transition count 2499
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 32 rules applied. Total rules applied 1672 place count 374 transition count 2499
Discarding 284 places :
Symmetric choice reduction at 14 with 284 rule applications. Total rules 1956 place count 90 transition count 339
Iterating global reduction 14 with 284 rules applied. Total rules applied 2240 place count 90 transition count 339
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 14 with 254 rules applied. Total rules applied 2494 place count 90 transition count 85
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 2502 place count 82 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2502 place count 82 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2504 place count 81 transition count 84
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 2516 place count 69 transition count 67
Iterating global reduction 16 with 12 rules applied. Total rules applied 2528 place count 69 transition count 67
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 2533 place count 64 transition count 62
Iterating global reduction 16 with 5 rules applied. Total rules applied 2538 place count 64 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2542 place count 62 transition count 60
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2543 place count 61 transition count 58
Iterating global reduction 16 with 1 rules applied. Total rules applied 2544 place count 61 transition count 58
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 16 with 15 rules applied. Total rules applied 2559 place count 61 transition count 43
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 16 with 15 rules applied. Total rules applied 2574 place count 46 transition count 43
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2575 place count 46 transition count 43
Applied a total of 2575 rules in 662 ms. Remains 46 /983 variables (removed 937) and now considering 43/4277 (removed 4234) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 46 cols
[2023-03-24 00:16:22] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-24 00:16:22] [INFO ] [Real]Absence check using 2 positive place invariants in 34 ms returned sat
[2023-03-24 00:16:22] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 116 ms returned sat
[2023-03-24 00:16:22] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 00:16:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-24 00:16:22] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-24 00:16:22] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 00:16:22] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-24 00:16:22] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 35 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2023-03-24 00:16:23] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2023-03-24 00:16:23] [INFO ] Computed 50 place invariants in 21 ms
[2023-03-24 00:16:23] [INFO ] Implicit Places using invariants in 973 ms returned []
[2023-03-24 00:16:23] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2023-03-24 00:16:23] [INFO ] Invariant cache hit.
[2023-03-24 00:16:24] [INFO ] State equation strengthened by 853 read => feed constraints.
[2023-03-24 00:16:33] [INFO ] Implicit Places using invariants and state equation in 9086 ms returned []
Implicit Place search using SMT with State Equation took 10060 ms to find 0 implicit places.
[2023-03-24 00:16:33] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2023-03-24 00:16:33] [INFO ] Invariant cache hit.
[2023-03-24 00:16:34] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11196 ms. Remains : 1117/1117 places, 2542/2542 transitions.
Computed a total of 302 stabilizing places and 926 stable transitions
Computed a total of 302 stabilizing places and 926 stable transitions
Detected a total of 302/1117 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 5909 steps, including 101 resets, run visited all 2 properties in 61 ms. (steps per millisecond=96 )
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1711 reset in 508 ms.
Product exploration explored 100000 steps with 1711 reset in 532 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 74 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2023-03-24 00:16:36] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-24 00:16:36] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2023-03-24 00:16:36] [INFO ] Invariant cache hit.
[2023-03-24 00:16:37] [INFO ] Dead Transitions using invariants and state equation in 1048 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1240 ms. Remains : 1117/1117 places, 2542/2542 transitions.
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 49 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2023-03-24 00:16:37] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2023-03-24 00:16:37] [INFO ] Invariant cache hit.
[2023-03-24 00:16:38] [INFO ] Implicit Places using invariants in 1032 ms returned []
[2023-03-24 00:16:38] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2023-03-24 00:16:38] [INFO ] Invariant cache hit.
[2023-03-24 00:16:39] [INFO ] State equation strengthened by 853 read => feed constraints.
[2023-03-24 00:16:47] [INFO ] Implicit Places using invariants and state equation in 9063 ms returned []
Implicit Place search using SMT with State Equation took 10122 ms to find 0 implicit places.
[2023-03-24 00:16:47] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2023-03-24 00:16:47] [INFO ] Invariant cache hit.
[2023-03-24 00:16:49] [INFO ] Dead Transitions using invariants and state equation in 1085 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11267 ms. Remains : 1117/1117 places, 2542/2542 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 finished in 124305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p1&&X((G(!p0)||(!p0&&G(F(p2)))))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
Stuttering acceptance computed with spot in 136 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 5 out of 1285 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1285/1285 places, 2906/2906 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1285 transition count 2878
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1257 transition count 2878
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 56 place count 1257 transition count 2854
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 104 place count 1233 transition count 2854
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 118 place count 1219 transition count 2805
Iterating global reduction 2 with 14 rules applied. Total rules applied 132 place count 1219 transition count 2805
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 132 place count 1219 transition count 2803
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 1217 transition count 2803
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 145 place count 1208 transition count 2738
Iterating global reduction 2 with 9 rules applied. Total rules applied 154 place count 1208 transition count 2738
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 1207 transition count 2730
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 1207 transition count 2730
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 216 place count 1177 transition count 2700
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 222 place count 1171 transition count 2694
Iterating global reduction 2 with 6 rules applied. Total rules applied 228 place count 1171 transition count 2694
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 1165 transition count 2646
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 1165 transition count 2646
Applied a total of 240 rules in 380 ms. Remains 1165 /1285 variables (removed 120) and now considering 2646/2906 (removed 260) transitions.
[2023-03-24 00:16:49] [INFO ] Flow matrix only has 2374 transitions (discarded 272 similar events)
// Phase 1: matrix 2374 rows 1165 cols
[2023-03-24 00:16:49] [INFO ] Computed 64 place invariants in 26 ms
[2023-03-24 00:16:50] [INFO ] Implicit Places using invariants in 1002 ms returned [93, 94, 95, 397, 462, 489, 507, 511, 557, 590, 633, 693, 751, 827, 869]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1024 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1150/1285 places, 2646/2906 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1143 transition count 2639
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1143 transition count 2639
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1136 transition count 2632
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1136 transition count 2632
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1131 transition count 2592
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1131 transition count 2592
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 1125 transition count 2586
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 1119 transition count 2580
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 1119 transition count 2580
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 1113 transition count 2532
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 1113 transition count 2532
Applied a total of 74 rules in 297 ms. Remains 1113 /1150 variables (removed 37) and now considering 2532/2646 (removed 114) transitions.
[2023-03-24 00:16:51] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1113 cols
[2023-03-24 00:16:51] [INFO ] Computed 49 place invariants in 27 ms
[2023-03-24 00:16:52] [INFO ] Implicit Places using invariants in 955 ms returned []
[2023-03-24 00:16:52] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2023-03-24 00:16:52] [INFO ] Invariant cache hit.
[2023-03-24 00:16:52] [INFO ] State equation strengthened by 846 read => feed constraints.
[2023-03-24 00:17:00] [INFO ] Implicit Places using invariants and state equation in 8833 ms returned []
Implicit Place search using SMT with State Equation took 9788 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1113/1285 places, 2532/2906 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11490 ms. Remains : 1113/1285 places, 2532/2906 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s833 1) (GEQ s1069 1) (GEQ s1096 1)) (AND (GEQ s833 1) (GEQ s1069 1))), p0:(AND (GEQ s833 1) (GEQ s1069 1)), p2:(AND (GEQ s453 1) (GEQ s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1710 reset in 512 ms.
Product exploration explored 100000 steps with 1711 reset in 538 ms.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 624 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 170 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 00:17:03] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2023-03-24 00:17:03] [INFO ] Invariant cache hit.
[2023-03-24 00:17:03] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 17 factoid took 932 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 5 out of 1113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Applied a total of 0 rules in 38 ms. Remains 1113 /1113 variables (removed 0) and now considering 2532/2532 (removed 0) transitions.
[2023-03-24 00:17:04] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2023-03-24 00:17:04] [INFO ] Invariant cache hit.
[2023-03-24 00:17:05] [INFO ] Implicit Places using invariants in 928 ms returned []
[2023-03-24 00:17:05] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2023-03-24 00:17:05] [INFO ] Invariant cache hit.
[2023-03-24 00:17:06] [INFO ] State equation strengthened by 846 read => feed constraints.
[2023-03-24 00:17:14] [INFO ] Implicit Places using invariants and state equation in 9049 ms returned []
Implicit Place search using SMT with State Equation took 9993 ms to find 0 implicit places.
[2023-03-24 00:17:14] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2023-03-24 00:17:14] [INFO ] Invariant cache hit.
[2023-03-24 00:17:15] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11138 ms. Remains : 1113/1113 places, 2532/2532 transitions.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 463 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Finished Best-First random walk after 2999 steps, including 11 resets, run visited all 4 properties in 8 ms. (steps per millisecond=374 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (AND p0 (NOT p2))), (F p1)]
Knowledge based reduction with 9 factoid took 492 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 185 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1712 reset in 510 ms.
Product exploration explored 100000 steps with 1712 reset in 540 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 132 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 5 out of 1113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Applied a total of 0 rules in 70 ms. Remains 1113 /1113 variables (removed 0) and now considering 2532/2532 (removed 0) transitions.
[2023-03-24 00:17:18] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-24 00:17:18] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2023-03-24 00:17:18] [INFO ] Invariant cache hit.
[2023-03-24 00:17:19] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1279 ms. Remains : 1113/1113 places, 2532/2532 transitions.
Support contains 5 out of 1113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Applied a total of 0 rules in 38 ms. Remains 1113 /1113 variables (removed 0) and now considering 2532/2532 (removed 0) transitions.
[2023-03-24 00:17:19] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2023-03-24 00:17:19] [INFO ] Invariant cache hit.
[2023-03-24 00:17:20] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-24 00:17:20] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2023-03-24 00:17:20] [INFO ] Invariant cache hit.
[2023-03-24 00:17:21] [INFO ] State equation strengthened by 846 read => feed constraints.
[2023-03-24 00:17:29] [INFO ] Implicit Places using invariants and state equation in 8990 ms returned []
Implicit Place search using SMT with State Equation took 9889 ms to find 0 implicit places.
[2023-03-24 00:17:29] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2023-03-24 00:17:29] [INFO ] Invariant cache hit.
[2023-03-24 00:17:30] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10907 ms. Remains : 1113/1113 places, 2532/2532 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 finished in 41765 ms.
[2023-03-24 00:17:31] [INFO ] Flatten gal took : 201 ms
[2023-03-24 00:17:31] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-24 00:17:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1285 places, 2906 transitions and 12771 arcs took 37 ms.
Total runtime 566109 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2608/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2608/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14

BK_STOP 1679617054713

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
ltl formula formula --ltl=/tmp/2608/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1285 places, 2906 transitions and 12771 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.400 real 0.080 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2608/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2608/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2608/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2608/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
ltl formula formula --ltl=/tmp/2608/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1285 places, 2906 transitions and 12771 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.460 real 0.080 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2608/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2608/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2608/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2608/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856419400796"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C08.tgz
mv MultiCrashLeafsetExtension-PT-S16C08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;