Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 13K Feb 26 02:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 02:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 02:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 02:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Feb 26 02:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 02:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.7M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-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 1679613004041

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 23:10:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 23:10:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 23:10:05] [INFO ] Load time of PNML (sax parser for PT used): 303 ms
[2023-03-23 23:10:05] [INFO ] Transformed 6222 places.
[2023-03-23 23:10:05] [INFO ] Transformed 8685 transitions.
[2023-03-23 23:10:05] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 408 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-10 TRUE 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
Support contains 35 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 1878 places :
Symmetric choice reduction at 1 with 1878 rule applications. Total rules 1912 place count 4310 transition count 6807
Iterating global reduction 1 with 1878 rules applied. Total rules applied 3790 place count 4310 transition count 6807
Discarding 1642 places :
Symmetric choice reduction at 1 with 1642 rule applications. Total rules 5432 place count 2668 transition count 5165
Iterating global reduction 1 with 1642 rules applied. Total rules applied 7074 place count 2668 transition count 5165
Discarding 212 places :
Symmetric choice reduction at 1 with 212 rule applications. Total rules 7286 place count 2456 transition count 3681
Iterating global reduction 1 with 212 rules applied. Total rules applied 7498 place count 2456 transition count 3681
Applied a total of 7498 rules in 1110 ms. Remains 2456 /6222 variables (removed 3766) and now considering 3681/8685 (removed 5004) transitions.
[2023-03-23 23:10:07] [INFO ] Flow matrix only has 3409 transitions (discarded 272 similar events)
// Phase 1: matrix 3409 rows 2456 cols
[2023-03-23 23:10:07] [INFO ] Computed 577 place invariants in 181 ms
[2023-03-23 23:10:11] [INFO ] Implicit Places using invariants in 3699 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 26, 31, 38, 47, 58, 73, 88, 104, 122, 124, 126, 128, 130, 132, 134, 147, 158, 167, 174, 179, 185, 216, 223, 226, 227, 228, 229, 230, 231, 232, 233, 236, 241, 248, 257, 268, 281, 295, 309, 310, 311, 312, 313, 314, 316, 327, 336, 345, 350, 353, 355, 386, 393, 396, 397, 398, 399, 400, 401, 402, 403, 405, 408, 413, 420, 429, 440, 452, 464, 465, 466, 467, 468, 470, 471, 480, 487, 492, 495, 499, 501, 532, 539, 542, 543, 544, 545, 546, 547, 548, 549, 551, 553, 556, 561, 568, 577, 587, 597, 598, 599, 600, 601, 602, 604, 611, 616, 619, 624, 626, 628, 659, 666, 670, 671, 672, 673, 674, 675, 676, 678, 680, 682, 685, 690, 700, 708, 716, 717, 719, 720, 722, 723, 729, 732, 736, 741, 743, 745, 776, 783, 786, 787, 788, 789, 790, 792, 793, 795, 797, 799, 804, 807, 812, 818, 824, 825, 826, 828, 829, 830, 831, 834, 839, 841, 843, 845, 847, 880, 887, 890, 892, 893, 894, 895, 896, 897, 901, 903, 905, 910, 912, 915, 919, 923, 924, 925, 926, 927, 928, 929, 930, 932, 934, 936, 938, 940, 942, 973, 980, 983, 985, 986, 988, 989, 990, 995, 998, 1000, 1002, 1007, 1009, 1011, 1014, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1023, 1025, 1027, 1029, 1031, 1033, 1064, 1066, 1070, 1073, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1082, 1084, 1086, 1088, 1090, 1092, 1094, 1097, 1098, 1099, 1100, 1101, 1102, 1103, 1104, 1106, 1108, 1110, 1112, 1114, 1116, 1147, 1154, 1157, 1158, 1159, 1161, 1162, 1163, 1164, 1166, 1168, 1172, 1174, 1176, 1178, 1180, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1192, 1194, 1196, 1198, 1200, 1203, 1234, 1241, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1253, 1255, 1257, 1259, 1261, 1263, 1266, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1284, 1286, 1288, 1291, 1293, 1295, 1326, 1333, 1336, 1337, 1339, 1340, 1341, 1342, 1343, 1345, 1347, 1352, 1354, 1356, 1359, 1364, 1371, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1383, 1386, 1388, 1390, 1392, 1394, 1425, 1432, 1435, 1436, 1437, 1438, 1439, 1440, 1441, 1442, 1444, 1446, 1448, 1450, 1453, 1458, 1465, 1475, 1476, 1477, 1478, 1479, 1480, 1481, 1490, 1495, 1498, 1500, 1502, 1504, 1535, 1542, 1545, 1546, 1547, 1548, 1549, 1550, 1551, 1552, 1554, 1556, 1558, 1561, 1566, 1573, 1582, 1593, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1609, 1616, 1621, 1624, 1626, 1628, 1659, 1666, 1669, 1670, 1671, 1672, 1673, 1674, 1675, 1676, 1678, 1680, 1683, 1688, 1695, 1704, 1715, 1728, 1729, 1730, 1731, 1732, 1734, 1735, 1746, 1755, 1762, 1767, 1773, 1775, 1806, 1813, 1816, 1817, 1818, 1819, 1820, 1821, 1822, 1823, 1825, 1828, 1833, 1840, 1849, 1860, 1873, 1888, 1889, 1891, 1892, 1893, 1894, 1895, 1908, 1919, 1928, 1935, 1940, 1945, 1976, 1978, 1982, 1986, 1987, 1989, 1990, 1991, 1992, 1995, 2000, 2007, 2016, 2027, 2044, 2059, 2076, 2077, 2078, 2079, 2080, 2081, 2082, 2083, 2098, 2111, 2122, 2131, 2138, 2143, 2175]
Discarding 509 places :
Implicit Place search using SMT only with invariants took 3732 ms to find 509 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1947/6222 places, 3681/8685 transitions.
Discarding 203 places :
Symmetric choice reduction at 0 with 203 rule applications. Total rules 203 place count 1744 transition count 3478
Iterating global reduction 0 with 203 rules applied. Total rules applied 406 place count 1744 transition count 3478
Discarding 203 places :
Symmetric choice reduction at 0 with 203 rule applications. Total rules 609 place count 1541 transition count 3275
Iterating global reduction 0 with 203 rules applied. Total rules applied 812 place count 1541 transition count 3275
Discarding 202 places :
Symmetric choice reduction at 0 with 202 rule applications. Total rules 1014 place count 1339 transition count 3073
Iterating global reduction 0 with 202 rules applied. Total rules applied 1216 place count 1339 transition count 3073
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 1229 place count 1326 transition count 2982
Iterating global reduction 0 with 13 rules applied. Total rules applied 1242 place count 1326 transition count 2982
Applied a total of 1242 rules in 289 ms. Remains 1326 /1947 variables (removed 621) and now considering 2982/3681 (removed 699) transitions.
[2023-03-23 23:10:11] [INFO ] Flow matrix only has 2710 transitions (discarded 272 similar events)
// Phase 1: matrix 2710 rows 1326 cols
[2023-03-23 23:10:11] [INFO ] Computed 68 place invariants in 55 ms
[2023-03-23 23:10:12] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2023-03-23 23:10:12] [INFO ] Flow matrix only has 2710 transitions (discarded 272 similar events)
[2023-03-23 23:10:12] [INFO ] Invariant cache hit.
[2023-03-23 23:10:13] [INFO ] State equation strengthened by 1100 read => feed constraints.
[2023-03-23 23:10:27] [INFO ] Implicit Places using invariants and state equation in 15250 ms returned []
Implicit Place search using SMT with State Equation took 16376 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1326/6222 places, 2982/8685 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21508 ms. Remains : 1326/6222 places, 2982/8685 transitions.
Support contains 35 out of 1326 places after structural reductions.
[2023-03-23 23:10:28] [INFO ] Flatten gal took : 219 ms
[2023-03-23 23:10:28] [INFO ] Flatten gal took : 146 ms
[2023-03-23 23:10:28] [INFO ] Input system was already deterministic with 2982 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 21) seen :4
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-23 23:10:29] [INFO ] Flow matrix only has 2710 transitions (discarded 272 similar events)
[2023-03-23 23:10:29] [INFO ] Invariant cache hit.
[2023-03-23 23:10:29] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2023-03-23 23:10:29] [INFO ] [Real]Absence check using 31 positive and 37 generalized place invariants in 8 ms returned sat
[2023-03-23 23:10:29] [INFO ] After 549ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:10
[2023-03-23 23:10:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2023-03-23 23:10:30] [INFO ] [Nat]Absence check using 31 positive and 37 generalized place invariants in 9 ms returned sat
[2023-03-23 23:10:31] [INFO ] After 1193ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :4
[2023-03-23 23:10:31] [INFO ] State equation strengthened by 1100 read => feed constraints.
[2023-03-23 23:10:32] [INFO ] After 756ms SMT Verify possible using 1100 Read/Feed constraints in natural domain returned unsat :11 sat :4
[2023-03-23 23:10:33] [INFO ] Deduced a trap composed of 380 places in 634 ms of which 7 ms to minimize.
[2023-03-23 23:10:34] [INFO ] Deduced a trap composed of 393 places in 693 ms of which 2 ms to minimize.
[2023-03-23 23:10:34] [INFO ] Deduced a trap composed of 413 places in 614 ms of which 5 ms to minimize.
[2023-03-23 23:10:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2264 ms
[2023-03-23 23:10:35] [INFO ] Deduced a trap composed of 396 places in 641 ms of which 1 ms to minimize.
[2023-03-23 23:10:36] [INFO ] Deduced a trap composed of 402 places in 704 ms of which 2 ms to minimize.
[2023-03-23 23:10:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1587 ms
[2023-03-23 23:10:36] [INFO ] After 5287ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :4
Attempting to minimize the solution found.
Minimization took 893 ms.
[2023-03-23 23:10:37] [INFO ] After 7883ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :4
Fused 15 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 7 out of 1326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1326/1326 places, 2982/2982 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1326 transition count 2956
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1300 transition count 2956
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 52 place count 1300 transition count 2932
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 100 place count 1276 transition count 2932
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 111 place count 1265 transition count 2903
Iterating global reduction 2 with 11 rules applied. Total rules applied 122 place count 1265 transition count 2903
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 129 place count 1258 transition count 2854
Iterating global reduction 2 with 7 rules applied. Total rules applied 136 place count 1258 transition count 2854
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 216 place count 1218 transition count 2814
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 226 place count 1208 transition count 2804
Iterating global reduction 2 with 10 rules applied. Total rules applied 236 place count 1208 transition count 2804
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 246 place count 1198 transition count 2734
Iterating global reduction 2 with 10 rules applied. Total rules applied 256 place count 1198 transition count 2734
Free-agglomeration rule (complex) applied 156 times.
Iterating global reduction 2 with 156 rules applied. Total rules applied 412 place count 1198 transition count 4048
Reduce places removed 156 places and 0 transitions.
Iterating post reduction 2 with 156 rules applied. Total rules applied 568 place count 1042 transition count 4048
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 589 place count 1042 transition count 4048
Applied a total of 589 rules in 937 ms. Remains 1042 /1326 variables (removed 284) and now considering 4048/2982 (removed -1066) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 942 ms. Remains : 1042/1326 places, 4048/2982 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 23:10:39] [INFO ] Flow matrix only has 3650 transitions (discarded 398 similar events)
// Phase 1: matrix 3650 rows 1042 cols
[2023-03-23 23:10:39] [INFO ] Computed 68 place invariants in 51 ms
[2023-03-23 23:10:39] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 23:10:39] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-23 23:10:39] [INFO ] [Nat]Absence check using 31 positive and 37 generalized place invariants in 7 ms returned sat
[2023-03-23 23:10:41] [INFO ] After 1234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 23:10:41] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:10:42] [INFO ] After 1712ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 23:10:44] [INFO ] Deduced a trap composed of 150 places in 514 ms of which 1 ms to minimize.
[2023-03-23 23:10:45] [INFO ] Deduced a trap composed of 179 places in 475 ms of which 1 ms to minimize.
[2023-03-23 23:10:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1357 ms
[2023-03-23 23:10:45] [INFO ] After 4748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1175 ms.
[2023-03-23 23:10:46] [INFO ] After 7414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 1042 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1042/1042 places, 4048/4048 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 1042 transition count 4048
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 1041 transition count 4047
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1041 transition count 4047
Applied a total of 3 rules in 260 ms. Remains 1041 /1042 variables (removed 1) and now considering 4047/4048 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 1041/1042 places, 4047/4048 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 56927 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56927 steps, saw 24083 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 23:10:50] [INFO ] Flow matrix only has 3649 transitions (discarded 398 similar events)
// Phase 1: matrix 3649 rows 1041 cols
[2023-03-23 23:10:50] [INFO ] Computed 68 place invariants in 35 ms
[2023-03-23 23:10:50] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 23:10:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 23:10:51] [INFO ] [Nat]Absence check using 31 positive and 37 generalized place invariants in 8 ms returned sat
[2023-03-23 23:10:52] [INFO ] After 1061ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 23:10:52] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:10:53] [INFO ] After 1306ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 23:10:54] [INFO ] Deduced a trap composed of 163 places in 551 ms of which 1 ms to minimize.
[2023-03-23 23:10:54] [INFO ] Deduced a trap composed of 165 places in 536 ms of which 1 ms to minimize.
[2023-03-23 23:10:55] [INFO ] Deduced a trap composed of 172 places in 533 ms of which 1 ms to minimize.
[2023-03-23 23:10:56] [INFO ] Deduced a trap composed of 202 places in 549 ms of which 1 ms to minimize.
[2023-03-23 23:10:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2767 ms
[2023-03-23 23:10:57] [INFO ] Deduced a trap composed of 155 places in 486 ms of which 1 ms to minimize.
[2023-03-23 23:10:58] [INFO ] Deduced a trap composed of 174 places in 494 ms of which 1 ms to minimize.
[2023-03-23 23:10:58] [INFO ] Deduced a trap composed of 194 places in 546 ms of which 1 ms to minimize.
[2023-03-23 23:10:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2034 ms
[2023-03-23 23:11:00] [INFO ] Deduced a trap composed of 147 places in 526 ms of which 1 ms to minimize.
[2023-03-23 23:11:01] [INFO ] Deduced a trap composed of 164 places in 525 ms of which 2 ms to minimize.
[2023-03-23 23:11:01] [INFO ] Deduced a trap composed of 143 places in 571 ms of which 1 ms to minimize.
[2023-03-23 23:11:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2438 ms
[2023-03-23 23:11:02] [INFO ] After 9963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1626 ms.
[2023-03-23 23:11:03] [INFO ] After 12885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 1041 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1041/1041 places, 4047/4047 transitions.
Applied a total of 0 rules in 109 ms. Remains 1041 /1041 variables (removed 0) and now considering 4047/4047 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 1041/1041 places, 4047/4047 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1041/1041 places, 4047/4047 transitions.
Applied a total of 0 rules in 121 ms. Remains 1041 /1041 variables (removed 0) and now considering 4047/4047 (removed 0) transitions.
[2023-03-23 23:11:03] [INFO ] Flow matrix only has 3649 transitions (discarded 398 similar events)
[2023-03-23 23:11:03] [INFO ] Invariant cache hit.
[2023-03-23 23:11:05] [INFO ] Implicit Places using invariants in 1244 ms returned [85, 286, 397, 398, 418, 452, 477, 523, 556, 572, 622, 734, 819, 863, 864]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1247 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1026/1041 places, 4047/4047 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1019 transition count 4040
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1019 transition count 4040
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1012 transition count 4033
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1012 transition count 4033
Applied a total of 28 rules in 159 ms. Remains 1012 /1026 variables (removed 14) and now considering 4033/4047 (removed 14) transitions.
[2023-03-23 23:11:05] [INFO ] Flow matrix only has 3635 transitions (discarded 398 similar events)
// Phase 1: matrix 3635 rows 1012 cols
[2023-03-23 23:11:05] [INFO ] Computed 53 place invariants in 36 ms
[2023-03-23 23:11:06] [INFO ] Implicit Places using invariants in 1172 ms returned []
[2023-03-23 23:11:06] [INFO ] Flow matrix only has 3635 transitions (discarded 398 similar events)
[2023-03-23 23:11:06] [INFO ] Invariant cache hit.
[2023-03-23 23:11:07] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:11:29] [INFO ] Implicit Places using invariants and state equation in 22914 ms returned []
Implicit Place search using SMT with State Equation took 24089 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1012/1041 places, 4033/4047 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25618 ms. Remains : 1012/1041 places, 4033/4047 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 23:11:29] [INFO ] Flow matrix only has 3635 transitions (discarded 398 similar events)
[2023-03-23 23:11:29] [INFO ] Invariant cache hit.
[2023-03-23 23:11:30] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-23 23:11:30] [INFO ] [Real]Absence check using 31 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-23 23:11:31] [INFO ] After 973ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-23 23:11:31] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:11:31] [INFO ] After 276ms SMT Verify possible using 2450 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 23:11:31] [INFO ] After 1439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 23:11:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 23:11:31] [INFO ] [Nat]Absence check using 31 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-23 23:11:32] [INFO ] After 1022ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 23:11:33] [INFO ] After 1032ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 23:11:34] [INFO ] Deduced a trap composed of 192 places in 482 ms of which 1 ms to minimize.
[2023-03-23 23:11:35] [INFO ] Deduced a trap composed of 146 places in 500 ms of which 1 ms to minimize.
[2023-03-23 23:11:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1327 ms
[2023-03-23 23:11:36] [INFO ] Deduced a trap composed of 137 places in 500 ms of which 2 ms to minimize.
[2023-03-23 23:11:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 679 ms
[2023-03-23 23:11:36] [INFO ] After 4145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2074 ms.
[2023-03-23 23:11:38] [INFO ] After 7437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 1012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1012/1012 places, 4033/4033 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1012 transition count 4032
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1011 transition count 4032
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1011 transition count 4032
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 1009 transition count 4030
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1009 transition count 4030
Applied a total of 8 rules in 246 ms. Remains 1009 /1012 variables (removed 3) and now considering 4030/4033 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 1009/1012 places, 4030/4033 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 58314 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58314 steps, saw 24664 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 23:11:42] [INFO ] Flow matrix only has 3632 transitions (discarded 398 similar events)
// Phase 1: matrix 3632 rows 1009 cols
[2023-03-23 23:11:42] [INFO ] Computed 53 place invariants in 33 ms
[2023-03-23 23:11:42] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-23 23:11:42] [INFO ] [Real]Absence check using 31 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-23 23:11:43] [INFO ] After 987ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-23 23:11:43] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:11:43] [INFO ] After 298ms SMT Verify possible using 2450 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 23:11:43] [INFO ] After 1490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 23:11:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 23:11:44] [INFO ] [Nat]Absence check using 31 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-23 23:11:45] [INFO ] After 1034ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 23:11:46] [INFO ] After 1270ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 23:11:47] [INFO ] Deduced a trap composed of 175 places in 472 ms of which 1 ms to minimize.
[2023-03-23 23:11:48] [INFO ] Deduced a trap composed of 145 places in 515 ms of which 1 ms to minimize.
[2023-03-23 23:11:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1327 ms
[2023-03-23 23:11:48] [INFO ] After 3772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1193 ms.
[2023-03-23 23:11:50] [INFO ] After 6175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 1009 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1009/1009 places, 4030/4030 transitions.
Applied a total of 0 rules in 100 ms. Remains 1009 /1009 variables (removed 0) and now considering 4030/4030 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 1009/1009 places, 4030/4030 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1009/1009 places, 4030/4030 transitions.
Applied a total of 0 rules in 103 ms. Remains 1009 /1009 variables (removed 0) and now considering 4030/4030 (removed 0) transitions.
[2023-03-23 23:11:50] [INFO ] Flow matrix only has 3632 transitions (discarded 398 similar events)
[2023-03-23 23:11:50] [INFO ] Invariant cache hit.
[2023-03-23 23:11:51] [INFO ] Implicit Places using invariants in 1131 ms returned [369, 468]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1135 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1007/1009 places, 4030/4030 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1006 transition count 4029
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1006 transition count 4029
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1005 transition count 4028
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1005 transition count 4028
Applied a total of 4 rules in 157 ms. Remains 1005 /1007 variables (removed 2) and now considering 4028/4030 (removed 2) transitions.
[2023-03-23 23:11:51] [INFO ] Flow matrix only has 3630 transitions (discarded 398 similar events)
// Phase 1: matrix 3630 rows 1005 cols
[2023-03-23 23:11:51] [INFO ] Computed 51 place invariants in 25 ms
[2023-03-23 23:11:52] [INFO ] Implicit Places using invariants in 1187 ms returned []
[2023-03-23 23:11:52] [INFO ] Flow matrix only has 3630 transitions (discarded 398 similar events)
[2023-03-23 23:11:52] [INFO ] Invariant cache hit.
[2023-03-23 23:11:53] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:12:14] [INFO ] Implicit Places using invariants and state equation in 21607 ms returned []
Implicit Place search using SMT with State Equation took 22796 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1005/1009 places, 4028/4030 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24191 ms. Remains : 1005/1009 places, 4028/4030 transitions.
Successfully simplified 11 atomic propositions for a total of 10 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 494 stabilizing places and 1349 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 1326 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1326/1326 places, 2982/2982 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 1326 transition count 2955
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1299 transition count 2955
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 1299 transition count 2931
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 102 place count 1275 transition count 2931
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 116 place count 1261 transition count 2899
Iterating global reduction 2 with 14 rules applied. Total rules applied 130 place count 1261 transition count 2899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 130 place count 1261 transition count 2898
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 132 place count 1260 transition count 2898
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 142 place count 1250 transition count 2828
Iterating global reduction 2 with 10 rules applied. Total rules applied 152 place count 1250 transition count 2828
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 230 place count 1211 transition count 2789
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 241 place count 1200 transition count 2778
Iterating global reduction 2 with 11 rules applied. Total rules applied 252 place count 1200 transition count 2778
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 263 place count 1189 transition count 2701
Iterating global reduction 2 with 11 rules applied. Total rules applied 274 place count 1189 transition count 2701
Applied a total of 274 rules in 452 ms. Remains 1189 /1326 variables (removed 137) and now considering 2701/2982 (removed 281) transitions.
[2023-03-23 23:12:15] [INFO ] Flow matrix only has 2429 transitions (discarded 272 similar events)
// Phase 1: matrix 2429 rows 1189 cols
[2023-03-23 23:12:15] [INFO ] Computed 68 place invariants in 33 ms
[2023-03-23 23:12:16] [INFO ] Implicit Places using invariants in 1026 ms returned [9, 94, 326, 427, 457, 483, 504, 523, 553, 554, 600, 636, 654, 714, 845, 943, 994, 995]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1028 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1171/1326 places, 2701/2982 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1163 transition count 2693
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1163 transition count 2693
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1155 transition count 2685
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1155 transition count 2685
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1151 transition count 2657
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1151 transition count 2657
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 60 place count 1141 transition count 2647
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 1131 transition count 2637
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 1131 transition count 2637
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 91 place count 1120 transition count 2560
Iterating global reduction 0 with 11 rules applied. Total rules applied 102 place count 1120 transition count 2560
Applied a total of 102 rules in 387 ms. Remains 1120 /1171 variables (removed 51) and now considering 2560/2701 (removed 141) transitions.
[2023-03-23 23:12:16] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1120 cols
[2023-03-23 23:12:16] [INFO ] Computed 50 place invariants in 19 ms
[2023-03-23 23:12:17] [INFO ] Implicit Places using invariants in 947 ms returned []
[2023-03-23 23:12:17] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
[2023-03-23 23:12:17] [INFO ] Invariant cache hit.
[2023-03-23 23:12:18] [INFO ] State equation strengthened by 866 read => feed constraints.
[2023-03-23 23:12:26] [INFO ] Implicit Places using invariants and state equation in 9319 ms returned [1087]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10269 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1119/1326 places, 2560/2982 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 1119 transition count 2559
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 1118 transition count 2559
Applied a total of 2 rules in 80 ms. Remains 1118 /1119 variables (removed 1) and now considering 2559/2560 (removed 1) transitions.
[2023-03-23 23:12:26] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
// Phase 1: matrix 2287 rows 1118 cols
[2023-03-23 23:12:26] [INFO ] Computed 49 place invariants in 26 ms
[2023-03-23 23:12:27] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2023-03-23 23:12:27] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
[2023-03-23 23:12:27] [INFO ] Invariant cache hit.
[2023-03-23 23:12:28] [INFO ] State equation strengthened by 866 read => feed constraints.
[2023-03-23 23:12:37] [INFO ] Implicit Places using invariants and state equation in 9727 ms returned []
Implicit Place search using SMT with State Equation took 10729 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1118/1326 places, 2559/2982 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 22956 ms. Remains : 1118/1326 places, 2559/2982 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s456), p0:(LEQ s406 s251)], 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 1957 reset in 644 ms.
Product exploration explored 100000 steps with 1957 reset in 602 ms.
Computed a total of 303 stabilizing places and 943 stable transitions
Computed a total of 303 stabilizing places and 943 stable transitions
Detected a total of 303/1118 stabilizing places and 943/2559 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 195 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 69104 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69104 steps, saw 29405 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 23:12:42] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
[2023-03-23 23:12:42] [INFO ] Invariant cache hit.
[2023-03-23 23:12:42] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 23:12:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-23 23:12:42] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-23 23:12:43] [INFO ] After 732ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-23 23:12:43] [INFO ] State equation strengthened by 866 read => feed constraints.
[2023-03-23 23:12:43] [INFO ] After 199ms SMT Verify possible using 866 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-23 23:12:44] [INFO ] Deduced a trap composed of 279 places in 466 ms of which 1 ms to minimize.
[2023-03-23 23:12:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 585 ms
[2023-03-23 23:12:44] [INFO ] After 841ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-23 23:12:44] [INFO ] After 1831ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1118/1118 places, 2559/2559 transitions.
Free-agglomeration rule (complex) applied 137 times.
Iterating global reduction 0 with 137 rules applied. Total rules applied 137 place count 1118 transition count 4006
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 0 with 137 rules applied. Total rules applied 274 place count 981 transition count 4006
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 981 transition count 4006
Applied a total of 277 rules in 302 ms. Remains 981 /1118 variables (removed 137) and now considering 4006/2559 (removed -1447) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 981/1118 places, 4006/2559 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 65826 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65826 steps, saw 27617 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 23:12:48] [INFO ] Flow matrix only has 3608 transitions (discarded 398 similar events)
// Phase 1: matrix 3608 rows 981 cols
[2023-03-23 23:12:48] [INFO ] Computed 49 place invariants in 98 ms
[2023-03-23 23:12:48] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:12:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 23:12:48] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-23 23:12:49] [INFO ] After 891ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:12:49] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:12:49] [INFO ] After 502ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 23:12:50] [INFO ] After 664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-23 23:12:50] [INFO ] After 1834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 981 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 981/981 places, 4006/4006 transitions.
Applied a total of 0 rules in 106 ms. Remains 981 /981 variables (removed 0) and now considering 4006/4006 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 981/981 places, 4006/4006 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 981/981 places, 4006/4006 transitions.
Applied a total of 0 rules in 99 ms. Remains 981 /981 variables (removed 0) and now considering 4006/4006 (removed 0) transitions.
[2023-03-23 23:12:50] [INFO ] Flow matrix only has 3608 transitions (discarded 398 similar events)
[2023-03-23 23:12:50] [INFO ] Invariant cache hit.
[2023-03-23 23:12:51] [INFO ] Implicit Places using invariants in 1127 ms returned []
[2023-03-23 23:12:51] [INFO ] Flow matrix only has 3608 transitions (discarded 398 similar events)
[2023-03-23 23:12:51] [INFO ] Invariant cache hit.
[2023-03-23 23:12:52] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:13:14] [INFO ] Implicit Places using invariants and state equation in 22943 ms returned []
Implicit Place search using SMT with State Equation took 24080 ms to find 0 implicit places.
[2023-03-23 23:13:14] [INFO ] Redundant transitions in 314 ms returned []
[2023-03-23 23:13:14] [INFO ] Flow matrix only has 3608 transitions (discarded 398 similar events)
[2023-03-23 23:13:14] [INFO ] Invariant cache hit.
[2023-03-23 23:13:16] [INFO ] Dead Transitions using invariants and state equation in 1480 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25989 ms. Remains : 981/981 places, 4006/4006 transitions.
Graph (trivial) has 1053 edges and 981 vertex of which 17 / 981 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 4598 edges and 965 vertex of which 951 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1347.t1568 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 934 transition count 3237
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 837 transition count 3044
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 741 transition count 2876
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 669 transition count 2734
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 599 transition count 2614
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 549 transition count 2516
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 501 transition count 2436
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 469 transition count 2374
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 439 transition count 2326
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 421 transition count 2292
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 405 transition count 2268
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 397 transition count 2254
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 391 transition count 2246
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 388 transition count 2244
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 14 Pre rules applied. Total rules applied 1640 place count 388 transition count 2230
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 14 with 28 rules applied. Total rules applied 1668 place count 374 transition count 2230
Discarding 280 places :
Symmetric choice reduction at 14 with 280 rule applications. Total rules 1948 place count 94 transition count 366
Iterating global reduction 14 with 280 rules applied. Total rules applied 2228 place count 94 transition count 366
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 14 with 237 rules applied. Total rules applied 2465 place count 94 transition count 129
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 2472 place count 87 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2472 place count 87 transition count 128
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 2474 place count 86 transition count 128
Discarding 11 places :
Symmetric choice reduction at 16 with 11 rule applications. Total rules 2485 place count 75 transition count 105
Iterating global reduction 16 with 11 rules applied. Total rules applied 2496 place count 75 transition count 105
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 2500 place count 71 transition count 101
Iterating global reduction 16 with 4 rules applied. Total rules applied 2504 place count 71 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 16 with 10 rules applied. Total rules applied 2514 place count 66 transition count 96
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2515 place count 65 transition count 92
Iterating global reduction 16 with 1 rules applied. Total rules applied 2516 place count 65 transition count 92
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 16 with 12 rules applied. Total rules applied 2528 place count 65 transition count 80
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 16 with 12 rules applied. Total rules applied 2540 place count 53 transition count 80
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 17 with 8 rules applied. Total rules applied 2548 place count 53 transition count 80
Applied a total of 2548 rules in 500 ms. Remains 53 /981 variables (removed 928) and now considering 80/4006 (removed 3926) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 80 rows 53 cols
[2023-03-23 23:13:16] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-23 23:13:16] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:13:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 23:13:16] [INFO ] [Nat]Absence check using 2 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-23 23:13:16] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:13:16] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-23 23:13:16] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 406 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1118 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1118/1118 places, 2559/2559 transitions.
Applied a total of 0 rules in 65 ms. Remains 1118 /1118 variables (removed 0) and now considering 2559/2559 (removed 0) transitions.
[2023-03-23 23:13:17] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
// Phase 1: matrix 2287 rows 1118 cols
[2023-03-23 23:13:17] [INFO ] Computed 49 place invariants in 27 ms
[2023-03-23 23:13:18] [INFO ] Implicit Places using invariants in 970 ms returned []
[2023-03-23 23:13:18] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
[2023-03-23 23:13:18] [INFO ] Invariant cache hit.
[2023-03-23 23:13:19] [INFO ] State equation strengthened by 866 read => feed constraints.
[2023-03-23 23:13:28] [INFO ] Implicit Places using invariants and state equation in 9620 ms returned []
Implicit Place search using SMT with State Equation took 10592 ms to find 0 implicit places.
[2023-03-23 23:13:28] [INFO ] Redundant transitions in 135 ms returned []
[2023-03-23 23:13:28] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
[2023-03-23 23:13:28] [INFO ] Invariant cache hit.
[2023-03-23 23:13:29] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11826 ms. Remains : 1118/1118 places, 2559/2559 transitions.
Computed a total of 303 stabilizing places and 943 stable transitions
Computed a total of 303 stabilizing places and 943 stable transitions
Detected a total of 303/1118 stabilizing places and 943/2559 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 195 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85874 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85874 steps, saw 36451 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 23:13:32] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
[2023-03-23 23:13:32] [INFO ] Invariant cache hit.
[2023-03-23 23:13:32] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:13:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-23 23:13:32] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-23 23:13:33] [INFO ] After 660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:13:33] [INFO ] State equation strengthened by 866 read => feed constraints.
[2023-03-23 23:13:33] [INFO ] After 197ms SMT Verify possible using 866 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 23:13:34] [INFO ] Deduced a trap composed of 305 places in 464 ms of which 1 ms to minimize.
[2023-03-23 23:13:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 607 ms
[2023-03-23 23:13:34] [INFO ] After 863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-23 23:13:34] [INFO ] After 1760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1118/1118 places, 2559/2559 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1117 transition count 2558
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1117 transition count 2558
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1116 transition count 2551
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1116 transition count 2551
Free-agglomeration rule (complex) applied 136 times.
Iterating global reduction 0 with 136 rules applied. Total rules applied 140 place count 1116 transition count 4005
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 0 with 136 rules applied. Total rules applied 276 place count 980 transition count 4005
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 279 place count 980 transition count 4005
Applied a total of 279 rules in 391 ms. Remains 980 /1118 variables (removed 138) and now considering 4005/2559 (removed -1446) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 980/1118 places, 4005/2559 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 73481 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73481 steps, saw 30802 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 23:13:38] [INFO ] Flow matrix only has 3607 transitions (discarded 398 similar events)
// Phase 1: matrix 3607 rows 980 cols
[2023-03-23 23:13:38] [INFO ] Computed 49 place invariants in 50 ms
[2023-03-23 23:13:38] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:13:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 23:13:38] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-23 23:13:39] [INFO ] After 955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:13:39] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:13:39] [INFO ] After 461ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 23:13:40] [INFO ] After 624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-23 23:13:40] [INFO ] After 1842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 980 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 4005/4005 transitions.
Applied a total of 0 rules in 101 ms. Remains 980 /980 variables (removed 0) and now considering 4005/4005 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 980/980 places, 4005/4005 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 4005/4005 transitions.
Applied a total of 0 rules in 109 ms. Remains 980 /980 variables (removed 0) and now considering 4005/4005 (removed 0) transitions.
[2023-03-23 23:13:40] [INFO ] Flow matrix only has 3607 transitions (discarded 398 similar events)
[2023-03-23 23:13:40] [INFO ] Invariant cache hit.
[2023-03-23 23:13:41] [INFO ] Implicit Places using invariants in 1196 ms returned [386]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1200 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 979/980 places, 4005/4005 transitions.
Applied a total of 0 rules in 97 ms. Remains 979 /979 variables (removed 0) and now considering 4005/4005 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1408 ms. Remains : 979/980 places, 4005/4005 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 73556 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73556 steps, saw 30847 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 23:13:44] [INFO ] Flow matrix only has 3607 transitions (discarded 398 similar events)
// Phase 1: matrix 3607 rows 979 cols
[2023-03-23 23:13:44] [INFO ] Computed 48 place invariants in 32 ms
[2023-03-23 23:13:45] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:13:45] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 23:13:45] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-23 23:13:46] [INFO ] After 889ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:13:46] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:13:46] [INFO ] After 393ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 23:13:46] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-23 23:13:46] [INFO ] After 1709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4005/4005 transitions.
Applied a total of 0 rules in 97 ms. Remains 979 /979 variables (removed 0) and now considering 4005/4005 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 979/979 places, 4005/4005 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4005/4005 transitions.
Applied a total of 0 rules in 100 ms. Remains 979 /979 variables (removed 0) and now considering 4005/4005 (removed 0) transitions.
[2023-03-23 23:13:46] [INFO ] Flow matrix only has 3607 transitions (discarded 398 similar events)
[2023-03-23 23:13:46] [INFO ] Invariant cache hit.
[2023-03-23 23:13:48] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2023-03-23 23:13:48] [INFO ] Flow matrix only has 3607 transitions (discarded 398 similar events)
[2023-03-23 23:13:48] [INFO ] Invariant cache hit.
[2023-03-23 23:13:48] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:14:08] [INFO ] Implicit Places using invariants and state equation in 20239 ms returned []
Implicit Place search using SMT with State Equation took 21391 ms to find 0 implicit places.
[2023-03-23 23:14:08] [INFO ] Redundant transitions in 197 ms returned []
[2023-03-23 23:14:08] [INFO ] Flow matrix only has 3607 transitions (discarded 398 similar events)
[2023-03-23 23:14:08] [INFO ] Invariant cache hit.
[2023-03-23 23:14:09] [INFO ] Dead Transitions using invariants and state equation in 1438 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23137 ms. Remains : 979/979 places, 4005/4005 transitions.
Graph (trivial) has 1053 edges and 979 vertex of which 17 / 979 are part of one of the 1 SCC in 0 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 4584 edges and 963 vertex of which 949 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1347.t1568 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 932 transition count 3236
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 835 transition count 3043
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 739 transition count 2875
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 667 transition count 2733
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 597 transition count 2613
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 547 transition count 2515
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 499 transition count 2435
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 467 transition count 2373
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 437 transition count 2325
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 419 transition count 2291
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 403 transition count 2267
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 395 transition count 2253
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 389 transition count 2245
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 386 transition count 2243
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 1640 place count 386 transition count 2228
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 14 with 30 rules applied. Total rules applied 1670 place count 371 transition count 2228
Discarding 282 places :
Symmetric choice reduction at 14 with 282 rule applications. Total rules 1952 place count 89 transition count 356
Iterating global reduction 14 with 282 rules applied. Total rules applied 2234 place count 89 transition count 356
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 14 with 237 rules applied. Total rules applied 2471 place count 89 transition count 119
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 2478 place count 82 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2478 place count 82 transition count 118
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 2480 place count 81 transition count 118
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 2492 place count 69 transition count 88
Iterating global reduction 16 with 12 rules applied. Total rules applied 2504 place count 69 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 2509 place count 69 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2510 place count 68 transition count 83
Discarding 4 places :
Symmetric choice reduction at 18 with 4 rule applications. Total rules 2514 place count 64 transition count 79
Iterating global reduction 18 with 4 rules applied. Total rules applied 2518 place count 64 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 18 with 6 rules applied. Total rules applied 2524 place count 61 transition count 76
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 2525 place count 60 transition count 73
Iterating global reduction 18 with 1 rules applied. Total rules applied 2526 place count 60 transition count 73
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 18 with 13 rules applied. Total rules applied 2539 place count 60 transition count 60
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 18 with 13 rules applied. Total rules applied 2552 place count 47 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 2553 place count 47 transition count 60
Applied a total of 2553 rules in 360 ms. Remains 47 /979 variables (removed 932) and now considering 60/4005 (removed 3945) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 47 cols
[2023-03-23 23:14:10] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-23 23:14:10] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:14:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-23 23:14:10] [INFO ] [Nat]Absence check using 2 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 23:14:10] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:14:10] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-23 23:14:10] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1956 reset in 553 ms.
Product exploration explored 100000 steps with 1958 reset in 539 ms.
Support contains 2 out of 1118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1118/1118 places, 2559/2559 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1117 transition count 2558
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1117 transition count 2558
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1116 transition count 2551
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1116 transition count 2551
Applied a total of 4 rules in 136 ms. Remains 1116 /1118 variables (removed 2) and now considering 2551/2559 (removed 8) transitions.
[2023-03-23 23:14:12] [INFO ] Flow matrix only has 2279 transitions (discarded 272 similar events)
// Phase 1: matrix 2279 rows 1116 cols
[2023-03-23 23:14:12] [INFO ] Computed 49 place invariants in 35 ms
[2023-03-23 23:14:12] [INFO ] Implicit Places using invariants in 938 ms returned [447]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 942 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1115/1118 places, 2551/2559 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1114 transition count 2550
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1113 transition count 2549
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1113 transition count 2549
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1112 transition count 2542
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1112 transition count 2542
Applied a total of 6 rules in 171 ms. Remains 1112 /1115 variables (removed 3) and now considering 2542/2551 (removed 9) transitions.
[2023-03-23 23:14:13] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1112 cols
[2023-03-23 23:14:13] [INFO ] Computed 48 place invariants in 21 ms
[2023-03-23 23:14:14] [INFO ] Implicit Places using invariants in 934 ms returned []
[2023-03-23 23:14:14] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2023-03-23 23:14:14] [INFO ] Invariant cache hit.
[2023-03-23 23:14:14] [INFO ] State equation strengthened by 854 read => feed constraints.
[2023-03-23 23:14:23] [INFO ] Implicit Places using invariants and state equation in 9250 ms returned []
Implicit Place search using SMT with State Equation took 10186 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1112/1118 places, 2542/2559 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11435 ms. Remains : 1112/1118 places, 2542/2559 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-13 finished in 128986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2023-03-23 23:14:23] [INFO ] Flatten gal took : 116 ms
[2023-03-23 23:14:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-23 23:14:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1326 places, 2982 transitions and 13042 arcs took 20 ms.
Total runtime 258399 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/892/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C07-LTLCardinality-13

BK_STOP 1679613266176

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x555ffec4b3f4]
1: pnml2lts-mc(+0xa2496) [0x555ffec4b496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fd42f618140]
3: pnml2lts-mc(+0x405be5) [0x555ffefaebe5]
4: pnml2lts-mc(+0x16b3f9) [0x555ffed143f9]
5: pnml2lts-mc(+0x164ac4) [0x555ffed0dac4]
6: pnml2lts-mc(+0x272e0a) [0x555ffee1be0a]
7: pnml2lts-mc(+0xb61f0) [0x555ffec5f1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fd42f46b4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fd42f46b67a]
10: pnml2lts-mc(+0xa1581) [0x555ffec4a581]
11: pnml2lts-mc(+0xa1910) [0x555ffec4a910]
12: pnml2lts-mc(+0xa32a2) [0x555ffec4c2a2]
13: pnml2lts-mc(+0xa50f4) [0x555ffec4e0f4]
14: pnml2lts-mc(+0xa516b) [0x555ffec4e16b]
15: pnml2lts-mc(+0x3f34b3) [0x555ffef9c4b3]
16: pnml2lts-mc(+0x7c63d) [0x555ffec2563d]
17: pnml2lts-mc(+0x67d86) [0x555ffec10d86]
18: pnml2lts-mc(+0x60a8a) [0x555ffec09a8a]
19: pnml2lts-mc(+0x5eb15) [0x555ffec07b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fd42f453d0a]
21: pnml2lts-mc(+0x6075e) [0x555ffec0975e]

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-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 r233-tall-167856419400787"
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 ;