About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S24C02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1509.976 | 411131.00 | 473904.00 | 1083.60 | T?FFFFTFFFTTTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r508-tall-171654350800062.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S24C02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350800062
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 05:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 05:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 05:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 05:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 7.6M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717199766149
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:56:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:56:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:56:07] [INFO ] Load time of PNML (sax parser for PT used): 514 ms
[2024-05-31 23:56:07] [INFO ] Transformed 7032 places.
[2024-05-31 23:56:07] [INFO ] Transformed 10855 transitions.
[2024-05-31 23:56:07] [INFO ] Parsed PT model containing 7032 places and 10855 transitions and 46214 arcs in 652 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1883 resets) in 2655 ms. (15 steps per ms) remains 14/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (340 resets) in 558 ms. (71 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (340 resets) in 326 ms. (122 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (340 resets) in 531 ms. (75 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (340 resets) in 271 ms. (147 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (340 resets) in 296 ms. (134 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (340 resets) in 262 ms. (152 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (340 resets) in 253 ms. (157 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (340 resets) in 172 ms. (231 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (340 resets) in 189 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (340 resets) in 198 ms. (201 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (340 resets) in 247 ms. (161 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (340 resets) in 202 ms. (197 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (340 resets) in 241 ms. (165 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (340 resets) in 193 ms. (206 steps per ms) remains 14/14 properties
[2024-05-31 23:56:10] [INFO ] Flow matrix only has 10255 transitions (discarded 600 similar events)
// Phase 1: matrix 10255 rows 7032 cols
[2024-05-31 23:56:10] [INFO ] Computed 813 invariants in 609 ms
[2024-05-31 23:56:10] [INFO ] State equation strengthened by 3202 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-04 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 2269/2543 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2543 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 42/2585 variables, 42/52 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2585 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-11 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 3441/6026 variables, 414/466 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6026 variables, 0/466 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 6/6032 variables, 6/472 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6032 variables, 0/472 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 979/7011 variables, 320/792 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7011 variables, 0/792 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 21/7032 variables, 21/813 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/7032 variables, 0/813 constraints. Problems are: Problem set: 9 solved, 5 unsolved
SMT process timed out in 5979ms, After SMT, problems are : Problem set: 9 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 92 out of 7032 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7032/7032 places, 10855/10855 transitions.
Graph (complete) has 26261 edges and 7032 vertex of which 7000 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.29 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1175 transitions
Trivial Post-agglo rules discarded 1175 transitions
Performed 1175 trivial Post agglomeration. Transition count delta: 1175
Iterating post reduction 0 with 1175 rules applied. Total rules applied 1176 place count 7000 transition count 9680
Reduce places removed 1175 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 1185 rules applied. Total rules applied 2361 place count 5825 transition count 9670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 2371 place count 5815 transition count 9670
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 2371 place count 5815 transition count 9570
Deduced a syphon composed of 100 places in 11 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 2571 place count 5715 transition count 9570
Discarding 1075 places :
Symmetric choice reduction at 3 with 1075 rule applications. Total rules 3646 place count 4640 transition count 8495
Iterating global reduction 3 with 1075 rules applied. Total rules applied 4721 place count 4640 transition count 8495
Discarding 521 places :
Symmetric choice reduction at 3 with 521 rule applications. Total rules 5242 place count 4119 transition count 7453
Iterating global reduction 3 with 521 rules applied. Total rules applied 5763 place count 4119 transition count 7453
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 5811 place count 4095 transition count 7429
Free-agglomeration rule (complex) applied 321 times.
Iterating global reduction 3 with 321 rules applied. Total rules applied 6132 place count 4095 transition count 7303
Reduce places removed 321 places and 0 transitions.
Iterating post reduction 3 with 321 rules applied. Total rules applied 6453 place count 3774 transition count 7303
Partial Free-agglomeration rule applied 100 times.
Drop transitions (Partial Free agglomeration) removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 6553 place count 3774 transition count 7303
Applied a total of 6553 rules in 4558 ms. Remains 3774 /7032 variables (removed 3258) and now considering 7303/10855 (removed 3552) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4572 ms. Remains : 3774/7032 places, 7303/10855 transitions.
RANDOM walk for 40000 steps (2773 resets) in 1186 ms. (33 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (360 resets) in 194 ms. (205 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (360 resets) in 274 ms. (145 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (360 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (360 resets) in 280 ms. (142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (360 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 27317 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 5
Probabilistic random walk after 27317 steps, saw 12453 distinct states, run finished after 3013 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-31 23:56:24] [INFO ] Flow matrix only has 6425 transitions (discarded 878 similar events)
// Phase 1: matrix 6425 rows 3774 cols
[2024-05-31 23:56:24] [INFO ] Computed 781 invariants in 143 ms
[2024-05-31 23:56:24] [INFO ] State equation strengthened by 2876 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2583/2675 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2675 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2675 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 868/3543 variables, 541/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:56:29] [INFO ] Deduced a trap composed of 7 places in 3436 ms of which 193 ms to minimize.
[2024-05-31 23:56:32] [INFO ] Deduced a trap composed of 41 places in 3380 ms of which 25 ms to minimize.
[2024-05-31 23:56:36] [INFO ] Deduced a trap composed of 195 places in 3295 ms of which 30 ms to minimize.
[2024-05-31 23:56:39] [INFO ] Deduced a trap composed of 222 places in 3115 ms of which 20 ms to minimize.
[2024-05-31 23:56:42] [INFO ] Deduced a trap composed of 41 places in 3336 ms of which 23 ms to minimize.
[2024-05-31 23:56:46] [INFO ] Deduced a trap composed of 180 places in 3295 ms of which 24 ms to minimize.
[2024-05-31 23:56:49] [INFO ] Deduced a trap composed of 91 places in 3300 ms of which 23 ms to minimize.
[2024-05-31 23:56:52] [INFO ] Deduced a trap composed of 167 places in 3195 ms of which 24 ms to minimize.
[2024-05-31 23:56:55] [INFO ] Deduced a trap composed of 74 places in 3234 ms of which 23 ms to minimize.
[2024-05-31 23:56:59] [INFO ] Deduced a trap composed of 102 places in 3265 ms of which 23 ms to minimize.
[2024-05-31 23:57:02] [INFO ] Deduced a trap composed of 127 places in 3208 ms of which 22 ms to minimize.
[2024-05-31 23:57:05] [INFO ] Deduced a trap composed of 127 places in 3232 ms of which 23 ms to minimize.
[2024-05-31 23:57:09] [INFO ] Deduced a trap composed of 162 places in 3185 ms of which 23 ms to minimize.
[2024-05-31 23:57:12] [INFO ] Deduced a trap composed of 230 places in 3193 ms of which 23 ms to minimize.
SMT process timed out in 47821ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 92 out of 3774 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3774/3774 places, 7303/7303 transitions.
Applied a total of 0 rules in 447 ms. Remains 3774 /3774 variables (removed 0) and now considering 7303/7303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 447 ms. Remains : 3774/3774 places, 7303/7303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3774/3774 places, 7303/7303 transitions.
Applied a total of 0 rules in 439 ms. Remains 3774 /3774 variables (removed 0) and now considering 7303/7303 (removed 0) transitions.
[2024-05-31 23:57:13] [INFO ] Flow matrix only has 6425 transitions (discarded 878 similar events)
[2024-05-31 23:57:13] [INFO ] Invariant cache hit.
[2024-05-31 23:57:20] [INFO ] Implicit Places using invariants in 7609 ms returned [4, 7, 9, 10, 11, 15, 21, 29, 39, 51, 65, 81, 99, 119, 141, 164, 187, 188, 189, 227, 243, 257, 269, 279, 287, 297, 299, 312, 315, 317, 319, 323, 329, 337, 347, 359, 391, 409, 429, 450, 471, 472, 490, 506, 520, 532, 543, 551, 559, 563, 565, 567, 574, 580, 583, 584, 585, 587, 589, 593, 599, 607, 617, 629, 643, 659, 677, 697, 716, 717, 734, 748, 760, 770, 778, 784, 788, 790, 792, 794, 803, 809, 812, 814, 816, 818, 820, 824, 830, 840, 851, 863, 877, 893, 910, 926, 927, 928, 942, 954, 964, 972, 978, 982, 984, 986, 988, 990, 997, 1003, 1006, 1007, 1008, 1010, 1012, 1014, 1016, 1020, 1026, 1034, 1044, 1056, 1070, 1085, 1101, 1113, 1123, 1131, 1137, 1141, 1143, 1145, 1147, 1151, 1155, 1162, 1168, 1171, 1172, 1173, 1177, 1179, 1181, 1184, 1188, 1194, 1202, 1212, 1224, 1237, 1249, 1250, 1251, 1261, 1269, 1275, 1279, 1281, 1283, 1285, 1287, 1289, 1291, 1298, 1304, 1307, 1308, 1309, 1311, 1313, 1315, 1317, 1319, 1321, 1325, 1331, 1339, 1349, 1360, 1371, 1372, 1380, 1386, 1390, 1392, 1394, 1396, 1399, 1401, 1403, 1405, 1412, 1418, 1421, 1422, 1423, 1425, 1427, 1429, 1431, 1433, 1435, 1437, 1441, 1447, 1455, 1464, 1473, 1474, 1480, 1484, 1486, 1488, 1490, 1492, 1494, 1496, 1500, 1502, 1509, 1515, 1518, 1519, 1520, 1522, 1524, 1526, 1528, 1530, 1532, 1534, 1536, 1540, 1546, 1553, 1561, 1562, 1566, 1568, 1570, 1572, 1575, 1577, 1579, 1581, 1583, 1585, 1592, 1598, 1601, 1602, 1603, 1605, 1607, 1609, 1611, 1613, 1615, 1617, 1619, 1621, 1625, 1630, 1634, 1635, 1636, 1638, 1640, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1663, 1669, 1672, 1673, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1692, 1694, 1697, 1700, 1701, 1702, 1704, 1706, 1708, 1710, 1712, 1714, 1716, 1718, 1720, 1729, 1736, 1739, 1740, 1741, 1743, 1745, 1747, 1749, 1751, 1753, 1755, 1757, 1759, 1761, 1763, 1765, 1766, 1767, 1769, 1771, 1773, 1775, 1777, 1779, 1781, 1783, 1785, 1787, 1794, 1796, 1799, 1802, 1803, 1804, 1806, 1808, 1810, 1812, 1814, 1816, 1818, 1820, 1822, 1824, 1826, 1829, 1830, 1833, 1835, 1837, 1839, 1841, 1843, 1845, 1848, 1850, 1854, 1861, 1867, 1870, 1872, 1874, 1876, 1878, 1880, 1884, 1886, 1888, 1890, 1892, 1894, 1896, 1898, 1899, 1900, 1902, 1904, 1906, 1908, 1910, 1912, 1914, 1916, 1918, 1920, 1927, 1933, 1936, 1937, 1938, 1940, 1942, 1944, 1946, 1948, 1950, 1952, 1954, 1956, 1958, 1960, 1964, 1965, 1968, 1970, 1972, 1974, 1976, 1978, 1980, 1982, 1984, 1986, 1993, 1999, 2003, 2004, 2006, 2008, 2010, 2012, 2014, 2016, 2019, 2021, 2023, 2025, 2030, 2036, 2037, 2041, 2043, 2045, 2047, 2049, 2053, 2055, 2057, 2059, 2061, 2068, 2074, 2077, 2078, 2079, 2081, 2083, 2085, 2087, 2089, 2091, 2093, 2095, 2097, 2101, 2107, 2114, 2115, 2116, 2122, 2126, 2128, 2130, 2132, 2134, 2136, 2138, 2140, 2142, 2149, 2155, 2158, 2159, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2176, 2180, 2186, 2194, 2204, 2205, 2206, 2214, 2220, 2224, 2226, 2228, 2230, 2232, 2234, 2236, 2238, 2245, 2251, 2254, 2255, 2256, 2259, 2261, 2263, 2265, 2267, 2269, 2271, 2275, 2282, 2290, 2300, 2313, 2314, 2324, 2332, 2338, 2342, 2346, 2348, 2350, 2352, 2354, 2356, 2363, 2369, 2372, 2374, 2376, 2380, 2382, 2384, 2386, 2388, 2392, 2398, 2406, 2416, 2428, 2441, 2442, 2443, 2455, 2465, 2473, 2479, 2483, 2485, 2487, 2489, 2491, 2493, 2500, 2506, 2509, 2511, 2513, 2515, 2519, 2521, 2523, 2527, 2533, 2541, 2551, 2565, 2579, 2595, 2596, 2611, 2623, 2633, 2641, 2647, 2651, 2654, 2656, 2658, 2660, 2667, 2673, 2676, 2677, 2678, 2680, 2682, 2684, 2686, 2690, 2696, 2704, 2714, 2726, 2740, 2756, 2773, 2775, 2793, 2807, 2820, 2830, 2838, 2844, 2848, 2850, 2852, 2861, 2867, 2871, 2872, 2874, 2878, 2880, 2884, 2890, 2899, 2909, 2921, 2935, 2951, 2969, 2988, 2989, 2990, 3008, 3024, 3038, 3050, 3060, 3068, 3074, 3079, 3081, 3083, 3090, 3096, 3099, 3100, 3101, 3103, 3105, 3109, 3115, 3123, 3133, 3145, 3159, 3175, 3193, 3213, 3234, 3236, 3256, 3274, 3290, 3304, 3317, 3327, 3335, 3341, 3347, 3349, 3356, 3358, 3361, 3364, 3365, 3366, 3368, 3372, 3378, 3386, 3396, 3408, 3423, 3439, 3457, 3477, 3499, 3522, 3523, 3524, 3546, 3566, 3584, 3600, 3614, 3626, 3636, 3644, 3650, 3654, 3661]
[2024-05-31 23:57:20] [INFO ] Actually due to overlaps returned [2245, 2363, 2667, 1927, 1993, 2068, 2149, 2500, 2861, 3356, 3661, 3090, 1861, 803, 1509, 997, 1298, 1592, 1729, 1794, 574, 1162, 1412, 1663, 4, 9, 10, 187, 188, 312, 315, 471, 580, 583, 584, 716, 809, 812, 926, 927, 1003, 1006, 1007, 1168, 1171, 1172, 1249, 1250, 1304, 1307, 1308, 1371, 1418, 1421, 1422, 1473, 1515, 1518, 1519, 1561, 1598, 1601, 1602, 1634, 1635, 1669, 1672, 1673, 1700, 1701, 1736, 1739, 1740, 1765, 1766, 1796, 1799, 1802, 1803, 1829, 1867, 1870, 1898, 1899, 1933, 1936, 1937, 1964, 1999, 2003, 2036, 2074, 2077, 2078, 2114, 2115, 2155, 2158, 2159, 2204, 2205, 2251, 2254, 2255, 2313, 2369, 2372, 2441, 2442, 2506, 2509, 2595, 2596, 2673, 2676, 2677, 2773, 2867, 2871, 2988, 2989, 3096, 3099, 3100, 3234, 3358, 3361, 3364, 3365, 3522, 3523]
Discarding 131 places :
Implicit Place search using SMT only with invariants took 7633 ms to find 131 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3643/3774 places, 7303/7303 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 3567 transition count 7227
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 3567 transition count 7227
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 227 place count 3492 transition count 7152
Iterating global reduction 0 with 75 rules applied. Total rules applied 302 place count 3492 transition count 7152
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 320 place count 3474 transition count 7116
Iterating global reduction 0 with 18 rules applied. Total rules applied 338 place count 3474 transition count 7116
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 340 place count 3474 transition count 7114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 342 place count 3472 transition count 7114
Applied a total of 342 rules in 1820 ms. Remains 3472 /3643 variables (removed 171) and now considering 7114/7303 (removed 189) transitions.
[2024-05-31 23:57:22] [INFO ] Flow matrix only has 6236 transitions (discarded 878 similar events)
// Phase 1: matrix 6236 rows 3472 cols
[2024-05-31 23:57:22] [INFO ] Computed 650 invariants in 150 ms
[2024-05-31 23:57:29] [INFO ] Implicit Places using invariants in 6806 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 78, 96, 116, 138, 161, 184, 222, 238, 252, 264, 274, 282, 292, 294, 310, 312, 316, 322, 330, 340, 352, 384, 402, 422, 443, 464, 482, 498, 512, 524, 535, 543, 551, 555, 557, 559, 571, 573, 575, 579, 585, 593, 603, 615, 629, 645, 663, 683, 702, 719, 733, 745, 755, 763, 769, 773, 775, 777, 779, 793, 795, 797, 799, 803, 809, 819, 830, 842, 856, 872, 889, 905, 919, 931, 941, 949, 955, 959, 961, 963, 965, 967, 977, 979, 981, 983, 985, 989, 995, 1003, 1013, 1025, 1039, 1054, 1070, 1082, 1092, 1100, 1106, 1110, 1112, 1114, 1116, 1120, 1124, 1135, 1139, 1141, 1143, 1146, 1150, 1156, 1164, 1174, 1186, 1199, 1211, 1221, 1229, 1235, 1239, 1241, 1243, 1245, 1247, 1249, 1251, 1260, 1262, 1264, 1266, 1268, 1270, 1272, 1276, 1282, 1290, 1300, 1311, 1322, 1330, 1336, 1340, 1342, 1344, 1346, 1349, 1351, 1353, 1355, 1365, 1367, 1369, 1371, 1373, 1375, 1377, 1379, 1383, 1389, 1397, 1406, 1415, 1421, 1425, 1427, 1429, 1431, 1433, 1435, 1437, 1441, 1443, 1453, 1455, 1457, 1459, 1461, 1463, 1465, 1467, 1469, 1473, 1479, 1486, 1494, 1498, 1500, 1502, 1504, 1507, 1509, 1511, 1513, 1515, 1517, 1528, 1530, 1532, 1534, 1536, 1538, 1540, 1542, 1544, 1546, 1550, 1555, 1559, 1561, 1563, 1565, 1567, 1569, 1571, 1573, 1575, 1577, 1579, 1589, 1591, 1593, 1595, 1597, 1599, 1601, 1603, 1605, 1607, 1609, 1612, 1614, 1616, 1618, 1620, 1622, 1624, 1626, 1628, 1630, 1632, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1658, 1660, 1662, 1664, 1666, 1668, 1670, 1672, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1720, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1738, 1740, 1744, 1755, 1757, 1759, 1761, 1763, 1767, 1769, 1771, 1773, 1775, 1777, 1779, 1781, 1783, 1785, 1787, 1789, 1791, 1793, 1795, 1797, 1799, 1801, 1811, 1813, 1815, 1817, 1819, 1821, 1823, 1825, 1827, 1829, 1831, 1833, 1837, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1858, 1870, 1872, 1874, 1876, 1878, 1880, 1882, 1885, 1887, 1889, 1891, 1896, 1902, 1906, 1908, 1910, 1912, 1914, 1918, 1920, 1922, 1924, 1926, 1937, 1939, 1941, 1943, 1945, 1947, 1949, 1951, 1953, 1955, 1959, 1965, 1972, 1978, 1982, 1984, 1986, 1988, 1990, 1992, 1994, 1996, 1998, 2007, 2009, 2011, 2013, 2015, 2017, 2019, 2021, 2023, 2027, 2033, 2041, 2050, 2058, 2064, 2068, 2070, 2072, 2074, 2076, 2078, 2080, 2082, 2092, 2094, 2096, 2098, 2100, 2102, 2104, 2106, 2110, 2117, 2125, 2135, 2148, 2158, 2166, 2172, 2176, 2180, 2182, 2184, 2186, 2188, 2190, 2202, 2204, 2208, 2210, 2212, 2214, 2216, 2220, 2226, 2234, 2244, 2256, 2269, 2281, 2291, 2299, 2305, 2309, 2311, 2313, 2315, 2317, 2319, 2331, 2333, 2335, 2339, 2341, 2343, 2347, 2353, 2361, 2371, 2385, 2399, 2428, 2440, 2450, 2458, 2464, 2468, 2471, 2473, 2475, 2477, 2487, 2489, 2491, 2493, 2495, 2499, 2505, 2513, 2523, 2535, 2549, 2565, 2583, 2601, 2615, 2628, 2638, 2646, 2652, 2656, 2658, 2660, 2674, 2676, 2680, 2682, 2686, 2692, 2701, 2711, 2723, 2737, 2753, 2771, 2790, 2808, 2824, 2838, 2850, 2860, 2868, 2874, 2879, 2881, 2883, 2893, 2895, 2897, 2901, 2907, 2915, 2925, 2937, 2951, 2967, 2985, 3005, 3027, 3047, 3065, 3081, 3095, 3108, 3118, 3126, 3132, 3138, 3140, 3148, 3150, 3154, 3160, 3168, 3178, 3190, 3205, 3221, 3239, 3259, 3281, 3304, 3326, 3346, 3364, 3380, 3394, 3406, 3416, 3424, 3430, 3434]
Discarding 569 places :
Implicit Place search using SMT only with invariants took 6821 ms to find 569 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2903/3774 places, 7114/7303 transitions.
Applied a total of 0 rules in 377 ms. Remains 2903 /2903 variables (removed 0) and now considering 7114/7114 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 17090 ms. Remains : 2903/3774 places, 7114/7303 transitions.
RANDOM walk for 40000 steps (2884 resets) in 813 ms. (49 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (250 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (255 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (259 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (277 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (254 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 29913 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 5
Probabilistic random walk after 29913 steps, saw 12950 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-31 23:57:33] [INFO ] Flow matrix only has 6236 transitions (discarded 878 similar events)
// Phase 1: matrix 6236 rows 2903 cols
[2024-05-31 23:57:33] [INFO ] Computed 81 invariants in 112 ms
[2024-05-31 23:57:33] [INFO ] State equation strengthened by 2858 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2791 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2791 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2791 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 64/2855 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2855 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 44/2899 variables, 44/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2899 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 4/2903 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2903 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6236/9139 variables, 2903/2984 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-07 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (INCLUDED_ONLY) 0/9139 variables, 2858/5842 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/9139 variables, 0/5842 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/9139 variables, 0/5842 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9139/9139 variables, and 5842 constraints, problems are : Problem set: 1 solved, 4 unsolved in 6888 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 2903/2903 constraints, ReadFeed: 2858/2858 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 2700/2791 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2791 variables, 7/11 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-31 23:57:42] [INFO ] Deduced a trap composed of 365 places in 1994 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2791 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2791 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/2855 variables, 22/34 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-31 23:57:45] [INFO ] Deduced a trap composed of 7 places in 2132 ms of which 19 ms to minimize.
[2024-05-31 23:57:47] [INFO ] Deduced a trap composed of 219 places in 2016 ms of which 19 ms to minimize.
[2024-05-31 23:57:49] [INFO ] Deduced a trap composed of 158 places in 2222 ms of which 18 ms to minimize.
[2024-05-31 23:57:51] [INFO ] Deduced a trap composed of 176 places in 2219 ms of which 20 ms to minimize.
[2024-05-31 23:57:54] [INFO ] Deduced a trap composed of 137 places in 2210 ms of which 20 ms to minimize.
[2024-05-31 23:57:56] [INFO ] Deduced a trap composed of 161 places in 2130 ms of which 18 ms to minimize.
[2024-05-31 23:57:58] [INFO ] Deduced a trap composed of 165 places in 2247 ms of which 21 ms to minimize.
[2024-05-31 23:58:00] [INFO ] Deduced a trap composed of 155 places in 2233 ms of which 19 ms to minimize.
[2024-05-31 23:58:03] [INFO ] Deduced a trap composed of 159 places in 2233 ms of which 20 ms to minimize.
[2024-05-31 23:58:05] [INFO ] Deduced a trap composed of 160 places in 2174 ms of which 18 ms to minimize.
[2024-05-31 23:58:07] [INFO ] Deduced a trap composed of 173 places in 2179 ms of which 18 ms to minimize.
[2024-05-31 23:58:09] [INFO ] Deduced a trap composed of 41 places in 2205 ms of which 19 ms to minimize.
[2024-05-31 23:58:12] [INFO ] Deduced a trap composed of 151 places in 2225 ms of which 21 ms to minimize.
[2024-05-31 23:58:14] [INFO ] Deduced a trap composed of 153 places in 2232 ms of which 19 ms to minimize.
[2024-05-31 23:58:16] [INFO ] Deduced a trap composed of 162 places in 2201 ms of which 19 ms to minimize.
[2024-05-31 23:58:18] [INFO ] Deduced a trap composed of 171 places in 2230 ms of which 20 ms to minimize.
[2024-05-31 23:58:21] [INFO ] Deduced a trap composed of 173 places in 2198 ms of which 18 ms to minimize.
[2024-05-31 23:58:23] [INFO ] Deduced a trap composed of 74 places in 2219 ms of which 17 ms to minimize.
[2024-05-31 23:58:25] [INFO ] Deduced a trap composed of 166 places in 2203 ms of which 19 ms to minimize.
[2024-05-31 23:58:27] [INFO ] Deduced a trap composed of 165 places in 2140 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2855 variables, 20/54 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-31 23:58:29] [INFO ] Deduced a trap composed of 212 places in 2148 ms of which 19 ms to minimize.
[2024-05-31 23:58:32] [INFO ] Deduced a trap composed of 178 places in 2220 ms of which 20 ms to minimize.
[2024-05-31 23:58:34] [INFO ] Deduced a trap composed of 165 places in 2175 ms of which 20 ms to minimize.
[2024-05-31 23:58:36] [INFO ] Deduced a trap composed of 260 places in 2169 ms of which 19 ms to minimize.
[2024-05-31 23:58:38] [INFO ] Deduced a trap composed of 163 places in 2178 ms of which 19 ms to minimize.
[2024-05-31 23:58:41] [INFO ] Deduced a trap composed of 162 places in 2166 ms of which 20 ms to minimize.
[2024-05-31 23:58:43] [INFO ] Deduced a trap composed of 164 places in 2213 ms of which 18 ms to minimize.
[2024-05-31 23:58:45] [INFO ] Deduced a trap composed of 166 places in 2087 ms of which 18 ms to minimize.
[2024-05-31 23:58:47] [INFO ] Deduced a trap composed of 168 places in 2107 ms of which 18 ms to minimize.
[2024-05-31 23:58:49] [INFO ] Deduced a trap composed of 173 places in 2125 ms of which 18 ms to minimize.
[2024-05-31 23:58:51] [INFO ] Deduced a trap composed of 163 places in 2070 ms of which 18 ms to minimize.
[2024-05-31 23:58:54] [INFO ] Deduced a trap composed of 169 places in 2028 ms of which 17 ms to minimize.
[2024-05-31 23:58:56] [INFO ] Deduced a trap composed of 155 places in 2158 ms of which 17 ms to minimize.
SMT process timed out in 82959ms, After SMT, problems are : Problem set: 4 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2903/2903 places, 7114/7114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 2903 transition count 7099
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 2888 transition count 7099
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 39 place count 2879 transition count 7087
Iterating global reduction 2 with 9 rules applied. Total rules applied 48 place count 2879 transition count 7087
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 2878 transition count 7085
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 2878 transition count 7085
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 2877 transition count 7084
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 2 with 25 rules applied. Total rules applied 77 place count 2877 transition count 7204
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 102 place count 2852 transition count 7204
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 122 place count 2832 transition count 7184
Iterating global reduction 3 with 20 rules applied. Total rules applied 142 place count 2832 transition count 7184
Applied a total of 142 rules in 1701 ms. Remains 2832 /2903 variables (removed 71) and now considering 7184/7114 (removed -70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1701 ms. Remains : 2832/2903 places, 7184/7114 transitions.
RANDOM walk for 40000 steps (3095 resets) in 830 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (258 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 33570 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :0 out of 1
Probabilistic random walk after 33570 steps, saw 14323 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
[2024-05-31 23:59:01] [INFO ] Flow matrix only has 6298 transitions (discarded 886 similar events)
// Phase 1: matrix 6298 rows 2832 cols
[2024-05-31 23:59:01] [INFO ] Computed 81 invariants in 111 ms
[2024-05-31 23:59:01] [INFO ] State equation strengthened by 2999 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2698/2701 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/2727 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2727 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/2784 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2784 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 44/2828 variables, 44/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2828 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/2832 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2832 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6298/9130 variables, 2832/2913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/9130 variables, 2999/5912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/9130 variables, 0/5912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/9130 variables, 0/5912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9130/9130 variables, and 5912 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3729 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 2832/2832 constraints, ReadFeed: 2999/2999 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2698/2701 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/2727 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:59:07] [INFO ] Deduced a trap composed of 340 places in 1869 ms of which 17 ms to minimize.
[2024-05-31 23:59:09] [INFO ] Deduced a trap composed of 142 places in 1899 ms of which 17 ms to minimize.
[2024-05-31 23:59:11] [INFO ] Deduced a trap composed of 333 places in 1778 ms of which 18 ms to minimize.
[2024-05-31 23:59:13] [INFO ] Deduced a trap composed of 225 places in 1876 ms of which 18 ms to minimize.
[2024-05-31 23:59:15] [INFO ] Deduced a trap composed of 292 places in 1815 ms of which 17 ms to minimize.
[2024-05-31 23:59:16] [INFO ] Deduced a trap composed of 396 places in 1858 ms of which 17 ms to minimize.
[2024-05-31 23:59:18] [INFO ] Deduced a trap composed of 123 places in 1893 ms of which 19 ms to minimize.
[2024-05-31 23:59:20] [INFO ] Deduced a trap composed of 192 places in 1953 ms of which 18 ms to minimize.
[2024-05-31 23:59:22] [INFO ] Deduced a trap composed of 297 places in 1914 ms of which 19 ms to minimize.
[2024-05-31 23:59:24] [INFO ] Deduced a trap composed of 381 places in 1938 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2727 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2727 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 57/2784 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:59:27] [INFO ] Deduced a trap composed of 118 places in 2192 ms of which 20 ms to minimize.
[2024-05-31 23:59:29] [INFO ] Deduced a trap composed of 5 places in 2096 ms of which 18 ms to minimize.
[2024-05-31 23:59:31] [INFO ] Deduced a trap composed of 39 places in 2175 ms of which 18 ms to minimize.
[2024-05-31 23:59:33] [INFO ] Deduced a trap composed of 112 places in 2029 ms of which 19 ms to minimize.
[2024-05-31 23:59:35] [INFO ] Deduced a trap composed of 126 places in 2116 ms of which 18 ms to minimize.
[2024-05-31 23:59:37] [INFO ] Deduced a trap composed of 106 places in 2101 ms of which 18 ms to minimize.
[2024-05-31 23:59:40] [INFO ] Deduced a trap composed of 131 places in 2154 ms of which 18 ms to minimize.
[2024-05-31 23:59:42] [INFO ] Deduced a trap composed of 70 places in 2115 ms of which 19 ms to minimize.
[2024-05-31 23:59:44] [INFO ] Deduced a trap composed of 39 places in 2067 ms of which 18 ms to minimize.
[2024-05-31 23:59:46] [INFO ] Deduced a trap composed of 129 places in 2106 ms of which 18 ms to minimize.
[2024-05-31 23:59:48] [INFO ] Deduced a trap composed of 129 places in 2153 ms of which 18 ms to minimize.
[2024-05-31 23:59:50] [INFO ] Deduced a trap composed of 125 places in 2117 ms of which 19 ms to minimize.
[2024-05-31 23:59:53] [INFO ] Deduced a trap composed of 122 places in 2129 ms of which 19 ms to minimize.
[2024-05-31 23:59:55] [INFO ] Deduced a trap composed of 254 places in 2089 ms of which 19 ms to minimize.
[2024-05-31 23:59:57] [INFO ] Deduced a trap composed of 213 places in 2132 ms of which 19 ms to minimize.
[2024-05-31 23:59:59] [INFO ] Deduced a trap composed of 146 places in 2185 ms of which 19 ms to minimize.
[2024-06-01 00:00:01] [INFO ] Deduced a trap composed of 132 places in 2096 ms of which 19 ms to minimize.
[2024-06-01 00:00:03] [INFO ] Deduced a trap composed of 253 places in 2116 ms of which 19 ms to minimize.
[2024-06-01 00:00:05] [INFO ] Deduced a trap composed of 149 places in 2011 ms of which 18 ms to minimize.
[2024-06-01 00:00:08] [INFO ] Deduced a trap composed of 103 places in 2074 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2784 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:00:10] [INFO ] Deduced a trap composed of 121 places in 1937 ms of which 18 ms to minimize.
[2024-06-01 00:00:12] [INFO ] Deduced a trap composed of 116 places in 2024 ms of which 22 ms to minimize.
[2024-06-01 00:00:14] [INFO ] Deduced a trap composed of 125 places in 2010 ms of which 18 ms to minimize.
[2024-06-01 00:00:16] [INFO ] Deduced a trap composed of 101 places in 2010 ms of which 17 ms to minimize.
[2024-06-01 00:00:18] [INFO ] Deduced a trap composed of 105 places in 2053 ms of which 19 ms to minimize.
[2024-06-01 00:00:20] [INFO ] Deduced a trap composed of 192 places in 1973 ms of which 19 ms to minimize.
[2024-06-01 00:00:22] [INFO ] Deduced a trap composed of 122 places in 2025 ms of which 20 ms to minimize.
[2024-06-01 00:00:24] [INFO ] Deduced a trap composed of 116 places in 2055 ms of which 18 ms to minimize.
[2024-06-01 00:00:26] [INFO ] Deduced a trap composed of 109 places in 2000 ms of which 19 ms to minimize.
[2024-06-01 00:00:28] [INFO ] Deduced a trap composed of 111 places in 1999 ms of which 18 ms to minimize.
[2024-06-01 00:00:30] [INFO ] Deduced a trap composed of 114 places in 2007 ms of which 17 ms to minimize.
[2024-06-01 00:00:32] [INFO ] Deduced a trap composed of 110 places in 2012 ms of which 19 ms to minimize.
[2024-06-01 00:00:34] [INFO ] Deduced a trap composed of 175 places in 2016 ms of which 18 ms to minimize.
[2024-06-01 00:00:36] [INFO ] Deduced a trap composed of 70 places in 2005 ms of which 17 ms to minimize.
SMT process timed out in 95606ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2832 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2832/2832 places, 7184/7184 transitions.
Applied a total of 0 rules in 359 ms. Remains 2832 /2832 variables (removed 0) and now considering 7184/7184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 2832/2832 places, 7184/7184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2832/2832 places, 7184/7184 transitions.
Applied a total of 0 rules in 353 ms. Remains 2832 /2832 variables (removed 0) and now considering 7184/7184 (removed 0) transitions.
[2024-06-01 00:00:37] [INFO ] Flow matrix only has 6298 transitions (discarded 886 similar events)
[2024-06-01 00:00:37] [INFO ] Invariant cache hit.
[2024-06-01 00:00:41] [INFO ] Implicit Places using invariants in 4251 ms returned [189, 267, 278, 285, 335, 426, 637, 713, 951, 952, 1004, 1154, 1223, 1276, 1358, 1407, 1426, 1471, 1491, 1509, 1681, 1721, 1824, 1892, 2037, 2104, 2114, 2428]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 4261 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2804/2832 places, 7184/7184 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2784 transition count 7164
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2784 transition count 7164
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 2764 transition count 7144
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 2764 transition count 7144
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 81 place count 2764 transition count 7143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 82 place count 2763 transition count 7143
Applied a total of 82 rules in 1191 ms. Remains 2763 /2804 variables (removed 41) and now considering 7143/7184 (removed 41) transitions.
[2024-06-01 00:00:43] [INFO ] Flow matrix only has 6257 transitions (discarded 886 similar events)
// Phase 1: matrix 6257 rows 2763 cols
[2024-06-01 00:00:43] [INFO ] Computed 53 invariants in 137 ms
[2024-06-01 00:00:47] [INFO ] Implicit Places using invariants in 4194 ms returned []
[2024-06-01 00:00:47] [INFO ] Flow matrix only has 6257 transitions (discarded 886 similar events)
[2024-06-01 00:00:47] [INFO ] Invariant cache hit.
[2024-06-01 00:00:50] [INFO ] State equation strengthened by 2999 read => feed constraints.
[2024-06-01 00:01:21] [INFO ] Performed 747/2763 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:01:53] [INFO ] Performed 1161/2763 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-06-01 00:02:23] [INFO ] Performed 1427/2763 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2024-06-01 00:02:56] [INFO ] Performed 1679/2763 implicitness test of which 0 returned IMPLICIT in 125 seconds.
[2024-06-01 00:02:56] [INFO ] Timeout of Implicit test with SMT after 125 seconds.
[2024-06-01 00:02:56] [INFO ] Implicit Places using invariants and state equation in 128962 ms returned []
Implicit Place search using SMT with State Equation took 133157 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2763/2832 places, 7143/7184 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 138962 ms. Remains : 2763/2832 places, 7143/7184 transitions.
[2024-06-01 00:02:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2024-06-01 00:02:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2763 places, 7143 transitions and 34346 arcs took 40 ms.
[2024-06-01 00:02:57] [INFO ] Flatten gal took : 480 ms
Total runtime 409798 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-01
BK_STOP 1717200177280
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name MultiCrashLeafsetExtension-PT-S24C02-ReachabilityCardinality-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/849/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S24C02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654350800062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C02.tgz
mv MultiCrashLeafsetExtension-PT-S24C02 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;