About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S24C02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16026.728 | 2416201.00 | 6552846.00 | 2852.30 | ?FFFFFFFFFF??TF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r508-tall-171654350800059.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S24C02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350800059
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 05:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 05:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 05:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 05:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 7.6M May 18 16:43 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-S24C02-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717198624261
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:37:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:37:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:37:06] [INFO ] Load time of PNML (sax parser for PT used): 499 ms
[2024-05-31 23:37:06] [INFO ] Transformed 7032 places.
[2024-05-31 23:37:06] [INFO ] Transformed 10855 transitions.
[2024-05-31 23:37:06] [INFO ] Parsed PT model containing 7032 places and 10855 transitions and 46214 arcs in 649 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 7032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7032/7032 places, 10855/10855 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 7000 transition count 10855
Discarding 1189 places :
Symmetric choice reduction at 1 with 1189 rule applications. Total rules 1221 place count 5811 transition count 9666
Iterating global reduction 1 with 1189 rules applied. Total rules applied 2410 place count 5811 transition count 9666
Discarding 1087 places :
Symmetric choice reduction at 1 with 1087 rule applications. Total rules 3497 place count 4724 transition count 8579
Iterating global reduction 1 with 1087 rules applied. Total rules applied 4584 place count 4724 transition count 8579
Discarding 535 places :
Symmetric choice reduction at 1 with 535 rule applications. Total rules 5119 place count 4189 transition count 7509
Iterating global reduction 1 with 535 rules applied. Total rules applied 5654 place count 4189 transition count 7509
Applied a total of 5654 rules in 2933 ms. Remains 4189 /7032 variables (removed 2843) and now considering 7509/10855 (removed 3346) transitions.
[2024-05-31 23:37:09] [INFO ] Flow matrix only has 6909 transitions (discarded 600 similar events)
// Phase 1: matrix 6909 rows 4189 cols
[2024-05-31 23:37:09] [INFO ] Computed 781 invariants in 556 ms
[2024-05-31 23:37:18] [INFO ] Implicit Places using invariants in 8746 ms returned [4, 8, 12, 14, 16, 21, 28, 37, 48, 61, 76, 93, 112, 133, 156, 180, 204, 206, 208, 229, 248, 265, 280, 293, 304, 313, 320, 325, 328, 339, 346, 349, 350, 351, 354, 359, 366, 375, 386, 399, 414, 431, 450, 471, 515, 516, 517, 536, 553, 568, 581, 592, 601, 608, 613, 616, 618, 629, 636, 639, 641, 643, 646, 651, 658, 667, 678, 694, 709, 726, 745, 765, 785, 786, 787, 804, 819, 832, 843, 852, 859, 864, 867, 869, 871, 882, 889, 892, 893, 894, 896, 898, 901, 906, 913, 922, 933, 946, 961, 978, 996, 1014, 1015, 1016, 1031, 1044, 1055, 1064, 1071, 1076, 1079, 1081, 1083, 1085, 1096, 1103, 1106, 1107, 1108, 1110, 1112, 1114, 1117, 1122, 1129, 1138, 1149, 1162, 1177, 1193, 1209, 1210, 1211, 1224, 1244, 1251, 1256, 1259, 1261, 1263, 1265, 1267, 1278, 1285, 1288, 1289, 1290, 1292, 1294, 1297, 1299, 1302, 1307, 1314, 1323, 1334, 1347, 1361, 1375, 1376, 1377, 1388, 1397, 1404, 1409, 1412, 1414, 1416, 1418, 1420, 1422, 1433, 1440, 1443, 1444, 1445, 1447, 1449, 1451, 1453, 1455, 1458, 1463, 1470, 1479, 1490, 1502, 1515, 1516, 1528, 1535, 1540, 1543, 1545, 1547, 1549, 1551, 1553, 1555, 1566, 1573, 1576, 1577, 1578, 1580, 1582, 1584, 1586, 1588, 1590, 1593, 1598, 1605, 1614, 1624, 1634, 1635, 1636, 1643, 1648, 1651, 1653, 1655, 1657, 1659, 1661, 1663, 1665, 1676, 1683, 1686, 1688, 1690, 1692, 1694, 1696, 1698, 1700, 1704, 1707, 1712, 1719, 1727, 1735, 1737, 1742, 1745, 1747, 1749, 1751, 1753, 1755, 1757, 1759, 1761, 1774, 1781, 1785, 1786, 1790, 1792, 1794, 1796, 1798, 1800, 1802, 1804, 1807, 1812, 1818, 1824, 1825, 1826, 1829, 1831, 1833, 1835, 1837, 1839, 1841, 1843, 1845, 1847, 1858, 1865, 1868, 1869, 1870, 1872, 1874, 1876, 1879, 1881, 1883, 1885, 1887, 1889, 1892, 1896, 1900, 1901, 1902, 1904, 1906, 1908, 1910, 1912, 1914, 1916, 1918, 1920, 1922, 1933, 1940, 1943, 1944, 1945, 1947, 1949, 1951, 1953, 1955, 1957, 1959, 1961, 1963, 1965, 1967, 1970, 1971, 1972, 1974, 1976, 1978, 1980, 1982, 1984, 1986, 1988, 1990, 1992, 2003, 2005, 2009, 2012, 2013, 2014, 2016, 2018, 2020, 2022, 2024, 2026, 2028, 2030, 2032, 2034, 2036, 2039, 2040, 2041, 2043, 2045, 2047, 2049, 2051, 2053, 2055, 2057, 2059, 2061, 2072, 2082, 2083, 2084, 2086, 2088, 2090, 2092, 2094, 2096, 2098, 2100, 2102, 2104, 2106, 2110, 2111, 2115, 2117, 2119, 2121, 2123, 2125, 2127, 2129, 2131, 2133, 2144, 2151, 2154, 2155, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2176, 2179, 2184, 2185, 2186, 2189, 2191, 2193, 2195, 2197, 2199, 2201, 2203, 2205, 2207, 2218, 2225, 2228, 2229, 2230, 2232, 2234, 2236, 2238, 2240, 2242, 2244, 2246, 2248, 2251, 2256, 2263, 2264, 2265, 2270, 2273, 2275, 2277, 2279, 2281, 2283, 2285, 2287, 2289, 2300, 2307, 2310, 2312, 2314, 2316, 2318, 2320, 2322, 2324, 2326, 2328, 2334, 2339, 2346, 2355, 2356, 2357, 2364, 2369, 2372, 2374, 2376, 2378, 2380, 2382, 2384, 2386, 2397, 2404, 2407, 2408, 2409, 2411, 2413, 2415, 2417, 2419, 2421, 2423, 2426, 2431, 2438, 2447, 2458, 2459, 2460, 2469, 2476, 2481, 2484, 2486, 2488, 2490, 2492, 2494, 2496, 2507, 2514, 2517, 2518, 2519, 2521, 2523, 2525, 2527, 2529, 2531, 2534, 2539, 2546, 2555, 2566, 2579, 2581, 2592, 2601, 2608, 2613, 2619, 2621, 2623, 2625, 2627, 2629, 2640, 2647, 2650, 2651, 2652, 2654, 2656, 2658, 2660, 2662, 2665, 2670, 2677, 2686, 2697, 2710, 2726, 2727, 2740, 2751, 2760, 2767, 2772, 2775, 2777, 2779, 2783, 2785, 2796, 2803, 2808, 2810, 2812, 2814, 2818, 2821, 2826, 2833, 2842, 2856, 2869, 2884, 2901, 2902, 2903, 2918, 2931, 2942, 2951, 2958, 2963, 2966, 2968, 2970, 2972, 2983, 2990, 2993, 2994, 2995, 2997, 2999, 3001, 3004, 3009, 3016, 3025, 3036, 3049, 3064, 3081, 3100, 3102, 3119, 3137, 3150, 3161, 3170, 3177, 3182, 3185, 3187, 3189, 3200, 3207, 3210, 3211, 3212, 3214, 3216, 3219, 3224, 3231, 3240, 3251, 3264, 3279, 3296, 3315, 3337, 3338, 3357, 3374, 3389, 3402, 3413, 3425, 3432, 3437, 3440, 3442, 3453, 3460, 3463, 3464, 3465, 3467, 3470, 3475, 3482, 3491, 3502, 3515, 3530, 3547, 3566, 3587, 3610, 3611, 3612, 3633, 3652, 3669, 3684, 3697, 3708, 3717, 3724, 3729, 3732, 3743, 3745, 3749, 3752, 3753, 3754, 3757, 3762, 3769, 3778, 3789, 3802, 3817, 3834, 3853, 3874, 3897, 3922, 3923, 3924, 3947, 3968, 3987, 4004, 4019, 4032, 4043, 4052, 4059, 4064, 4076]
[2024-05-31 23:37:18] [INFO ] Actually due to overlaps returned [339, 629, 882, 1096, 1278, 1433, 1566, 1676, 1774, 1858, 1933, 2003, 2072, 2144, 2218, 2300, 2397, 2507, 2640, 2796, 2983, 3200, 3453, 3743, 4076, 4, 12, 14, 204, 206, 349, 350, 515, 516, 639, 785, 786, 892, 893, 1014, 1015, 1106, 1107, 1209, 1210, 1288, 1289, 1375, 1376, 1443, 1444, 1515, 1576, 1577, 1634, 1635, 1686, 1735, 1785, 1824, 1825, 1868, 1869, 1900, 1901, 1943, 1944, 1970, 1971, 2005, 2012, 2013, 2039, 2040, 2082, 2083, 2110, 2154, 2155, 2184, 2185, 2228, 2229, 2263, 2264, 2310, 2355, 2356, 2407, 2408, 2458, 2459, 2517, 2518, 2579, 2650, 2651, 2726, 2901, 2902, 2993, 2994, 3100, 3210, 3211, 3337, 3463, 3464, 3610, 3611, 3745, 3752, 3753, 3922, 3923]
Discarding 115 places :
Implicit Place search using SMT only with invariants took 8797 ms to find 115 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4074/7032 places, 7509/10855 transitions.
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 83 place count 3991 transition count 7426
Iterating global reduction 0 with 83 rules applied. Total rules applied 166 place count 3991 transition count 7426
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 248 place count 3909 transition count 7344
Iterating global reduction 0 with 82 rules applied. Total rules applied 330 place count 3909 transition count 7344
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 411 place count 3828 transition count 7263
Iterating global reduction 0 with 81 rules applied. Total rules applied 492 place count 3828 transition count 7263
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 527 place count 3793 transition count 7193
Iterating global reduction 0 with 35 rules applied. Total rules applied 562 place count 3793 transition count 7193
Applied a total of 562 rules in 2161 ms. Remains 3793 /4074 variables (removed 281) and now considering 7193/7509 (removed 316) transitions.
[2024-05-31 23:37:20] [INFO ] Flow matrix only has 6593 transitions (discarded 600 similar events)
// Phase 1: matrix 6593 rows 3793 cols
[2024-05-31 23:37:20] [INFO ] Computed 666 invariants in 148 ms
[2024-05-31 23:37:27] [INFO ] Implicit Places using invariants in 7206 ms returned [7, 13, 18, 25, 34, 45, 58, 73, 90, 109, 130, 153, 177, 203, 224, 243, 260, 275, 288, 299, 308, 315, 320, 323, 340, 342, 345, 350, 357, 366, 377, 390, 405, 422, 441, 462, 505, 524, 541, 556, 569, 580, 589, 596, 601, 604, 606, 615, 619, 621, 624, 629, 636, 645, 656, 672, 687, 704, 723, 743, 762, 779, 794, 807, 818, 827, 834, 839, 842, 844, 846, 857, 859, 861, 863, 866, 871, 878, 887, 898, 911, 926, 943, 961, 978, 993, 1006, 1017, 1026, 1033, 1038, 1041, 1043, 1045, 1047, 1056, 1058, 1060, 1062, 1064, 1067, 1072, 1079, 1088, 1099, 1112, 1127, 1143, 1158, 1171, 1191, 1198, 1203, 1206, 1208, 1210, 1212, 1214, 1223, 1225, 1227, 1229, 1232, 1234, 1237, 1242, 1249, 1258, 1269, 1282, 1296, 1309, 1320, 1329, 1336, 1341, 1344, 1346, 1348, 1350, 1352, 1354, 1363, 1365, 1367, 1369, 1371, 1373, 1375, 1378, 1383, 1390, 1399, 1410, 1422, 1435, 1447, 1454, 1459, 1462, 1464, 1466, 1468, 1470, 1472, 1474, 1485, 1487, 1489, 1491, 1493, 1495, 1497, 1499, 1502, 1507, 1514, 1523, 1533, 1542, 1549, 1554, 1557, 1559, 1561, 1563, 1565, 1567, 1569, 1571, 1580, 1584, 1586, 1588, 1590, 1592, 1594, 1596, 1600, 1603, 1608, 1615, 1623, 1632, 1637, 1640, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1671, 1675, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1696, 1701, 1707, 1712, 1715, 1717, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1744, 1746, 1748, 1750, 1752, 1755, 1757, 1759, 1761, 1763, 1765, 1768, 1772, 1775, 1777, 1779, 1781, 1783, 1785, 1787, 1789, 1791, 1793, 1795, 1804, 1806, 1808, 1810, 1812, 1814, 1816, 1818, 1820, 1822, 1824, 1826, 1828, 1830, 1832, 1834, 1836, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1857, 1859, 1861, 1863, 1865, 1867, 1869, 1871, 1873, 1875, 1877, 1879, 1881, 1883, 1885, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1914, 1916, 1918, 1920, 1922, 1924, 1926, 1928, 1930, 1932, 1934, 1936, 1940, 1944, 1946, 1948, 1950, 1952, 1954, 1956, 1958, 1960, 1962, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1987, 1989, 1991, 1993, 1995, 1998, 2003, 2006, 2008, 2010, 2012, 2014, 2016, 2018, 2020, 2022, 2024, 2034, 2036, 2038, 2040, 2042, 2044, 2046, 2048, 2050, 2052, 2054, 2057, 2062, 2068, 2073, 2076, 2078, 2080, 2082, 2084, 2086, 2088, 2090, 2092, 2101, 2105, 2107, 2109, 2111, 2113, 2115, 2117, 2119, 2121, 2127, 2132, 2139, 2147, 2154, 2159, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2176, 2187, 2189, 2191, 2193, 2195, 2197, 2199, 2201, 2203, 2206, 2211, 2218, 2227, 2237, 2246, 2253, 2258, 2261, 2263, 2265, 2267, 2269, 2271, 2273, 2282, 2284, 2286, 2288, 2290, 2292, 2294, 2296, 2299, 2304, 2311, 2320, 2331, 2345, 2356, 2365, 2372, 2377, 2383, 2385, 2387, 2389, 2391, 2393, 2404, 2406, 2408, 2410, 2412, 2414, 2416, 2419, 2424, 2431, 2440, 2451, 2464, 2480, 2493, 2504, 2513, 2520, 2525, 2528, 2530, 2532, 2536, 2538, 2549, 2554, 2556, 2558, 2560, 2564, 2567, 2572, 2579, 2588, 2602, 2615, 2630, 2646, 2661, 2674, 2685, 2694, 2701, 2706, 2709, 2711, 2713, 2715, 2728, 2730, 2732, 2734, 2736, 2739, 2744, 2751, 2760, 2771, 2784, 2799, 2816, 2836, 2853, 2871, 2884, 2895, 2904, 2911, 2916, 2919, 2921, 2923, 2934, 2936, 2938, 2940, 2943, 2948, 2955, 2964, 2975, 2988, 3003, 3020, 3039, 3061, 3080, 3097, 3112, 3125, 3136, 3148, 3155, 3160, 3163, 3165, 3177, 3179, 3181, 3184, 3189, 3196, 3205, 3216, 3229, 3244, 3261, 3280, 3301, 3323, 3344, 3363, 3380, 3395, 3408, 3419, 3428, 3435, 3440, 3443, 3450, 3452, 3455, 3460, 3467, 3476, 3487, 3500, 3515, 3532, 3551, 3572, 3595, 3619, 3642, 3663, 3682, 3699, 3714, 3727, 3738, 3747, 3754, 3759]
Discarding 597 places :
Implicit Place search using SMT only with invariants took 7219 ms to find 597 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3196/7032 places, 7193/10855 transitions.
Applied a total of 0 rules in 414 ms. Remains 3196 /3196 variables (removed 0) and now considering 7193/7193 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 21544 ms. Remains : 3196/7032 places, 7193/10855 transitions.
Support contains 41 out of 3196 places after structural reductions.
[2024-05-31 23:37:28] [INFO ] Flatten gal took : 410 ms
[2024-05-31 23:37:28] [INFO ] Flatten gal took : 240 ms
[2024-05-31 23:37:29] [INFO ] Input system was already deterministic with 7193 transitions.
RANDOM walk for 40000 steps (1882 resets) in 3041 ms. (13 steps per ms) remains 16/25 properties
BEST_FIRST walk for 4004 steps (32 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (32 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (32 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (32 resets) in 52 ms. (75 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (32 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (32 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
[2024-05-31 23:37:30] [INFO ] Flow matrix only has 6593 transitions (discarded 600 similar events)
// Phase 1: matrix 6593 rows 3196 cols
[2024-05-31 23:37:30] [INFO ] Computed 69 invariants in 183 ms
[2024-05-31 23:37:30] [INFO ] State equation strengthened by 2632 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 3069/3092 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3092 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-05-31 23:37:33] [INFO ] Deduced a trap composed of 362 places in 2294 ms of which 153 ms to minimize.
[2024-05-31 23:37:36] [INFO ] Deduced a trap composed of 547 places in 2285 ms of which 22 ms to minimize.
SMT process timed out in 5684ms, After SMT, problems are : Problem set: 6 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 17 out of 3196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3196/3196 places, 7193/7193 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 3196 transition count 7186
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 3189 transition count 7186
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 14 place count 3189 transition count 7172
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 42 place count 3175 transition count 7172
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 50 place count 3167 transition count 7162
Iterating global reduction 2 with 8 rules applied. Total rules applied 58 place count 3167 transition count 7162
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 3161 transition count 7151
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 3161 transition count 7151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 3160 transition count 7149
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 3160 transition count 7149
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 5 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 138 place count 3127 transition count 7116
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 3123 transition count 7112
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 3123 transition count 7112
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 3119 transition count 7104
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 3119 transition count 7104
Free-agglomeration rule (complex) applied 301 times.
Iterating global reduction 2 with 301 rules applied. Total rules applied 455 place count 3119 transition count 6931
Reduce places removed 301 places and 0 transitions.
Iterating post reduction 2 with 301 rules applied. Total rules applied 756 place count 2818 transition count 6931
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 769 place count 2818 transition count 6931
Applied a total of 769 rules in 4797 ms. Remains 2818 /3196 variables (removed 378) and now considering 6931/7193 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4799 ms. Remains : 2818/3196 places, 6931/7193 transitions.
RANDOM walk for 40000 steps (2963 resets) in 1282 ms. (31 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (206 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (206 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (217 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (207 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (208 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (206 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (206 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
[2024-05-31 23:37:41] [INFO ] Flow matrix only has 6049 transitions (discarded 882 similar events)
// Phase 1: matrix 6049 rows 2818 cols
[2024-05-31 23:37:41] [INFO ] Computed 69 invariants in 128 ms
[2024-05-31 23:37:41] [INFO ] State equation strengthened by 2748 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2709/2723 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2723 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:37:44] [INFO ] Deduced a trap composed of 322 places in 1977 ms of which 20 ms to minimize.
[2024-05-31 23:37:46] [INFO ] Deduced a trap composed of 325 places in 2003 ms of which 19 ms to minimize.
[2024-05-31 23:37:48] [INFO ] Deduced a trap composed of 149 places in 1934 ms of which 19 ms to minimize.
[2024-05-31 23:37:50] [INFO ] Deduced a trap composed of 364 places in 2027 ms of which 20 ms to minimize.
[2024-05-31 23:37:52] [INFO ] Deduced a trap composed of 348 places in 1979 ms of which 18 ms to minimize.
[2024-05-31 23:37:54] [INFO ] Deduced a trap composed of 511 places in 1985 ms of which 18 ms to minimize.
[2024-05-31 23:37:56] [INFO ] Deduced a trap composed of 582 places in 1954 ms of which 18 ms to minimize.
[2024-05-31 23:37:58] [INFO ] Deduced a trap composed of 366 places in 1898 ms of which 17 ms to minimize.
[2024-05-31 23:38:00] [INFO ] Deduced a trap composed of 130 places in 1876 ms of which 17 ms to minimize.
[2024-05-31 23:38:02] [INFO ] Deduced a trap composed of 345 places in 1937 ms of which 17 ms to minimize.
[2024-05-31 23:38:04] [INFO ] Deduced a trap composed of 362 places in 1850 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2723 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:38:06] [INFO ] Deduced a trap composed of 183 places in 1991 ms of which 19 ms to minimize.
[2024-05-31 23:38:08] [INFO ] Deduced a trap composed of 579 places in 1887 ms of which 19 ms to minimize.
[2024-05-31 23:38:10] [INFO ] Deduced a trap composed of 572 places in 1963 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2723 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:38:13] [INFO ] Deduced a trap composed of 249 places in 1910 ms of which 19 ms to minimize.
[2024-05-31 23:38:15] [INFO ] Deduced a trap composed of 470 places in 1883 ms of which 20 ms to minimize.
[2024-05-31 23:38:16] [INFO ] Deduced a trap composed of 512 places in 1849 ms of which 16 ms to minimize.
[2024-05-31 23:38:18] [INFO ] Deduced a trap composed of 413 places in 1909 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2723 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:38:21] [INFO ] Deduced a trap composed of 311 places in 1813 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2723 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:38:23] [INFO ] Deduced a trap composed of 374 places in 1940 ms of which 19 ms to minimize.
[2024-05-31 23:38:25] [INFO ] Deduced a trap composed of 194 places in 1799 ms of which 16 ms to minimize.
[2024-05-31 23:38:27] [INFO ] Deduced a trap composed of 129 places in 1899 ms of which 18 ms to minimize.
SMT process timed out in 45493ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 2818 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2818/2818 places, 6931/6931 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2818 transition count 6929
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 2816 transition count 6929
Applied a total of 4 rules in 814 ms. Remains 2816 /2818 variables (removed 2) and now considering 6929/6931 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 814 ms. Remains : 2816/2818 places, 6929/6931 transitions.
RANDOM walk for 40000 steps (2959 resets) in 770 ms. (51 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (203 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (207 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (216 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (208 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (205 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (205 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (204 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 28155 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :1 out of 7
Probabilistic random walk after 28155 steps, saw 11914 distinct states, run finished after 3004 ms. (steps per millisecond=9 ) properties seen :1
[2024-05-31 23:38:31] [INFO ] Flow matrix only has 6045 transitions (discarded 884 similar events)
// Phase 1: matrix 6045 rows 2816 cols
[2024-05-31 23:38:31] [INFO ] Computed 69 invariants in 125 ms
[2024-05-31 23:38:31] [INFO ] State equation strengthened by 2748 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2709/2721 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2721 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:38:34] [INFO ] Deduced a trap composed of 273 places in 2064 ms of which 18 ms to minimize.
[2024-05-31 23:38:36] [INFO ] Deduced a trap composed of 340 places in 1843 ms of which 18 ms to minimize.
[2024-05-31 23:38:37] [INFO ] Deduced a trap composed of 143 places in 1833 ms of which 18 ms to minimize.
[2024-05-31 23:38:39] [INFO ] Deduced a trap composed of 130 places in 1862 ms of which 18 ms to minimize.
[2024-05-31 23:38:41] [INFO ] Deduced a trap composed of 295 places in 1815 ms of which 17 ms to minimize.
[2024-05-31 23:38:43] [INFO ] Deduced a trap composed of 232 places in 1820 ms of which 17 ms to minimize.
[2024-05-31 23:38:45] [INFO ] Deduced a trap composed of 129 places in 1840 ms of which 16 ms to minimize.
[2024-05-31 23:38:47] [INFO ] Deduced a trap composed of 185 places in 1818 ms of which 18 ms to minimize.
[2024-05-31 23:38:49] [INFO ] Deduced a trap composed of 468 places in 1804 ms of which 18 ms to minimize.
[2024-05-31 23:38:51] [INFO ] Deduced a trap composed of 239 places in 1945 ms of which 18 ms to minimize.
[2024-05-31 23:38:53] [INFO ] Deduced a trap composed of 466 places in 1869 ms of which 19 ms to minimize.
[2024-05-31 23:38:54] [INFO ] Deduced a trap composed of 132 places in 1859 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2721 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:38:57] [INFO ] Deduced a trap composed of 322 places in 1962 ms of which 19 ms to minimize.
[2024-05-31 23:38:59] [INFO ] Deduced a trap composed of 324 places in 1986 ms of which 22 ms to minimize.
[2024-05-31 23:39:01] [INFO ] Deduced a trap composed of 561 places in 1925 ms of which 18 ms to minimize.
[2024-05-31 23:39:03] [INFO ] Deduced a trap composed of 247 places in 1939 ms of which 20 ms to minimize.
[2024-05-31 23:39:05] [INFO ] Deduced a trap composed of 381 places in 1918 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2721 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2721 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 6 (OVERLAPS) 47/2768 variables, 16/38 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2768 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 44/2812 variables, 44/82 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2812 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/2816 variables, 4/86 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2816 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6045/8861 variables, 2816/2902 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/8861 variables, 2748/5650 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8861 variables, 0/5650 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/8861 variables, 0/5650 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8861/8861 variables, and 5650 constraints, problems are : Problem set: 3 solved, 3 unsolved in 40583 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 2816/2816 constraints, ReadFeed: 2748/2748 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2711/2720 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2720 variables, 1/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2720 variables, 17/22 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-31 23:39:14] [INFO ] Deduced a trap composed of 378 places in 1986 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2720 variables, 1/23 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2720 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 48/2768 variables, 16/39 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-31 23:39:17] [INFO ] Deduced a trap composed of 6 places in 2060 ms of which 18 ms to minimize.
[2024-05-31 23:39:19] [INFO ] Deduced a trap composed of 40 places in 2069 ms of which 18 ms to minimize.
[2024-05-31 23:39:21] [INFO ] Deduced a trap composed of 174 places in 2082 ms of which 20 ms to minimize.
[2024-05-31 23:39:23] [INFO ] Deduced a trap composed of 184 places in 2037 ms of which 20 ms to minimize.
[2024-05-31 23:39:25] [INFO ] Deduced a trap composed of 123 places in 2095 ms of which 17 ms to minimize.
[2024-05-31 23:39:27] [INFO ] Deduced a trap composed of 112 places in 2177 ms of which 18 ms to minimize.
[2024-05-31 23:39:29] [INFO ] Deduced a trap composed of 126 places in 2088 ms of which 19 ms to minimize.
[2024-05-31 23:39:32] [INFO ] Deduced a trap composed of 107 places in 2101 ms of which 18 ms to minimize.
[2024-05-31 23:39:34] [INFO ] Deduced a trap composed of 130 places in 2096 ms of which 18 ms to minimize.
[2024-05-31 23:39:36] [INFO ] Deduced a trap composed of 112 places in 2111 ms of which 19 ms to minimize.
[2024-05-31 23:39:38] [INFO ] Deduced a trap composed of 71 places in 2107 ms of which 18 ms to minimize.
[2024-05-31 23:39:40] [INFO ] Deduced a trap composed of 141 places in 2221 ms of which 19 ms to minimize.
[2024-05-31 23:39:42] [INFO ] Deduced a trap composed of 117 places in 2148 ms of which 18 ms to minimize.
[2024-05-31 23:39:45] [INFO ] Deduced a trap composed of 123 places in 2132 ms of which 17 ms to minimize.
[2024-05-31 23:39:47] [INFO ] Deduced a trap composed of 105 places in 2172 ms of which 23 ms to minimize.
[2024-05-31 23:39:49] [INFO ] Deduced a trap composed of 116 places in 2106 ms of which 19 ms to minimize.
[2024-05-31 23:39:51] [INFO ] Deduced a trap composed of 115 places in 2181 ms of which 20 ms to minimize.
[2024-05-31 23:39:53] [INFO ] Deduced a trap composed of 123 places in 2112 ms of which 19 ms to minimize.
[2024-05-31 23:39:56] [INFO ] Deduced a trap composed of 71 places in 2105 ms of which 19 ms to minimize.
[2024-05-31 23:39:58] [INFO ] Deduced a trap composed of 128 places in 2138 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2768 variables, 20/59 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-31 23:40:00] [INFO ] Deduced a trap composed of 151 places in 2113 ms of which 18 ms to minimize.
[2024-05-31 23:40:02] [INFO ] Deduced a trap composed of 144 places in 2134 ms of which 18 ms to minimize.
[2024-05-31 23:40:04] [INFO ] Deduced a trap composed of 141 places in 2079 ms of which 19 ms to minimize.
[2024-05-31 23:40:06] [INFO ] Deduced a trap composed of 109 places in 2155 ms of which 19 ms to minimize.
[2024-05-31 23:40:09] [INFO ] Deduced a trap composed of 427 places in 2046 ms of which 19 ms to minimize.
[2024-05-31 23:40:11] [INFO ] Deduced a trap composed of 242 places in 2000 ms of which 19 ms to minimize.
[2024-05-31 23:40:13] [INFO ] Deduced a trap composed of 89 places in 2107 ms of which 17 ms to minimize.
[2024-05-31 23:40:15] [INFO ] Deduced a trap composed of 130 places in 1982 ms of which 18 ms to minimize.
[2024-05-31 23:40:17] [INFO ] Deduced a trap composed of 307 places in 2054 ms of which 17 ms to minimize.
[2024-05-31 23:40:19] [INFO ] Deduced a trap composed of 307 places in 2031 ms of which 18 ms to minimize.
[2024-05-31 23:40:21] [INFO ] Deduced a trap composed of 123 places in 1988 ms of which 18 ms to minimize.
[2024-05-31 23:40:23] [INFO ] Deduced a trap composed of 85 places in 2027 ms of which 19 ms to minimize.
[2024-05-31 23:40:25] [INFO ] Deduced a trap composed of 127 places in 1946 ms of which 20 ms to minimize.
[2024-05-31 23:40:27] [INFO ] Deduced a trap composed of 274 places in 1970 ms of which 18 ms to minimize.
SMT process timed out in 116192ms, After SMT, problems are : Problem set: 4 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2816 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2816/2816 places, 6929/6929 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2816 transition count 6927
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 2814 transition count 6927
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 2813 transition count 6926
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 2813 transition count 6926
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 2813 transition count 7163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 2811 transition count 7163
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 13 place count 2811 transition count 7163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 16 place count 2808 transition count 7160
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 2808 transition count 7160
Applied a total of 19 rules in 1762 ms. Remains 2808 /2816 variables (removed 8) and now considering 7160/6929 (removed -231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1764 ms. Remains : 2808/2816 places, 7160/6929 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 572 stabilizing places and 1992 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 4 out of 3196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3196/3196 places, 7193/7193 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3180 transition count 7175
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3180 transition count 7175
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 45 place count 3167 transition count 7157
Iterating global reduction 0 with 13 rules applied. Total rules applied 58 place count 3167 transition count 7157
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 3159 transition count 7141
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 3159 transition count 7141
Applied a total of 74 rules in 1710 ms. Remains 3159 /3196 variables (removed 37) and now considering 7141/7193 (removed 52) transitions.
[2024-05-31 23:40:31] [INFO ] Flow matrix only has 6541 transitions (discarded 600 similar events)
// Phase 1: matrix 6541 rows 3159 cols
[2024-05-31 23:40:31] [INFO ] Computed 69 invariants in 130 ms
[2024-05-31 23:40:36] [INFO ] Implicit Places using invariants in 4859 ms returned [448, 570, 1069, 1275, 1385, 1419, 1448, 1588, 1603, 1704, 1881, 1989, 2048, 2292, 2490]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 4865 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3144/3196 places, 7141/7193 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3132 transition count 7129
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3132 transition count 7129
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 3120 transition count 7117
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 3120 transition count 7117
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 3108 transition count 7105
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 3108 transition count 7105
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 3097 transition count 7083
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 3097 transition count 7083
Applied a total of 94 rules in 2191 ms. Remains 3097 /3144 variables (removed 47) and now considering 7083/7141 (removed 58) transitions.
[2024-05-31 23:40:38] [INFO ] Flow matrix only has 6483 transitions (discarded 600 similar events)
// Phase 1: matrix 6483 rows 3097 cols
[2024-05-31 23:40:38] [INFO ] Computed 54 invariants in 143 ms
[2024-05-31 23:40:43] [INFO ] Implicit Places using invariants in 4711 ms returned []
[2024-05-31 23:40:43] [INFO ] Flow matrix only has 6483 transitions (discarded 600 similar events)
[2024-05-31 23:40:43] [INFO ] Invariant cache hit.
[2024-05-31 23:40:45] [INFO ] State equation strengthened by 2606 read => feed constraints.
[2024-05-31 23:41:15] [INFO ] Performed 947/3097 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:41:47] [INFO ] Performed 1423/3097 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-05-31 23:42:17] [INFO ] Performed 1955/3097 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2024-05-31 23:42:47] [INFO ] Performed 2896/3097 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2024-05-31 23:42:47] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2024-05-31 23:42:47] [INFO ] Implicit Places using invariants and state equation in 123997 ms returned []
Implicit Place search using SMT with State Equation took 128710 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3097/3196 places, 7083/7193 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137478 ms. Remains : 3097/3196 places, 7083/7193 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-00
Product exploration explored 100000 steps with 4710 reset in 932 ms.
Product exploration explored 100000 steps with 4708 reset in 953 ms.
Computed a total of 473 stabilizing places and 1882 stable transitions
Computed a total of 473 stabilizing places and 1882 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1881 resets) in 673 ms. (59 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (340 resets) in 302 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (340 resets) in 347 ms. (114 steps per ms) remains 2/2 properties
[2024-05-31 23:42:50] [INFO ] Flow matrix only has 6483 transitions (discarded 600 similar events)
[2024-05-31 23:42:50] [INFO ] Invariant cache hit.
[2024-05-31 23:42:50] [INFO ] State equation strengthened by 2606 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2988/2992 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2992 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/3018 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3018 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/3049 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3049 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/3093 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3093 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/3097 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3097 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6483/9580 variables, 3097/3151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9580/9580 variables, and 5757 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3920 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 3097/3097 constraints, ReadFeed: 2606/2606 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2988/2992 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2992 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/3018 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3018 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/3049 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:42:57] [INFO ] Deduced a trap composed of 125 places in 2320 ms of which 20 ms to minimize.
[2024-05-31 23:42:59] [INFO ] Deduced a trap composed of 74 places in 2454 ms of which 21 ms to minimize.
SMT process timed out in 9561ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 3097 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3097/3097 places, 7083/7083 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 3097 transition count 7076
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 3090 transition count 7076
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 14 place count 3090 transition count 7071
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 3085 transition count 7071
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 4 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 76 place count 3059 transition count 7045
Free-agglomeration rule (complex) applied 292 times.
Iterating global reduction 2 with 292 rules applied. Total rules applied 368 place count 3059 transition count 7050
Reduce places removed 292 places and 0 transitions.
Iterating post reduction 2 with 292 rules applied. Total rules applied 660 place count 2767 transition count 7050
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 661 place count 2767 transition count 7050
Applied a total of 661 rules in 1890 ms. Remains 2767 /3097 variables (removed 330) and now considering 7050/7083 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1891 ms. Remains : 2767/3097 places, 7050/7083 transitions.
RANDOM walk for 40000 steps (3067 resets) in 1005 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (208 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (208 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 29277 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 2
Probabilistic random walk after 29277 steps, saw 12146 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-31 23:43:05] [INFO ] Flow matrix only has 6164 transitions (discarded 886 similar events)
// Phase 1: matrix 6164 rows 2767 cols
[2024-05-31 23:43:05] [INFO ] Computed 54 invariants in 128 ms
[2024-05-31 23:43:05] [INFO ] State equation strengthened by 2903 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2658/2662 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2662 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2688 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/2719 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2719 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/2763 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2763 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/2767 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2767 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6164/8931 variables, 2767/2821 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8931 variables, 2903/5724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8931 variables, 0/5724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/8931 variables, 0/5724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8931/8931 variables, and 5724 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3282 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 2767/2767 constraints, ReadFeed: 2903/2903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2658/2662 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2662 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2688 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:43:10] [INFO ] Deduced a trap composed of 100 places in 1798 ms of which 17 ms to minimize.
[2024-05-31 23:43:12] [INFO ] Deduced a trap composed of 100 places in 1854 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2688 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 31/2719 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:43:15] [INFO ] Deduced a trap composed of 5 places in 1976 ms of which 18 ms to minimize.
[2024-05-31 23:43:17] [INFO ] Deduced a trap composed of 138 places in 1967 ms of which 19 ms to minimize.
[2024-05-31 23:43:19] [INFO ] Deduced a trap composed of 166 places in 1964 ms of which 18 ms to minimize.
[2024-05-31 23:43:21] [INFO ] Deduced a trap composed of 94 places in 2094 ms of which 18 ms to minimize.
[2024-05-31 23:43:23] [INFO ] Deduced a trap composed of 109 places in 2152 ms of which 18 ms to minimize.
[2024-05-31 23:43:25] [INFO ] Deduced a trap composed of 94 places in 2060 ms of which 17 ms to minimize.
[2024-05-31 23:43:27] [INFO ] Deduced a trap composed of 90 places in 2073 ms of which 19 ms to minimize.
[2024-05-31 23:43:29] [INFO ] Deduced a trap composed of 107 places in 2011 ms of which 17 ms to minimize.
[2024-05-31 23:43:31] [INFO ] Deduced a trap composed of 121 places in 2130 ms of which 19 ms to minimize.
[2024-05-31 23:43:34] [INFO ] Deduced a trap composed of 95 places in 2148 ms of which 19 ms to minimize.
[2024-05-31 23:43:36] [INFO ] Deduced a trap composed of 96 places in 2063 ms of which 18 ms to minimize.
[2024-05-31 23:43:38] [INFO ] Deduced a trap composed of 79 places in 2149 ms of which 18 ms to minimize.
[2024-05-31 23:43:40] [INFO ] Deduced a trap composed of 95 places in 2077 ms of which 18 ms to minimize.
[2024-05-31 23:43:42] [INFO ] Deduced a trap composed of 102 places in 2157 ms of which 18 ms to minimize.
[2024-05-31 23:43:44] [INFO ] Deduced a trap composed of 109 places in 1966 ms of which 18 ms to minimize.
[2024-05-31 23:43:46] [INFO ] Deduced a trap composed of 100 places in 2015 ms of which 18 ms to minimize.
[2024-05-31 23:43:48] [INFO ] Deduced a trap composed of 169 places in 2142 ms of which 18 ms to minimize.
[2024-05-31 23:43:51] [INFO ] Deduced a trap composed of 70 places in 2130 ms of which 18 ms to minimize.
[2024-05-31 23:43:53] [INFO ] Deduced a trap composed of 104 places in 2180 ms of which 20 ms to minimize.
[2024-05-31 23:43:55] [INFO ] Deduced a trap composed of 100 places in 2110 ms of which 19 ms to minimize.
SMT process timed out in 50354ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2767/2767 places, 7050/7050 transitions.
Applied a total of 0 rules in 410 ms. Remains 2767 /2767 variables (removed 0) and now considering 7050/7050 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 2767/2767 places, 7050/7050 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2767/2767 places, 7050/7050 transitions.
Applied a total of 0 rules in 434 ms. Remains 2767 /2767 variables (removed 0) and now considering 7050/7050 (removed 0) transitions.
[2024-05-31 23:43:56] [INFO ] Flow matrix only has 6164 transitions (discarded 886 similar events)
[2024-05-31 23:43:56] [INFO ] Invariant cache hit.
[2024-05-31 23:44:00] [INFO ] Implicit Places using invariants in 4134 ms returned []
[2024-05-31 23:44:00] [INFO ] Flow matrix only has 6164 transitions (discarded 886 similar events)
[2024-05-31 23:44:00] [INFO ] Invariant cache hit.
[2024-05-31 23:44:02] [INFO ] State equation strengthened by 2903 read => feed constraints.
[2024-05-31 23:44:32] [INFO ] Performed 845/2767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:45:11] [INFO ] Performed 1162/2767 implicitness test of which 0 returned IMPLICIT in 68 seconds.
[2024-05-31 23:45:42] [INFO ] Performed 1425/2767 implicitness test of which 0 returned IMPLICIT in 100 seconds.
[2024-05-31 23:46:12] [INFO ] Performed 1691/2767 implicitness test of which 0 returned IMPLICIT in 130 seconds.
[2024-05-31 23:46:12] [INFO ] Timeout of Implicit test with SMT after 130 seconds.
[2024-05-31 23:46:12] [INFO ] Implicit Places using invariants and state equation in 132436 ms returned []
Implicit Place search using SMT with State Equation took 136572 ms to find 0 implicit places.
[2024-05-31 23:46:13] [INFO ] Redundant transitions in 778 ms returned []
Running 6956 sub problems to find dead transitions.
[2024-05-31 23:46:13] [INFO ] Flow matrix only has 6164 transitions (discarded 886 similar events)
[2024-05-31 23:46:13] [INFO ] Invariant cache hit.
[2024-05-31 23:46:13] [INFO ] State equation strengthened by 2903 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2765 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 6956 unsolved
SMT process timed out in 54850ms, After SMT, problems are : Problem set: 0 solved, 6956 unsolved
Search for dead transitions found 0 dead transitions in 54926ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192745 ms. Remains : 2767/2767 places, 7050/7050 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3097/3097 places, 7083/7083 transitions.
Applied a total of 0 rules in 392 ms. Remains 3097 /3097 variables (removed 0) and now considering 7083/7083 (removed 0) transitions.
[2024-05-31 23:47:09] [INFO ] Flow matrix only has 6483 transitions (discarded 600 similar events)
// Phase 1: matrix 6483 rows 3097 cols
[2024-05-31 23:47:09] [INFO ] Computed 54 invariants in 133 ms
[2024-05-31 23:47:13] [INFO ] Implicit Places using invariants in 4460 ms returned []
[2024-05-31 23:47:13] [INFO ] Flow matrix only has 6483 transitions (discarded 600 similar events)
[2024-05-31 23:47:13] [INFO ] Invariant cache hit.
[2024-05-31 23:47:16] [INFO ] State equation strengthened by 2606 read => feed constraints.
[2024-05-31 23:47:46] [INFO ] Performed 893/3097 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:48:16] [INFO ] Performed 1423/3097 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 23:48:47] [INFO ] Performed 2001/3097 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 23:49:17] [INFO ] Performed 2951/3097 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-31 23:49:17] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-31 23:49:17] [INFO ] Implicit Places using invariants and state equation in 123126 ms returned []
Implicit Place search using SMT with State Equation took 127593 ms to find 0 implicit places.
Running 7058 sub problems to find dead transitions.
[2024-05-31 23:49:17] [INFO ] Flow matrix only has 6483 transitions (discarded 600 similar events)
[2024-05-31 23:49:17] [INFO ] Invariant cache hit.
[2024-05-31 23:49:17] [INFO ] State equation strengthened by 2606 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3095 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7058 unsolved
SMT process timed out in 42831ms, After SMT, problems are : Problem set: 0 solved, 7058 unsolved
Search for dead transitions found 0 dead transitions in 42919ms
Finished structural reductions in LTL mode , in 1 iterations and 170923 ms. Remains : 3097/3097 places, 7083/7083 transitions.
Computed a total of 473 stabilizing places and 1882 stable transitions
Computed a total of 473 stabilizing places and 1882 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1883 resets) in 522 ms. (76 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (340 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (340 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
[2024-05-31 23:50:00] [INFO ] Flow matrix only has 6483 transitions (discarded 600 similar events)
[2024-05-31 23:50:00] [INFO ] Invariant cache hit.
[2024-05-31 23:50:00] [INFO ] State equation strengthened by 2606 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2988/2992 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2992 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/3018 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3018 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/3049 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3049 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/3093 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3093 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/3097 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3097 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6483/9580 variables, 3097/3151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9580/9580 variables, and 5757 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3717 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 3097/3097 constraints, ReadFeed: 2606/2606 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2988/2992 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2992 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/3018 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3018 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/3049 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:50:07] [INFO ] Deduced a trap composed of 125 places in 2285 ms of which 21 ms to minimize.
[2024-05-31 23:50:09] [INFO ] Deduced a trap composed of 74 places in 2270 ms of which 20 ms to minimize.
SMT process timed out in 9043ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 3097 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3097/3097 places, 7083/7083 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 3097 transition count 7076
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 3090 transition count 7076
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 14 place count 3090 transition count 7071
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 3085 transition count 7071
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 5 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 76 place count 3059 transition count 7045
Free-agglomeration rule (complex) applied 292 times.
Iterating global reduction 2 with 292 rules applied. Total rules applied 368 place count 3059 transition count 7050
Reduce places removed 292 places and 0 transitions.
Iterating post reduction 2 with 292 rules applied. Total rules applied 660 place count 2767 transition count 7050
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 661 place count 2767 transition count 7050
Applied a total of 661 rules in 2103 ms. Remains 2767 /3097 variables (removed 330) and now considering 7050/7083 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2105 ms. Remains : 2767/3097 places, 7050/7083 transitions.
RANDOM walk for 40000 steps (3058 resets) in 1138 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (209 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (204 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 27884 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 2
Probabilistic random walk after 27884 steps, saw 11569 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-31 23:50:15] [INFO ] Flow matrix only has 6164 transitions (discarded 886 similar events)
// Phase 1: matrix 6164 rows 2767 cols
[2024-05-31 23:50:15] [INFO ] Computed 54 invariants in 107 ms
[2024-05-31 23:50:15] [INFO ] State equation strengthened by 2903 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2658/2662 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2662 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2688 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/2719 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2719 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/2763 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2763 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/2767 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2767 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6164/8931 variables, 2767/2821 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8931 variables, 2903/5724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8931 variables, 0/5724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/8931 variables, 0/5724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8931/8931 variables, and 5724 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3268 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 2767/2767 constraints, ReadFeed: 2903/2903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2658/2662 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2662 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2688 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:50:20] [INFO ] Deduced a trap composed of 100 places in 1802 ms of which 16 ms to minimize.
[2024-05-31 23:50:22] [INFO ] Deduced a trap composed of 100 places in 1857 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2688 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 31/2719 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:50:24] [INFO ] Deduced a trap composed of 5 places in 1852 ms of which 18 ms to minimize.
[2024-05-31 23:50:27] [INFO ] Deduced a trap composed of 138 places in 2058 ms of which 18 ms to minimize.
[2024-05-31 23:50:29] [INFO ] Deduced a trap composed of 166 places in 1946 ms of which 18 ms to minimize.
[2024-05-31 23:50:31] [INFO ] Deduced a trap composed of 94 places in 2092 ms of which 18 ms to minimize.
[2024-05-31 23:50:33] [INFO ] Deduced a trap composed of 109 places in 2100 ms of which 16 ms to minimize.
[2024-05-31 23:50:35] [INFO ] Deduced a trap composed of 94 places in 2159 ms of which 16 ms to minimize.
[2024-05-31 23:50:37] [INFO ] Deduced a trap composed of 90 places in 2158 ms of which 19 ms to minimize.
[2024-05-31 23:50:39] [INFO ] Deduced a trap composed of 107 places in 2096 ms of which 19 ms to minimize.
[2024-05-31 23:50:42] [INFO ] Deduced a trap composed of 121 places in 2140 ms of which 18 ms to minimize.
[2024-05-31 23:50:43] [INFO ] Deduced a trap composed of 95 places in 1901 ms of which 16 ms to minimize.
[2024-05-31 23:50:46] [INFO ] Deduced a trap composed of 96 places in 2129 ms of which 18 ms to minimize.
[2024-05-31 23:50:48] [INFO ] Deduced a trap composed of 79 places in 2155 ms of which 18 ms to minimize.
[2024-05-31 23:50:50] [INFO ] Deduced a trap composed of 95 places in 2122 ms of which 18 ms to minimize.
[2024-05-31 23:50:52] [INFO ] Deduced a trap composed of 102 places in 2143 ms of which 19 ms to minimize.
[2024-05-31 23:50:54] [INFO ] Deduced a trap composed of 109 places in 2033 ms of which 18 ms to minimize.
[2024-05-31 23:50:56] [INFO ] Deduced a trap composed of 100 places in 2100 ms of which 19 ms to minimize.
[2024-05-31 23:50:59] [INFO ] Deduced a trap composed of 169 places in 2086 ms of which 19 ms to minimize.
[2024-05-31 23:51:01] [INFO ] Deduced a trap composed of 70 places in 2025 ms of which 16 ms to minimize.
[2024-05-31 23:51:03] [INFO ] Deduced a trap composed of 104 places in 2065 ms of which 19 ms to minimize.
[2024-05-31 23:51:05] [INFO ] Deduced a trap composed of 100 places in 1881 ms of which 15 ms to minimize.
SMT process timed out in 50015ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2767/2767 places, 7050/7050 transitions.
Applied a total of 0 rules in 392 ms. Remains 2767 /2767 variables (removed 0) and now considering 7050/7050 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 2767/2767 places, 7050/7050 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2767/2767 places, 7050/7050 transitions.
Applied a total of 0 rules in 382 ms. Remains 2767 /2767 variables (removed 0) and now considering 7050/7050 (removed 0) transitions.
[2024-05-31 23:51:05] [INFO ] Flow matrix only has 6164 transitions (discarded 886 similar events)
[2024-05-31 23:51:05] [INFO ] Invariant cache hit.
[2024-05-31 23:51:10] [INFO ] Implicit Places using invariants in 4087 ms returned []
[2024-05-31 23:51:10] [INFO ] Flow matrix only has 6164 transitions (discarded 886 similar events)
[2024-05-31 23:51:10] [INFO ] Invariant cache hit.
[2024-05-31 23:51:11] [INFO ] State equation strengthened by 2903 read => feed constraints.
[2024-05-31 23:51:42] [INFO ] Performed 834/2767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:52:21] [INFO ] Performed 1162/2767 implicitness test of which 0 returned IMPLICIT in 68 seconds.
[2024-05-31 23:52:53] [INFO ] Performed 1425/2767 implicitness test of which 0 returned IMPLICIT in 101 seconds.
[2024-05-31 23:53:23] [INFO ] Performed 1724/2767 implicitness test of which 0 returned IMPLICIT in 131 seconds.
[2024-05-31 23:53:23] [INFO ] Timeout of Implicit test with SMT after 131 seconds.
[2024-05-31 23:53:23] [INFO ] Implicit Places using invariants and state equation in 133630 ms returned []
Implicit Place search using SMT with State Equation took 137721 ms to find 0 implicit places.
[2024-05-31 23:53:24] [INFO ] Redundant transitions in 711 ms returned []
Running 6956 sub problems to find dead transitions.
[2024-05-31 23:53:24] [INFO ] Flow matrix only has 6164 transitions (discarded 886 similar events)
[2024-05-31 23:53:24] [INFO ] Invariant cache hit.
[2024-05-31 23:53:24] [INFO ] State equation strengthened by 2903 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 1.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 1.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 1.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 0.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 0.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 1.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 1.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 1.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 1.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 1.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 1.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 1.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 1.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 1.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 1.0)
(s846 0.0)
(s847 0.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 0.0)
(s855 0.0)
(s856 1.0)
(s857 0.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 0.0)
(s866 0.0)
(s867 1.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 1.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 1.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 1.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 1.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 1.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 1.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 1.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 1.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 1.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 1.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 1.0)
(s972 0.0)
(s973 0.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 0.0)
(s982 0.0)
(s983 1.0)
(s984 0.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 0.0)
(s994 0.0)
(s995 1.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 1.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 1.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 1.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 1.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 1.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 1.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 1.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 1.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 1.0)
(s1072 0.0)
(s1073 0.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 0.0)
(s1083 0.0)
(s1084 1.0)
(s1085 0.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 0.0)
(s1096 0.0)
(s1097 1.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 1.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 1.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 1.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 1.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 1.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 1.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 1.0)
(s1150 0.0)
(s1151 0.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 0.0)
(s1162 0.0)
(s1163 1.0)
(s1164 0.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 0.0)
(s1176 0.0)
(s1177 1.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 1.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 1.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 1.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 1.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 1.0)
(s1210 0.0)
(s1211 0.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 0.0)
(s1223 0.0)
(s1224 1.0)
(s1225 0.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 0.0)
(s1238 0.0)
(s1239 1.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 1.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 1.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 1.0)
(s1256 0.0)
(s1257 0.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 0.0)
(s1270 0.0)
(s1271 1.0)
(s1272 0.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 0.0)
(s1286 0.0)
(s1287 1.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 1.0)
(s1292 0.0)
(s1293 0.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 0.0)
(s1307 0.0)
(s1308 1.0)
(s1309 0.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 0.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 0.0)
(s1340 0.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 0.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 0.0)
(s1395 0.0)
(s1396 1.0)
(s1397 0.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 0.0)
(s1425 0.0)
(s1426 1.0)
(s1427 0.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 0.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2765 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 6956 unsolved
SMT process timed out in 54380ms, After SMT, problems are : Problem set: 0 solved, 6956 unsolved
Search for dead transitions found 0 dead transitions in 54462ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193323 ms. Remains : 2767/2767 places, 7050/7050 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4705 reset in 785 ms.
Product exploration explored 100000 steps with 4707 reset in 921 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 3097 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3097/3097 places, 7083/7083 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 3097 transition count 7083
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 7 place count 3097 transition count 7084
Deduced a syphon composed of 12 places in 4 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 3097 transition count 7084
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 3094 transition count 7081
Deduced a syphon composed of 9 places in 4 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 3094 transition count 7081
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 4 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 44 place count 3094 transition count 7081
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 3093 transition count 7080
Deduced a syphon composed of 34 places in 4 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 3093 transition count 7080
Deduced a syphon composed of 34 places in 4 ms
Applied a total of 46 rules in 2736 ms. Remains 3093 /3097 variables (removed 4) and now considering 7080/7083 (removed 3) transitions.
[2024-05-31 23:54:24] [INFO ] Redundant transitions in 658 ms returned []
Running 7055 sub problems to find dead transitions.
[2024-05-31 23:54:24] [INFO ] Flow matrix only has 6480 transitions (discarded 600 similar events)
// Phase 1: matrix 6480 rows 3093 cols
[2024-05-31 23:54:25] [INFO ] Computed 54 invariants in 150 ms
[2024-05-31 23:54:25] [INFO ] State equation strengthened by 2606 read => feed constraints.
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-00
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-11
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-12
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-13
FORMULA MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-15
BK_STOP 1717201040462
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-00
ltl formula formula --ltl=/tmp/1214/ltl_0_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.200 real 0.370 user 0.460 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 7001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10861 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~24 levels ~10000 states ~11604 transitions
pnml2lts-mc( 2/ 4): ~24 levels ~20000 states ~23020 transitions
pnml2lts-mc( 0/ 4): ~27 levels ~40000 states ~45752 transitions
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-01
ltl formula formula --ltl=/tmp/1214/ltl_1_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.390 real 0.400 user 0.460 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10870 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 81
pnml2lts-mc( 0/ 4): unique transitions count: 377
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 84
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 84 states 456 transitions, fanout: 5.429
pnml2lts-mc( 0/ 4): Total exploration time 0.260 sec (0.260 sec minimum, 0.260 sec on average)
pnml2lts-mc( 0/ 4): States per second: 323, Transitions per second: 1754
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 63.5 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-02
ltl formula formula --ltl=/tmp/1214/ltl_2_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.250 real 0.440 user 0.510 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10859 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~24!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2570
pnml2lts-mc( 0/ 4): unique states count: 2641
pnml2lts-mc( 0/ 4): unique transitions count: 3201
pnml2lts-mc( 0/ 4): - self-loop count: 18
pnml2lts-mc( 0/ 4): - claim dead count: 334
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2644
pnml2lts-mc( 0/ 4): - cum. max stack depth: 90
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2644 states 3280 transitions, fanout: 1.241
pnml2lts-mc( 0/ 4): Total exploration time 11.720 sec (11.710 sec minimum, 11.718 sec on average)
pnml2lts-mc( 0/ 4): States per second: 226, Transitions per second: 280
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 50.3 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.1MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-03
ltl formula formula --ltl=/tmp/1214/ltl_3_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.210 real 0.440 user 0.420 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10858 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 66
pnml2lts-mc( 0/ 4): unique transitions count: 362
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 69
pnml2lts-mc( 0/ 4): - cum. max stack depth: 69
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 69 states 441 transitions, fanout: 6.391
pnml2lts-mc( 0/ 4): Total exploration time 0.290 sec (0.270 sec minimum, 0.278 sec on average)
pnml2lts-mc( 0/ 4): States per second: 238, Transitions per second: 1521
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 64.5 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-04
ltl formula formula --ltl=/tmp/1214/ltl_4_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.300 real 0.420 user 0.420 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10858 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 81
pnml2lts-mc( 0/ 4): unique transitions count: 377
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 84
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 84 states 456 transitions, fanout: 5.429
pnml2lts-mc( 0/ 4): Total exploration time 0.270 sec (0.260 sec minimum, 0.265 sec on average)
pnml2lts-mc( 0/ 4): States per second: 311, Transitions per second: 1689
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 63.0 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-05
ltl formula formula --ltl=/tmp/1214/ltl_5_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.180 real 0.430 user 0.390 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 7001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10859 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 75
pnml2lts-mc( 0/ 4): unique transitions count: 325
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 81
pnml2lts-mc( 0/ 4): - cum. max stack depth: 81
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 81 states 453 transitions, fanout: 5.593
pnml2lts-mc( 0/ 4): Total exploration time 0.260 sec (0.250 sec minimum, 0.252 sec on average)
pnml2lts-mc( 0/ 4): States per second: 312, Transitions per second: 1742
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 69.1 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-06
ltl formula formula --ltl=/tmp/1214/ltl_6_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.210 real 0.400 user 0.400 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10857 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 80
pnml2lts-mc( 0/ 4): unique transitions count: 376
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 83
pnml2lts-mc( 0/ 4): - cum. max stack depth: 83
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 83 states 455 transitions, fanout: 5.482
pnml2lts-mc( 0/ 4): Total exploration time 0.260 sec (0.250 sec minimum, 0.252 sec on average)
pnml2lts-mc( 0/ 4): States per second: 319, Transitions per second: 1750
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 63.0 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-07
ltl formula formula --ltl=/tmp/1214/ltl_7_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.190 real 0.430 user 0.370 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10858 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 80
pnml2lts-mc( 0/ 4): unique transitions count: 376
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 83
pnml2lts-mc( 0/ 4): - cum. max stack depth: 83
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 83 states 455 transitions, fanout: 5.482
pnml2lts-mc( 0/ 4): Total exploration time 0.260 sec (0.250 sec minimum, 0.255 sec on average)
pnml2lts-mc( 0/ 4): States per second: 319, Transitions per second: 1750
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 63.8 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-08
ltl formula formula --ltl=/tmp/1214/ltl_8_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.160 real 0.390 user 0.470 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10864 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 76
pnml2lts-mc( 0/ 4): unique transitions count: 372
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 79
pnml2lts-mc( 0/ 4): - cum. max stack depth: 79
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 79 states 451 transitions, fanout: 5.709
pnml2lts-mc( 0/ 4): Total exploration time 0.260 sec (0.240 sec minimum, 0.252 sec on average)
pnml2lts-mc( 0/ 4): States per second: 304, Transitions per second: 1735
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 63.6 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-09
ltl formula formula --ltl=/tmp/1214/ltl_9_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.170 real 0.450 user 0.370 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10884 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 81
pnml2lts-mc( 0/ 4): unique transitions count: 377
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 84
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 84 states 456 transitions, fanout: 5.429
pnml2lts-mc( 0/ 4): Total exploration time 0.340 sec (0.320 sec minimum, 0.327 sec on average)
pnml2lts-mc( 0/ 4): States per second: 247, Transitions per second: 1341
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 63.4 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-10
ltl formula formula --ltl=/tmp/1214/ltl_10_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.180 real 0.410 user 0.430 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10861 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~21 levels ~10000 states ~11692 transitions
pnml2lts-mc( 0/ 4): ~24 levels ~20000 states ~23020 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 36539
pnml2lts-mc( 0/ 4): unique states count: 36604
pnml2lts-mc( 0/ 4): unique transitions count: 41888
pnml2lts-mc( 0/ 4): - self-loop count: 183
pnml2lts-mc( 0/ 4): - claim dead count: 4866
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 36607
pnml2lts-mc( 0/ 4): - cum. max stack depth: 96
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 36607 states 41967 transitions, fanout: 1.146
pnml2lts-mc( 0/ 4): Total exploration time 134.710 sec (134.670 sec minimum, 134.693 sec on average)
pnml2lts-mc( 0/ 4): States per second: 272, Transitions per second: 312
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.9MB, 24.8 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.9MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-11
ltl formula formula --ltl=/tmp/1214/ltl_11_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_11_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.210 real 0.420 user 0.520 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 7001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10888 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~21 levels ~10000 states ~11692 transitions
pnml2lts-mc( 2/ 4): ~24 levels ~20000 states ~23020 transitions
pnml2lts-mc( 2/ 4): ~24 levels ~40000 states ~46020 transitions
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-12
ltl formula formula --ltl=/tmp/1214/ltl_12_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.200 real 0.440 user 0.380 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 7001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10863 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~21 levels ~10000 states ~11692 transitions
pnml2lts-mc( 2/ 4): ~24 levels ~20000 states ~23020 transitions
pnml2lts-mc( 2/ 4): ~24 levels ~40000 states ~45844 transitions
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-13
ltl formula formula --ltl=/tmp/1214/ltl_13_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.250 real 0.370 user 0.510 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 7001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10869 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~24 levels ~10000 states ~11704 transitions
pnml2lts-mc( 2/ 4): ~24 levels ~20000 states ~27052 transitions
pnml2lts-mc( 1/ 4): ~27 levels ~40000 states ~66340 transitions
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-14
ltl formula formula --ltl=/tmp/1214/ltl_14_
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 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.270 real 0.410 user 0.410 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10865 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~21!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 81
pnml2lts-mc( 0/ 4): unique transitions count: 377
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 84
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 84 states 456 transitions, fanout: 5.429
pnml2lts-mc( 0/ 4): Total exploration time 0.260 sec (0.250 sec minimum, 0.257 sec on average)
pnml2lts-mc( 0/ 4): States per second: 323, Transitions per second: 1754
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 63.4 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11101 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S24C02-LTLCardinality-15
ltl formula formula --ltl=/tmp/1214/ltl_15_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 7032 places, 10855 transitions and 46214 arcs
pnml2lts-mc( 0/ 4): Petri net gen analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.160 real 0.410 user 0.420 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1214/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1214/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1214/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1214/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 7002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 7033, there are 10858 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~21 levels ~10000 states ~11692 transitions
pnml2lts-mc( 1/ 4): ~24 levels ~20000 states ~23020 transitions
pnml2lts-mc( 1/ 4): ~24 levels ~40000 states ~45932 transitions
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-S24C02"
export BK_EXAMINATION="LTLCardinality"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654350800059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C02.tgz
mv MultiCrashLeafsetExtension-PT-S24C02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;