Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 13K Apr 29 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 16:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 16:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 5.7M May 10 09:34 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-S16C07-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652832814438

Running Version 202205111006
[2022-05-18 00:13:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 00:13:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:13:36] [INFO ] Load time of PNML (sax parser for PT used): 426 ms
[2022-05-18 00:13:36] [INFO ] Transformed 6222 places.
[2022-05-18 00:13:36] [INFO ] Transformed 8685 transitions.
[2022-05-18 00:13:36] [INFO ] Parsed PT model containing 6222 places and 8685 transitions in 559 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 6222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 6188 transition count 8685
Discarding 1880 places :
Symmetric choice reduction at 1 with 1880 rule applications. Total rules 1914 place count 4308 transition count 6805
Iterating global reduction 1 with 1880 rules applied. Total rules applied 3794 place count 4308 transition count 6805
Discarding 1650 places :
Symmetric choice reduction at 1 with 1650 rule applications. Total rules 5444 place count 2658 transition count 5155
Iterating global reduction 1 with 1650 rules applied. Total rules applied 7094 place count 2658 transition count 5155
Discarding 222 places :
Symmetric choice reduction at 1 with 222 rule applications. Total rules 7316 place count 2436 transition count 3601
Iterating global reduction 1 with 222 rules applied. Total rules applied 7538 place count 2436 transition count 3601
Applied a total of 7538 rules in 1302 ms. Remains 2436 /6222 variables (removed 3786) and now considering 3601/8685 (removed 5084) transitions.
[2022-05-18 00:13:37] [INFO ] Flow matrix only has 3329 transitions (discarded 272 similar events)
// Phase 1: matrix 3329 rows 2436 cols
[2022-05-18 00:13:37] [INFO ] Computed 577 place invariants in 220 ms
[2022-05-18 00:13:40] [INFO ] Implicit Places using invariants in 3304 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 31, 38, 47, 58, 71, 86, 102, 118, 120, 122, 124, 126, 128, 130, 132, 145, 156, 165, 172, 177, 180, 211, 218, 221, 222, 223, 224, 225, 226, 228, 231, 238, 254, 265, 278, 292, 306, 308, 309, 310, 311, 312, 313, 324, 333, 340, 348, 351, 353, 384, 391, 394, 395, 396, 397, 398, 399, 400, 401, 403, 406, 411, 418, 427, 438, 450, 462, 463, 464, 465, 466, 467, 468, 469, 478, 485, 490, 493, 495, 497, 528, 535, 538, 539, 540, 541, 543, 544, 545, 547, 554, 559, 566, 575, 585, 595, 596, 597, 598, 599, 600, 601, 602, 609, 614, 617, 619, 621, 623, 654, 661, 664, 665, 666, 667, 668, 669, 670, 671, 673, 675, 677, 680, 685, 692, 700, 708, 710, 711, 712, 713, 714, 715, 720, 723, 725, 730, 732, 734, 765, 772, 775, 776, 777, 778, 779, 780, 781, 782, 784, 786, 788, 790, 793, 798, 804, 810, 811, 812, 813, 814, 815, 816, 817, 820, 822, 824, 826, 828, 830, 861, 868, 871, 872, 873, 874, 875, 876, 877, 878, 880, 882, 884, 886, 888, 891, 895, 899, 900, 901, 902, 903, 904, 905, 906, 908, 910, 912, 914, 916, 918, 949, 956, 960, 961, 962, 963, 964, 965, 966, 971, 973, 975, 977, 979, 981, 983, 986, 987, 988, 989, 990, 991, 992, 993, 995, 997, 999, 1001, 1003, 1005, 1036, 1038, 1042, 1046, 1047, 1048, 1051, 1052, 1053, 1057, 1059, 1061, 1065, 1067, 1069, 1071, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1081, 1083, 1085, 1087, 1089, 1091, 1093, 1124, 1131, 1134, 1135, 1136, 1137, 1138, 1139, 1140, 1141, 1143, 1145, 1147, 1149, 1151, 1153, 1155, 1158, 1159, 1160, 1161, 1162, 1163, 1164, 1165, 1167, 1169, 1171, 1173, 1175, 1177, 1208, 1215, 1218, 1219, 1220, 1221, 1222, 1224, 1225, 1227, 1232, 1234, 1238, 1240, 1243, 1248, 1249, 1250, 1251, 1252, 1253, 1254, 1255, 1258, 1260, 1262, 1264, 1266, 1268, 1299, 1306, 1309, 1310, 1312, 1313, 1317, 1321, 1323, 1328, 1330, 1332, 1337, 1342, 1349, 1350, 1351, 1352, 1353, 1354, 1355, 1356, 1361, 1364, 1366, 1368, 1370, 1372, 1403, 1410, 1413, 1414, 1415, 1417, 1418, 1419, 1420, 1422, 1424, 1426, 1428, 1431, 1436, 1446, 1455, 1457, 1458, 1459, 1460, 1461, 1462, 1469, 1477, 1480, 1482, 1484, 1486, 1517, 1524, 1527, 1528, 1529, 1530, 1531, 1532, 1533, 1534, 1536, 1538, 1540, 1543, 1548, 1555, 1564, 1575, 1576, 1577, 1578, 1579, 1580, 1581, 1582, 1591, 1598, 1603, 1606, 1608, 1610, 1641, 1648, 1651, 1652, 1653, 1654, 1655, 1656, 1657, 1658, 1660, 1662, 1665, 1670, 1677, 1686, 1697, 1710, 1711, 1712, 1714, 1715, 1716, 1717, 1730, 1739, 1746, 1751, 1754, 1756, 1787, 1794, 1797, 1799, 1801, 1802, 1803, 1804, 1806, 1809, 1814, 1821, 1834, 1845, 1858, 1873, 1874, 1875, 1876, 1877, 1878, 1879, 1880, 1893, 1904, 1913, 1920, 1925, 1928, 1959, 1961, 1965, 1968, 1969, 1970, 1971, 1972, 1973, 1974, 1975, 1978, 1983, 1990, 1999, 2010, 2023, 2038, 2055, 2056, 2057, 2058, 2059, 2060, 2061, 2062, 2077, 2090, 2101, 2110, 2117, 2122, 2155]
Discarding 510 places :
Implicit Place search using SMT only with invariants took 3340 ms to find 510 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1926/6222 places, 3601/8685 transitions.
Discarding 207 places :
Symmetric choice reduction at 0 with 207 rule applications. Total rules 207 place count 1719 transition count 3394
Iterating global reduction 0 with 207 rules applied. Total rules applied 414 place count 1719 transition count 3394
Discarding 207 places :
Symmetric choice reduction at 0 with 207 rule applications. Total rules 621 place count 1512 transition count 3187
Iterating global reduction 0 with 207 rules applied. Total rules applied 828 place count 1512 transition count 3187
Discarding 206 places :
Symmetric choice reduction at 0 with 206 rule applications. Total rules 1034 place count 1306 transition count 2981
Iterating global reduction 0 with 206 rules applied. Total rules applied 1240 place count 1306 transition count 2981
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1259 place count 1287 transition count 2848
Iterating global reduction 0 with 19 rules applied. Total rules applied 1278 place count 1287 transition count 2848
Applied a total of 1278 rules in 307 ms. Remains 1287 /1926 variables (removed 639) and now considering 2848/3601 (removed 753) transitions.
[2022-05-18 00:13:41] [INFO ] Flow matrix only has 2576 transitions (discarded 272 similar events)
// Phase 1: matrix 2576 rows 1287 cols
[2022-05-18 00:13:41] [INFO ] Computed 67 place invariants in 80 ms
[2022-05-18 00:13:42] [INFO ] Implicit Places using invariants in 1095 ms returned []
[2022-05-18 00:13:42] [INFO ] Flow matrix only has 2576 transitions (discarded 272 similar events)
// Phase 1: matrix 2576 rows 1287 cols
[2022-05-18 00:13:42] [INFO ] Computed 67 place invariants in 31 ms
[2022-05-18 00:13:43] [INFO ] State equation strengthened by 1004 read => feed constraints.
[2022-05-18 00:13:51] [INFO ] Implicit Places using invariants and state equation in 9554 ms returned []
Implicit Place search using SMT with State Equation took 10655 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1287/6222 places, 2848/8685 transitions.
Finished structural reductions, in 2 iterations. Remains : 1287/6222 places, 2848/8685 transitions.
Support contains 29 out of 1287 places after structural reductions.
[2022-05-18 00:13:52] [INFO ] Flatten gal took : 231 ms
[2022-05-18 00:13:52] [INFO ] Flatten gal took : 177 ms
[2022-05-18 00:13:52] [INFO ] Input system was already deterministic with 2848 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 652 ms. (steps per millisecond=15 ) properties (out of 19) seen :6
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-05-18 00:13:54] [INFO ] Flow matrix only has 2576 transitions (discarded 272 similar events)
// Phase 1: matrix 2576 rows 1287 cols
[2022-05-18 00:13:54] [INFO ] Computed 67 place invariants in 37 ms
[2022-05-18 00:13:55] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-18 00:13:55] [INFO ] [Real]Absence check using 31 positive and 36 generalized place invariants in 23 ms returned sat
[2022-05-18 00:13:55] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2022-05-18 00:13:55] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:13:55] [INFO ] [Nat]Absence check using 31 positive and 36 generalized place invariants in 21 ms returned sat
[2022-05-18 00:13:56] [INFO ] After 1279ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :5
[2022-05-18 00:13:56] [INFO ] State equation strengthened by 1004 read => feed constraints.
[2022-05-18 00:13:57] [INFO ] After 808ms SMT Verify possible using 1004 Read/Feed constraints in natural domain returned unsat :8 sat :3
[2022-05-18 00:13:58] [INFO ] Deduced a trap composed of 213 places in 533 ms of which 4 ms to minimize.
[2022-05-18 00:13:59] [INFO ] Deduced a trap composed of 550 places in 568 ms of which 2 ms to minimize.
[2022-05-18 00:14:00] [INFO ] Deduced a trap composed of 245 places in 554 ms of which 1 ms to minimize.
[2022-05-18 00:14:00] [INFO ] Deduced a trap composed of 242 places in 539 ms of which 2 ms to minimize.
[2022-05-18 00:14:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2614 ms
[2022-05-18 00:14:01] [INFO ] After 4164ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :3
Attempting to minimize the solution found.
Minimization took 449 ms.
[2022-05-18 00:14:01] [INFO ] After 6420ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :3
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 5 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1287/1287 places, 2848/2848 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1287 transition count 2821
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1260 transition count 2821
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 54 place count 1260 transition count 2797
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 102 place count 1236 transition count 2797
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 109 place count 1229 transition count 2784
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 1229 transition count 2784
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 116 place count 1229 transition count 2783
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 1228 transition count 2783
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 122 place count 1224 transition count 2761
Iterating global reduction 2 with 4 rules applied. Total rules applied 126 place count 1224 transition count 2761
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 1223 transition count 2754
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 1223 transition count 2754
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 3 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 192 place count 1191 transition count 2722
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 200 place count 1183 transition count 2714
Iterating global reduction 2 with 8 rules applied. Total rules applied 208 place count 1183 transition count 2714
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 216 place count 1175 transition count 2658
Iterating global reduction 2 with 8 rules applied. Total rules applied 224 place count 1175 transition count 2658
Free-agglomeration rule (complex) applied 147 times.
Iterating global reduction 2 with 147 rules applied. Total rules applied 371 place count 1175 transition count 4035
Reduce places removed 147 places and 0 transitions.
Iterating post reduction 2 with 147 rules applied. Total rules applied 518 place count 1028 transition count 4035
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 533 place count 1028 transition count 4035
Applied a total of 533 rules in 1031 ms. Remains 1028 /1287 variables (removed 259) and now considering 4035/2848 (removed -1187) transitions.
Finished structural reductions, in 1 iterations. Remains : 1028/1287 places, 4035/2848 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:14:03] [INFO ] Flow matrix only has 3637 transitions (discarded 398 similar events)
// Phase 1: matrix 3637 rows 1028 cols
[2022-05-18 00:14:03] [INFO ] Computed 67 place invariants in 81 ms
[2022-05-18 00:14:03] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:14:03] [INFO ] [Nat]Absence check using 32 positive place invariants in 18 ms returned sat
[2022-05-18 00:14:03] [INFO ] [Nat]Absence check using 32 positive and 35 generalized place invariants in 6 ms returned sat
[2022-05-18 00:14:04] [INFO ] After 945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:14:04] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:14:06] [INFO ] After 1713ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:14:07] [INFO ] Deduced a trap composed of 278 places in 530 ms of which 1 ms to minimize.
[2022-05-18 00:14:08] [INFO ] Deduced a trap composed of 90 places in 614 ms of which 1 ms to minimize.
[2022-05-18 00:14:08] [INFO ] Deduced a trap composed of 116 places in 614 ms of which 1 ms to minimize.
[2022-05-18 00:14:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2122 ms
[2022-05-18 00:14:09] [INFO ] After 5004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1094 ms.
[2022-05-18 00:14:10] [INFO ] After 7256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 1028 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1028/1028 places, 4035/4035 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1028 transition count 4035
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 1027 transition count 4034
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1027 transition count 4034
Applied a total of 3 rules in 269 ms. Remains 1027 /1028 variables (removed 1) and now considering 4034/4035 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1027/1028 places, 4034/4035 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 61638 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61638 steps, saw 26047 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:14:14] [INFO ] Flow matrix only has 3636 transitions (discarded 398 similar events)
// Phase 1: matrix 3636 rows 1027 cols
[2022-05-18 00:14:14] [INFO ] Computed 67 place invariants in 46 ms
[2022-05-18 00:14:14] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:14:14] [INFO ] [Nat]Absence check using 32 positive place invariants in 21 ms returned sat
[2022-05-18 00:14:14] [INFO ] [Nat]Absence check using 32 positive and 35 generalized place invariants in 8 ms returned sat
[2022-05-18 00:14:15] [INFO ] After 1041ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:14:15] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:14:17] [INFO ] After 1716ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:14:19] [INFO ] Deduced a trap composed of 219 places in 460 ms of which 0 ms to minimize.
[2022-05-18 00:14:20] [INFO ] Deduced a trap composed of 96 places in 567 ms of which 1 ms to minimize.
[2022-05-18 00:14:20] [INFO ] Deduced a trap composed of 117 places in 571 ms of which 1 ms to minimize.
[2022-05-18 00:14:21] [INFO ] Deduced a trap composed of 116 places in 565 ms of which 1 ms to minimize.
[2022-05-18 00:14:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2643 ms
[2022-05-18 00:14:22] [INFO ] After 6456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1033 ms.
[2022-05-18 00:14:23] [INFO ] After 8763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 1027 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1027/1027 places, 4034/4034 transitions.
Applied a total of 0 rules in 127 ms. Remains 1027 /1027 variables (removed 0) and now considering 4034/4034 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1027/1027 places, 4034/4034 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1027/1027 places, 4034/4034 transitions.
Applied a total of 0 rules in 151 ms. Remains 1027 /1027 variables (removed 0) and now considering 4034/4034 (removed 0) transitions.
[2022-05-18 00:14:23] [INFO ] Flow matrix only has 3636 transitions (discarded 398 similar events)
// Phase 1: matrix 3636 rows 1027 cols
[2022-05-18 00:14:23] [INFO ] Computed 67 place invariants in 31 ms
[2022-05-18 00:14:24] [INFO ] Implicit Places using invariants in 1179 ms returned [7, 141, 151, 202, 310, 313, 389, 459, 481, 482, 535, 556, 557, 593, 613, 763, 764]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1188 ms to find 17 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1010/1027 places, 4034/4034 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1004 transition count 4028
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1004 transition count 4028
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 998 transition count 4022
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 998 transition count 4022
Applied a total of 24 rules in 156 ms. Remains 998 /1010 variables (removed 12) and now considering 4022/4034 (removed 12) transitions.
[2022-05-18 00:14:24] [INFO ] Flow matrix only has 3624 transitions (discarded 398 similar events)
// Phase 1: matrix 3624 rows 998 cols
[2022-05-18 00:14:24] [INFO ] Computed 50 place invariants in 37 ms
[2022-05-18 00:14:25] [INFO ] Implicit Places using invariants in 1126 ms returned []
[2022-05-18 00:14:25] [INFO ] Flow matrix only has 3624 transitions (discarded 398 similar events)
// Phase 1: matrix 3624 rows 998 cols
[2022-05-18 00:14:25] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-18 00:14:26] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:14:49] [INFO ] Implicit Places using invariants and state equation in 24036 ms returned []
Implicit Place search using SMT with State Equation took 25167 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 998/1027 places, 4022/4034 transitions.
Finished structural reductions, in 2 iterations. Remains : 998/1027 places, 4022/4034 transitions.
Incomplete random walk after 10000 steps, including 240 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 64279 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64279 steps, saw 27069 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:14:53] [INFO ] Flow matrix only has 3624 transitions (discarded 398 similar events)
// Phase 1: matrix 3624 rows 998 cols
[2022-05-18 00:14:53] [INFO ] Computed 50 place invariants in 30 ms
[2022-05-18 00:14:53] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:14:53] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 00:14:53] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2022-05-18 00:14:54] [INFO ] After 999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:14:54] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:14:55] [INFO ] After 1200ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:14:56] [INFO ] Deduced a trap composed of 223 places in 462 ms of which 1 ms to minimize.
[2022-05-18 00:14:57] [INFO ] Deduced a trap composed of 86 places in 537 ms of which 1 ms to minimize.
[2022-05-18 00:14:58] [INFO ] Deduced a trap composed of 87 places in 514 ms of which 1 ms to minimize.
[2022-05-18 00:14:58] [INFO ] Deduced a trap composed of 101 places in 511 ms of which 1 ms to minimize.
[2022-05-18 00:14:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2480 ms
[2022-05-18 00:14:59] [INFO ] After 4495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 736 ms.
[2022-05-18 00:14:59] [INFO ] After 6415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 4022/4022 transitions.
Applied a total of 0 rules in 105 ms. Remains 998 /998 variables (removed 0) and now considering 4022/4022 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 4022/4022 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 998/998 places, 4022/4022 transitions.
Applied a total of 0 rules in 102 ms. Remains 998 /998 variables (removed 0) and now considering 4022/4022 (removed 0) transitions.
[2022-05-18 00:15:00] [INFO ] Flow matrix only has 3624 transitions (discarded 398 similar events)
// Phase 1: matrix 3624 rows 998 cols
[2022-05-18 00:15:00] [INFO ] Computed 50 place invariants in 24 ms
[2022-05-18 00:15:01] [INFO ] Implicit Places using invariants in 1103 ms returned []
[2022-05-18 00:15:01] [INFO ] Flow matrix only has 3624 transitions (discarded 398 similar events)
// Phase 1: matrix 3624 rows 998 cols
[2022-05-18 00:15:01] [INFO ] Computed 50 place invariants in 20 ms
[2022-05-18 00:15:02] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:15:24] [INFO ] Implicit Places using invariants and state equation in 23519 ms returned []
Implicit Place search using SMT with State Equation took 24626 ms to find 0 implicit places.
[2022-05-18 00:15:25] [INFO ] Redundant transitions in 307 ms returned []
[2022-05-18 00:15:25] [INFO ] Flow matrix only has 3624 transitions (discarded 398 similar events)
// Phase 1: matrix 3624 rows 998 cols
[2022-05-18 00:15:25] [INFO ] Computed 50 place invariants in 20 ms
[2022-05-18 00:15:26] [INFO ] Dead Transitions using invariants and state equation in 1405 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/998 places, 4022/4022 transitions.
Graph (trivial) has 1060 edges and 998 vertex of which 17 / 998 are part of one of the 1 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4630 edges and 982 vertex of which 968 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.8 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1221.t1444 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 951 transition count 3253
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 854 transition count 3060
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 263 rules applied. Total rules applied 654 place count 758 transition count 2893
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 3 with 211 rules applied. Total rules applied 865 place count 687 transition count 2753
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 188 rules applied. Total rules applied 1053 place count 618 transition count 2634
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1201 place count 568 transition count 2536
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1329 place count 520 transition count 2456
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1423 place count 488 transition count 2394
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1501 place count 458 transition count 2346
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1553 place count 440 transition count 2312
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1593 place count 424 transition count 2288
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1615 place count 416 transition count 2274
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1629 place count 410 transition count 2266
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1634 place count 408 transition count 2263
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1636 place count 407 transition count 2262
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 21 Pre rules applied. Total rules applied 1636 place count 407 transition count 2241
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 15 with 42 rules applied. Total rules applied 1678 place count 386 transition count 2241
Discarding 277 places :
Symmetric choice reduction at 15 with 277 rule applications. Total rules 1955 place count 109 transition count 428
Iterating global reduction 15 with 277 rules applied. Total rules applied 2232 place count 109 transition count 428
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Iterating post reduction 15 with 172 rules applied. Total rules applied 2404 place count 109 transition count 256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2404 place count 109 transition count 255
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2406 place count 108 transition count 255
Discarding 11 places :
Symmetric choice reduction at 16 with 11 rule applications. Total rules 2417 place count 97 transition count 186
Iterating global reduction 16 with 11 rules applied. Total rules applied 2428 place count 97 transition count 186
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 16 with 37 rules applied. Total rules applied 2465 place count 97 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2466 place count 96 transition count 149
Discarding 6 places :
Symmetric choice reduction at 18 with 6 rule applications. Total rules 2472 place count 90 transition count 140
Iterating global reduction 18 with 6 rules applied. Total rules applied 2478 place count 90 transition count 140
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 2479 place count 89 transition count 139
Iterating global reduction 18 with 1 rules applied. Total rules applied 2480 place count 89 transition count 139
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 18 with 20 rules applied. Total rules applied 2500 place count 79 transition count 129
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 2502 place count 77 transition count 123
Iterating global reduction 18 with 2 rules applied. Total rules applied 2504 place count 77 transition count 123
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 18 with 13 rules applied. Total rules applied 2517 place count 77 transition count 110
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 18 with 13 rules applied. Total rules applied 2530 place count 64 transition count 110
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 19 with 7 rules applied. Total rules applied 2537 place count 64 transition count 110
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 2538 place count 63 transition count 103
Iterating global reduction 19 with 1 rules applied. Total rules applied 2539 place count 63 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 2543 place count 63 transition count 99
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 2544 place count 62 transition count 96
Iterating global reduction 20 with 1 rules applied. Total rules applied 2545 place count 62 transition count 96
Applied a total of 2545 rules in 568 ms. Remains 62 /998 variables (removed 936) and now considering 96/4022 (removed 3926) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 96 rows 62 cols
[2022-05-18 00:15:27] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-18 00:15:27] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:15:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 00:15:27] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 00:15:27] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:15:27] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-18 00:15:27] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:15:27] [INFO ] Flatten gal took : 6 ms
[2022-05-18 00:15:27] [INFO ] Flatten gal took : 7 ms
[2022-05-18 00:15:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13327994174580359527.gal : 66 ms
[2022-05-18 00:15:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3216036702217315477.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2928546786160814659;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13327994174580359527.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3216036702217315477.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality3216036702217315477.prop.
Reachability property AtomicPropp11 is true.
SDD proceeding with computation,1 properties remain. new max is 2
SDD size :1 after 18
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :18 after 20
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :20 after 53
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :53 after 63
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :63 after 138
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :138 after 257
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :257 after 4566
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,18813,0.080738,5904,2,2002,13,6906,7,0,325,4913,0
Total reachable state count : 18813

Verifying 2 reachability properties.
Reachability property AtomicPropp3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp3,583,0.081351,6168,2,369,13,6906,7,0,329,4913,0
Reachability property AtomicPropp11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp11,583,0.082281,6168,2,375,13,6906,8,0,333,4913,0
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 455 stabilizing places and 1215 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 2848/2848 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1268 transition count 2823
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1268 transition count 2823
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 54 place count 1252 transition count 2777
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 1252 transition count 2777
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 81 place count 1241 transition count 2706
Iterating global reduction 0 with 11 rules applied. Total rules applied 92 place count 1241 transition count 2706
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 1240 transition count 2699
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1240 transition count 2699
Applied a total of 94 rules in 191 ms. Remains 1240 /1287 variables (removed 47) and now considering 2699/2848 (removed 149) transitions.
[2022-05-18 00:15:27] [INFO ] Flow matrix only has 2427 transitions (discarded 272 similar events)
// Phase 1: matrix 2427 rows 1240 cols
[2022-05-18 00:15:27] [INFO ] Computed 67 place invariants in 27 ms
[2022-05-18 00:15:28] [INFO ] Implicit Places using invariants in 1038 ms returned [17, 189, 202, 259, 388, 391, 484, 569, 594, 595, 647, 652, 679, 680, 681, 724, 749, 885, 929, 930]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 1041 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1220/1287 places, 2699/2848 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1205 transition count 2684
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1205 transition count 2684
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1190 transition count 2669
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1190 transition count 2669
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1175 transition count 2654
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1175 transition count 2654
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 1164 transition count 2577
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 1164 transition count 2577
Applied a total of 112 rules in 165 ms. Remains 1164 /1220 variables (removed 56) and now considering 2577/2699 (removed 122) transitions.
[2022-05-18 00:15:29] [INFO ] Flow matrix only has 2305 transitions (discarded 272 similar events)
// Phase 1: matrix 2305 rows 1164 cols
[2022-05-18 00:15:29] [INFO ] Computed 47 place invariants in 23 ms
[2022-05-18 00:15:30] [INFO ] Implicit Places using invariants in 888 ms returned []
[2022-05-18 00:15:30] [INFO ] Flow matrix only has 2305 transitions (discarded 272 similar events)
// Phase 1: matrix 2305 rows 1164 cols
[2022-05-18 00:15:30] [INFO ] Computed 47 place invariants in 20 ms
[2022-05-18 00:15:30] [INFO ] State equation strengthened by 836 read => feed constraints.
[2022-05-18 00:15:40] [INFO ] Implicit Places using invariants and state equation in 10060 ms returned [1147]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10954 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1163/1287 places, 2577/2848 transitions.
Applied a total of 0 rules in 36 ms. Remains 1163 /1163 variables (removed 0) and now considering 2577/2577 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1163/1287 places, 2577/2848 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s672)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-01 finished in 12658 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))||p1)))'
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 2848/2848 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1271 transition count 2832
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1271 transition count 2832
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 46 place count 1257 transition count 2788
Iterating global reduction 0 with 14 rules applied. Total rules applied 60 place count 1257 transition count 2788
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 1248 transition count 2731
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 1248 transition count 2731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1247 transition count 2724
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1247 transition count 2724
Applied a total of 80 rules in 183 ms. Remains 1247 /1287 variables (removed 40) and now considering 2724/2848 (removed 124) transitions.
[2022-05-18 00:15:40] [INFO ] Flow matrix only has 2452 transitions (discarded 272 similar events)
// Phase 1: matrix 2452 rows 1247 cols
[2022-05-18 00:15:40] [INFO ] Computed 67 place invariants in 25 ms
[2022-05-18 00:15:41] [INFO ] Implicit Places using invariants in 978 ms returned [17, 189, 202, 259, 388, 391, 484, 597, 598, 650, 655, 682, 683, 730, 755, 891, 935, 936]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 980 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1229/1287 places, 2724/2848 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1215 transition count 2710
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1215 transition count 2710
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1201 transition count 2696
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1201 transition count 2696
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1187 transition count 2682
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1187 transition count 2682
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 1177 transition count 2612
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 1177 transition count 2612
Applied a total of 104 rules in 195 ms. Remains 1177 /1229 variables (removed 52) and now considering 2612/2724 (removed 112) transitions.
[2022-05-18 00:15:41] [INFO ] Flow matrix only has 2340 transitions (discarded 272 similar events)
// Phase 1: matrix 2340 rows 1177 cols
[2022-05-18 00:15:41] [INFO ] Computed 49 place invariants in 15 ms
[2022-05-18 00:15:42] [INFO ] Implicit Places using invariants in 895 ms returned []
[2022-05-18 00:15:42] [INFO ] Flow matrix only has 2340 transitions (discarded 272 similar events)
// Phase 1: matrix 2340 rows 1177 cols
[2022-05-18 00:15:42] [INFO ] Computed 49 place invariants in 23 ms
[2022-05-18 00:15:43] [INFO ] State equation strengthened by 860 read => feed constraints.
[2022-05-18 00:15:52] [INFO ] Implicit Places using invariants and state equation in 9822 ms returned []
Implicit Place search using SMT with State Equation took 10720 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1177/1287 places, 2612/2848 transitions.
Finished structural reductions, in 2 iterations. Remains : 1177/1287 places, 2612/2848 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s1115 s554), p0:(GT s274 s657)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-04 finished in 12196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 2848/2848 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1270 transition count 2825
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1270 transition count 2825
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 49 place count 1255 transition count 2780
Iterating global reduction 0 with 15 rules applied. Total rules applied 64 place count 1255 transition count 2780
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 1246 transition count 2723
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 1246 transition count 2723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1245 transition count 2716
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1245 transition count 2716
Applied a total of 84 rules in 191 ms. Remains 1245 /1287 variables (removed 42) and now considering 2716/2848 (removed 132) transitions.
[2022-05-18 00:15:52] [INFO ] Flow matrix only has 2444 transitions (discarded 272 similar events)
// Phase 1: matrix 2444 rows 1245 cols
[2022-05-18 00:15:52] [INFO ] Computed 67 place invariants in 27 ms
[2022-05-18 00:15:53] [INFO ] Implicit Places using invariants in 978 ms returned [17, 189, 202, 259, 388, 391, 484, 569, 594, 595, 647, 652, 679, 680, 681, 752, 888, 932]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 980 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1227/1287 places, 2716/2848 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1213 transition count 2702
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1213 transition count 2702
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1199 transition count 2688
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1199 transition count 2688
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1185 transition count 2674
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1185 transition count 2674
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 1175 transition count 2604
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 1175 transition count 2604
Applied a total of 104 rules in 163 ms. Remains 1175 /1227 variables (removed 52) and now considering 2604/2716 (removed 112) transitions.
[2022-05-18 00:15:53] [INFO ] Flow matrix only has 2332 transitions (discarded 272 similar events)
// Phase 1: matrix 2332 rows 1175 cols
[2022-05-18 00:15:53] [INFO ] Computed 49 place invariants in 22 ms
[2022-05-18 00:15:54] [INFO ] Implicit Places using invariants in 882 ms returned []
[2022-05-18 00:15:54] [INFO ] Flow matrix only has 2332 transitions (discarded 272 similar events)
// Phase 1: matrix 2332 rows 1175 cols
[2022-05-18 00:15:54] [INFO ] Computed 49 place invariants in 17 ms
[2022-05-18 00:15:55] [INFO ] State equation strengthened by 854 read => feed constraints.
[2022-05-18 00:16:05] [INFO ] Implicit Places using invariants and state equation in 10951 ms returned [1158]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11837 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1174/1287 places, 2604/2848 transitions.
Applied a total of 0 rules in 35 ms. Remains 1174 /1174 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1174/1287 places, 2604/2848 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s698 s902)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-05 finished in 13296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 2848/2848 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1270 transition count 2825
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1270 transition count 2825
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 48 place count 1256 transition count 2787
Iterating global reduction 0 with 14 rules applied. Total rules applied 62 place count 1256 transition count 2787
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 1246 transition count 2723
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 1246 transition count 2723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1245 transition count 2716
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1245 transition count 2716
Applied a total of 84 rules in 188 ms. Remains 1245 /1287 variables (removed 42) and now considering 2716/2848 (removed 132) transitions.
[2022-05-18 00:16:06] [INFO ] Flow matrix only has 2444 transitions (discarded 272 similar events)
// Phase 1: matrix 2444 rows 1245 cols
[2022-05-18 00:16:06] [INFO ] Computed 67 place invariants in 25 ms
[2022-05-18 00:16:07] [INFO ] Implicit Places using invariants in 1034 ms returned [17, 189, 202, 259, 388, 391, 484, 569, 595, 649, 654, 681, 684, 729, 754, 890, 934, 935]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1037 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1227/1287 places, 2716/2848 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1213 transition count 2702
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1213 transition count 2702
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1199 transition count 2688
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1199 transition count 2688
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1185 transition count 2674
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1185 transition count 2674
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 1175 transition count 2604
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 1175 transition count 2604
Applied a total of 104 rules in 174 ms. Remains 1175 /1227 variables (removed 52) and now considering 2604/2716 (removed 112) transitions.
[2022-05-18 00:16:07] [INFO ] Flow matrix only has 2332 transitions (discarded 272 similar events)
// Phase 1: matrix 2332 rows 1175 cols
[2022-05-18 00:16:07] [INFO ] Computed 49 place invariants in 20 ms
[2022-05-18 00:16:08] [INFO ] Implicit Places using invariants in 919 ms returned []
[2022-05-18 00:16:08] [INFO ] Flow matrix only has 2332 transitions (discarded 272 similar events)
// Phase 1: matrix 2332 rows 1175 cols
[2022-05-18 00:16:08] [INFO ] Computed 49 place invariants in 19 ms
[2022-05-18 00:16:08] [INFO ] State equation strengthened by 854 read => feed constraints.
[2022-05-18 00:16:18] [INFO ] Implicit Places using invariants and state equation in 10599 ms returned [1158]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11521 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1174/1287 places, 2604/2848 transitions.
Applied a total of 0 rules in 36 ms. Remains 1174 /1174 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1174/1287 places, 2604/2848 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(GT s577 s651)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-06 finished in 13322 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(p0)))||G(F(p1))))'
Support contains 3 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 2848/2848 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1287 transition count 2820
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1259 transition count 2820
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 56 place count 1259 transition count 2796
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 104 place count 1235 transition count 2796
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 111 place count 1228 transition count 2783
Iterating global reduction 2 with 7 rules applied. Total rules applied 118 place count 1228 transition count 2783
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 118 place count 1228 transition count 2782
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 1227 transition count 2782
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 124 place count 1223 transition count 2760
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 1223 transition count 2760
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 1222 transition count 2753
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 1222 transition count 2753
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 194 place count 1190 transition count 2721
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 203 place count 1181 transition count 2712
Iterating global reduction 2 with 9 rules applied. Total rules applied 212 place count 1181 transition count 2712
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 221 place count 1172 transition count 2649
Iterating global reduction 2 with 9 rules applied. Total rules applied 230 place count 1172 transition count 2649
Applied a total of 230 rules in 515 ms. Remains 1172 /1287 variables (removed 115) and now considering 2649/2848 (removed 199) transitions.
[2022-05-18 00:16:19] [INFO ] Flow matrix only has 2377 transitions (discarded 272 similar events)
// Phase 1: matrix 2377 rows 1172 cols
[2022-05-18 00:16:19] [INFO ] Computed 67 place invariants in 22 ms
[2022-05-18 00:16:20] [INFO ] Implicit Places using invariants in 934 ms returned [9, 160, 173, 230, 358, 451, 532, 555, 556, 612, 637, 638, 639, 678, 703, 879, 880]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 935 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1155/1287 places, 2649/2848 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1149 transition count 2643
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1149 transition count 2643
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1143 transition count 2637
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1143 transition count 2637
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 1141 transition count 2623
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 1141 transition count 2623
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 42 place count 1134 transition count 2616
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 1127 transition count 2609
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 1127 transition count 2609
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 1120 transition count 2560
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 1120 transition count 2560
Applied a total of 70 rules in 310 ms. Remains 1120 /1155 variables (removed 35) and now considering 2560/2649 (removed 89) transitions.
[2022-05-18 00:16:20] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1120 cols
[2022-05-18 00:16:20] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-18 00:16:21] [INFO ] Implicit Places using invariants in 884 ms returned []
[2022-05-18 00:16:21] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1120 cols
[2022-05-18 00:16:21] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-18 00:16:22] [INFO ] State equation strengthened by 866 read => feed constraints.
[2022-05-18 00:16:30] [INFO ] Implicit Places using invariants and state equation in 8875 ms returned []
Implicit Place search using SMT with State Equation took 9760 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1120/1287 places, 2560/2848 transitions.
Finished structural reductions, in 2 iterations. Remains : 1120/1287 places, 2560/2848 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s353), p1:(GT s589 s813)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1955 reset in 590 ms.
Product exploration explored 100000 steps with 1955 reset in 548 ms.
Computed a total of 305 stabilizing places and 944 stable transitions
Computed a total of 305 stabilizing places and 944 stable transitions
Detected a total of 305/1120 stabilizing places and 944/2560 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 6413 steps, including 124 resets, run visited all 2 properties in 86 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1120/1120 places, 2560/2560 transitions.
Applied a total of 0 rules in 71 ms. Remains 1120 /1120 variables (removed 0) and now considering 2560/2560 (removed 0) transitions.
[2022-05-18 00:16:32] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1120 cols
[2022-05-18 00:16:32] [INFO ] Computed 50 place invariants in 18 ms
[2022-05-18 00:16:33] [INFO ] Implicit Places using invariants in 865 ms returned []
[2022-05-18 00:16:33] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1120 cols
[2022-05-18 00:16:33] [INFO ] Computed 50 place invariants in 24 ms
[2022-05-18 00:16:34] [INFO ] State equation strengthened by 866 read => feed constraints.
[2022-05-18 00:16:42] [INFO ] Implicit Places using invariants and state equation in 8339 ms returned []
Implicit Place search using SMT with State Equation took 9206 ms to find 0 implicit places.
[2022-05-18 00:16:42] [INFO ] Redundant transitions in 127 ms returned []
[2022-05-18 00:16:42] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1120 cols
[2022-05-18 00:16:42] [INFO ] Computed 50 place invariants in 29 ms
[2022-05-18 00:16:43] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1120/1120 places, 2560/2560 transitions.
Computed a total of 305 stabilizing places and 944 stable transitions
Computed a total of 305 stabilizing places and 944 stable transitions
Detected a total of 305/1120 stabilizing places and 944/2560 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 364 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 195 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 76501 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76501 steps, saw 32460 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:16:46] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1120 cols
[2022-05-18 00:16:46] [INFO ] Computed 50 place invariants in 24 ms
[2022-05-18 00:16:47] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-18 00:16:47] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 00:16:47] [INFO ] After 683ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-18 00:16:47] [INFO ] State equation strengthened by 866 read => feed constraints.
[2022-05-18 00:16:47] [INFO ] After 122ms SMT Verify possible using 866 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:16:47] [INFO ] After 983ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:16:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 00:16:47] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2022-05-18 00:16:48] [INFO ] After 783ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:16:49] [INFO ] After 224ms SMT Verify possible using 866 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:16:49] [INFO ] After 431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 140 ms.
[2022-05-18 00:16:49] [INFO ] After 1544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 1120 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1120/1120 places, 2560/2560 transitions.
Free-agglomeration rule (complex) applied 137 times.
Iterating global reduction 0 with 137 rules applied. Total rules applied 137 place count 1120 transition count 4007
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 0 with 137 rules applied. Total rules applied 274 place count 983 transition count 4007
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 277 place count 983 transition count 4007
Applied a total of 277 rules in 289 ms. Remains 983 /1120 variables (removed 137) and now considering 4007/2560 (removed -1447) transitions.
Finished structural reductions, in 1 iterations. Remains : 983/1120 places, 4007/2560 transitions.
Finished random walk after 9522 steps, including 229 resets, run visited all 2 properties in 245 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1956 reset in 492 ms.
Product exploration explored 100000 steps with 1953 reset in 505 ms.
Built C files in :
/tmp/ltsmin13956855575525648843
[2022-05-18 00:16:51] [INFO ] Too many transitions (2560) to apply POR reductions. Disabling POR matrices.
[2022-05-18 00:16:51] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13956855575525648843
Running compilation step : cd /tmp/ltsmin13956855575525648843;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13956855575525648843;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13956855575525648843;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1120/1120 places, 2560/2560 transitions.
Applied a total of 0 rules in 78 ms. Remains 1120 /1120 variables (removed 0) and now considering 2560/2560 (removed 0) transitions.
[2022-05-18 00:16:54] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1120 cols
[2022-05-18 00:16:54] [INFO ] Computed 50 place invariants in 17 ms
[2022-05-18 00:16:55] [INFO ] Implicit Places using invariants in 940 ms returned []
[2022-05-18 00:16:55] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1120 cols
[2022-05-18 00:16:55] [INFO ] Computed 50 place invariants in 25 ms
[2022-05-18 00:16:56] [INFO ] State equation strengthened by 866 read => feed constraints.
[2022-05-18 00:17:04] [INFO ] Implicit Places using invariants and state equation in 8421 ms returned []
Implicit Place search using SMT with State Equation took 9371 ms to find 0 implicit places.
[2022-05-18 00:17:04] [INFO ] Redundant transitions in 84 ms returned []
[2022-05-18 00:17:04] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1120 cols
[2022-05-18 00:17:04] [INFO ] Computed 50 place invariants in 25 ms
[2022-05-18 00:17:05] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1120/1120 places, 2560/2560 transitions.
Built C files in :
/tmp/ltsmin18407308261382649175
[2022-05-18 00:17:05] [INFO ] Too many transitions (2560) to apply POR reductions. Disabling POR matrices.
[2022-05-18 00:17:05] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18407308261382649175
Running compilation step : cd /tmp/ltsmin18407308261382649175;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18407308261382649175;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18407308261382649175;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 00:17:08] [INFO ] Flatten gal took : 84 ms
[2022-05-18 00:17:08] [INFO ] Flatten gal took : 81 ms
[2022-05-18 00:17:09] [INFO ] Time to serialize gal into /tmp/LTL9748283594610565278.gal : 491 ms
[2022-05-18 00:17:09] [INFO ] Time to serialize properties into /tmp/LTL12936143572453290268.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9748283594610565278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12936143572453290268.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9748283...267
Read 1 LTL properties
Checking formula 0 : !(((F(G(X("(Node3HasAskedItsLeafSetToLx4ToReplaceNode4<1)"))))||(G(F("(Node10HasTheLeafSetOfLx5ToReplaceNode2>Node14HasAskedItsLeafSet...181
Formula 0 simplified : !(FGX"(Node3HasAskedItsLeafSetToLx4ToReplaceNode4<1)" | GF"(Node10HasTheLeafSetOfLx5ToReplaceNode2>Node14HasAskedItsLeafSetToRx3ToRe...168
Detected timeout of ITS tools.
[2022-05-18 00:17:24] [INFO ] Flatten gal took : 94 ms
[2022-05-18 00:17:24] [INFO ] Applying decomposition
[2022-05-18 00:17:24] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13212410755965463073.txt' '-o' '/tmp/graph13212410755965463073.bin' '-w' '/tmp/graph13212410755965463073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13212410755965463073.bin' '-l' '-1' '-v' '-w' '/tmp/graph13212410755965463073.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:17:24] [INFO ] Decomposing Gal with order
[2022-05-18 00:17:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:17:24] [INFO ] Removed a total of 462 redundant transitions.
[2022-05-18 00:17:25] [INFO ] Flatten gal took : 234 ms
[2022-05-18 00:17:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-18 00:17:25] [INFO ] Time to serialize gal into /tmp/LTL4638068432407724577.gal : 13 ms
[2022-05-18 00:17:25] [INFO ] Time to serialize properties into /tmp/LTL5369607032605769818.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4638068432407724577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5369607032605769818.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4638068...266
Read 1 LTL properties
Checking formula 0 : !(((F(G(X("(gi1.gi0.gu45.Node3HasAskedItsLeafSetToLx4ToReplaceNode4<1)"))))||(G(F("(gu20.Node10HasTheLeafSetOfLx5ToReplaceNode2>gu20.N...204
Formula 0 simplified : !(FGX"(gi1.gi0.gu45.Node3HasAskedItsLeafSetToLx4ToReplaceNode4<1)" | GF"(gu20.Node10HasTheLeafSetOfLx5ToReplaceNode2>gu20.Node14HasA...191
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5462336063277724996
[2022-05-18 00:17:40] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5462336063277724996
Running compilation step : cd /tmp/ltsmin5462336063277724996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5462336063277724996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5462336063277724996;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-08 finished in 84279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(G(p0)))||X(F(p0)))))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 2848/2848 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1268 transition count 2823
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1268 transition count 2823
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 54 place count 1252 transition count 2777
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 1252 transition count 2777
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 81 place count 1241 transition count 2706
Iterating global reduction 0 with 11 rules applied. Total rules applied 92 place count 1241 transition count 2706
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 1240 transition count 2699
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1240 transition count 2699
Applied a total of 94 rules in 196 ms. Remains 1240 /1287 variables (removed 47) and now considering 2699/2848 (removed 149) transitions.
[2022-05-18 00:17:43] [INFO ] Flow matrix only has 2427 transitions (discarded 272 similar events)
// Phase 1: matrix 2427 rows 1240 cols
[2022-05-18 00:17:43] [INFO ] Computed 67 place invariants in 29 ms
[2022-05-18 00:17:44] [INFO ] Implicit Places using invariants in 1094 ms returned [189, 202, 259, 388, 484, 569, 594, 595, 647, 652, 679, 680, 681, 724, 749, 885, 929, 930]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1111 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1222/1287 places, 2699/2848 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1206 transition count 2683
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1206 transition count 2683
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 1190 transition count 2667
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 1190 transition count 2667
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 1174 transition count 2651
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 1174 transition count 2651
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 108 place count 1162 transition count 2567
Iterating global reduction 0 with 12 rules applied. Total rules applied 120 place count 1162 transition count 2567
Applied a total of 120 rules in 189 ms. Remains 1162 /1222 variables (removed 60) and now considering 2567/2699 (removed 132) transitions.
[2022-05-18 00:17:44] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1162 cols
[2022-05-18 00:17:44] [INFO ] Computed 49 place invariants in 17 ms
[2022-05-18 00:17:45] [INFO ] Implicit Places using invariants in 930 ms returned []
[2022-05-18 00:17:45] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1162 cols
[2022-05-18 00:17:45] [INFO ] Computed 49 place invariants in 29 ms
[2022-05-18 00:17:46] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:17:56] [INFO ] Implicit Places using invariants and state equation in 10290 ms returned [1124, 1145]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11223 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1160/1287 places, 2567/2848 transitions.
Applied a total of 0 rules in 37 ms. Remains 1160 /1160 variables (removed 0) and now considering 2567/2567 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1160/1287 places, 2567/2848 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s17 s380)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1021 ms.
Product exploration explored 100000 steps with 50000 reset in 1013 ms.
Computed a total of 328 stabilizing places and 934 stable transitions
Computed a total of 328 stabilizing places and 934 stable transitions
Detected a total of 328/1160 stabilizing places and 934/2567 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 2698 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-10 finished in 17591 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((true U X(p0)))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 2848/2848 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1270 transition count 2825
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1270 transition count 2825
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 48 place count 1256 transition count 2787
Iterating global reduction 0 with 14 rules applied. Total rules applied 62 place count 1256 transition count 2787
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 1246 transition count 2723
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 1246 transition count 2723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1245 transition count 2716
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1245 transition count 2716
Applied a total of 84 rules in 168 ms. Remains 1245 /1287 variables (removed 42) and now considering 2716/2848 (removed 132) transitions.
[2022-05-18 00:18:01] [INFO ] Flow matrix only has 2444 transitions (discarded 272 similar events)
// Phase 1: matrix 2444 rows 1245 cols
[2022-05-18 00:18:01] [INFO ] Computed 67 place invariants in 19 ms
[2022-05-18 00:18:02] [INFO ] Implicit Places using invariants in 1003 ms returned [17, 204, 261, 390, 393, 486, 571, 596, 597, 649, 654, 681, 682, 683, 726, 890, 934, 935]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1007 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1227/1287 places, 2716/2848 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1213 transition count 2702
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1213 transition count 2702
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1199 transition count 2688
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1199 transition count 2688
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1185 transition count 2674
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1185 transition count 2674
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 1175 transition count 2604
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 1175 transition count 2604
Applied a total of 104 rules in 159 ms. Remains 1175 /1227 variables (removed 52) and now considering 2604/2716 (removed 112) transitions.
[2022-05-18 00:18:02] [INFO ] Flow matrix only has 2332 transitions (discarded 272 similar events)
// Phase 1: matrix 2332 rows 1175 cols
[2022-05-18 00:18:02] [INFO ] Computed 49 place invariants in 34 ms
[2022-05-18 00:18:03] [INFO ] Implicit Places using invariants in 906 ms returned []
[2022-05-18 00:18:03] [INFO ] Flow matrix only has 2332 transitions (discarded 272 similar events)
// Phase 1: matrix 2332 rows 1175 cols
[2022-05-18 00:18:03] [INFO ] Computed 49 place invariants in 21 ms
[2022-05-18 00:18:04] [INFO ] State equation strengthened by 854 read => feed constraints.
[2022-05-18 00:18:13] [INFO ] Implicit Places using invariants and state equation in 10521 ms returned []
Implicit Place search using SMT with State Equation took 11429 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1175/1287 places, 2604/2848 transitions.
Finished structural reductions, in 2 iterations. Remains : 1175/1287 places, 2604/2848 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s721 s196)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-14 finished in 12842 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G(F(p0)))))))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 2848/2848 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1287 transition count 2820
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1259 transition count 2820
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 56 place count 1259 transition count 2796
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 104 place count 1235 transition count 2796
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 113 place count 1226 transition count 2781
Iterating global reduction 2 with 9 rules applied. Total rules applied 122 place count 1226 transition count 2781
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 122 place count 1226 transition count 2779
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 126 place count 1224 transition count 2779
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 132 place count 1218 transition count 2743
Iterating global reduction 2 with 6 rules applied. Total rules applied 138 place count 1218 transition count 2743
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 1217 transition count 2736
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 1217 transition count 2736
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 202 place count 1186 transition count 2705
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 211 place count 1177 transition count 2696
Iterating global reduction 2 with 9 rules applied. Total rules applied 220 place count 1177 transition count 2696
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 229 place count 1168 transition count 2633
Iterating global reduction 2 with 9 rules applied. Total rules applied 238 place count 1168 transition count 2633
Applied a total of 238 rules in 383 ms. Remains 1168 /1287 variables (removed 119) and now considering 2633/2848 (removed 215) transitions.
[2022-05-18 00:18:14] [INFO ] Flow matrix only has 2361 transitions (discarded 272 similar events)
// Phase 1: matrix 2361 rows 1168 cols
[2022-05-18 00:18:14] [INFO ] Computed 67 place invariants in 20 ms
[2022-05-18 00:18:15] [INFO ] Implicit Places using invariants in 946 ms returned [9, 159, 172, 229, 354, 357, 448, 529, 552, 553, 601, 606, 631, 632, 633, 672, 697, 829, 872]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 948 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1149/1287 places, 2633/2848 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1140 transition count 2624
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1140 transition count 2624
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1131 transition count 2615
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1131 transition count 2615
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 1128 transition count 2594
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 1128 transition count 2594
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 54 place count 1122 transition count 2588
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 1116 transition count 2582
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 1116 transition count 2582
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 1108 transition count 2526
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 1108 transition count 2526
Applied a total of 82 rules in 305 ms. Remains 1108 /1149 variables (removed 41) and now considering 2526/2633 (removed 107) transitions.
[2022-05-18 00:18:15] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1108 cols
[2022-05-18 00:18:15] [INFO ] Computed 48 place invariants in 15 ms
[2022-05-18 00:18:16] [INFO ] Implicit Places using invariants in 903 ms returned []
[2022-05-18 00:18:16] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1108 cols
[2022-05-18 00:18:16] [INFO ] Computed 48 place invariants in 16 ms
[2022-05-18 00:18:17] [INFO ] State equation strengthened by 842 read => feed constraints.
[2022-05-18 00:18:26] [INFO ] Implicit Places using invariants and state equation in 9581 ms returned [1098]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10486 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1107/1287 places, 2526/2848 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1107 transition count 2525
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1106 transition count 2525
Applied a total of 2 rules in 69 ms. Remains 1106 /1107 variables (removed 1) and now considering 2525/2526 (removed 1) transitions.
[2022-05-18 00:18:26] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2022-05-18 00:18:26] [INFO ] Computed 47 place invariants in 21 ms
[2022-05-18 00:18:26] [INFO ] Implicit Places using invariants in 877 ms returned []
[2022-05-18 00:18:26] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2022-05-18 00:18:26] [INFO ] Computed 47 place invariants in 17 ms
[2022-05-18 00:18:27] [INFO ] State equation strengthened by 842 read => feed constraints.
[2022-05-18 00:18:36] [INFO ] Implicit Places using invariants and state equation in 9877 ms returned []
Implicit Place search using SMT with State Equation took 10756 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1106/1287 places, 2525/2848 transitions.
Finished structural reductions, in 3 iterations. Remains : 1106/1287 places, 2525/2848 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s852 s700)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-15 finished in 23021 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(p0)))||G(F(p1))))'
[2022-05-18 00:18:37] [INFO ] Flatten gal took : 95 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13503211468770667545
[2022-05-18 00:18:37] [INFO ] Too many transitions (2848) to apply POR reductions. Disabling POR matrices.
[2022-05-18 00:18:37] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13503211468770667545
Running compilation step : cd /tmp/ltsmin13503211468770667545;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 00:18:37] [INFO ] Applying decomposition
[2022-05-18 00:18:37] [INFO ] Flatten gal took : 96 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10966278468882030854.txt' '-o' '/tmp/graph10966278468882030854.bin' '-w' '/tmp/graph10966278468882030854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10966278468882030854.bin' '-l' '-1' '-v' '-w' '/tmp/graph10966278468882030854.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:18:37] [INFO ] Decomposing Gal with order
[2022-05-18 00:18:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:18:37] [INFO ] Removed a total of 2044 redundant transitions.
[2022-05-18 00:18:37] [INFO ] Flatten gal took : 254 ms
[2022-05-18 00:18:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 49 ms.
[2022-05-18 00:18:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality11460897169566175232.gal : 12 ms
[2022-05-18 00:18:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality13456825480122637180.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11460897169566175232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13456825480122637180.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !(((F(G(X("(gi0.gi12.gu30.Node3HasAskedItsLeafSetToLx4ToReplaceNode4<1)"))))||(G(F("(gu119.Node10HasTheLeafSetOfLx5ToReplaceNode2>gu11...207
Formula 0 simplified : !(FGX"(gi0.gi12.gu30.Node3HasAskedItsLeafSetToLx4ToReplaceNode4<1)" | GF"(gu119.Node10HasTheLeafSetOfLx5ToReplaceNode2>gu119.Node14H...194
Compilation finished in 6339 ms.
Running link step : cd /tmp/ltsmin13503211468770667545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 469 ms.
Running LTSmin : cd /tmp/ltsmin13503211468770667545;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([](X((LTLAPp0==true))))||[](<>((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-18 00:40:19] [INFO ] Flatten gal took : 235 ms
[2022-05-18 00:40:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality2711075004803489263.gal : 39 ms
[2022-05-18 00:40:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality18421486951754785503.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2711075004803489263.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18421486951754785503.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !(((F(G(X("(Node3HasAskedItsLeafSetToLx4ToReplaceNode4<1)"))))||(G(F("(Node10HasTheLeafSetOfLx5ToReplaceNode2>Node14HasAskedItsLeafSet...181
Formula 0 simplified : !(FGX"(Node3HasAskedItsLeafSetToLx4ToReplaceNode4<1)" | GF"(Node10HasTheLeafSetOfLx5ToReplaceNode2>Node14HasAskedItsLeafSetToRx3ToRe...168
LTSmin run took 1511077 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1819719 ms.

BK_STOP 1652834635364

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S16C07"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C07, 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 r132-tall-165271821200691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C07.tgz
mv MultiCrashLeafsetExtension-PT-S16C07 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;