Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 13K Apr 29 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 16:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 16:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 5.7M May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652833086079

Running Version 202205111006
[2022-05-18 00:18:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 00:18:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:18:08] [INFO ] Load time of PNML (sax parser for PT used): 431 ms
[2022-05-18 00:18:08] [INFO ] Transformed 6222 places.
[2022-05-18 00:18:08] [INFO ] Transformed 8685 transitions.
[2022-05-18 00:18:08] [INFO ] Parsed PT model containing 6222 places and 8685 transitions in 592 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 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 1886 places :
Symmetric choice reduction at 1 with 1886 rule applications. Total rules 1920 place count 4302 transition count 6799
Iterating global reduction 1 with 1886 rules applied. Total rules applied 3806 place count 4302 transition count 6799
Discarding 1658 places :
Symmetric choice reduction at 1 with 1658 rule applications. Total rules 5464 place count 2644 transition count 5141
Iterating global reduction 1 with 1658 rules applied. Total rules applied 7122 place count 2644 transition count 5141
Discarding 223 places :
Symmetric choice reduction at 1 with 223 rule applications. Total rules 7345 place count 2421 transition count 3580
Iterating global reduction 1 with 223 rules applied. Total rules applied 7568 place count 2421 transition count 3580
Applied a total of 7568 rules in 1253 ms. Remains 2421 /6222 variables (removed 3801) and now considering 3580/8685 (removed 5105) transitions.
[2022-05-18 00:18:09] [INFO ] Flow matrix only has 3308 transitions (discarded 272 similar events)
// Phase 1: matrix 3308 rows 2421 cols
[2022-05-18 00:18:10] [INFO ] Computed 577 place invariants in 168 ms
[2022-05-18 00:18:11] [INFO ] Implicit Places using invariants in 2019 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 26, 31, 38, 47, 58, 71, 86, 102, 118, 120, 122, 124, 126, 128, 130, 132, 145, 156, 165, 172, 177, 180, 211, 218, 221, 222, 223, 224, 225, 226, 227, 228, 231, 236, 243, 252, 263, 276, 290, 304, 305, 306, 307, 308, 309, 310, 311, 322, 331, 338, 343, 346, 348, 379, 386, 389, 391, 392, 393, 395, 396, 398, 401, 409, 416, 425, 436, 448, 460, 461, 462, 463, 464, 465, 466, 467, 476, 483, 488, 491, 493, 495, 526, 533, 536, 537, 538, 539, 540, 542, 543, 545, 547, 550, 557, 564, 573, 583, 593, 594, 595, 596, 597, 598, 599, 600, 607, 612, 615, 617, 619, 621, 652, 659, 662, 663, 664, 665, 666, 667, 668, 669, 671, 673, 675, 678, 683, 690, 698, 706, 707, 708, 709, 710, 711, 712, 713, 718, 721, 723, 725, 727, 729, 760, 767, 770, 771, 772, 774, 775, 776, 777, 779, 781, 783, 787, 790, 795, 801, 807, 808, 809, 810, 811, 812, 813, 814, 817, 819, 821, 823, 825, 827, 858, 865, 868, 869, 870, 871, 872, 873, 875, 878, 883, 885, 887, 889, 892, 896, 900, 901, 902, 903, 904, 905, 906, 907, 909, 911, 913, 915, 917, 919, 950, 957, 960, 961, 962, 963, 964, 965, 966, 967, 969, 971, 973, 975, 977, 979, 981, 984, 985, 986, 987, 988, 989, 990, 991, 993, 995, 998, 1000, 1003, 1005, 1036, 1038, 1042, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1054, 1056, 1058, 1060, 1062, 1064, 1066, 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1076, 1078, 1080, 1082, 1084, 1086, 1088, 1126, 1129, 1130, 1131, 1132, 1133, 1134, 1136, 1138, 1142, 1144, 1146, 1148, 1150, 1152, 1155, 1156, 1157, 1158, 1159, 1160, 1161, 1164, 1166, 1168, 1170, 1172, 1174, 1205, 1212, 1215, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1224, 1226, 1228, 1230, 1232, 1234, 1237, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1252, 1254, 1256, 1258, 1260, 1262, 1300, 1303, 1304, 1305, 1306, 1307, 1308, 1309, 1310, 1312, 1314, 1316, 1319, 1321, 1324, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1348, 1352, 1354, 1356, 1358, 1361, 1392, 1399, 1402, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1411, 1413, 1415, 1417, 1420, 1425, 1432, 1441, 1442, 1443, 1444, 1445, 1446, 1447, 1448, 1455, 1460, 1463, 1465, 1467, 1469, 1500, 1507, 1510, 1511, 1512, 1513, 1514, 1515, 1516, 1517, 1519, 1521, 1523, 1526, 1531, 1538, 1547, 1558, 1559, 1561, 1562, 1563, 1564, 1565, 1574, 1584, 1589, 1592, 1594, 1596, 1627, 1634, 1637, 1638, 1639, 1640, 1641, 1642, 1643, 1644, 1647, 1649, 1652, 1657, 1664, 1673, 1684, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1715, 1724, 1731, 1736, 1739, 1741, 1772, 1779, 1782, 1783, 1785, 1786, 1787, 1788, 1789, 1791, 1794, 1802, 1809, 1818, 1829, 1842, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1877, 1888, 1897, 1904, 1909, 1912, 1943, 1945, 1949, 1952, 1953, 1955, 1956, 1957, 1958, 1959, 1964, 1969, 1976, 1985, 1996, 2009, 2024, 2041, 2042, 2043, 2044, 2045, 2046, 2047, 2048, 2063, 2076, 2087, 2096, 2103, 2108, 2140]
Discarding 517 places :
Implicit Place search using SMT only with invariants took 2055 ms to find 517 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1904/6222 places, 3580/8685 transitions.
Discarding 215 places :
Symmetric choice reduction at 0 with 215 rule applications. Total rules 215 place count 1689 transition count 3365
Iterating global reduction 0 with 215 rules applied. Total rules applied 430 place count 1689 transition count 3365
Discarding 215 places :
Symmetric choice reduction at 0 with 215 rule applications. Total rules 645 place count 1474 transition count 3150
Iterating global reduction 0 with 215 rules applied. Total rules applied 860 place count 1474 transition count 3150
Discarding 214 places :
Symmetric choice reduction at 0 with 214 rule applications. Total rules 1074 place count 1260 transition count 2936
Iterating global reduction 0 with 214 rules applied. Total rules applied 1288 place count 1260 transition count 2936
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 1311 place count 1237 transition count 2775
Iterating global reduction 0 with 23 rules applied. Total rules applied 1334 place count 1237 transition count 2775
Applied a total of 1334 rules in 287 ms. Remains 1237 /1904 variables (removed 667) and now considering 2775/3580 (removed 805) transitions.
[2022-05-18 00:18:12] [INFO ] Flow matrix only has 2503 transitions (discarded 272 similar events)
// Phase 1: matrix 2503 rows 1237 cols
[2022-05-18 00:18:12] [INFO ] Computed 60 place invariants in 35 ms
[2022-05-18 00:18:13] [INFO ] Implicit Places using invariants in 909 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 916 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1236/6222 places, 2775/8685 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1235 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1235 transition count 2774
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1234 transition count 2773
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1234 transition count 2773
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1233 transition count 2772
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1233 transition count 2772
Applied a total of 6 rules in 164 ms. Remains 1233 /1236 variables (removed 3) and now considering 2772/2775 (removed 3) transitions.
[2022-05-18 00:18:13] [INFO ] Flow matrix only has 2500 transitions (discarded 272 similar events)
// Phase 1: matrix 2500 rows 1233 cols
[2022-05-18 00:18:13] [INFO ] Computed 59 place invariants in 36 ms
[2022-05-18 00:18:14] [INFO ] Implicit Places using invariants in 1043 ms returned []
[2022-05-18 00:18:14] [INFO ] Flow matrix only has 2500 transitions (discarded 272 similar events)
// Phase 1: matrix 2500 rows 1233 cols
[2022-05-18 00:18:14] [INFO ] Computed 59 place invariants in 26 ms
[2022-05-18 00:18:15] [INFO ] State equation strengthened by 974 read => feed constraints.
[2022-05-18 00:18:26] [INFO ] Implicit Places using invariants and state equation in 11794 ms returned []
Implicit Place search using SMT with State Equation took 12850 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 1233/6222 places, 2772/8685 transitions.
Finished structural reductions, in 3 iterations. Remains : 1233/6222 places, 2772/8685 transitions.
Support contains 50 out of 1233 places after structural reductions.
[2022-05-18 00:18:26] [INFO ] Flatten gal took : 226 ms
[2022-05-18 00:18:26] [INFO ] Flatten gal took : 170 ms
[2022-05-18 00:18:27] [INFO ] Input system was already deterministic with 2772 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 696 ms. (steps per millisecond=14 ) properties (out of 26) seen :7
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) 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 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2022-05-18 00:18:28] [INFO ] Flow matrix only has 2500 transitions (discarded 272 similar events)
// Phase 1: matrix 2500 rows 1233 cols
[2022-05-18 00:18:28] [INFO ] Computed 59 place invariants in 22 ms
[2022-05-18 00:18:28] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2022-05-18 00:18:28] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 9 ms returned sat
[2022-05-18 00:18:31] [INFO ] After 2033ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10 real:8
[2022-05-18 00:18:31] [INFO ] State equation strengthened by 974 read => feed constraints.
[2022-05-18 00:18:32] [INFO ] After 1327ms SMT Verify possible using 974 Read/Feed constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-18 00:18:32] [INFO ] After 4333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-18 00:18:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2022-05-18 00:18:33] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 6 ms returned sat
[2022-05-18 00:18:35] [INFO ] After 2199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2022-05-18 00:18:39] [INFO ] After 3340ms SMT Verify possible using 974 Read/Feed constraints in natural domain returned unsat :1 sat :17
[2022-05-18 00:18:39] [INFO ] Deduced a trap composed of 401 places in 550 ms of which 8 ms to minimize.
[2022-05-18 00:18:40] [INFO ] Deduced a trap composed of 144 places in 585 ms of which 3 ms to minimize.
[2022-05-18 00:18:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1361 ms
[2022-05-18 00:18:41] [INFO ] Deduced a trap composed of 128 places in 531 ms of which 2 ms to minimize.
[2022-05-18 00:18:41] [INFO ] Deduced a trap composed of 237 places in 544 ms of which 2 ms to minimize.
[2022-05-18 00:18:42] [INFO ] Deduced a trap composed of 298 places in 586 ms of which 1 ms to minimize.
[2022-05-18 00:18:43] [INFO ] Deduced a trap composed of 279 places in 572 ms of which 1 ms to minimize.
[2022-05-18 00:18:43] [INFO ] Deduced a trap composed of 252 places in 575 ms of which 1 ms to minimize.
[2022-05-18 00:18:44] [INFO ] Deduced a trap composed of 254 places in 527 ms of which 1 ms to minimize.
[2022-05-18 00:18:45] [INFO ] Deduced a trap composed of 308 places in 528 ms of which 2 ms to minimize.
[2022-05-18 00:18:46] [INFO ] Deduced a trap composed of 267 places in 564 ms of which 1 ms to minimize.
[2022-05-18 00:18:47] [INFO ] Deduced a trap composed of 299 places in 528 ms of which 2 ms to minimize.
[2022-05-18 00:18:47] [INFO ] Deduced a trap composed of 289 places in 550 ms of which 1 ms to minimize.
[2022-05-18 00:18:48] [INFO ] Deduced a trap composed of 213 places in 507 ms of which 1 ms to minimize.
[2022-05-18 00:18:49] [INFO ] Deduced a trap composed of 223 places in 571 ms of which 1 ms to minimize.
[2022-05-18 00:18:49] [INFO ] Deduced a trap composed of 286 places in 570 ms of which 2 ms to minimize.
[2022-05-18 00:18:50] [INFO ] Deduced a trap composed of 291 places in 582 ms of which 1 ms to minimize.
[2022-05-18 00:18:51] [INFO ] Deduced a trap composed of 321 places in 572 ms of which 1 ms to minimize.
[2022-05-18 00:18:51] [INFO ] Deduced a trap composed of 339 places in 568 ms of which 1 ms to minimize.
[2022-05-18 00:18:52] [INFO ] Deduced a trap composed of 216 places in 530 ms of which 1 ms to minimize.
[2022-05-18 00:18:53] [INFO ] Deduced a trap composed of 240 places in 526 ms of which 2 ms to minimize.
[2022-05-18 00:18:53] [INFO ] Deduced a trap composed of 333 places in 582 ms of which 1 ms to minimize.
[2022-05-18 00:18:54] [INFO ] Deduced a trap composed of 228 places in 524 ms of which 1 ms to minimize.
[2022-05-18 00:18:55] [INFO ] Deduced a trap composed of 255 places in 553 ms of which 1 ms to minimize.
[2022-05-18 00:18:55] [INFO ] Deduced a trap composed of 248 places in 623 ms of which 1 ms to minimize.
[2022-05-18 00:18:56] [INFO ] Deduced a trap composed of 267 places in 564 ms of which 1 ms to minimize.
[2022-05-18 00:18:57] [INFO ] Deduced a trap composed of 328 places in 566 ms of which 1 ms to minimize.
[2022-05-18 00:18:57] [INFO ] Deduced a trap composed of 282 places in 585 ms of which 1 ms to minimize.
[2022-05-18 00:18:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 00:18:57] [INFO ] After 25411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Fused 18 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 30 out of 1233 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1233/1233 places, 2772/2772 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1233 transition count 2749
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1210 transition count 2749
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 1210 transition count 2734
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 1195 transition count 2734
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 1189 transition count 2704
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 1189 transition count 2704
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 1188 transition count 2697
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 1188 transition count 2697
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
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 138 place count 1164 transition count 2673
Free-agglomeration rule (complex) applied 125 times.
Iterating global reduction 2 with 125 rules applied. Total rules applied 263 place count 1164 transition count 4018
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 2 with 125 rules applied. Total rules applied 388 place count 1039 transition count 4018
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 393 place count 1039 transition count 4018
Applied a total of 393 rules in 772 ms. Remains 1039 /1233 variables (removed 194) and now considering 4018/2772 (removed -1246) transitions.
Finished structural reductions, in 1 iterations. Remains : 1039/1233 places, 4018/2772 transitions.
Incomplete random walk after 10000 steps, including 238 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 17) seen :3
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-05-18 00:19:00] [INFO ] Flow matrix only has 3639 transitions (discarded 379 similar events)
// Phase 1: matrix 3639 rows 1039 cols
[2022-05-18 00:19:00] [INFO ] Computed 59 place invariants in 44 ms
[2022-05-18 00:19:00] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2022-05-18 00:19:00] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 8 ms returned sat
[2022-05-18 00:19:02] [INFO ] After 2253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-18 00:19:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2022-05-18 00:19:02] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 7 ms returned sat
[2022-05-18 00:19:04] [INFO ] After 1782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-18 00:19:04] [INFO ] State equation strengthened by 2414 read => feed constraints.
[2022-05-18 00:19:07] [INFO ] After 2910ms SMT Verify possible using 2414 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-18 00:19:08] [INFO ] Deduced a trap composed of 89 places in 552 ms of which 0 ms to minimize.
[2022-05-18 00:19:09] [INFO ] Deduced a trap composed of 88 places in 543 ms of which 1 ms to minimize.
[2022-05-18 00:19:09] [INFO ] Deduced a trap composed of 79 places in 590 ms of which 1 ms to minimize.
[2022-05-18 00:19:10] [INFO ] Deduced a trap composed of 86 places in 628 ms of which 1 ms to minimize.
[2022-05-18 00:19:11] [INFO ] Deduced a trap composed of 90 places in 624 ms of which 1 ms to minimize.
[2022-05-18 00:19:12] [INFO ] Deduced a trap composed of 80 places in 631 ms of which 1 ms to minimize.
[2022-05-18 00:19:12] [INFO ] Deduced a trap composed of 90 places in 617 ms of which 1 ms to minimize.
[2022-05-18 00:19:13] [INFO ] Deduced a trap composed of 208 places in 517 ms of which 1 ms to minimize.
[2022-05-18 00:19:14] [INFO ] Deduced a trap composed of 163 places in 567 ms of which 1 ms to minimize.
[2022-05-18 00:19:14] [INFO ] Deduced a trap composed of 208 places in 543 ms of which 1 ms to minimize.
[2022-05-18 00:19:15] [INFO ] Deduced a trap composed of 174 places in 536 ms of which 1 ms to minimize.
[2022-05-18 00:19:16] [INFO ] Deduced a trap composed of 175 places in 487 ms of which 1 ms to minimize.
[2022-05-18 00:19:16] [INFO ] Deduced a trap composed of 189 places in 481 ms of which 1 ms to minimize.
[2022-05-18 00:19:17] [INFO ] Deduced a trap composed of 184 places in 440 ms of which 1 ms to minimize.
[2022-05-18 00:19:18] [INFO ] Deduced a trap composed of 250 places in 487 ms of which 1 ms to minimize.
[2022-05-18 00:19:18] [INFO ] Deduced a trap composed of 194 places in 471 ms of which 1 ms to minimize.
[2022-05-18 00:19:19] [INFO ] Deduced a trap composed of 149 places in 460 ms of which 1 ms to minimize.
[2022-05-18 00:19:20] [INFO ] Deduced a trap composed of 149 places in 463 ms of which 1 ms to minimize.
[2022-05-18 00:19:20] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 12502 ms
[2022-05-18 00:19:24] [INFO ] Deduced a trap composed of 210 places in 560 ms of which 1 ms to minimize.
[2022-05-18 00:19:25] [INFO ] Deduced a trap composed of 115 places in 540 ms of which 0 ms to minimize.
[2022-05-18 00:19:26] [INFO ] Deduced a trap composed of 107 places in 529 ms of which 1 ms to minimize.
[2022-05-18 00:19:26] [INFO ] Deduced a trap composed of 113 places in 550 ms of which 1 ms to minimize.
[2022-05-18 00:19:28] [INFO ] Deduced a trap composed of 115 places in 575 ms of which 1 ms to minimize.
[2022-05-18 00:19:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 00:19:28] [INFO ] After 25567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 18 out of 1039 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1039/1039 places, 4018/4018 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 0 with 2 rules applied. Total rules applied 2 place count 1039 transition count 4016
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1037 transition count 4016
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1037 transition count 4015
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1036 transition count 4015
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 1035 transition count 4014
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 1035 transition count 4014
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 1035 transition count 4012
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 1033 transition count 4012
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 15 place count 1033 transition count 4012
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 17 place count 1031 transition count 4010
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 1031 transition count 4010
Applied a total of 19 rules in 506 ms. Remains 1031 /1039 variables (removed 8) and now considering 4010/4018 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1031/1039 places, 4010/4018 transitions.
Incomplete random walk after 10000 steps, including 239 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 57067 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57067 steps, saw 24072 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 11 properties.
[2022-05-18 00:19:32] [INFO ] Flow matrix only has 3630 transitions (discarded 380 similar events)
// Phase 1: matrix 3630 rows 1031 cols
[2022-05-18 00:19:33] [INFO ] Computed 59 place invariants in 39 ms
[2022-05-18 00:19:33] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2022-05-18 00:19:33] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 8 ms returned sat
[2022-05-18 00:19:35] [INFO ] After 2205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-18 00:19:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 21 ms returned sat
[2022-05-18 00:19:35] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 7 ms returned sat
[2022-05-18 00:19:37] [INFO ] After 1918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-18 00:19:37] [INFO ] State equation strengthened by 2414 read => feed constraints.
[2022-05-18 00:19:40] [INFO ] After 2703ms SMT Verify possible using 2414 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-18 00:19:41] [INFO ] Deduced a trap composed of 81 places in 559 ms of which 1 ms to minimize.
[2022-05-18 00:19:41] [INFO ] Deduced a trap composed of 185 places in 457 ms of which 1 ms to minimize.
[2022-05-18 00:19:42] [INFO ] Deduced a trap composed of 183 places in 526 ms of which 1 ms to minimize.
[2022-05-18 00:19:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2165 ms
[2022-05-18 00:19:43] [INFO ] Deduced a trap composed of 157 places in 504 ms of which 1 ms to minimize.
[2022-05-18 00:19:44] [INFO ] Deduced a trap composed of 167 places in 510 ms of which 1 ms to minimize.
[2022-05-18 00:19:44] [INFO ] Deduced a trap composed of 164 places in 481 ms of which 0 ms to minimize.
[2022-05-18 00:19:45] [INFO ] Deduced a trap composed of 173 places in 548 ms of which 4 ms to minimize.
[2022-05-18 00:19:46] [INFO ] Deduced a trap composed of 180 places in 438 ms of which 1 ms to minimize.
[2022-05-18 00:19:46] [INFO ] Deduced a trap composed of 178 places in 567 ms of which 1 ms to minimize.
[2022-05-18 00:19:47] [INFO ] Deduced a trap composed of 82 places in 621 ms of which 1 ms to minimize.
[2022-05-18 00:19:48] [INFO ] Deduced a trap composed of 82 places in 639 ms of which 1 ms to minimize.
[2022-05-18 00:19:49] [INFO ] Deduced a trap composed of 184 places in 527 ms of which 1 ms to minimize.
[2022-05-18 00:19:50] [INFO ] Deduced a trap composed of 186 places in 544 ms of which 1 ms to minimize.
[2022-05-18 00:19:51] [INFO ] Deduced a trap composed of 187 places in 453 ms of which 1 ms to minimize.
[2022-05-18 00:19:52] [INFO ] Deduced a trap composed of 173 places in 495 ms of which 1 ms to minimize.
[2022-05-18 00:19:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 9558 ms
[2022-05-18 00:19:53] [INFO ] Deduced a trap composed of 170 places in 453 ms of which 1 ms to minimize.
[2022-05-18 00:19:53] [INFO ] Deduced a trap composed of 206 places in 497 ms of which 1 ms to minimize.
[2022-05-18 00:19:54] [INFO ] Deduced a trap composed of 176 places in 457 ms of which 2 ms to minimize.
[2022-05-18 00:19:55] [INFO ] Deduced a trap composed of 176 places in 456 ms of which 2 ms to minimize.
[2022-05-18 00:19:55] [INFO ] Deduced a trap composed of 175 places in 450 ms of which 1 ms to minimize.
[2022-05-18 00:19:56] [INFO ] Deduced a trap composed of 192 places in 509 ms of which 1 ms to minimize.
[2022-05-18 00:19:57] [INFO ] Deduced a trap composed of 192 places in 447 ms of which 1 ms to minimize.
[2022-05-18 00:19:58] [INFO ] Deduced a trap composed of 167 places in 502 ms of which 1 ms to minimize.
[2022-05-18 00:19:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6163 ms
[2022-05-18 00:20:00] [INFO ] Deduced a trap composed of 263 places in 502 ms of which 1 ms to minimize.
[2022-05-18 00:20:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 00:20:00] [INFO ] After 25139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 18 out of 1031 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1031/1031 places, 4010/4010 transitions.
Applied a total of 0 rules in 105 ms. Remains 1031 /1031 variables (removed 0) and now considering 4010/4010 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1031/1031 places, 4010/4010 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1031/1031 places, 4010/4010 transitions.
Applied a total of 0 rules in 99 ms. Remains 1031 /1031 variables (removed 0) and now considering 4010/4010 (removed 0) transitions.
[2022-05-18 00:20:00] [INFO ] Flow matrix only has 3630 transitions (discarded 380 similar events)
// Phase 1: matrix 3630 rows 1031 cols
[2022-05-18 00:20:00] [INFO ] Computed 59 place invariants in 45 ms
[2022-05-18 00:20:01] [INFO ] Implicit Places using invariants in 1228 ms returned [413, 510, 528, 562, 579, 668, 770, 865]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1235 ms to find 8 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1023/1031 places, 4010/4010 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1021 transition count 4008
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1021 transition count 4008
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1019 transition count 4006
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1019 transition count 4006
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 1019 transition count 4005
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 1018 transition count 4005
Applied a total of 10 rules in 267 ms. Remains 1018 /1023 variables (removed 5) and now considering 4005/4010 (removed 5) transitions.
[2022-05-18 00:20:02] [INFO ] Flow matrix only has 3625 transitions (discarded 380 similar events)
// Phase 1: matrix 3625 rows 1018 cols
[2022-05-18 00:20:02] [INFO ] Computed 51 place invariants in 27 ms
[2022-05-18 00:20:03] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2022-05-18 00:20:03] [INFO ] Flow matrix only has 3625 transitions (discarded 380 similar events)
// Phase 1: matrix 3625 rows 1018 cols
[2022-05-18 00:20:03] [INFO ] Computed 51 place invariants in 30 ms
[2022-05-18 00:20:04] [INFO ] State equation strengthened by 2414 read => feed constraints.
[2022-05-18 00:20:23] [INFO ] Implicit Places using invariants and state equation in 20491 ms returned []
Implicit Place search using SMT with State Equation took 21669 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1018/1031 places, 4005/4010 transitions.
Finished structural reductions, in 2 iterations. Remains : 1018/1031 places, 4005/4010 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 401 stabilizing places and 1139 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1233/1233 places, 2772/2772 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 1233 transition count 2745
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1206 transition count 2745
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 54 place count 1206 transition count 2727
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 90 place count 1188 transition count 2727
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 102 place count 1176 transition count 2673
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 1176 transition count 2673
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 114 place count 1176 transition count 2672
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 116 place count 1175 transition count 2672
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 1170 transition count 2637
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 1170 transition count 2637
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 176 place count 1145 transition count 2612
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 180 place count 1141 transition count 2608
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 1141 transition count 2608
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 188 place count 1137 transition count 2580
Iterating global reduction 2 with 4 rules applied. Total rules applied 192 place count 1137 transition count 2580
Applied a total of 192 rules in 357 ms. Remains 1137 /1233 variables (removed 96) and now considering 2580/2772 (removed 192) transitions.
[2022-05-18 00:20:24] [INFO ] Flow matrix only has 2308 transitions (discarded 272 similar events)
// Phase 1: matrix 2308 rows 1137 cols
[2022-05-18 00:20:24] [INFO ] Computed 59 place invariants in 31 ms
[2022-05-18 00:20:25] [INFO ] Implicit Places using invariants in 954 ms returned [264, 349, 460, 497, 561, 569, 578, 614, 632, 735, 850, 957]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 956 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1125/1233 places, 2580/2772 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1121 transition count 2576
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1121 transition count 2576
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 1117 transition count 2572
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 1117 transition count 2572
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 1113 transition count 2544
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 1113 transition count 2544
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1109 transition count 2540
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1105 transition count 2536
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1105 transition count 2536
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 1101 transition count 2508
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 1101 transition count 2508
Applied a total of 48 rules in 287 ms. Remains 1101 /1125 variables (removed 24) and now considering 2508/2580 (removed 72) transitions.
[2022-05-18 00:20:25] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1101 cols
[2022-05-18 00:20:25] [INFO ] Computed 47 place invariants in 25 ms
[2022-05-18 00:20:26] [INFO ] Implicit Places using invariants in 857 ms returned []
[2022-05-18 00:20:26] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1101 cols
[2022-05-18 00:20:26] [INFO ] Computed 47 place invariants in 20 ms
[2022-05-18 00:20:27] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:20:34] [INFO ] Implicit Places using invariants and state equation in 8322 ms returned []
Implicit Place search using SMT with State Equation took 9180 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1101/1233 places, 2508/2772 transitions.
Finished structural reductions, in 2 iterations. Remains : 1101/1233 places, 2508/2772 transitions.
Stuttering acceptance computed with spot in 364 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s483 1) (GEQ s624 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-00 finished in 11297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(F(p2)&&p1))))'
Support contains 4 out of 1233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1233/1233 places, 2772/2772 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1219 transition count 2716
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1219 transition count 2716
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1212 transition count 2691
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1212 transition count 2691
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 1208 transition count 2663
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 1208 transition count 2663
Applied a total of 50 rules in 150 ms. Remains 1208 /1233 variables (removed 25) and now considering 2663/2772 (removed 109) transitions.
[2022-05-18 00:20:35] [INFO ] Flow matrix only has 2391 transitions (discarded 272 similar events)
// Phase 1: matrix 2391 rows 1208 cols
[2022-05-18 00:20:35] [INFO ] Computed 59 place invariants in 31 ms
[2022-05-18 00:20:36] [INFO ] Implicit Places using invariants in 996 ms returned [297, 500, 539, 606, 615, 624, 662, 681, 786, 904, 1013]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 999 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1197/1233 places, 2663/2772 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1190 transition count 2656
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1190 transition count 2656
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1183 transition count 2649
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1183 transition count 2649
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1176 transition count 2642
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1176 transition count 2642
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 1169 transition count 2593
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 1169 transition count 2593
Applied a total of 56 rules in 161 ms. Remains 1169 /1197 variables (removed 28) and now considering 2593/2663 (removed 70) transitions.
[2022-05-18 00:20:36] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:20:36] [INFO ] Computed 48 place invariants in 30 ms
[2022-05-18 00:20:37] [INFO ] Implicit Places using invariants in 901 ms returned []
[2022-05-18 00:20:37] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:20:37] [INFO ] Computed 48 place invariants in 19 ms
[2022-05-18 00:20:38] [INFO ] State equation strengthened by 848 read => feed constraints.
[2022-05-18 00:20:47] [INFO ] Implicit Places using invariants and state equation in 10342 ms returned [1152]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11245 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1168/1233 places, 2593/2772 transitions.
Applied a total of 0 rules in 32 ms. Remains 1168 /1168 variables (removed 0) and now considering 2593/2593 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1168/1233 places, 2593/2772 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(OR (LT s390 1) (LT s439 1)), p0:(AND (GEQ s287 1) (GEQ s1118 1)), p1:(AND (GEQ s390 1) (GEQ s439 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-01 finished in 12790 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0) U p0)))'
Support contains 2 out of 1233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1233/1233 places, 2772/2772 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 1233 transition count 2745
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1206 transition count 2745
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 54 place count 1206 transition count 2727
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 90 place count 1188 transition count 2727
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 101 place count 1177 transition count 2680
Iterating global reduction 2 with 11 rules applied. Total rules applied 112 place count 1177 transition count 2680
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 112 place count 1177 transition count 2679
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 114 place count 1176 transition count 2679
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 1171 transition count 2644
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 1171 transition count 2644
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 174 place count 1146 transition count 2619
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 178 place count 1142 transition count 2615
Iterating global reduction 2 with 4 rules applied. Total rules applied 182 place count 1142 transition count 2615
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 186 place count 1138 transition count 2587
Iterating global reduction 2 with 4 rules applied. Total rules applied 190 place count 1138 transition count 2587
Applied a total of 190 rules in 300 ms. Remains 1138 /1233 variables (removed 95) and now considering 2587/2772 (removed 185) transitions.
[2022-05-18 00:20:48] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1138 cols
[2022-05-18 00:20:48] [INFO ] Computed 59 place invariants in 38 ms
[2022-05-18 00:20:49] [INFO ] Implicit Places using invariants in 912 ms returned [264, 349, 460, 497, 562, 570, 579, 615, 633, 736, 851, 958]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 914 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1126/1233 places, 2587/2772 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1122 transition count 2583
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1122 transition count 2583
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 1118 transition count 2579
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 1118 transition count 2579
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 1114 transition count 2551
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 1114 transition count 2551
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1110 transition count 2547
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1106 transition count 2543
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1106 transition count 2543
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 1102 transition count 2515
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 1102 transition count 2515
Applied a total of 48 rules in 286 ms. Remains 1102 /1126 variables (removed 24) and now considering 2515/2587 (removed 72) transitions.
[2022-05-18 00:20:49] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1102 cols
[2022-05-18 00:20:49] [INFO ] Computed 47 place invariants in 23 ms
[2022-05-18 00:20:50] [INFO ] Implicit Places using invariants in 931 ms returned []
[2022-05-18 00:20:50] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1102 cols
[2022-05-18 00:20:50] [INFO ] Computed 47 place invariants in 19 ms
[2022-05-18 00:20:51] [INFO ] State equation strengthened by 836 read => feed constraints.
[2022-05-18 00:20:59] [INFO ] Implicit Places using invariants and state equation in 8794 ms returned []
Implicit Place search using SMT with State Equation took 9728 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1102/1233 places, 2515/2772 transitions.
Finished structural reductions, in 2 iterations. Remains : 1102/1233 places, 2515/2772 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s525 1) (GEQ s1083 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-02 finished in 11286 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (!X((p1 U p2))||F(G(p1))))))'
Support contains 5 out of 1233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1233/1233 places, 2772/2772 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1219 transition count 2716
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1219 transition count 2716
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1212 transition count 2685
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1212 transition count 2685
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 1209 transition count 2664
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 1209 transition count 2664
Applied a total of 48 rules in 140 ms. Remains 1209 /1233 variables (removed 24) and now considering 2664/2772 (removed 108) transitions.
[2022-05-18 00:20:59] [INFO ] Flow matrix only has 2392 transitions (discarded 272 similar events)
// Phase 1: matrix 2392 rows 1209 cols
[2022-05-18 00:20:59] [INFO ] Computed 59 place invariants in 30 ms
[2022-05-18 00:21:00] [INFO ] Implicit Places using invariants in 1056 ms returned [385, 499, 538, 605, 614, 623, 661, 680, 785, 903]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1058 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1199/1233 places, 2664/2772 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1193 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1193 transition count 2658
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1187 transition count 2652
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1187 transition count 2652
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1181 transition count 2646
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1181 transition count 2646
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 1175 transition count 2604
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 1175 transition count 2604
Applied a total of 48 rules in 180 ms. Remains 1175 /1199 variables (removed 24) and now considering 2604/2664 (removed 60) transitions.
[2022-05-18 00:21:00] [INFO ] Flow matrix only has 2332 transitions (discarded 272 similar events)
// Phase 1: matrix 2332 rows 1175 cols
[2022-05-18 00:21:00] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-18 00:21:01] [INFO ] Implicit Places using invariants in 905 ms returned []
[2022-05-18 00:21:01] [INFO ] Flow matrix only has 2332 transitions (discarded 272 similar events)
// Phase 1: matrix 2332 rows 1175 cols
[2022-05-18 00:21:01] [INFO ] Computed 49 place invariants in 22 ms
[2022-05-18 00:21:02] [INFO ] State equation strengthened by 854 read => feed constraints.
[2022-05-18 00:21:09] [INFO ] Implicit Places using invariants and state equation in 7453 ms returned []
Implicit Place search using SMT with State Equation took 8360 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1175/1233 places, 2604/2772 transitions.
Finished structural reductions, in 2 iterations. Remains : 1175/1233 places, 2604/2772 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s374 1) (GEQ s1133 1)), p0:(GEQ s305 1), p2:(AND (GEQ s988 1) (GEQ s1115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1143 ms.
Product exploration explored 100000 steps with 33333 reset in 1099 ms.
Computed a total of 343 stabilizing places and 971 stable transitions
Computed a total of 343 stabilizing places and 971 stable transitions
Detected a total of 343/1175 stabilizing places and 971/2604 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0) (NOT p2))
Knowledge based reduction with 8 factoid took 283 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-04 finished in 12547 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(p0)&&X(p1)) U G(X(p2))))'
Support contains 5 out of 1233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1233/1233 places, 2772/2772 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1220 transition count 2723
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1220 transition count 2723
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 1213 transition count 2692
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 1213 transition count 2692
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 1210 transition count 2671
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 1210 transition count 2671
Applied a total of 46 rules in 142 ms. Remains 1210 /1233 variables (removed 23) and now considering 2671/2772 (removed 101) transitions.
[2022-05-18 00:21:12] [INFO ] Flow matrix only has 2399 transitions (discarded 272 similar events)
// Phase 1: matrix 2399 rows 1210 cols
[2022-05-18 00:21:12] [INFO ] Computed 59 place invariants in 27 ms
[2022-05-18 00:21:13] [INFO ] Implicit Places using invariants in 1081 ms returned [295, 382, 537, 605, 614, 623, 661, 680, 906, 1015]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1084 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1200/1233 places, 2671/2772 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1194 transition count 2665
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1194 transition count 2665
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1188 transition count 2659
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1188 transition count 2659
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1182 transition count 2653
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1182 transition count 2653
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 1176 transition count 2611
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 1176 transition count 2611
Applied a total of 48 rules in 167 ms. Remains 1176 /1200 variables (removed 24) and now considering 2611/2671 (removed 60) transitions.
[2022-05-18 00:21:13] [INFO ] Flow matrix only has 2339 transitions (discarded 272 similar events)
// Phase 1: matrix 2339 rows 1176 cols
[2022-05-18 00:21:13] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 00:21:14] [INFO ] Implicit Places using invariants in 894 ms returned []
[2022-05-18 00:21:14] [INFO ] Flow matrix only has 2339 transitions (discarded 272 similar events)
// Phase 1: matrix 2339 rows 1176 cols
[2022-05-18 00:21:14] [INFO ] Computed 49 place invariants in 27 ms
[2022-05-18 00:21:14] [INFO ] State equation strengthened by 860 read => feed constraints.
[2022-05-18 00:21:21] [INFO ] Implicit Places using invariants and state equation in 7609 ms returned []
Implicit Place search using SMT with State Equation took 8504 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1176/1233 places, 2611/2772 transitions.
Finished structural reductions, in 2 iterations. Remains : 1176/1233 places, 2611/2772 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p2) p0 p1), (NOT p2), (AND (NOT p2) p1), true, (OR (AND p0 (NOT p1)) (AND p0 p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(GEQ s782 1), p1:(AND (GEQ s494 1) (GEQ s519 1)), p2:(AND (GEQ s528 1) (GEQ s1139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33361 reset in 1133 ms.
Product exploration explored 100000 steps with 33378 reset in 1182 ms.
Computed a total of 344 stabilizing places and 978 stable transitions
Computed a total of 344 stabilizing places and 978 stable transitions
Detected a total of 344/1176 stabilizing places and 978/2611 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 27 factoid took 2168 ms. Reduced automaton from 7 states, 19 edges and 3 AP to 6 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (AND p1 (NOT p2) (NOT p0)), true, (OR (AND p0 (NOT p1)) (AND p0 p2)), (NOT p2), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 137 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-05-18 00:21:27] [INFO ] Flow matrix only has 2339 transitions (discarded 272 similar events)
// Phase 1: matrix 2339 rows 1176 cols
[2022-05-18 00:21:27] [INFO ] Computed 49 place invariants in 18 ms
[2022-05-18 00:21:28] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-18 00:21:28] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 11 ms returned sat
[2022-05-18 00:21:28] [INFO ] After 690ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:6
[2022-05-18 00:21:28] [INFO ] State equation strengthened by 860 read => feed constraints.
[2022-05-18 00:21:29] [INFO ] After 129ms SMT Verify possible using 860 Read/Feed constraints in real domain returned unsat :1 sat :0 real:7
[2022-05-18 00:21:29] [INFO ] After 1154ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2022-05-18 00:21:29] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:21:29] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 11 ms returned sat
[2022-05-18 00:21:30] [INFO ] After 900ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2022-05-18 00:21:30] [INFO ] After 557ms SMT Verify possible using 860 Read/Feed constraints in natural domain returned unsat :4 sat :4
[2022-05-18 00:21:31] [INFO ] Deduced a trap composed of 320 places in 487 ms of which 1 ms to minimize.
[2022-05-18 00:21:31] [INFO ] Deduced a trap composed of 281 places in 434 ms of which 1 ms to minimize.
[2022-05-18 00:21:32] [INFO ] Deduced a trap composed of 264 places in 465 ms of which 1 ms to minimize.
[2022-05-18 00:21:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1698 ms
[2022-05-18 00:21:33] [INFO ] After 2752ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 315 ms.
[2022-05-18 00:21:33] [INFO ] After 4328ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 1176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1176/1176 places, 2611/2611 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 1176 transition count 2585
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1150 transition count 2585
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 52 place count 1150 transition count 2571
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 1136 transition count 2571
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 120 place count 1116 transition count 2551
Free-agglomeration rule (complex) applied 135 times.
Iterating global reduction 2 with 135 rules applied. Total rules applied 255 place count 1116 transition count 4006
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 2 with 135 rules applied. Total rules applied 390 place count 981 transition count 4006
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 391 place count 981 transition count 4006
Applied a total of 391 rules in 367 ms. Remains 981 /1176 variables (removed 195) and now considering 4006/2611 (removed -1395) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/1176 places, 4006/2611 transitions.
Incomplete random walk after 10000 steps, including 240 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 64298 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64298 steps, saw 27069 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-18 00:21:37] [INFO ] Flow matrix only has 3608 transitions (discarded 398 similar events)
// Phase 1: matrix 3608 rows 981 cols
[2022-05-18 00:21:37] [INFO ] Computed 49 place invariants in 27 ms
[2022-05-18 00:21:37] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-18 00:21:37] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 12 ms returned sat
[2022-05-18 00:21:38] [INFO ] After 936ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-05-18 00:21:38] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:21:38] [INFO ] After 352ms SMT Verify possible using 2450 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-18 00:21:38] [INFO ] After 1525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-18 00:21:39] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 00:21:39] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 17 ms returned sat
[2022-05-18 00:21:40] [INFO ] After 1094ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-18 00:21:40] [INFO ] After 602ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-18 00:21:41] [INFO ] Deduced a trap composed of 179 places in 419 ms of which 1 ms to minimize.
[2022-05-18 00:21:41] [INFO ] Deduced a trap composed of 200 places in 408 ms of which 1 ms to minimize.
[2022-05-18 00:21:42] [INFO ] Deduced a trap composed of 124 places in 437 ms of which 1 ms to minimize.
[2022-05-18 00:21:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1748 ms
[2022-05-18 00:21:43] [INFO ] After 2875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 358 ms.
[2022-05-18 00:21:43] [INFO ] After 4575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 981 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4006/4006 transitions.
Applied a total of 0 rules in 113 ms. Remains 981 /981 variables (removed 0) and now considering 4006/4006 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4006/4006 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4006/4006 transitions.
Applied a total of 0 rules in 96 ms. Remains 981 /981 variables (removed 0) and now considering 4006/4006 (removed 0) transitions.
[2022-05-18 00:21:43] [INFO ] Flow matrix only has 3608 transitions (discarded 398 similar events)
// Phase 1: matrix 3608 rows 981 cols
[2022-05-18 00:21:43] [INFO ] Computed 49 place invariants in 29 ms
[2022-05-18 00:21:44] [INFO ] Implicit Places using invariants in 1091 ms returned []
[2022-05-18 00:21:44] [INFO ] Flow matrix only has 3608 transitions (discarded 398 similar events)
// Phase 1: matrix 3608 rows 981 cols
[2022-05-18 00:21:44] [INFO ] Computed 49 place invariants in 22 ms
[2022-05-18 00:21:45] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:22:03] [INFO ] Implicit Places using invariants and state equation in 19130 ms returned []
Implicit Place search using SMT with State Equation took 20223 ms to find 0 implicit places.
[2022-05-18 00:22:04] [INFO ] Redundant transitions in 300 ms returned []
[2022-05-18 00:22:04] [INFO ] Flow matrix only has 3608 transitions (discarded 398 similar events)
// Phase 1: matrix 3608 rows 981 cols
[2022-05-18 00:22:04] [INFO ] Computed 49 place invariants in 21 ms
[2022-05-18 00:22:05] [INFO ] Dead Transitions using invariants and state equation in 1387 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 4586 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 t1235.t1429 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 281 places :
Symmetric choice reduction at 14 with 281 rule applications. Total rules 1949 place count 93 transition count 359
Iterating global reduction 14 with 281 rules applied. Total rules applied 2230 place count 93 transition count 359
Ensure Unique test removed 237 transitions
Reduce isomorphic transitions removed 237 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 14 with 240 rules applied. Total rules applied 2470 place count 93 transition count 119
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 2473 place count 90 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 2473 place count 90 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 2475 place count 89 transition count 118
Discarding 7 places :
Symmetric choice reduction at 16 with 7 rule applications. Total rules 2482 place count 82 transition count 104
Iterating global reduction 16 with 7 rules applied. Total rules applied 2489 place count 82 transition count 104
Discarding 7 places :
Symmetric choice reduction at 16 with 7 rule applications. Total rules 2496 place count 75 transition count 97
Iterating global reduction 16 with 7 rules applied. Total rules applied 2503 place count 75 transition count 97
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 16 with 12 rules applied. Total rules applied 2515 place count 69 transition count 91
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 2517 place count 67 transition count 87
Iterating global reduction 16 with 2 rules applied. Total rules applied 2519 place count 67 transition count 87
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 16 with 6 rules applied. Total rules applied 2525 place count 67 transition count 81
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2531 place count 61 transition count 81
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 17 with 20 rules applied. Total rules applied 2551 place count 61 transition count 81
Applied a total of 2551 rules in 588 ms. Remains 61 /981 variables (removed 920) and now considering 81/4006 (removed 3925) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 81 rows 61 cols
[2022-05-18 00:22:06] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-18 00:22:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-18 00:22:06] [INFO ] [Real]Absence check using 2 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 00:22:06] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-18 00:22:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-18 00:22:06] [INFO ] [Nat]Absence check using 2 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-18 00:22:06] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-18 00:22:06] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-18 00:22:06] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-18 00:22:06] [INFO ] Flatten gal took : 8 ms
[2022-05-18 00:22:06] [INFO ] Flatten gal took : 7 ms
[2022-05-18 00:22:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17341256219231959260.gal : 29 ms
[2022-05-18 00:22:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13583386640438991136.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14365873426910344914;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17341256219231959260.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13583386640438991136.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality13583386640438991136.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 19
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :19 after 21
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :21 after 28
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :28 after 89
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :89 after 285
Reachability property apf13 is true.
Reachability property apf9 is true.
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,962,0.051462,4828,2,1085,12,4778,6,0,305,3027,0
Total reachable state count : 962

Verifying 4 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,7,0.053357,5072,2,70,12,4778,7,0,317,3027,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,7,0.05671,5072,2,70,12,4778,8,0,323,3027,0
Reachability property apf9 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf9,1,0.056928,5072,2,62,12,4778,9,0,323,3027,0
Reachability property apf13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf13,7,0.058913,5072,2,70,12,4778,10,0,327,3027,0
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p1 (NOT p2) p0))), (G (NOT (AND p1 p2 (NOT p0)))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p2) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (F (AND (NOT p1) (NOT p2) p0)), (F (OR (AND (NOT p1) p0) (AND p2 p0)))]
Knowledge based reduction with 31 factoid took 1516 ms. Reduced automaton from 6 states, 18 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (AND p1 (NOT p2)), (OR (NOT p2) (NOT p0)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (AND p1 (NOT p2)), (OR (NOT p2) (NOT p0)), (AND p0 (NOT p2))]
[2022-05-18 00:22:08] [INFO ] Flow matrix only has 2339 transitions (discarded 272 similar events)
// Phase 1: matrix 2339 rows 1176 cols
[2022-05-18 00:22:08] [INFO ] Computed 49 place invariants in 18 ms
[2022-05-18 00:22:10] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2022-05-18 00:22:10] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 24 ms returned sat
[2022-05-18 00:22:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:22:12] [INFO ] [Real]Absence check using state equation in 2114 ms returned sat
[2022-05-18 00:22:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:22:14] [INFO ] [Nat]Absence check using 31 positive place invariants in 71 ms returned sat
[2022-05-18 00:22:14] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 18 ms returned sat
[2022-05-18 00:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:22:16] [INFO ] [Nat]Absence check using state equation in 1542 ms returned sat
[2022-05-18 00:22:16] [INFO ] State equation strengthened by 860 read => feed constraints.
[2022-05-18 00:22:16] [INFO ] [Nat]Added 860 Read/Feed constraints in 158 ms returned sat
[2022-05-18 00:22:17] [INFO ] Deduced a trap composed of 243 places in 433 ms of which 1 ms to minimize.
[2022-05-18 00:22:17] [INFO ] Deduced a trap composed of 254 places in 418 ms of which 1 ms to minimize.
[2022-05-18 00:22:18] [INFO ] Deduced a trap composed of 297 places in 424 ms of which 1 ms to minimize.
[2022-05-18 00:22:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1710 ms
[2022-05-18 00:22:18] [INFO ] Computed and/alt/rep : 1954/3311/1954 causal constraints (skipped 368 transitions) in 177 ms.
[2022-05-18 00:22:19] [INFO ] Added : 42 causal constraints over 9 iterations in 1369 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 1176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1176/1176 places, 2611/2611 transitions.
Applied a total of 0 rules in 47 ms. Remains 1176 /1176 variables (removed 0) and now considering 2611/2611 (removed 0) transitions.
[2022-05-18 00:22:19] [INFO ] Flow matrix only has 2339 transitions (discarded 272 similar events)
// Phase 1: matrix 2339 rows 1176 cols
[2022-05-18 00:22:19] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-18 00:22:20] [INFO ] Implicit Places using invariants in 921 ms returned []
[2022-05-18 00:22:20] [INFO ] Flow matrix only has 2339 transitions (discarded 272 similar events)
// Phase 1: matrix 2339 rows 1176 cols
[2022-05-18 00:22:20] [INFO ] Computed 49 place invariants in 18 ms
[2022-05-18 00:22:21] [INFO ] State equation strengthened by 860 read => feed constraints.
[2022-05-18 00:22:28] [INFO ] Implicit Places using invariants and state equation in 8240 ms returned []
Implicit Place search using SMT with State Equation took 9163 ms to find 0 implicit places.
[2022-05-18 00:22:28] [INFO ] Flow matrix only has 2339 transitions (discarded 272 similar events)
// Phase 1: matrix 2339 rows 1176 cols
[2022-05-18 00:22:28] [INFO ] Computed 49 place invariants in 22 ms
[2022-05-18 00:22:29] [INFO ] Dead Transitions using invariants and state equation in 993 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1176/1176 places, 2611/2611 transitions.
Computed a total of 344 stabilizing places and 978 stable transitions
Computed a total of 344 stabilizing places and 978 stable transitions
Detected a total of 344/1176 stabilizing places and 978/2611 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 744 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (AND p1 (NOT p2)), (OR (NOT p2) (NOT p0)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 137 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-18 00:22:31] [INFO ] Flow matrix only has 2339 transitions (discarded 272 similar events)
// Phase 1: matrix 2339 rows 1176 cols
[2022-05-18 00:22:31] [INFO ] Computed 49 place invariants in 18 ms
[2022-05-18 00:22:31] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-18 00:22:31] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 11 ms returned sat
[2022-05-18 00:22:32] [INFO ] After 771ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:1
[2022-05-18 00:22:32] [INFO ] State equation strengthened by 860 read => feed constraints.
[2022-05-18 00:22:32] [INFO ] After 196ms SMT Verify possible using 860 Read/Feed constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-18 00:22:32] [INFO ] After 1238ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-18 00:22:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-18 00:22:32] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 11 ms returned sat
[2022-05-18 00:22:33] [INFO ] After 800ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-18 00:22:34] [INFO ] After 425ms SMT Verify possible using 860 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-05-18 00:22:34] [INFO ] Deduced a trap composed of 217 places in 433 ms of which 1 ms to minimize.
[2022-05-18 00:22:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 607 ms
[2022-05-18 00:22:35] [INFO ] Deduced a trap composed of 252 places in 476 ms of which 1 ms to minimize.
[2022-05-18 00:22:36] [INFO ] Deduced a trap composed of 236 places in 502 ms of which 1 ms to minimize.
[2022-05-18 00:22:36] [INFO ] Deduced a trap composed of 276 places in 497 ms of which 1 ms to minimize.
[2022-05-18 00:22:37] [INFO ] Deduced a trap composed of 265 places in 512 ms of which 2 ms to minimize.
[2022-05-18 00:22:37] [INFO ] Deduced a trap composed of 103 places in 481 ms of which 1 ms to minimize.
[2022-05-18 00:22:38] [INFO ] Deduced a trap composed of 262 places in 480 ms of which 1 ms to minimize.
[2022-05-18 00:22:39] [INFO ] Deduced a trap composed of 99 places in 483 ms of which 1 ms to minimize.
[2022-05-18 00:22:39] [INFO ] Deduced a trap composed of 110 places in 493 ms of which 1 ms to minimize.
[2022-05-18 00:22:40] [INFO ] Deduced a trap composed of 293 places in 490 ms of which 1 ms to minimize.
[2022-05-18 00:22:41] [INFO ] Deduced a trap composed of 135 places in 494 ms of which 1 ms to minimize.
[2022-05-18 00:22:41] [INFO ] Deduced a trap composed of 287 places in 469 ms of which 1 ms to minimize.
[2022-05-18 00:22:42] [INFO ] Deduced a trap composed of 93 places in 473 ms of which 1 ms to minimize.
[2022-05-18 00:22:42] [INFO ] Deduced a trap composed of 88 places in 461 ms of which 1 ms to minimize.
[2022-05-18 00:22:43] [INFO ] Deduced a trap composed of 95 places in 473 ms of which 1 ms to minimize.
[2022-05-18 00:22:43] [INFO ] Deduced a trap composed of 233 places in 463 ms of which 0 ms to minimize.
[2022-05-18 00:22:44] [INFO ] Deduced a trap composed of 95 places in 461 ms of which 1 ms to minimize.
[2022-05-18 00:22:44] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9732 ms
[2022-05-18 00:22:44] [INFO ] After 11056ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 769 ms.
[2022-05-18 00:22:45] [INFO ] After 12866ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 1176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1176/1176 places, 2611/2611 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 1176 transition count 2585
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1150 transition count 2585
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 52 place count 1150 transition count 2571
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 1136 transition count 2571
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 120 place count 1116 transition count 2551
Free-agglomeration rule (complex) applied 135 times.
Iterating global reduction 2 with 135 rules applied. Total rules applied 255 place count 1116 transition count 4006
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 2 with 135 rules applied. Total rules applied 390 place count 981 transition count 4006
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 391 place count 981 transition count 4006
Applied a total of 391 rules in 373 ms. Remains 981 /1176 variables (removed 195) and now considering 4006/2611 (removed -1395) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/1176 places, 4006/2611 transitions.
Incomplete random walk after 10000 steps, including 240 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:22:46] [INFO ] Flow matrix only has 3608 transitions (discarded 398 similar events)
// Phase 1: matrix 3608 rows 981 cols
[2022-05-18 00:22:46] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-18 00:22:46] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-18 00:22:46] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 9 ms returned sat
[2022-05-18 00:22:47] [INFO ] After 935ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-18 00:22:47] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:22:47] [INFO ] After 337ms SMT Verify possible using 2450 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:22:47] [INFO ] After 1482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:22:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-05-18 00:22:47] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 19 ms returned sat
[2022-05-18 00:22:48] [INFO ] After 965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:22:49] [INFO ] After 402ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:22:49] [INFO ] Deduced a trap composed of 179 places in 421 ms of which 1 ms to minimize.
[2022-05-18 00:22:50] [INFO ] Deduced a trap composed of 200 places in 422 ms of which 1 ms to minimize.
[2022-05-18 00:22:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1256 ms
[2022-05-18 00:22:50] [INFO ] After 1879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 191 ms.
[2022-05-18 00:22:50] [INFO ] After 3225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 981 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4006/4006 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 981 transition count 4005
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 980 transition count 4005
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 979 transition count 4004
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 979 transition count 4004
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 979 transition count 4004
Applied a total of 5 rules in 250 ms. Remains 979 /981 variables (removed 2) and now considering 4004/4006 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 979/981 places, 4004/4006 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 68791 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68791 steps, saw 28910 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:22:54] [INFO ] Flow matrix only has 3606 transitions (discarded 398 similar events)
// Phase 1: matrix 3606 rows 979 cols
[2022-05-18 00:22:54] [INFO ] Computed 49 place invariants in 22 ms
[2022-05-18 00:22:54] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-18 00:22:54] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 00:22:55] [INFO ] After 1071ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-18 00:22:55] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:22:56] [INFO ] After 323ms SMT Verify possible using 2450 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:22:56] [INFO ] After 1598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:22:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-18 00:22:56] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-18 00:22:57] [INFO ] After 1092ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:22:57] [INFO ] After 487ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:22:58] [INFO ] Deduced a trap composed of 178 places in 430 ms of which 1 ms to minimize.
[2022-05-18 00:22:59] [INFO ] Deduced a trap composed of 188 places in 473 ms of which 1 ms to minimize.
[2022-05-18 00:22:59] [INFO ] Deduced a trap composed of 175 places in 459 ms of which 1 ms to minimize.
[2022-05-18 00:22:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1893 ms
[2022-05-18 00:23:00] [INFO ] After 2636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 183 ms.
[2022-05-18 00:23:00] [INFO ] After 4076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 979 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 979/979 places, 4004/4004 transitions.
Applied a total of 0 rules in 100 ms. Remains 979 /979 variables (removed 0) and now considering 4004/4004 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 979/979 places, 4004/4004 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 979/979 places, 4004/4004 transitions.
Applied a total of 0 rules in 102 ms. Remains 979 /979 variables (removed 0) and now considering 4004/4004 (removed 0) transitions.
[2022-05-18 00:23:00] [INFO ] Flow matrix only has 3606 transitions (discarded 398 similar events)
// Phase 1: matrix 3606 rows 979 cols
[2022-05-18 00:23:00] [INFO ] Computed 49 place invariants in 27 ms
[2022-05-18 00:23:01] [INFO ] Implicit Places using invariants in 1072 ms returned [396]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1075 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 978/979 places, 4004/4004 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 977 transition count 4003
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 977 transition count 4003
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 976 transition count 4002
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 976 transition count 4002
Applied a total of 4 rules in 154 ms. Remains 976 /978 variables (removed 2) and now considering 4002/4004 (removed 2) transitions.
[2022-05-18 00:23:01] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:23:01] [INFO ] Computed 48 place invariants in 28 ms
[2022-05-18 00:23:02] [INFO ] Implicit Places using invariants in 1059 ms returned []
[2022-05-18 00:23:02] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:23:02] [INFO ] Computed 48 place invariants in 21 ms
[2022-05-18 00:23:03] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:23:22] [INFO ] Implicit Places using invariants and state equation in 19240 ms returned []
Implicit Place search using SMT with State Equation took 20299 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 976/979 places, 4002/4004 transitions.
Finished structural reductions, in 2 iterations. Remains : 976/979 places, 4002/4004 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 68499 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68499 steps, saw 28758 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:23:25] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:23:25] [INFO ] Computed 48 place invariants in 28 ms
[2022-05-18 00:23:25] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2022-05-18 00:23:25] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 00:23:26] [INFO ] After 991ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-18 00:23:26] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:23:26] [INFO ] After 348ms SMT Verify possible using 2450 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:23:26] [INFO ] After 1535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:23:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-18 00:23:27] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 00:23:28] [INFO ] After 992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:23:28] [INFO ] After 450ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:23:29] [INFO ] Deduced a trap composed of 177 places in 468 ms of which 1 ms to minimize.
[2022-05-18 00:23:29] [INFO ] Deduced a trap composed of 126 places in 426 ms of which 1 ms to minimize.
[2022-05-18 00:23:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1728 ms
[2022-05-18 00:23:30] [INFO ] After 2395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 182 ms.
[2022-05-18 00:23:30] [INFO ] After 3728ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 976 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 116 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 976/976 places, 4002/4002 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 106 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
[2022-05-18 00:23:30] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:23:30] [INFO ] Computed 48 place invariants in 25 ms
[2022-05-18 00:23:31] [INFO ] Implicit Places using invariants in 1070 ms returned []
[2022-05-18 00:23:31] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:23:32] [INFO ] Computed 48 place invariants in 21 ms
[2022-05-18 00:23:32] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:23:49] [INFO ] Implicit Places using invariants and state equation in 17536 ms returned []
Implicit Place search using SMT with State Equation took 18607 ms to find 0 implicit places.
[2022-05-18 00:23:49] [INFO ] Redundant transitions in 238 ms returned []
[2022-05-18 00:23:49] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:23:49] [INFO ] Computed 48 place invariants in 28 ms
[2022-05-18 00:23:51] [INFO ] Dead Transitions using invariants and state equation in 1348 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 976/976 places, 4002/4002 transitions.
Graph (trivial) has 1052 edges and 976 vertex of which 17 / 976 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 4570 edges and 960 vertex of which 946 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 t1235.t1429 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 929 transition count 3233
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 832 transition count 3040
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 736 transition count 2872
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 664 transition count 2730
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 594 transition count 2610
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 544 transition count 2512
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 496 transition count 2432
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 464 transition count 2370
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 434 transition count 2322
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 416 transition count 2288
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 400 transition count 2264
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 392 transition count 2250
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 386 transition count 2242
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 383 transition count 2240
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 383 transition count 2226
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 369 transition count 2226
Discarding 283 places :
Symmetric choice reduction at 14 with 283 rule applications. Total rules 1951 place count 86 transition count 341
Iterating global reduction 14 with 283 rules applied. Total rules applied 2234 place count 86 transition count 341
Ensure Unique test removed 245 transitions
Reduce isomorphic transitions removed 245 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 14 with 253 rules applied. Total rules applied 2487 place count 86 transition count 88
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 2495 place count 78 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2495 place count 78 transition count 87
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 2497 place count 77 transition count 87
Discarding 10 places :
Symmetric choice reduction at 16 with 10 rule applications. Total rules 2507 place count 67 transition count 73
Iterating global reduction 16 with 10 rules applied. Total rules applied 2517 place count 67 transition count 73
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 2521 place count 63 transition count 69
Iterating global reduction 16 with 4 rules applied. Total rules applied 2525 place count 63 transition count 69
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 16 with 6 rules applied. Total rules applied 2531 place count 60 transition count 66
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2532 place count 59 transition count 64
Iterating global reduction 16 with 1 rules applied. Total rules applied 2533 place count 59 transition count 64
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 16 with 6 rules applied. Total rules applied 2539 place count 59 transition count 58
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2545 place count 53 transition count 58
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 17 with 8 rules applied. Total rules applied 2553 place count 53 transition count 58
Applied a total of 2553 rules in 353 ms. Remains 53 /976 variables (removed 923) and now considering 58/4002 (removed 3944) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 58 rows 53 cols
[2022-05-18 00:23:51] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-18 00:23:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-18 00:23:51] [INFO ] [Real]Absence check using 2 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:23:51] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-18 00:23:51] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-18 00:23:51] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2022-05-18 00:23:51] [INFO ] Flatten gal took : 6 ms
[2022-05-18 00:23:51] [INFO ] Flatten gal took : 7 ms
[2022-05-18 00:23:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17862898175799511717.gal : 7 ms
[2022-05-18 00:23:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5711438243549747126.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15833960690915331080;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17862898175799511717.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5711438243549747126.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5711438243549747126.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 69
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,165,0.023968,4688,2,558,10,1872,6,0,252,1040,0
Total reachable state count : 165

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.024333,4688,2,54,10,1872,7,0,258,1040,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.024521,4688,2,54,10,1872,8,0,259,1040,0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 16 factoid took 1008 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 394 ms :[(NOT p2), (AND (NOT p2) p1), true, p0]
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (AND (NOT p2) p1), true, p0]
[2022-05-18 00:23:53] [INFO ] Flow matrix only has 2339 transitions (discarded 272 similar events)
// Phase 1: matrix 2339 rows 1176 cols
[2022-05-18 00:23:53] [INFO ] Computed 49 place invariants in 25 ms
[2022-05-18 00:23:55] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2022-05-18 00:23:55] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 18 ms returned sat
[2022-05-18 00:23:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:23:57] [INFO ] [Real]Absence check using state equation in 2103 ms returned sat
[2022-05-18 00:23:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:23:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 71 ms returned sat
[2022-05-18 00:23:59] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 17 ms returned sat
[2022-05-18 00:23:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:24:00] [INFO ] [Nat]Absence check using state equation in 1476 ms returned sat
[2022-05-18 00:24:00] [INFO ] State equation strengthened by 860 read => feed constraints.
[2022-05-18 00:24:00] [INFO ] [Nat]Added 860 Read/Feed constraints in 153 ms returned sat
[2022-05-18 00:24:01] [INFO ] Deduced a trap composed of 243 places in 412 ms of which 1 ms to minimize.
[2022-05-18 00:24:01] [INFO ] Deduced a trap composed of 254 places in 424 ms of which 1 ms to minimize.
[2022-05-18 00:24:02] [INFO ] Deduced a trap composed of 297 places in 416 ms of which 1 ms to minimize.
[2022-05-18 00:24:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1686 ms
[2022-05-18 00:24:02] [INFO ] Computed and/alt/rep : 1954/3311/1954 causal constraints (skipped 368 transitions) in 118 ms.
[2022-05-18 00:24:03] [INFO ] Added : 42 causal constraints over 9 iterations in 1152 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (AND (NOT p2) p1), true, p0]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-07 finished in 171955 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(!(!X(p0) U p1)))))'
Support contains 6 out of 1233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1233/1233 places, 2772/2772 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1217 transition count 2714
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1217 transition count 2714
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 1208 transition count 2675
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 1208 transition count 2675
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 1204 transition count 2647
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 1204 transition count 2647
Applied a total of 58 rules in 139 ms. Remains 1204 /1233 variables (removed 29) and now considering 2647/2772 (removed 125) transitions.
[2022-05-18 00:24:04] [INFO ] Flow matrix only has 2375 transitions (discarded 272 similar events)
// Phase 1: matrix 2375 rows 1204 cols
[2022-05-18 00:24:04] [INFO ] Computed 59 place invariants in 31 ms
[2022-05-18 00:24:04] [INFO ] Implicit Places using invariants in 895 ms returned [295, 382, 496, 535, 611, 620, 658, 782, 900, 1009]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 897 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1194/1233 places, 2647/2772 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1186 transition count 2639
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1186 transition count 2639
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1178 transition count 2631
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1178 transition count 2631
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1170 transition count 2623
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1170 transition count 2623
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 1162 transition count 2567
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 1162 transition count 2567
Applied a total of 64 rules in 165 ms. Remains 1162 /1194 variables (removed 32) and now considering 2567/2647 (removed 80) transitions.
[2022-05-18 00:24:05] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1162 cols
[2022-05-18 00:24:05] [INFO ] Computed 49 place invariants in 38 ms
[2022-05-18 00:24:05] [INFO ] Implicit Places using invariants in 828 ms returned []
[2022-05-18 00:24:05] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1162 cols
[2022-05-18 00:24:05] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 00:24:06] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:24:15] [INFO ] Implicit Places using invariants and state equation in 9707 ms returned [1124, 1145]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10538 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1160/1233 places, 2567/2772 transitions.
Applied a total of 0 rules in 38 ms. Remains 1160 /1160 variables (removed 0) and now considering 2567/2567 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1160/1233 places, 2567/2772 transitions.
Stuttering acceptance computed with spot in 109 ms :[p1, p1, (AND p1 (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s481 1) (GEQ s828 1)), p0:(AND (GEQ s2 1) (GEQ s586 1) (GEQ s655 1) (GEQ s656 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1403 reset in 483 ms.
Product exploration explored 100000 steps with 1395 reset in 454 ms.
Computed a total of 328 stabilizing places and 934 stable transitions
Computed a total of 328 stabilizing places and 934 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 292 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[p1, p1, (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 138 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:24:17] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1160 cols
[2022-05-18 00:24:17] [INFO ] Computed 47 place invariants in 38 ms
[2022-05-18 00:24:17] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2022-05-18 00:24:17] [INFO ] [Real]Absence check using 33 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-18 00:24:18] [INFO ] After 1006ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:24:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2022-05-18 00:24:18] [INFO ] [Nat]Absence check using 33 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-18 00:24:20] [INFO ] After 1909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:24:20] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:24:21] [INFO ] After 626ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:24:21] [INFO ] After 1018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 453 ms.
[2022-05-18 00:24:22] [INFO ] After 3588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 1160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1160/1160 places, 2567/2567 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 0 with 30 rules applied. Total rules applied 30 place count 1160 transition count 2537
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1130 transition count 2537
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 60 place count 1130 transition count 2523
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 88 place count 1116 transition count 2523
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 122 place count 1099 transition count 2506
Free-agglomeration rule (complex) applied 127 times.
Iterating global reduction 2 with 127 rules applied. Total rules applied 249 place count 1099 transition count 2379
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 376 place count 972 transition count 2379
Applied a total of 376 rules in 194 ms. Remains 972 /1160 variables (removed 188) and now considering 2379/2567 (removed 188) transitions.
Finished structural reductions, in 1 iterations. Remains : 972/1160 places, 2379/2567 transitions.
Incomplete random walk after 10000 steps, including 206 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 90550 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90550 steps, saw 38092 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:24:25] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:24:25] [INFO ] Computed 47 place invariants in 44 ms
[2022-05-18 00:24:25] [INFO ] [Real]Absence check using 33 positive place invariants in 23 ms returned sat
[2022-05-18 00:24:25] [INFO ] [Real]Absence check using 33 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-18 00:24:26] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:24:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 22 ms returned sat
[2022-05-18 00:24:26] [INFO ] [Nat]Absence check using 33 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-18 00:24:27] [INFO ] After 856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:24:27] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:24:27] [INFO ] After 373ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:24:28] [INFO ] After 709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 197 ms.
[2022-05-18 00:24:28] [INFO ] After 1938ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 972 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 972/972 places, 2379/2379 transitions.
Applied a total of 0 rules in 47 ms. Remains 972 /972 variables (removed 0) and now considering 2379/2379 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 972/972 places, 2379/2379 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 972/972 places, 2379/2379 transitions.
Applied a total of 0 rules in 47 ms. Remains 972 /972 variables (removed 0) and now considering 2379/2379 (removed 0) transitions.
[2022-05-18 00:24:28] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:24:28] [INFO ] Computed 47 place invariants in 23 ms
[2022-05-18 00:24:29] [INFO ] Implicit Places using invariants in 744 ms returned []
[2022-05-18 00:24:29] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:24:29] [INFO ] Computed 47 place invariants in 19 ms
[2022-05-18 00:24:29] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:24:37] [INFO ] Implicit Places using invariants and state equation in 8106 ms returned []
Implicit Place search using SMT with State Equation took 8851 ms to find 0 implicit places.
[2022-05-18 00:24:37] [INFO ] Redundant transitions in 72 ms returned []
[2022-05-18 00:24:37] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:24:37] [INFO ] Computed 47 place invariants in 28 ms
[2022-05-18 00:24:38] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 972/972 places, 2379/2379 transitions.
Graph (trivial) has 772 edges and 972 vertex of which 17 / 972 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 299 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 669 transitions.
Graph (complete) has 2896 edges and 956 vertex of which 942 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 t1235.t1429 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 925 transition count 1600
Reduce places removed 108 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 299 rules applied. Total rules applied 411 place count 817 transition count 1409
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 261 rules applied. Total rules applied 672 place count 722 transition count 1243
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 3 with 211 rules applied. Total rules applied 883 place count 651 transition count 1103
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 187 rules applied. Total rules applied 1070 place count 582 transition count 985
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1215 place count 533 transition count 889
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1340 place count 486 transition count 811
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1431 place count 455 transition count 751
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1506 place count 426 transition count 705
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 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 50 rules applied. Total rules applied 1556 place count 409 transition count 672
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 1596 place count 393 transition count 648
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 1618 place count 385 transition count 634
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 1632 place count 379 transition count 626
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1637 place count 377 transition count 623
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1639 place count 376 transition count 622
Discarding 282 places :
Symmetric choice reduction at 15 with 282 rule applications. Total rules 1921 place count 94 transition count 340
Iterating global reduction 15 with 282 rules applied. Total rules applied 2203 place count 94 transition count 340
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 15 with 265 rules applied. Total rules applied 2468 place count 94 transition count 75
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 14 rules applied. Total rules applied 2482 place count 81 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2483 place count 80 transition count 74
Discarding 13 places :
Symmetric choice reduction at 18 with 13 rule applications. Total rules 2496 place count 67 transition count 61
Iterating global reduction 18 with 13 rules applied. Total rules applied 2509 place count 67 transition count 61
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 2515 place count 64 transition count 58
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 2518 place count 64 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 2522 place count 62 transition count 77
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 19 with 4 rules applied. Total rules applied 2526 place count 62 transition count 73
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 19 with 2 rules applied. Total rules applied 2528 place count 62 transition count 71
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 20 with 3 rules applied. Total rules applied 2531 place count 60 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 2532 place count 59 transition count 70
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 2533 place count 59 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 2534 place count 58 transition count 69
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 23 with 3 rules applied. Total rules applied 2537 place count 58 transition count 69
Applied a total of 2537 rules in 241 ms. Remains 58 /972 variables (removed 914) and now considering 69/2379 (removed 2310) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 69 rows 58 cols
[2022-05-18 00:24:38] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-18 00:24:38] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 00:24:38] [INFO ] [Real]Absence check using 5 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-18 00:24:38] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:24:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 00:24:38] [INFO ] [Nat]Absence check using 5 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-18 00:24:38] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:24:38] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-18 00:24:38] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:24:38] [INFO ] Flatten gal took : 6 ms
[2022-05-18 00:24:38] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:24:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18343831044848150702.gal : 2 ms
[2022-05-18 00:24:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7459219796132623031.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5308579364908546733;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18343831044848150702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7459219796132623031.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7459219796132623031.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 21
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :21 after 41
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 80
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :80 after 141
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :141 after 1093
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1093 after 2745
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3288,0.077126,7092,2,2838,12,16300,8,0,294,12103,0
Total reachable state count : 3288

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.078173,7092,2,59,12,16300,8,0,297,12103,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.078884,7356,2,59,12,16300,8,0,299,12103,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 311 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[p1, p1, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 97 ms :[p1, p1, (AND p1 (NOT p0))]
Support contains 6 out of 1160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1160/1160 places, 2567/2567 transitions.
Applied a total of 0 rules in 33 ms. Remains 1160 /1160 variables (removed 0) and now considering 2567/2567 (removed 0) transitions.
[2022-05-18 00:24:39] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1160 cols
[2022-05-18 00:24:39] [INFO ] Computed 47 place invariants in 36 ms
[2022-05-18 00:24:40] [INFO ] Implicit Places using invariants in 820 ms returned []
[2022-05-18 00:24:40] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1160 cols
[2022-05-18 00:24:40] [INFO ] Computed 47 place invariants in 28 ms
[2022-05-18 00:24:40] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:24:49] [INFO ] Implicit Places using invariants and state equation in 9085 ms returned []
Implicit Place search using SMT with State Equation took 9906 ms to find 0 implicit places.
[2022-05-18 00:24:49] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1160 cols
[2022-05-18 00:24:49] [INFO ] Computed 47 place invariants in 41 ms
[2022-05-18 00:24:50] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1160/1160 places, 2567/2567 transitions.
Computed a total of 328 stabilizing places and 934 stable transitions
Computed a total of 328 stabilizing places and 934 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 257 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[p1, p1, (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 137 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:24:50] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1160 cols
[2022-05-18 00:24:50] [INFO ] Computed 47 place invariants in 45 ms
[2022-05-18 00:24:50] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2022-05-18 00:24:50] [INFO ] [Real]Absence check using 33 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-18 00:24:51] [INFO ] After 999ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:24:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2022-05-18 00:24:51] [INFO ] [Nat]Absence check using 33 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-18 00:24:53] [INFO ] After 1949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:24:53] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:24:54] [INFO ] After 633ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:24:54] [INFO ] After 1030ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 465 ms.
[2022-05-18 00:24:55] [INFO ] After 3655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 1160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1160/1160 places, 2567/2567 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 0 with 30 rules applied. Total rules applied 30 place count 1160 transition count 2537
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1130 transition count 2537
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 60 place count 1130 transition count 2523
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 88 place count 1116 transition count 2523
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 122 place count 1099 transition count 2506
Free-agglomeration rule (complex) applied 127 times.
Iterating global reduction 2 with 127 rules applied. Total rules applied 249 place count 1099 transition count 2379
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 376 place count 972 transition count 2379
Applied a total of 376 rules in 187 ms. Remains 972 /1160 variables (removed 188) and now considering 2379/2567 (removed 188) transitions.
Finished structural reductions, in 1 iterations. Remains : 972/1160 places, 2379/2567 transitions.
Incomplete random walk after 10000 steps, including 206 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 89014 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89014 steps, saw 37445 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:24:58] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:24:58] [INFO ] Computed 47 place invariants in 24 ms
[2022-05-18 00:24:58] [INFO ] [Real]Absence check using 33 positive place invariants in 20 ms returned sat
[2022-05-18 00:24:58] [INFO ] [Real]Absence check using 33 positive and 14 generalized place invariants in 5 ms returned sat
[2022-05-18 00:24:59] [INFO ] After 811ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:24:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2022-05-18 00:24:59] [INFO ] [Nat]Absence check using 33 positive and 14 generalized place invariants in 7 ms returned sat
[2022-05-18 00:25:00] [INFO ] After 818ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:25:00] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:25:01] [INFO ] After 390ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:25:01] [INFO ] After 714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 197 ms.
[2022-05-18 00:25:01] [INFO ] After 1918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 972 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 972/972 places, 2379/2379 transitions.
Applied a total of 0 rules in 48 ms. Remains 972 /972 variables (removed 0) and now considering 2379/2379 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 972/972 places, 2379/2379 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 972/972 places, 2379/2379 transitions.
Applied a total of 0 rules in 47 ms. Remains 972 /972 variables (removed 0) and now considering 2379/2379 (removed 0) transitions.
[2022-05-18 00:25:01] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:25:01] [INFO ] Computed 47 place invariants in 26 ms
[2022-05-18 00:25:02] [INFO ] Implicit Places using invariants in 726 ms returned []
[2022-05-18 00:25:02] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:25:02] [INFO ] Computed 47 place invariants in 35 ms
[2022-05-18 00:25:03] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:25:10] [INFO ] Implicit Places using invariants and state equation in 7779 ms returned []
Implicit Place search using SMT with State Equation took 8507 ms to find 0 implicit places.
[2022-05-18 00:25:10] [INFO ] Redundant transitions in 65 ms returned []
[2022-05-18 00:25:10] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:25:10] [INFO ] Computed 47 place invariants in 19 ms
[2022-05-18 00:25:11] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 972/972 places, 2379/2379 transitions.
Graph (trivial) has 772 edges and 972 vertex of which 17 / 972 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 299 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 669 transitions.
Graph (complete) has 2896 edges and 956 vertex of which 942 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 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 t1235.t1429 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 925 transition count 1600
Reduce places removed 108 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 299 rules applied. Total rules applied 411 place count 817 transition count 1409
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 261 rules applied. Total rules applied 672 place count 722 transition count 1243
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 3 with 211 rules applied. Total rules applied 883 place count 651 transition count 1103
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 187 rules applied. Total rules applied 1070 place count 582 transition count 985
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1215 place count 533 transition count 889
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1340 place count 486 transition count 811
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1431 place count 455 transition count 751
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1506 place count 426 transition count 705
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 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 50 rules applied. Total rules applied 1556 place count 409 transition count 672
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 1596 place count 393 transition count 648
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 1618 place count 385 transition count 634
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 1632 place count 379 transition count 626
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1637 place count 377 transition count 623
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1639 place count 376 transition count 622
Discarding 282 places :
Symmetric choice reduction at 15 with 282 rule applications. Total rules 1921 place count 94 transition count 340
Iterating global reduction 15 with 282 rules applied. Total rules applied 2203 place count 94 transition count 340
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 15 with 265 rules applied. Total rules applied 2468 place count 94 transition count 75
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 14 rules applied. Total rules applied 2482 place count 81 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2483 place count 80 transition count 74
Discarding 13 places :
Symmetric choice reduction at 18 with 13 rule applications. Total rules 2496 place count 67 transition count 61
Iterating global reduction 18 with 13 rules applied. Total rules applied 2509 place count 67 transition count 61
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 2515 place count 64 transition count 58
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 2518 place count 64 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 2522 place count 62 transition count 77
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 19 with 4 rules applied. Total rules applied 2526 place count 62 transition count 73
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 19 with 2 rules applied. Total rules applied 2528 place count 62 transition count 71
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 20 with 3 rules applied. Total rules applied 2531 place count 60 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 2532 place count 59 transition count 70
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 2533 place count 59 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 2534 place count 58 transition count 69
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 23 with 3 rules applied. Total rules applied 2537 place count 58 transition count 69
Applied a total of 2537 rules in 212 ms. Remains 58 /972 variables (removed 914) and now considering 69/2379 (removed 2310) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 69 rows 58 cols
[2022-05-18 00:25:11] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-18 00:25:11] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 00:25:11] [INFO ] [Real]Absence check using 5 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-18 00:25:11] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:25:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 00:25:11] [INFO ] [Nat]Absence check using 5 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-18 00:25:11] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:25:11] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-18 00:25:11] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:25:11] [INFO ] Flatten gal took : 5 ms
[2022-05-18 00:25:11] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:25:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6794230528371390741.gal : 1 ms
[2022-05-18 00:25:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3887650288516002865.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11279507115233980490;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6794230528371390741.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3887650288516002865.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3887650288516002865.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 21
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :21 after 41
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 80
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :80 after 141
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :141 after 1093
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1093 after 2745
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3288,0.074901,7092,2,2838,12,16300,8,0,294,12103,0
Total reachable state count : 3288

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.075777,7092,2,59,12,16300,8,0,297,12103,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.07643,7356,2,59,12,16300,8,0,299,12103,0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 271 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[p1, p1, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[p1, p1, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 161 ms :[p1, p1, (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 1396 reset in 433 ms.
Product exploration explored 100000 steps with 1400 reset in 453 ms.
Built C files in :
/tmp/ltsmin10318706240031445733
[2022-05-18 00:25:13] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10318706240031445733
Running compilation step : cd /tmp/ltsmin10318706240031445733;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10318706240031445733;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10318706240031445733;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 1160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1160/1160 places, 2567/2567 transitions.
Applied a total of 0 rules in 37 ms. Remains 1160 /1160 variables (removed 0) and now considering 2567/2567 (removed 0) transitions.
[2022-05-18 00:25:16] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1160 cols
[2022-05-18 00:25:16] [INFO ] Computed 47 place invariants in 56 ms
[2022-05-18 00:25:17] [INFO ] Implicit Places using invariants in 889 ms returned []
[2022-05-18 00:25:17] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1160 cols
[2022-05-18 00:25:17] [INFO ] Computed 47 place invariants in 28 ms
[2022-05-18 00:25:17] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:25:26] [INFO ] Implicit Places using invariants and state equation in 9101 ms returned []
Implicit Place search using SMT with State Equation took 9991 ms to find 0 implicit places.
[2022-05-18 00:25:26] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1160 cols
[2022-05-18 00:25:26] [INFO ] Computed 47 place invariants in 33 ms
[2022-05-18 00:25:27] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1160/1160 places, 2567/2567 transitions.
Built C files in :
/tmp/ltsmin16387582789418632375
[2022-05-18 00:25:27] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16387582789418632375
Running compilation step : cd /tmp/ltsmin16387582789418632375;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16387582789418632375;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16387582789418632375;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 00:25:30] [INFO ] Flatten gal took : 93 ms
[2022-05-18 00:25:30] [INFO ] Flatten gal took : 95 ms
[2022-05-18 00:25:30] [INFO ] Time to serialize gal into /tmp/LTL5824442245920864078.gal : 18 ms
[2022-05-18 00:25:30] [INFO ] Time to serialize properties into /tmp/LTL14173685523054946869.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5824442245920864078.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14173685523054946869.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5824442...267
Read 1 LTL properties
Checking formula 0 : !((F(G(F(!((!(X("(((ThereIsAMasterInTheLeafSet>=1)&&(NoNodeManageTheCrashOfNode8>=1))&&((Node11WantsToManageTheCrashOfNode8>=1)&&(Node...289
Formula 0 simplified : !FGF!(!X"(((ThereIsAMasterInTheLeafSet>=1)&&(NoNodeManageTheCrashOfNode8>=1))&&((Node11WantsToManageTheCrashOfNode8>=1)&&(Node11HasD...275
Detected timeout of ITS tools.
[2022-05-18 00:25:45] [INFO ] Flatten gal took : 85 ms
[2022-05-18 00:25:45] [INFO ] Applying decomposition
[2022-05-18 00:25:45] [INFO ] Flatten gal took : 86 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15000778090486037041.txt' '-o' '/tmp/graph15000778090486037041.bin' '-w' '/tmp/graph15000778090486037041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15000778090486037041.bin' '-l' '-1' '-v' '-w' '/tmp/graph15000778090486037041.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:25:46] [INFO ] Decomposing Gal with order
[2022-05-18 00:25:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:25:46] [INFO ] Removed a total of 1880 redundant transitions.
[2022-05-18 00:25:46] [INFO ] Flatten gal took : 460 ms
[2022-05-18 00:25:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1035 labels/synchronizations in 108 ms.
[2022-05-18 00:25:47] [INFO ] Time to serialize gal into /tmp/LTL9963472328691629114.gal : 26 ms
[2022-05-18 00:25:47] [INFO ] Time to serialize properties into /tmp/LTL16935455186312689081.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9963472328691629114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16935455186312689081.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9963472...246
Read 1 LTL properties
Checking formula 0 : !((F(G(F(!((!(X("(((i10.u0.ThereIsAMasterInTheLeafSet>=1)&&(i10.u0.NoNodeManageTheCrashOfNode8>=1))&&((i10.u0.Node11WantsToManageTheCr...333
Formula 0 simplified : !FGF!(!X"(((i10.u0.ThereIsAMasterInTheLeafSet>=1)&&(i10.u0.NoNodeManageTheCrashOfNode8>=1))&&((i10.u0.Node11WantsToManageTheCrashOfN...319
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1333112029333785362
[2022-05-18 00:26:02] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1333112029333785362
Running compilation step : cd /tmp/ltsmin1333112029333785362;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1333112029333785362;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1333112029333785362;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-08 finished in 121325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1233/1233 places, 2772/2772 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 1233 transition count 2746
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1207 transition count 2746
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 52 place count 1207 transition count 2728
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 88 place count 1189 transition count 2728
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 1177 transition count 2674
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 1177 transition count 2674
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 112 place count 1177 transition count 2673
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 114 place count 1176 transition count 2673
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 1171 transition count 2638
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 1171 transition count 2638
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 174 place count 1146 transition count 2613
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 177 place count 1143 transition count 2610
Iterating global reduction 2 with 3 rules applied. Total rules applied 180 place count 1143 transition count 2610
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 183 place count 1140 transition count 2589
Iterating global reduction 2 with 3 rules applied. Total rules applied 186 place count 1140 transition count 2589
Applied a total of 186 rules in 319 ms. Remains 1140 /1233 variables (removed 93) and now considering 2589/2772 (removed 183) transitions.
[2022-05-18 00:26:05] [INFO ] Flow matrix only has 2317 transitions (discarded 272 similar events)
// Phase 1: matrix 2317 rows 1140 cols
[2022-05-18 00:26:05] [INFO ] Computed 59 place invariants in 23 ms
[2022-05-18 00:26:06] [INFO ] Implicit Places using invariants in 1213 ms returned [264, 349, 460, 497, 561, 569, 578, 614, 632, 735, 960]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1216 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1129/1233 places, 2589/2772 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1126 transition count 2586
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1126 transition count 2586
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1123 transition count 2583
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1123 transition count 2583
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1120 transition count 2562
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1120 transition count 2562
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 26 place count 1116 transition count 2558
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 1112 transition count 2554
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 1112 transition count 2554
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 1108 transition count 2526
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 1108 transition count 2526
Applied a total of 42 rules in 315 ms. Remains 1108 /1129 variables (removed 21) and now considering 2526/2589 (removed 63) transitions.
[2022-05-18 00:26:07] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1108 cols
[2022-05-18 00:26:07] [INFO ] Computed 48 place invariants in 32 ms
[2022-05-18 00:26:08] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2022-05-18 00:26:08] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1108 cols
[2022-05-18 00:26:08] [INFO ] Computed 48 place invariants in 16 ms
[2022-05-18 00:26:08] [INFO ] State equation strengthened by 842 read => feed constraints.
[2022-05-18 00:26:18] [INFO ] Implicit Places using invariants and state equation in 9962 ms returned [1101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11103 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1107/1233 places, 2526/2772 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1107 transition count 2525
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1106 transition count 2525
Applied a total of 2 rules in 70 ms. Remains 1106 /1107 variables (removed 1) and now considering 2525/2526 (removed 1) transitions.
[2022-05-18 00:26:18] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2022-05-18 00:26:18] [INFO ] Computed 47 place invariants in 26 ms
[2022-05-18 00:26:19] [INFO ] Implicit Places using invariants in 879 ms returned []
[2022-05-18 00:26:19] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2022-05-18 00:26:19] [INFO ] Computed 47 place invariants in 17 ms
[2022-05-18 00:26:19] [INFO ] State equation strengthened by 842 read => feed constraints.
[2022-05-18 00:26:27] [INFO ] Implicit Places using invariants and state equation in 8459 ms returned []
Implicit Place search using SMT with State Equation took 9340 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1106/1233 places, 2525/2772 transitions.
Finished structural reductions, in 3 iterations. Remains : 1106/1233 places, 2525/2772 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s838 1) (OR (LT s67 1) (LT s573 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1954 reset in 493 ms.
Product exploration explored 100000 steps with 1952 reset in 522 ms.
Computed a total of 291 stabilizing places and 909 stable transitions
Computed a total of 291 stabilizing places and 909 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 5908 steps, including 115 resets, run visited all 1 properties in 32 ms. (steps per millisecond=184 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 3 out of 1106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1106/1106 places, 2525/2525 transitions.
Applied a total of 0 rules in 71 ms. Remains 1106 /1106 variables (removed 0) and now considering 2525/2525 (removed 0) transitions.
[2022-05-18 00:26:29] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2022-05-18 00:26:29] [INFO ] Computed 47 place invariants in 25 ms
[2022-05-18 00:26:29] [INFO ] Implicit Places using invariants in 861 ms returned []
[2022-05-18 00:26:29] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2022-05-18 00:26:29] [INFO ] Computed 47 place invariants in 17 ms
[2022-05-18 00:26:30] [INFO ] State equation strengthened by 842 read => feed constraints.
[2022-05-18 00:26:39] [INFO ] Implicit Places using invariants and state equation in 9113 ms returned []
Implicit Place search using SMT with State Equation took 9974 ms to find 0 implicit places.
[2022-05-18 00:26:39] [INFO ] Redundant transitions in 82 ms returned []
[2022-05-18 00:26:39] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2022-05-18 00:26:39] [INFO ] Computed 47 place invariants in 17 ms
[2022-05-18 00:26:40] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1106/1106 places, 2525/2525 transitions.
Computed a total of 291 stabilizing places and 909 stable transitions
Computed a total of 291 stabilizing places and 909 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 195 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 89829 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89829 steps, saw 37924 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 00:26:43] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2022-05-18 00:26:43] [INFO ] Computed 47 place invariants in 17 ms
[2022-05-18 00:26:43] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 00:26:43] [INFO ] [Real]Absence check using 31 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 00:26:44] [INFO ] After 852ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 00:26:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:26:44] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 00:26:44] [INFO ] After 653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 00:26:44] [INFO ] State equation strengthened by 842 read => feed constraints.
[2022-05-18 00:26:45] [INFO ] After 141ms SMT Verify possible using 842 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 00:26:45] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-18 00:26:45] [INFO ] After 1138ms 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 1106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1106/1106 places, 2525/2525 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1106 transition count 4000
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 973 transition count 4000
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 267 place count 973 transition count 4000
Applied a total of 267 rules in 291 ms. Remains 973 /1106 variables (removed 133) and now considering 4000/2525 (removed -1475) transitions.
Finished structural reductions, in 1 iterations. Remains : 973/1106 places, 4000/2525 transitions.
Finished random walk after 1969 steps, including 47 resets, run visited all 1 properties in 34 ms. (steps per millisecond=57 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1956 reset in 489 ms.
Product exploration explored 100000 steps with 1957 reset in 509 ms.
Built C files in :
/tmp/ltsmin8361833924685757195
[2022-05-18 00:26:46] [INFO ] Too many transitions (2525) to apply POR reductions. Disabling POR matrices.
[2022-05-18 00:26:46] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8361833924685757195
Running compilation step : cd /tmp/ltsmin8361833924685757195;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8361833924685757195;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8361833924685757195;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1106/1106 places, 2525/2525 transitions.
Applied a total of 0 rules in 68 ms. Remains 1106 /1106 variables (removed 0) and now considering 2525/2525 (removed 0) transitions.
[2022-05-18 00:26:49] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2022-05-18 00:26:49] [INFO ] Computed 47 place invariants in 25 ms
[2022-05-18 00:26:50] [INFO ] Implicit Places using invariants in 910 ms returned []
[2022-05-18 00:26:50] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2022-05-18 00:26:50] [INFO ] Computed 47 place invariants in 16 ms
[2022-05-18 00:26:51] [INFO ] State equation strengthened by 842 read => feed constraints.
[2022-05-18 00:26:58] [INFO ] Implicit Places using invariants and state equation in 8103 ms returned []
Implicit Place search using SMT with State Equation took 9014 ms to find 0 implicit places.
[2022-05-18 00:26:59] [INFO ] Redundant transitions in 75 ms returned []
[2022-05-18 00:26:59] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2022-05-18 00:26:59] [INFO ] Computed 47 place invariants in 28 ms
[2022-05-18 00:26:59] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1106/1106 places, 2525/2525 transitions.
Built C files in :
/tmp/ltsmin1265626434160347794
[2022-05-18 00:27:00] [INFO ] Too many transitions (2525) to apply POR reductions. Disabling POR matrices.
[2022-05-18 00:27:00] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1265626434160347794
Running compilation step : cd /tmp/ltsmin1265626434160347794;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1265626434160347794;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1265626434160347794;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 00:27:03] [INFO ] Flatten gal took : 115 ms
[2022-05-18 00:27:03] [INFO ] Flatten gal took : 146 ms
[2022-05-18 00:27:03] [INFO ] Time to serialize gal into /tmp/LTL12868745309145272749.gal : 23 ms
[2022-05-18 00:27:03] [INFO ] Time to serialize properties into /tmp/LTL14414195012253311501.ltl : 53 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12868745309145272749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14414195012253311501.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1286874...268
Read 1 LTL properties
Checking formula 0 : !((F(G("((Node15HasTheLeafSetOfLx2ToReplaceNode3<1)&&((Node0ThinksNode10ShouldBeNodeMasterToReplaceNode8<1)||(NodesCanDetectThatNode10...175
Formula 0 simplified : !FG"((Node15HasTheLeafSetOfLx2ToReplaceNode3<1)&&((Node0ThinksNode10ShouldBeNodeMasterToReplaceNode8<1)||(NodesCanDetectThatNode10Ha...169
Detected timeout of ITS tools.
[2022-05-18 00:27:18] [INFO ] Flatten gal took : 64 ms
[2022-05-18 00:27:18] [INFO ] Applying decomposition
[2022-05-18 00:27:18] [INFO ] Flatten gal took : 67 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9919529900246049124.txt' '-o' '/tmp/graph9919529900246049124.bin' '-w' '/tmp/graph9919529900246049124.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9919529900246049124.bin' '-l' '-1' '-v' '-w' '/tmp/graph9919529900246049124.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:27:18] [INFO ] Decomposing Gal with order
[2022-05-18 00:27:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:27:19] [INFO ] Removed a total of 2253 redundant transitions.
[2022-05-18 00:27:19] [INFO ] Flatten gal took : 385 ms
[2022-05-18 00:27:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 1276 labels/synchronizations in 95 ms.
[2022-05-18 00:27:19] [INFO ] Time to serialize gal into /tmp/LTL6470650377590443713.gal : 20 ms
[2022-05-18 00:27:19] [INFO ] Time to serialize properties into /tmp/LTL7938233600449201971.ltl : 77 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6470650377590443713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7938233600449201971.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6470650...245
Read 1 LTL properties
Checking formula 0 : !((F(G("((i17.i1.u165.Node15HasTheLeafSetOfLx2ToReplaceNode3<1)&&((u8.Node0ThinksNode10ShouldBeNodeMasterToReplaceNode8<1)||(i8.i1.u66...200
Formula 0 simplified : !FG"((i17.i1.u165.Node15HasTheLeafSetOfLx2ToReplaceNode3<1)&&((u8.Node0ThinksNode10ShouldBeNodeMasterToReplaceNode8<1)||(i8.i1.u66.N...194
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8937038709978184258
[2022-05-18 00:27:34] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8937038709978184258
Running compilation step : cd /tmp/ltsmin8937038709978184258;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8937038709978184258;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8937038709978184258;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-09 finished in 92423 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X(p0)&&G(p1))))))))'
Support contains 4 out of 1233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1233/1233 places, 2772/2772 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1218 transition count 2721
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1218 transition count 2721
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 1210 transition count 2689
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 1210 transition count 2689
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 1206 transition count 2661
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1206 transition count 2661
Applied a total of 54 rules in 128 ms. Remains 1206 /1233 variables (removed 27) and now considering 2661/2772 (removed 111) transitions.
[2022-05-18 00:27:37] [INFO ] Flow matrix only has 2389 transitions (discarded 272 similar events)
// Phase 1: matrix 2389 rows 1206 cols
[2022-05-18 00:27:37] [INFO ] Computed 59 place invariants in 47 ms
[2022-05-18 00:27:38] [INFO ] Implicit Places using invariants in 1035 ms returned [295, 382, 496, 535, 602, 611, 620, 658, 677, 782, 901, 1010]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1052 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1194/1233 places, 2661/2772 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1186 transition count 2653
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1186 transition count 2653
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1178 transition count 2645
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1178 transition count 2645
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1170 transition count 2637
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1170 transition count 2637
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 1162 transition count 2581
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 1162 transition count 2581
Applied a total of 64 rules in 165 ms. Remains 1162 /1194 variables (removed 32) and now considering 2581/2661 (removed 80) transitions.
[2022-05-18 00:27:38] [INFO ] Flow matrix only has 2309 transitions (discarded 272 similar events)
// Phase 1: matrix 2309 rows 1162 cols
[2022-05-18 00:27:39] [INFO ] Computed 47 place invariants in 20 ms
[2022-05-18 00:27:39] [INFO ] Implicit Places using invariants in 938 ms returned []
[2022-05-18 00:27:39] [INFO ] Flow matrix only has 2309 transitions (discarded 272 similar events)
// Phase 1: matrix 2309 rows 1162 cols
[2022-05-18 00:27:39] [INFO ] Computed 47 place invariants in 21 ms
[2022-05-18 00:27:40] [INFO ] State equation strengthened by 842 read => feed constraints.
[2022-05-18 00:27:48] [INFO ] Implicit Places using invariants and state equation in 8097 ms returned []
Implicit Place search using SMT with State Equation took 9037 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1162/1233 places, 2581/2772 transitions.
Finished structural reductions, in 2 iterations. Remains : 1162/1233 places, 2581/2772 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p1:(OR (LT s787 1) (LT s1126 1)), p0:(AND (GEQ s977 1) (GEQ s1123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10 finished in 10599 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||X((p1 U p2))))))'
Support contains 9 out of 1233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1233/1233 places, 2772/2772 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1218 transition count 2715
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1218 transition count 2715
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 1210 transition count 2683
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 1210 transition count 2683
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 1206 transition count 2655
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1206 transition count 2655
Applied a total of 54 rules in 152 ms. Remains 1206 /1233 variables (removed 27) and now considering 2655/2772 (removed 117) transitions.
[2022-05-18 00:27:48] [INFO ] Flow matrix only has 2383 transitions (discarded 272 similar events)
// Phase 1: matrix 2383 rows 1206 cols
[2022-05-18 00:27:48] [INFO ] Computed 59 place invariants in 28 ms
[2022-05-18 00:27:49] [INFO ] Implicit Places using invariants in 911 ms returned [295, 382, 496, 535, 602, 679, 784, 902, 1011]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 913 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1197/1233 places, 2655/2772 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1190 transition count 2648
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1190 transition count 2648
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1183 transition count 2641
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1183 transition count 2641
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1176 transition count 2634
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1176 transition count 2634
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 1169 transition count 2585
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 1169 transition count 2585
Applied a total of 56 rules in 171 ms. Remains 1169 /1197 variables (removed 28) and now considering 2585/2655 (removed 70) transitions.
[2022-05-18 00:27:49] [INFO ] Flow matrix only has 2313 transitions (discarded 272 similar events)
// Phase 1: matrix 2313 rows 1169 cols
[2022-05-18 00:27:49] [INFO ] Computed 50 place invariants in 33 ms
[2022-05-18 00:27:50] [INFO ] Implicit Places using invariants in 850 ms returned []
[2022-05-18 00:27:50] [INFO ] Flow matrix only has 2313 transitions (discarded 272 similar events)
// Phase 1: matrix 2313 rows 1169 cols
[2022-05-18 00:27:50] [INFO ] Computed 50 place invariants in 27 ms
[2022-05-18 00:27:51] [INFO ] State equation strengthened by 842 read => feed constraints.
[2022-05-18 00:28:00] [INFO ] Implicit Places using invariants and state equation in 10155 ms returned [1152]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11009 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1168/1233 places, 2585/2772 transitions.
Applied a total of 0 rules in 41 ms. Remains 1168 /1168 variables (removed 0) and now considering 2585/2585 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1168/1233 places, 2585/2772 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s605 1) (GEQ s606 1) (GEQ s643 1)), p2:(AND (GEQ s515 1) (GEQ s518 1) (GEQ s567 1)), p1:(AND (GEQ s598 1) (GEQ s614 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-11 finished in 12483 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(X((G(p1)||p0)))) U p2)))'
Support contains 5 out of 1233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1233/1233 places, 2772/2772 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1219 transition count 2722
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1219 transition count 2722
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 1211 transition count 2684
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 1211 transition count 2684
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 1208 transition count 2663
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 1208 transition count 2663
Applied a total of 50 rules in 131 ms. Remains 1208 /1233 variables (removed 25) and now considering 2663/2772 (removed 109) transitions.
[2022-05-18 00:28:00] [INFO ] Flow matrix only has 2391 transitions (discarded 272 similar events)
// Phase 1: matrix 2391 rows 1208 cols
[2022-05-18 00:28:00] [INFO ] Computed 59 place invariants in 46 ms
[2022-05-18 00:28:01] [INFO ] Implicit Places using invariants in 968 ms returned [295, 382, 496, 605, 614, 623, 661, 680, 786, 904, 1013]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 970 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1197/1233 places, 2663/2772 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1190 transition count 2656
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1190 transition count 2656
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1183 transition count 2649
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1183 transition count 2649
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1176 transition count 2642
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1176 transition count 2642
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 1169 transition count 2593
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 1169 transition count 2593
Applied a total of 56 rules in 160 ms. Remains 1169 /1197 variables (removed 28) and now considering 2593/2663 (removed 70) transitions.
[2022-05-18 00:28:02] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:28:02] [INFO ] Computed 48 place invariants in 59 ms
[2022-05-18 00:28:02] [INFO ] Implicit Places using invariants in 910 ms returned []
[2022-05-18 00:28:02] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:28:02] [INFO ] Computed 48 place invariants in 18 ms
[2022-05-18 00:28:03] [INFO ] State equation strengthened by 848 read => feed constraints.
[2022-05-18 00:28:10] [INFO ] Implicit Places using invariants and state equation in 7579 ms returned []
Implicit Place search using SMT with State Equation took 8490 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1169/1233 places, 2593/2772 transitions.
Finished structural reductions, in 2 iterations. Remains : 1169/1233 places, 2593/2772 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 7}, { cond=p0, acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s670 1) (GEQ s1136 1)), p0:(GEQ s528 1), p1:(AND (LT s528 1) (NOT (AND (GEQ s373 1) (GEQ s602 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1377 reset in 450 ms.
Product exploration explored 100000 steps with 1379 reset in 454 ms.
Computed a total of 337 stabilizing places and 960 stable transitions
Computed a total of 337 stabilizing places and 960 stable transitions
Detected a total of 337/1169 stabilizing places and 960/2593 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT p2))), true, (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 570 ms. Reduced automaton from 9 states, 14 edges and 3 AP to 9 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 137 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-18 00:28:13] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:28:13] [INFO ] Computed 48 place invariants in 24 ms
[2022-05-18 00:28:13] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2022-05-18 00:28:13] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 11 ms returned sat
[2022-05-18 00:28:14] [INFO ] After 957ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-18 00:28:14] [INFO ] [Nat]Absence check using 31 positive place invariants in 23 ms returned sat
[2022-05-18 00:28:14] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 10 ms returned sat
[2022-05-18 00:28:15] [INFO ] After 945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-18 00:28:15] [INFO ] State equation strengthened by 848 read => feed constraints.
[2022-05-18 00:28:15] [INFO ] After 623ms SMT Verify possible using 848 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-18 00:28:17] [INFO ] Deduced a trap composed of 311 places in 442 ms of which 1 ms to minimize.
[2022-05-18 00:28:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 785 ms
[2022-05-18 00:28:17] [INFO ] Deduced a trap composed of 406 places in 457 ms of which 1 ms to minimize.
[2022-05-18 00:28:18] [INFO ] Deduced a trap composed of 137 places in 484 ms of which 1 ms to minimize.
[2022-05-18 00:28:19] [INFO ] Deduced a trap composed of 120 places in 454 ms of which 1 ms to minimize.
[2022-05-18 00:28:19] [INFO ] Deduced a trap composed of 103 places in 450 ms of which 1 ms to minimize.
[2022-05-18 00:28:20] [INFO ] Deduced a trap composed of 91 places in 459 ms of which 1 ms to minimize.
[2022-05-18 00:28:20] [INFO ] Deduced a trap composed of 414 places in 473 ms of which 1 ms to minimize.
[2022-05-18 00:28:21] [INFO ] Deduced a trap composed of 174 places in 456 ms of which 1 ms to minimize.
[2022-05-18 00:28:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3861 ms
[2022-05-18 00:28:21] [INFO ] After 6164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 538 ms.
[2022-05-18 00:28:22] [INFO ] After 7959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 1169 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1169/1169 places, 2593/2593 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 1169 transition count 2566
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1142 transition count 2566
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 54 place count 1142 transition count 2552
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 82 place count 1128 transition count 2552
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 118 place count 1110 transition count 2534
Free-agglomeration rule (complex) applied 126 times.
Iterating global reduction 2 with 126 rules applied. Total rules applied 244 place count 1110 transition count 3248
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 370 place count 984 transition count 3248
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 984 transition count 3248
Applied a total of 371 rules in 284 ms. Remains 984 /1169 variables (removed 185) and now considering 3248/2593 (removed -655) transitions.
Finished structural reductions, in 1 iterations. Remains : 984/1169 places, 3248/2593 transitions.
Incomplete random walk after 10000 steps, including 222 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 71754 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71754 steps, saw 30159 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-18 00:28:25] [INFO ] Flow matrix only has 2856 transitions (discarded 392 similar events)
// Phase 1: matrix 2856 rows 984 cols
[2022-05-18 00:28:25] [INFO ] Computed 48 place invariants in 24 ms
[2022-05-18 00:28:26] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-18 00:28:26] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 00:28:26] [INFO ] After 958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-18 00:28:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:28:26] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 00:28:28] [INFO ] After 1008ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-18 00:28:28] [INFO ] State equation strengthened by 1688 read => feed constraints.
[2022-05-18 00:28:28] [INFO ] After 847ms SMT Verify possible using 1688 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-18 00:28:30] [INFO ] Deduced a trap composed of 165 places in 412 ms of which 1 ms to minimize.
[2022-05-18 00:28:31] [INFO ] Deduced a trap composed of 66 places in 448 ms of which 1 ms to minimize.
[2022-05-18 00:28:31] [INFO ] Deduced a trap composed of 86 places in 449 ms of which 1 ms to minimize.
[2022-05-18 00:28:32] [INFO ] Deduced a trap composed of 93 places in 458 ms of which 1 ms to minimize.
[2022-05-18 00:28:32] [INFO ] Deduced a trap composed of 94 places in 444 ms of which 1 ms to minimize.
[2022-05-18 00:28:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2694 ms
[2022-05-18 00:28:33] [INFO ] After 5163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 811 ms.
[2022-05-18 00:28:34] [INFO ] After 7261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 984 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 984/984 places, 3248/3248 transitions.
Applied a total of 0 rules in 95 ms. Remains 984 /984 variables (removed 0) and now considering 3248/3248 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 984/984 places, 3248/3248 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 984/984 places, 3248/3248 transitions.
Applied a total of 0 rules in 73 ms. Remains 984 /984 variables (removed 0) and now considering 3248/3248 (removed 0) transitions.
[2022-05-18 00:28:34] [INFO ] Flow matrix only has 2856 transitions (discarded 392 similar events)
// Phase 1: matrix 2856 rows 984 cols
[2022-05-18 00:28:34] [INFO ] Computed 48 place invariants in 29 ms
[2022-05-18 00:28:35] [INFO ] Implicit Places using invariants in 898 ms returned []
[2022-05-18 00:28:35] [INFO ] Flow matrix only has 2856 transitions (discarded 392 similar events)
// Phase 1: matrix 2856 rows 984 cols
[2022-05-18 00:28:35] [INFO ] Computed 48 place invariants in 23 ms
[2022-05-18 00:28:35] [INFO ] State equation strengthened by 1688 read => feed constraints.
[2022-05-18 00:28:52] [INFO ] Implicit Places using invariants and state equation in 17260 ms returned []
Implicit Place search using SMT with State Equation took 18160 ms to find 0 implicit places.
[2022-05-18 00:28:52] [INFO ] Redundant transitions in 120 ms returned []
[2022-05-18 00:28:52] [INFO ] Flow matrix only has 2856 transitions (discarded 392 similar events)
// Phase 1: matrix 2856 rows 984 cols
[2022-05-18 00:28:52] [INFO ] Computed 48 place invariants in 32 ms
[2022-05-18 00:28:53] [INFO ] Dead Transitions using invariants and state equation in 1128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 984/984 places, 3248/3248 transitions.
Graph (trivial) has 1045 edges and 984 vertex of which 16 / 984 are part of one of the 1 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 267 transitions
Ensure Unique test removed 379 transitions
Reduce isomorphic transitions removed 646 transitions.
Graph (complete) has 3846 edges and 969 vertex of which 955 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 t1235.t1429 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 938 transition count 2518
Reduce places removed 82 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 1 with 225 rules applied. Total rules applied 311 place count 856 transition count 2375
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 177 rules applied. Total rules applied 488 place count 785 transition count 2269
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 112 rules applied. Total rules applied 600 place count 741 transition count 2201
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 4 with 71 rules applied. Total rules applied 671 place count 708 transition count 2163
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 22 rules applied. Total rules applied 693 place count 694 transition count 2155
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 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 6 with 7 rules applied. Total rules applied 700 place count 691 transition count 2151
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 7 with 8 rules applied. Total rules applied 708 place count 690 transition count 2144
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 714 place count 684 transition count 2144
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 714 place count 684 transition count 2130
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 28 rules applied. Total rules applied 742 place count 670 transition count 2130
Discarding 218 places :
Symmetric choice reduction at 9 with 218 rule applications. Total rules 960 place count 452 transition count 1249
Iterating global reduction 9 with 218 rules applied. Total rules applied 1178 place count 452 transition count 1249
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 9 with 183 rules applied. Total rules applied 1361 place count 452 transition count 1066
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1364 place count 449 transition count 1066
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1364 place count 449 transition count 1065
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1366 place count 448 transition count 1065
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1369 place count 445 transition count 1062
Iterating global reduction 11 with 3 rules applied. Total rules applied 1372 place count 445 transition count 1062
Performed 308 Post agglomeration using F-continuation condition.Transition count delta: 308
Deduced a syphon composed of 308 places in 0 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 11 with 616 rules applied. Total rules applied 1988 place count 137 transition count 754
Drop transitions removed 298 transitions
Reduce isomorphic transitions removed 298 transitions.
Iterating post reduction 11 with 298 rules applied. Total rules applied 2286 place count 137 transition count 456
Discarding 56 places :
Symmetric choice reduction at 12 with 56 rule applications. Total rules 2342 place count 81 transition count 182
Iterating global reduction 12 with 56 rules applied. Total rules applied 2398 place count 81 transition count 182
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 12 with 33 rules applied. Total rules applied 2431 place count 81 transition count 149
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 2435 place count 77 transition count 131
Iterating global reduction 13 with 4 rules applied. Total rules applied 2439 place count 77 transition count 131
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 2448 place count 77 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 2448 place count 77 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2450 place count 76 transition count 121
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 2459 place count 67 transition count 94
Iterating global reduction 13 with 9 rules applied. Total rules applied 2468 place count 67 transition count 94
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 13 with 19 rules applied. Total rules applied 2487 place count 67 transition count 75
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 2489 place count 65 transition count 72
Iterating global reduction 14 with 2 rules applied. Total rules applied 2491 place count 65 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2493 place count 64 transition count 77
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 2494 place count 64 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 2495 place count 63 transition count 76
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 15 with 26 rules applied. Total rules applied 2521 place count 63 transition count 76
Applied a total of 2521 rules in 596 ms. Remains 63 /984 variables (removed 921) and now considering 76/3248 (removed 3172) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 76 rows 63 cols
[2022-05-18 00:28:54] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-18 00:28:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 00:28:54] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:28:54] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-18 00:28:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-18 00:28:54] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:28:54] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-18 00:28:54] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-18 00:28:54] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-18 00:28:54] [INFO ] Flatten gal took : 5 ms
[2022-05-18 00:28:54] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:28:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11198782895029972316.gal : 1 ms
[2022-05-18 00:28:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17669477697773574895.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11818884701187506899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11198782895029972316.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17669477697773574895.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17669477697773574895.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 12
Reachability property apf6 is true.
Reachability property apf5 is true.
Reachability property apf3 is true.
Reachability property apf2 is true.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :12 after 23
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :23 after 48
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :48 after 75
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :75 after 164
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :164 after 355
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :355 after 661
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :661 after 6578
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,22062,0.076948,5940,2,1646,14,8092,7,0,313,4478,0
Total reachable state count : 22062

Verifying 5 reachability properties.
Reachability property apf2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,1,0.077692,5940,2,64,14,8092,8,0,320,4478,0
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,1,0.078069,6204,2,64,14,8092,9,0,320,4478,0
Reachability property apf4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf4,1,0.078884,6204,2,64,14,8092,9,0,323,4478,0
Reachability property apf5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,349,0.079302,6204,2,392,14,8092,10,0,323,4478,0
Reachability property apf6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf6,349,0.079631,6204,2,392,14,8092,10,0,323,4478,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT p2))), true, (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 11 factoid took 553 ms. Reduced automaton from 9 states, 14 edges and 3 AP to 9 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 291 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 282 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2022-05-18 00:28:55] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:28:55] [INFO ] Computed 48 place invariants in 21 ms
[2022-05-18 00:28:57] [INFO ] [Real]Absence check using 31 positive place invariants in 27 ms returned sat
[2022-05-18 00:28:57] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 27 ms returned sat
[2022-05-18 00:28:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:28:59] [INFO ] [Real]Absence check using state equation in 2213 ms returned sat
[2022-05-18 00:28:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:29:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 80 ms returned sat
[2022-05-18 00:29:01] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 19 ms returned sat
[2022-05-18 00:29:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:29:03] [INFO ] [Nat]Absence check using state equation in 1568 ms returned sat
[2022-05-18 00:29:03] [INFO ] State equation strengthened by 848 read => feed constraints.
[2022-05-18 00:29:03] [INFO ] [Nat]Added 848 Read/Feed constraints in 194 ms returned sat
[2022-05-18 00:29:04] [INFO ] Deduced a trap composed of 340 places in 460 ms of which 2 ms to minimize.
[2022-05-18 00:29:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 822 ms
[2022-05-18 00:29:04] [INFO ] Computed and/alt/rep : 1936/3222/1936 causal constraints (skipped 368 transitions) in 109 ms.
[2022-05-18 00:29:07] [INFO ] Added : 121 causal constraints over 25 iterations in 3227 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 1169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1169/1169 places, 2593/2593 transitions.
Applied a total of 0 rules in 35 ms. Remains 1169 /1169 variables (removed 0) and now considering 2593/2593 (removed 0) transitions.
[2022-05-18 00:29:07] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:29:07] [INFO ] Computed 48 place invariants in 23 ms
[2022-05-18 00:29:08] [INFO ] Implicit Places using invariants in 884 ms returned []
[2022-05-18 00:29:08] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:29:08] [INFO ] Computed 48 place invariants in 18 ms
[2022-05-18 00:29:09] [INFO ] State equation strengthened by 848 read => feed constraints.
[2022-05-18 00:29:16] [INFO ] Implicit Places using invariants and state equation in 7917 ms returned []
Implicit Place search using SMT with State Equation took 8803 ms to find 0 implicit places.
[2022-05-18 00:29:16] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:29:16] [INFO ] Computed 48 place invariants in 24 ms
[2022-05-18 00:29:17] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1169/1169 places, 2593/2593 transitions.
Computed a total of 337 stabilizing places and 960 stable transitions
Computed a total of 337 stabilizing places and 960 stable transitions
Detected a total of 337/1169 stabilizing places and 960/2593 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT p2))), true, (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 545 ms. Reduced automaton from 9 states, 14 edges and 3 AP to 9 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 137 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-18 00:29:18] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:29:18] [INFO ] Computed 48 place invariants in 17 ms
[2022-05-18 00:29:19] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2022-05-18 00:29:19] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 11 ms returned sat
[2022-05-18 00:29:19] [INFO ] After 964ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-18 00:29:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 23 ms returned sat
[2022-05-18 00:29:20] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 10 ms returned sat
[2022-05-18 00:29:21] [INFO ] After 980ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-18 00:29:21] [INFO ] State equation strengthened by 848 read => feed constraints.
[2022-05-18 00:29:21] [INFO ] After 634ms SMT Verify possible using 848 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-18 00:29:23] [INFO ] Deduced a trap composed of 311 places in 434 ms of which 1 ms to minimize.
[2022-05-18 00:29:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 776 ms
[2022-05-18 00:29:23] [INFO ] Deduced a trap composed of 406 places in 439 ms of which 1 ms to minimize.
[2022-05-18 00:29:24] [INFO ] Deduced a trap composed of 137 places in 487 ms of which 1 ms to minimize.
[2022-05-18 00:29:24] [INFO ] Deduced a trap composed of 120 places in 451 ms of which 1 ms to minimize.
[2022-05-18 00:29:25] [INFO ] Deduced a trap composed of 103 places in 442 ms of which 1 ms to minimize.
[2022-05-18 00:29:25] [INFO ] Deduced a trap composed of 91 places in 455 ms of which 1 ms to minimize.
[2022-05-18 00:29:26] [INFO ] Deduced a trap composed of 414 places in 465 ms of which 1 ms to minimize.
[2022-05-18 00:29:27] [INFO ] Deduced a trap composed of 174 places in 455 ms of which 1 ms to minimize.
[2022-05-18 00:29:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3812 ms
[2022-05-18 00:29:27] [INFO ] After 6115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 524 ms.
[2022-05-18 00:29:27] [INFO ] After 7960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 1169 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1169/1169 places, 2593/2593 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 1169 transition count 2566
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1142 transition count 2566
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 54 place count 1142 transition count 2552
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 82 place count 1128 transition count 2552
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 118 place count 1110 transition count 2534
Free-agglomeration rule (complex) applied 126 times.
Iterating global reduction 2 with 126 rules applied. Total rules applied 244 place count 1110 transition count 3248
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 370 place count 984 transition count 3248
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 984 transition count 3248
Applied a total of 371 rules in 408 ms. Remains 984 /1169 variables (removed 185) and now considering 3248/2593 (removed -655) transitions.
Finished structural reductions, in 1 iterations. Remains : 984/1169 places, 3248/2593 transitions.
Incomplete random walk after 10000 steps, including 223 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 70621 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70621 steps, saw 29662 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-18 00:29:31] [INFO ] Flow matrix only has 2856 transitions (discarded 392 similar events)
// Phase 1: matrix 2856 rows 984 cols
[2022-05-18 00:29:31] [INFO ] Computed 48 place invariants in 23 ms
[2022-05-18 00:29:32] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-18 00:29:32] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 6 ms returned sat
[2022-05-18 00:29:32] [INFO ] After 1015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-18 00:29:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2022-05-18 00:29:33] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 00:29:34] [INFO ] After 1017ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-18 00:29:34] [INFO ] State equation strengthened by 1688 read => feed constraints.
[2022-05-18 00:29:35] [INFO ] After 853ms SMT Verify possible using 1688 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-18 00:29:36] [INFO ] Deduced a trap composed of 165 places in 411 ms of which 1 ms to minimize.
[2022-05-18 00:29:37] [INFO ] Deduced a trap composed of 66 places in 452 ms of which 1 ms to minimize.
[2022-05-18 00:29:38] [INFO ] Deduced a trap composed of 86 places in 446 ms of which 1 ms to minimize.
[2022-05-18 00:29:38] [INFO ] Deduced a trap composed of 93 places in 445 ms of which 1 ms to minimize.
[2022-05-18 00:29:39] [INFO ] Deduced a trap composed of 94 places in 437 ms of which 1 ms to minimize.
[2022-05-18 00:29:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2688 ms
[2022-05-18 00:29:39] [INFO ] After 5170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 798 ms.
[2022-05-18 00:29:40] [INFO ] After 7249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 984 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 984/984 places, 3248/3248 transitions.
Applied a total of 0 rules in 73 ms. Remains 984 /984 variables (removed 0) and now considering 3248/3248 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 984/984 places, 3248/3248 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 984/984 places, 3248/3248 transitions.
Applied a total of 0 rules in 73 ms. Remains 984 /984 variables (removed 0) and now considering 3248/3248 (removed 0) transitions.
[2022-05-18 00:29:40] [INFO ] Flow matrix only has 2856 transitions (discarded 392 similar events)
// Phase 1: matrix 2856 rows 984 cols
[2022-05-18 00:29:40] [INFO ] Computed 48 place invariants in 33 ms
[2022-05-18 00:29:41] [INFO ] Implicit Places using invariants in 888 ms returned []
[2022-05-18 00:29:41] [INFO ] Flow matrix only has 2856 transitions (discarded 392 similar events)
// Phase 1: matrix 2856 rows 984 cols
[2022-05-18 00:29:41] [INFO ] Computed 48 place invariants in 21 ms
[2022-05-18 00:29:41] [INFO ] State equation strengthened by 1688 read => feed constraints.
[2022-05-18 00:29:56] [INFO ] Implicit Places using invariants and state equation in 15672 ms returned []
Implicit Place search using SMT with State Equation took 16562 ms to find 0 implicit places.
[2022-05-18 00:29:57] [INFO ] Redundant transitions in 118 ms returned []
[2022-05-18 00:29:57] [INFO ] Flow matrix only has 2856 transitions (discarded 392 similar events)
// Phase 1: matrix 2856 rows 984 cols
[2022-05-18 00:29:57] [INFO ] Computed 48 place invariants in 29 ms
[2022-05-18 00:29:58] [INFO ] Dead Transitions using invariants and state equation in 1104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 984/984 places, 3248/3248 transitions.
Graph (trivial) has 1045 edges and 984 vertex of which 16 / 984 are part of one of the 1 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 267 transitions
Ensure Unique test removed 379 transitions
Reduce isomorphic transitions removed 646 transitions.
Graph (complete) has 3846 edges and 969 vertex of which 955 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 t1235.t1429 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 938 transition count 2518
Reduce places removed 82 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 1 with 225 rules applied. Total rules applied 311 place count 856 transition count 2375
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 177 rules applied. Total rules applied 488 place count 785 transition count 2269
Reduce places removed 44 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 112 rules applied. Total rules applied 600 place count 741 transition count 2201
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 4 with 71 rules applied. Total rules applied 671 place count 708 transition count 2163
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 22 rules applied. Total rules applied 693 place count 694 transition count 2155
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 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 6 with 7 rules applied. Total rules applied 700 place count 691 transition count 2151
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 7 with 8 rules applied. Total rules applied 708 place count 690 transition count 2144
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 714 place count 684 transition count 2144
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 714 place count 684 transition count 2130
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 28 rules applied. Total rules applied 742 place count 670 transition count 2130
Discarding 218 places :
Symmetric choice reduction at 9 with 218 rule applications. Total rules 960 place count 452 transition count 1249
Iterating global reduction 9 with 218 rules applied. Total rules applied 1178 place count 452 transition count 1249
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 9 with 183 rules applied. Total rules applied 1361 place count 452 transition count 1066
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1364 place count 449 transition count 1066
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1364 place count 449 transition count 1065
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1366 place count 448 transition count 1065
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1369 place count 445 transition count 1062
Iterating global reduction 11 with 3 rules applied. Total rules applied 1372 place count 445 transition count 1062
Performed 308 Post agglomeration using F-continuation condition.Transition count delta: 308
Deduced a syphon composed of 308 places in 0 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 11 with 616 rules applied. Total rules applied 1988 place count 137 transition count 754
Drop transitions removed 298 transitions
Reduce isomorphic transitions removed 298 transitions.
Iterating post reduction 11 with 298 rules applied. Total rules applied 2286 place count 137 transition count 456
Discarding 56 places :
Symmetric choice reduction at 12 with 56 rule applications. Total rules 2342 place count 81 transition count 182
Iterating global reduction 12 with 56 rules applied. Total rules applied 2398 place count 81 transition count 182
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 12 with 33 rules applied. Total rules applied 2431 place count 81 transition count 149
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 2435 place count 77 transition count 131
Iterating global reduction 13 with 4 rules applied. Total rules applied 2439 place count 77 transition count 131
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 2448 place count 77 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 2448 place count 77 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2450 place count 76 transition count 121
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 2459 place count 67 transition count 94
Iterating global reduction 13 with 9 rules applied. Total rules applied 2468 place count 67 transition count 94
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 13 with 19 rules applied. Total rules applied 2487 place count 67 transition count 75
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 2489 place count 65 transition count 72
Iterating global reduction 14 with 2 rules applied. Total rules applied 2491 place count 65 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2493 place count 64 transition count 77
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 2494 place count 64 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 2495 place count 63 transition count 76
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 15 with 26 rules applied. Total rules applied 2521 place count 63 transition count 76
Applied a total of 2521 rules in 585 ms. Remains 63 /984 variables (removed 921) and now considering 76/3248 (removed 3172) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 76 rows 63 cols
[2022-05-18 00:29:58] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-18 00:29:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 00:29:58] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:29:58] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-18 00:29:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 00:29:58] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:29:58] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-18 00:29:58] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-18 00:29:58] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-18 00:29:58] [INFO ] Flatten gal took : 3 ms
[2022-05-18 00:29:58] [INFO ] Flatten gal took : 5 ms
[2022-05-18 00:29:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6936017487989372322.gal : 2 ms
[2022-05-18 00:29:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5332745720427936535.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12231182698227579717;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6936017487989372322.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5332745720427936535.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality5332745720427936535.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 12
Reachability property apf6 is true.
Reachability property apf5 is true.
Reachability property apf3 is true.
Reachability property apf2 is true.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :12 after 23
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :23 after 48
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :48 after 75
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :75 after 164
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :164 after 355
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :355 after 661
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :661 after 6578
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,22062,0.071667,5940,2,1646,14,8092,7,0,313,4477,0
Total reachable state count : 22062

Verifying 5 reachability properties.
Reachability property apf2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,1,0.072411,5940,2,64,14,8092,8,0,320,4477,0
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,1,0.072783,6204,2,64,14,8092,9,0,320,4477,0
Reachability property apf4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf4,1,0.073638,6204,2,64,14,8092,9,0,323,4477,0
Reachability property apf5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,349,0.074095,6204,2,392,14,8092,10,0,323,4477,0
Reachability property apf6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf6,349,0.074417,6204,2,392,14,8092,10,0,323,4477,0
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT p2))), true, (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 11 factoid took 527 ms. Reduced automaton from 9 states, 14 edges and 3 AP to 9 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2022-05-18 00:30:00] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:30:00] [INFO ] Computed 48 place invariants in 25 ms
[2022-05-18 00:30:02] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2022-05-18 00:30:02] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 36 ms returned sat
[2022-05-18 00:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:30:04] [INFO ] [Real]Absence check using state equation in 2223 ms returned sat
[2022-05-18 00:30:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:30:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 81 ms returned sat
[2022-05-18 00:30:06] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 19 ms returned sat
[2022-05-18 00:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:30:07] [INFO ] [Nat]Absence check using state equation in 1591 ms returned sat
[2022-05-18 00:30:07] [INFO ] State equation strengthened by 848 read => feed constraints.
[2022-05-18 00:30:08] [INFO ] [Nat]Added 848 Read/Feed constraints in 190 ms returned sat
[2022-05-18 00:30:08] [INFO ] Deduced a trap composed of 340 places in 461 ms of which 1 ms to minimize.
[2022-05-18 00:30:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 817 ms
[2022-05-18 00:30:09] [INFO ] Computed and/alt/rep : 1936/3222/1936 causal constraints (skipped 368 transitions) in 122 ms.
[2022-05-18 00:30:12] [INFO ] Added : 121 causal constraints over 25 iterations in 3184 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1374 reset in 424 ms.
Product exploration explored 100000 steps with 1378 reset in 439 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, false, false]
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 1169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1169/1169 places, 2593/2593 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1169 transition count 2593
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 27 place count 1169 transition count 2594
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 41 place count 1169 transition count 2594
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 1156 transition count 2581
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 1156 transition count 2581
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 2 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 1156 transition count 2581
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 1154 transition count 2579
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 1154 transition count 2579
Deduced a syphon composed of 44 places in 1 ms
Applied a total of 89 rules in 504 ms. Remains 1154 /1169 variables (removed 15) and now considering 2579/2593 (removed 14) transitions.
[2022-05-18 00:30:14] [INFO ] Redundant transitions in 81 ms returned []
[2022-05-18 00:30:14] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1154 cols
[2022-05-18 00:30:14] [INFO ] Computed 48 place invariants in 19 ms
[2022-05-18 00:30:15] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1154/1169 places, 2579/2593 transitions.
Finished structural reductions, in 1 iterations. Remains : 1154/1169 places, 2579/2593 transitions.
Product exploration explored 100000 steps with 1952 reset in 843 ms.
Product exploration explored 100000 steps with 1949 reset in 849 ms.
Built C files in :
/tmp/ltsmin12191036884229857824
[2022-05-18 00:30:16] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12191036884229857824
Running compilation step : cd /tmp/ltsmin12191036884229857824;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12191036884229857824;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12191036884229857824;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 1169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1169/1169 places, 2593/2593 transitions.
Applied a total of 0 rules in 37 ms. Remains 1169 /1169 variables (removed 0) and now considering 2593/2593 (removed 0) transitions.
[2022-05-18 00:30:20] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:30:20] [INFO ] Computed 48 place invariants in 18 ms
[2022-05-18 00:30:21] [INFO ] Implicit Places using invariants in 1187 ms returned []
[2022-05-18 00:30:21] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:30:21] [INFO ] Computed 48 place invariants in 18 ms
[2022-05-18 00:30:21] [INFO ] State equation strengthened by 848 read => feed constraints.
[2022-05-18 00:30:28] [INFO ] Implicit Places using invariants and state equation in 7560 ms returned []
Implicit Place search using SMT with State Equation took 8748 ms to find 0 implicit places.
[2022-05-18 00:30:28] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2022-05-18 00:30:28] [INFO ] Computed 48 place invariants in 26 ms
[2022-05-18 00:30:29] [INFO ] Dead Transitions using invariants and state equation in 980 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1169/1169 places, 2593/2593 transitions.
Built C files in :
/tmp/ltsmin12089854480766331841
[2022-05-18 00:30:29] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12089854480766331841
Running compilation step : cd /tmp/ltsmin12089854480766331841;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12089854480766331841;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12089854480766331841;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 00:30:32] [INFO ] Flatten gal took : 81 ms
[2022-05-18 00:30:32] [INFO ] Flatten gal took : 72 ms
[2022-05-18 00:30:33] [INFO ] Time to serialize gal into /tmp/LTL692383443272086242.gal : 18 ms
[2022-05-18 00:30:33] [INFO ] Time to serialize properties into /tmp/LTL9084144543110370735.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL692383443272086242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9084144543110370735.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6923834...265
Read 1 LTL properties
Checking formula 0 : !((X((("(Node6HasTheLeafSetOfLx6ToReplaceNode2>=1)")U(X(X((G("((Node6HasTheLeafSetOfLx6ToReplaceNode2<1)&&(!((Node3IsTheNodeMaster>=1)...334
Formula 0 simplified : !X(("(Node6HasTheLeafSetOfLx6ToReplaceNode2>=1)" U XX("(Node6HasTheLeafSetOfLx6ToReplaceNode2>=1)" | G"((Node6HasTheLeafSetOfLx6ToRe...323
Detected timeout of ITS tools.
[2022-05-18 00:30:48] [INFO ] Flatten gal took : 79 ms
[2022-05-18 00:30:48] [INFO ] Applying decomposition
[2022-05-18 00:30:48] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14984824714754501666.txt' '-o' '/tmp/graph14984824714754501666.bin' '-w' '/tmp/graph14984824714754501666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14984824714754501666.bin' '-l' '-1' '-v' '-w' '/tmp/graph14984824714754501666.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:30:48] [INFO ] Decomposing Gal with order
[2022-05-18 00:30:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:30:48] [INFO ] Removed a total of 1903 redundant transitions.
[2022-05-18 00:30:48] [INFO ] Flatten gal took : 165 ms
[2022-05-18 00:30:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 1511 labels/synchronizations in 55 ms.
[2022-05-18 00:30:48] [INFO ] Time to serialize gal into /tmp/LTL18293211476898468414.gal : 15 ms
[2022-05-18 00:30:48] [INFO ] Time to serialize properties into /tmp/LTL8240139015648184177.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18293211476898468414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8240139015648184177.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1829321...246
Read 1 LTL properties
Checking formula 0 : !((X((("(i4.i5.u91.Node6HasTheLeafSetOfLx6ToReplaceNode2>=1)")U(X(X((G("((i4.i5.u91.Node6HasTheLeafSetOfLx6ToReplaceNode2<1)&&(!((i0.u...396
Formula 0 simplified : !X(("(i4.i5.u91.Node6HasTheLeafSetOfLx6ToReplaceNode2>=1)" U XX("(i4.i5.u91.Node6HasTheLeafSetOfLx6ToReplaceNode2>=1)" | G"((i4.i5.u...385
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7216378662687392927
[2022-05-18 00:31:03] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7216378662687392927
Running compilation step : cd /tmp/ltsmin7216378662687392927;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7216378662687392927;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7216378662687392927;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-13 finished in 186096 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(p0)))||!(p1 U G(X(X(p2))))))'
Support contains 6 out of 1233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1233/1233 places, 2772/2772 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1220 transition count 2735
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1220 transition count 2735
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1211 transition count 2696
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1211 transition count 2696
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1207 transition count 2668
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1207 transition count 2668
Applied a total of 52 rules in 157 ms. Remains 1207 /1233 variables (removed 26) and now considering 2668/2772 (removed 104) transitions.
[2022-05-18 00:31:06] [INFO ] Flow matrix only has 2396 transitions (discarded 272 similar events)
// Phase 1: matrix 2396 rows 1207 cols
[2022-05-18 00:31:07] [INFO ] Computed 59 place invariants in 25 ms
[2022-05-18 00:31:07] [INFO ] Implicit Places using invariants in 921 ms returned [295, 382, 496, 535, 603, 612, 621, 659, 679, 785, 903, 1012]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 924 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1195/1233 places, 2668/2772 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1187 transition count 2660
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1187 transition count 2660
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1179 transition count 2652
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1179 transition count 2652
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1171 transition count 2644
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1171 transition count 2644
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 1163 transition count 2588
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 1163 transition count 2588
Applied a total of 64 rules in 238 ms. Remains 1163 /1195 variables (removed 32) and now considering 2588/2668 (removed 80) transitions.
[2022-05-18 00:31:08] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
// Phase 1: matrix 2316 rows 1163 cols
[2022-05-18 00:31:08] [INFO ] Computed 47 place invariants in 20 ms
[2022-05-18 00:31:08] [INFO ] Implicit Places using invariants in 846 ms returned []
[2022-05-18 00:31:09] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
// Phase 1: matrix 2316 rows 1163 cols
[2022-05-18 00:31:09] [INFO ] Computed 47 place invariants in 18 ms
[2022-05-18 00:31:09] [INFO ] State equation strengthened by 848 read => feed constraints.
[2022-05-18 00:31:18] [INFO ] Implicit Places using invariants and state equation in 9488 ms returned []
Implicit Place search using SMT with State Equation took 10334 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1163/1233 places, 2588/2772 transitions.
Finished structural reductions, in 2 iterations. Remains : 1163/1233 places, 2588/2772 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s559 1) (GEQ s1133 1)), p0:(OR (LT s647 1) (LT s1115 1)), p2:(AND (GEQ s670 1) (GEQ s1136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1085 ms.
Product exploration explored 100000 steps with 33333 reset in 1096 ms.
Computed a total of 331 stabilizing places and 955 stable transitions
Computed a total of 331 stabilizing places and 955 stable transitions
Detected a total of 331/1163 stabilizing places and 955/2588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0 (NOT p2))
Knowledge based reduction with 9 factoid took 305 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-14 finished in 14305 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(!(!X(p0) U p1)))))'
Found a CL insensitive property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-08
Stuttering acceptance computed with spot in 121 ms :[p1, p1, (AND p1 (NOT p0))]
Support contains 6 out of 1233 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1233/1233 places, 2772/2772 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 1233 transition count 2745
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1206 transition count 2745
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 54 place count 1206 transition count 2727
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 90 place count 1188 transition count 2727
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 102 place count 1176 transition count 2673
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 1176 transition count 2673
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 114 place count 1176 transition count 2672
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 116 place count 1175 transition count 2672
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 1170 transition count 2637
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 1170 transition count 2637
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 176 place count 1145 transition count 2612
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 180 place count 1141 transition count 2608
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 1141 transition count 2608
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 188 place count 1137 transition count 2580
Iterating global reduction 2 with 4 rules applied. Total rules applied 192 place count 1137 transition count 2580
Applied a total of 192 rules in 335 ms. Remains 1137 /1233 variables (removed 96) and now considering 2580/2772 (removed 192) transitions.
[2022-05-18 00:31:21] [INFO ] Flow matrix only has 2308 transitions (discarded 272 similar events)
// Phase 1: matrix 2308 rows 1137 cols
[2022-05-18 00:31:21] [INFO ] Computed 59 place invariants in 29 ms
[2022-05-18 00:31:22] [INFO ] Implicit Places using invariants in 892 ms returned [264, 349, 460, 497, 569, 578, 614, 735, 850, 957]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 894 ms to find 10 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1127/1233 places, 2580/2772 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1123 transition count 2576
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1123 transition count 2576
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 1119 transition count 2572
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 1119 transition count 2572
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 1115 transition count 2544
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 1115 transition count 2544
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1111 transition count 2540
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1107 transition count 2536
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1107 transition count 2536
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 1103 transition count 2508
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 1103 transition count 2508
Applied a total of 48 rules in 343 ms. Remains 1103 /1127 variables (removed 24) and now considering 2508/2580 (removed 72) transitions.
[2022-05-18 00:31:22] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1103 cols
[2022-05-18 00:31:22] [INFO ] Computed 49 place invariants in 60 ms
[2022-05-18 00:31:23] [INFO ] Implicit Places using invariants in 921 ms returned []
[2022-05-18 00:31:23] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1103 cols
[2022-05-18 00:31:23] [INFO ] Computed 49 place invariants in 34 ms
[2022-05-18 00:31:24] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:31:32] [INFO ] Implicit Places using invariants and state equation in 8363 ms returned []
Implicit Place search using SMT with State Equation took 9284 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1103/1233 places, 2508/2772 transitions.
Finished structural reductions, in 2 iterations. Remains : 1103/1233 places, 2508/2772 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s448 1) (GEQ s785 1)), p0:(AND (GEQ s2 1) (GEQ s549 1) (GEQ s615 1) (GEQ s616 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1976 reset in 528 ms.
Product exploration explored 100000 steps with 1976 reset in 530 ms.
Computed a total of 288 stabilizing places and 892 stable transitions
Computed a total of 288 stabilizing places and 892 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 257 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[p1, p1, (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 195 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:31:33] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1103 cols
[2022-05-18 00:31:33] [INFO ] Computed 49 place invariants in 34 ms
[2022-05-18 00:31:34] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2022-05-18 00:31:34] [INFO ] [Real]Absence check using 33 positive and 16 generalized place invariants in 4 ms returned sat
[2022-05-18 00:31:35] [INFO ] After 1051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:31:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2022-05-18 00:31:35] [INFO ] [Nat]Absence check using 33 positive and 16 generalized place invariants in 5 ms returned sat
[2022-05-18 00:31:36] [INFO ] After 936ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:31:36] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:31:36] [INFO ] After 341ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:31:37] [INFO ] Deduced a trap composed of 86 places in 470 ms of which 1 ms to minimize.
[2022-05-18 00:31:37] [INFO ] Deduced a trap composed of 389 places in 425 ms of which 0 ms to minimize.
[2022-05-18 00:31:38] [INFO ] Deduced a trap composed of 86 places in 419 ms of which 1 ms to minimize.
[2022-05-18 00:31:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1600 ms
[2022-05-18 00:31:38] [INFO ] After 2262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 237 ms.
[2022-05-18 00:31:38] [INFO ] After 3631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 1103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1103/1103 places, 2508/2508 transitions.
Free-agglomeration rule (complex) applied 127 times.
Iterating global reduction 0 with 127 rules applied. Total rules applied 127 place count 1103 transition count 2381
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 254 place count 976 transition count 2381
Applied a total of 254 rules in 132 ms. Remains 976 /1103 variables (removed 127) and now considering 2381/2508 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 976/1103 places, 2381/2508 transitions.
Incomplete random walk after 10000 steps, including 206 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 88065 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88065 steps, saw 37047 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:31:41] [INFO ] Flow matrix only has 1984 transitions (discarded 397 similar events)
// Phase 1: matrix 1984 rows 976 cols
[2022-05-18 00:31:42] [INFO ] Computed 49 place invariants in 37 ms
[2022-05-18 00:31:42] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2022-05-18 00:31:42] [INFO ] [Real]Absence check using 33 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 00:31:43] [INFO ] After 957ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:31:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2022-05-18 00:31:43] [INFO ] [Nat]Absence check using 33 positive and 16 generalized place invariants in 4 ms returned sat
[2022-05-18 00:31:44] [INFO ] After 988ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:31:44] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:31:44] [INFO ] After 473ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:31:45] [INFO ] After 810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 291 ms.
[2022-05-18 00:31:45] [INFO ] After 2293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 976 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 976/976 places, 2381/2381 transitions.
Applied a total of 0 rules in 52 ms. Remains 976 /976 variables (removed 0) and now considering 2381/2381 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 976/976 places, 2381/2381 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 976/976 places, 2381/2381 transitions.
Applied a total of 0 rules in 58 ms. Remains 976 /976 variables (removed 0) and now considering 2381/2381 (removed 0) transitions.
[2022-05-18 00:31:45] [INFO ] Flow matrix only has 1984 transitions (discarded 397 similar events)
// Phase 1: matrix 1984 rows 976 cols
[2022-05-18 00:31:45] [INFO ] Computed 49 place invariants in 32 ms
[2022-05-18 00:31:46] [INFO ] Implicit Places using invariants in 831 ms returned []
[2022-05-18 00:31:46] [INFO ] Flow matrix only has 1984 transitions (discarded 397 similar events)
// Phase 1: matrix 1984 rows 976 cols
[2022-05-18 00:31:46] [INFO ] Computed 49 place invariants in 28 ms
[2022-05-18 00:31:47] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:31:55] [INFO ] Implicit Places using invariants and state equation in 9180 ms returned [950, 969]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10012 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 974/976 places, 2381/2381 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 974 transition count 2379
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 972 transition count 2379
Applied a total of 4 rules in 62 ms. Remains 972 /974 variables (removed 2) and now considering 2379/2381 (removed 2) transitions.
[2022-05-18 00:31:55] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:31:55] [INFO ] Computed 47 place invariants in 24 ms
[2022-05-18 00:31:56] [INFO ] Implicit Places using invariants in 768 ms returned []
[2022-05-18 00:31:56] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:31:56] [INFO ] Computed 47 place invariants in 27 ms
[2022-05-18 00:31:56] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:32:03] [INFO ] Implicit Places using invariants and state equation in 7674 ms returned []
Implicit Place search using SMT with State Equation took 8443 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 972/976 places, 2379/2381 transitions.
Finished structural reductions, in 2 iterations. Remains : 972/976 places, 2379/2381 transitions.
Incomplete random walk after 10000 steps, including 206 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 88944 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88944 steps, saw 37416 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:32:07] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:32:07] [INFO ] Computed 47 place invariants in 32 ms
[2022-05-18 00:32:07] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned sat
[2022-05-18 00:32:07] [INFO ] [Real]Absence check using 33 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-18 00:32:08] [INFO ] After 858ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:32:08] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2022-05-18 00:32:08] [INFO ] [Nat]Absence check using 33 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-18 00:32:09] [INFO ] After 812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:32:09] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:32:09] [INFO ] After 396ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:32:09] [INFO ] After 706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 261 ms.
[2022-05-18 00:32:09] [INFO ] After 1965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 972 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 972/972 places, 2379/2379 transitions.
Applied a total of 0 rules in 52 ms. Remains 972 /972 variables (removed 0) and now considering 2379/2379 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 972/972 places, 2379/2379 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 972/972 places, 2379/2379 transitions.
Applied a total of 0 rules in 56 ms. Remains 972 /972 variables (removed 0) and now considering 2379/2379 (removed 0) transitions.
[2022-05-18 00:32:10] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:32:10] [INFO ] Computed 47 place invariants in 21 ms
[2022-05-18 00:32:10] [INFO ] Implicit Places using invariants in 833 ms returned []
[2022-05-18 00:32:10] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:32:10] [INFO ] Computed 47 place invariants in 18 ms
[2022-05-18 00:32:11] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:32:19] [INFO ] Implicit Places using invariants and state equation in 8315 ms returned []
Implicit Place search using SMT with State Equation took 9156 ms to find 0 implicit places.
[2022-05-18 00:32:19] [INFO ] Redundant transitions in 68 ms returned []
[2022-05-18 00:32:19] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:32:19] [INFO ] Computed 47 place invariants in 24 ms
[2022-05-18 00:32:20] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 972/972 places, 2379/2379 transitions.
Graph (trivial) has 772 edges and 972 vertex of which 17 / 972 are part of one of the 1 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions removed 299 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 669 transitions.
Graph (complete) has 2896 edges and 956 vertex of which 942 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 t1235.t1429 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 925 transition count 1600
Reduce places removed 108 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 299 rules applied. Total rules applied 411 place count 817 transition count 1409
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 261 rules applied. Total rules applied 672 place count 722 transition count 1243
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 3 with 211 rules applied. Total rules applied 883 place count 651 transition count 1103
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 187 rules applied. Total rules applied 1070 place count 582 transition count 985
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1215 place count 533 transition count 889
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1340 place count 486 transition count 811
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1431 place count 455 transition count 751
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1506 place count 426 transition count 705
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 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 50 rules applied. Total rules applied 1556 place count 409 transition count 672
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 1596 place count 393 transition count 648
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 1618 place count 385 transition count 634
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 1632 place count 379 transition count 626
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1637 place count 377 transition count 623
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1639 place count 376 transition count 622
Discarding 282 places :
Symmetric choice reduction at 15 with 282 rule applications. Total rules 1921 place count 94 transition count 340
Iterating global reduction 15 with 282 rules applied. Total rules applied 2203 place count 94 transition count 340
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 15 with 265 rules applied. Total rules applied 2468 place count 94 transition count 75
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 14 rules applied. Total rules applied 2482 place count 81 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2483 place count 80 transition count 74
Discarding 13 places :
Symmetric choice reduction at 18 with 13 rule applications. Total rules 2496 place count 67 transition count 61
Iterating global reduction 18 with 13 rules applied. Total rules applied 2509 place count 67 transition count 61
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 2515 place count 64 transition count 58
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 2518 place count 64 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 2522 place count 62 transition count 77
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 19 with 4 rules applied. Total rules applied 2526 place count 62 transition count 73
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 19 with 2 rules applied. Total rules applied 2528 place count 62 transition count 71
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 20 with 3 rules applied. Total rules applied 2531 place count 60 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 2532 place count 59 transition count 70
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 2533 place count 59 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 2534 place count 58 transition count 69
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 23 with 3 rules applied. Total rules applied 2537 place count 58 transition count 69
Applied a total of 2537 rules in 233 ms. Remains 58 /972 variables (removed 914) and now considering 69/2379 (removed 2310) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 69 rows 58 cols
[2022-05-18 00:32:20] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-18 00:32:20] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 00:32:20] [INFO ] [Real]Absence check using 5 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-18 00:32:20] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:32:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 00:32:20] [INFO ] [Nat]Absence check using 5 positive and 12 generalized place invariants in 1 ms returned sat
[2022-05-18 00:32:20] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:32:20] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-18 00:32:20] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:32:20] [INFO ] Flatten gal took : 3 ms
[2022-05-18 00:32:20] [INFO ] Flatten gal took : 3 ms
[2022-05-18 00:32:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9257448726877950259.gal : 1 ms
[2022-05-18 00:32:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality685537438310628108.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7176255800482621233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9257448726877950259.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality685537438310628108.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality685537438310628108.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 21
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :21 after 41
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 63
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :63 after 141
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :141 after 861
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :861 after 1842
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3288,0.08168,6828,2,2847,12,15543,8,0,294,12143,0
Total reachable state count : 3288

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.082193,7092,2,59,12,15543,8,0,297,12143,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.082771,7092,2,59,12,15543,8,0,299,12143,0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 351 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[p1, p1, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[p1, p1, (AND p1 (NOT p0))]
Support contains 6 out of 1103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1103/1103 places, 2508/2508 transitions.
Applied a total of 0 rules in 43 ms. Remains 1103 /1103 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
[2022-05-18 00:32:21] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1103 cols
[2022-05-18 00:32:21] [INFO ] Computed 49 place invariants in 39 ms
[2022-05-18 00:32:22] [INFO ] Implicit Places using invariants in 879 ms returned []
[2022-05-18 00:32:22] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1103 cols
[2022-05-18 00:32:22] [INFO ] Computed 49 place invariants in 34 ms
[2022-05-18 00:32:23] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:32:30] [INFO ] Implicit Places using invariants and state equation in 8585 ms returned []
Implicit Place search using SMT with State Equation took 9465 ms to find 0 implicit places.
[2022-05-18 00:32:30] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1103 cols
[2022-05-18 00:32:30] [INFO ] Computed 49 place invariants in 35 ms
[2022-05-18 00:32:31] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1103/1103 places, 2508/2508 transitions.
Computed a total of 288 stabilizing places and 892 stable transitions
Computed a total of 288 stabilizing places and 892 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 424 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[p1, p1, (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 195 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :1
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 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:32:32] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1103 cols
[2022-05-18 00:32:32] [INFO ] Computed 49 place invariants in 35 ms
[2022-05-18 00:32:32] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2022-05-18 00:32:33] [INFO ] [Real]Absence check using 33 positive and 16 generalized place invariants in 4 ms returned sat
[2022-05-18 00:32:33] [INFO ] After 1031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:32:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2022-05-18 00:32:34] [INFO ] [Nat]Absence check using 33 positive and 16 generalized place invariants in 4 ms returned sat
[2022-05-18 00:32:35] [INFO ] After 1011ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:32:35] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:32:35] [INFO ] After 366ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:32:35] [INFO ] Deduced a trap composed of 86 places in 450 ms of which 1 ms to minimize.
[2022-05-18 00:32:36] [INFO ] Deduced a trap composed of 389 places in 465 ms of which 2 ms to minimize.
[2022-05-18 00:32:37] [INFO ] Deduced a trap composed of 86 places in 465 ms of which 0 ms to minimize.
[2022-05-18 00:32:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1676 ms
[2022-05-18 00:32:37] [INFO ] After 2374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 249 ms.
[2022-05-18 00:32:37] [INFO ] After 3846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 1103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1103/1103 places, 2508/2508 transitions.
Free-agglomeration rule (complex) applied 127 times.
Iterating global reduction 0 with 127 rules applied. Total rules applied 127 place count 1103 transition count 2381
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 254 place count 976 transition count 2381
Applied a total of 254 rules in 163 ms. Remains 976 /1103 variables (removed 127) and now considering 2381/2508 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 976/1103 places, 2381/2508 transitions.
Incomplete random walk after 10000 steps, including 206 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 89561 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89561 steps, saw 37678 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:32:41] [INFO ] Flow matrix only has 1984 transitions (discarded 397 similar events)
// Phase 1: matrix 1984 rows 976 cols
[2022-05-18 00:32:41] [INFO ] Computed 49 place invariants in 30 ms
[2022-05-18 00:32:41] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2022-05-18 00:32:41] [INFO ] [Real]Absence check using 33 positive and 16 generalized place invariants in 4 ms returned sat
[2022-05-18 00:32:42] [INFO ] After 954ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:32:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2022-05-18 00:32:42] [INFO ] [Nat]Absence check using 33 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-18 00:32:43] [INFO ] After 950ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:32:43] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:32:43] [INFO ] After 462ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:32:44] [INFO ] After 780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 286 ms.
[2022-05-18 00:32:44] [INFO ] After 2219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 976 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 976/976 places, 2381/2381 transitions.
Applied a total of 0 rules in 55 ms. Remains 976 /976 variables (removed 0) and now considering 2381/2381 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 976/976 places, 2381/2381 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 976/976 places, 2381/2381 transitions.
Applied a total of 0 rules in 53 ms. Remains 976 /976 variables (removed 0) and now considering 2381/2381 (removed 0) transitions.
[2022-05-18 00:32:44] [INFO ] Flow matrix only has 1984 transitions (discarded 397 similar events)
// Phase 1: matrix 1984 rows 976 cols
[2022-05-18 00:32:44] [INFO ] Computed 49 place invariants in 31 ms
[2022-05-18 00:32:45] [INFO ] Implicit Places using invariants in 764 ms returned []
[2022-05-18 00:32:45] [INFO ] Flow matrix only has 1984 transitions (discarded 397 similar events)
// Phase 1: matrix 1984 rows 976 cols
[2022-05-18 00:32:45] [INFO ] Computed 49 place invariants in 29 ms
[2022-05-18 00:32:45] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:32:54] [INFO ] Implicit Places using invariants and state equation in 8828 ms returned [950, 969]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9598 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 974/976 places, 2381/2381 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 974 transition count 2379
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 972 transition count 2379
Applied a total of 4 rules in 61 ms. Remains 972 /974 variables (removed 2) and now considering 2379/2381 (removed 2) transitions.
[2022-05-18 00:32:54] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:32:54] [INFO ] Computed 47 place invariants in 28 ms
[2022-05-18 00:32:54] [INFO ] Implicit Places using invariants in 767 ms returned []
[2022-05-18 00:32:54] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:32:54] [INFO ] Computed 47 place invariants in 20 ms
[2022-05-18 00:32:55] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:33:02] [INFO ] Implicit Places using invariants and state equation in 7513 ms returned []
Implicit Place search using SMT with State Equation took 8282 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 972/976 places, 2379/2381 transitions.
Finished structural reductions, in 2 iterations. Remains : 972/976 places, 2379/2381 transitions.
Incomplete random walk after 10000 steps, including 206 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 89169 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89169 steps, saw 37509 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:33:05] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:33:05] [INFO ] Computed 47 place invariants in 23 ms
[2022-05-18 00:33:05] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned sat
[2022-05-18 00:33:05] [INFO ] [Real]Absence check using 33 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-18 00:33:06] [INFO ] After 881ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:33:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2022-05-18 00:33:06] [INFO ] [Nat]Absence check using 33 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-18 00:33:07] [INFO ] After 872ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:33:07] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:33:07] [INFO ] After 403ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:33:08] [INFO ] After 730ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 260 ms.
[2022-05-18 00:33:08] [INFO ] After 2082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 972 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 972/972 places, 2379/2379 transitions.
Applied a total of 0 rules in 54 ms. Remains 972 /972 variables (removed 0) and now considering 2379/2379 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 972/972 places, 2379/2379 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 972/972 places, 2379/2379 transitions.
Applied a total of 0 rules in 51 ms. Remains 972 /972 variables (removed 0) and now considering 2379/2379 (removed 0) transitions.
[2022-05-18 00:33:08] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:33:08] [INFO ] Computed 47 place invariants in 26 ms
[2022-05-18 00:33:09] [INFO ] Implicit Places using invariants in 776 ms returned []
[2022-05-18 00:33:09] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:33:09] [INFO ] Computed 47 place invariants in 24 ms
[2022-05-18 00:33:10] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:33:17] [INFO ] Implicit Places using invariants and state equation in 8174 ms returned []
Implicit Place search using SMT with State Equation took 8951 ms to find 0 implicit places.
[2022-05-18 00:33:17] [INFO ] Redundant transitions in 67 ms returned []
[2022-05-18 00:33:17] [INFO ] Flow matrix only has 1982 transitions (discarded 397 similar events)
// Phase 1: matrix 1982 rows 972 cols
[2022-05-18 00:33:17] [INFO ] Computed 47 place invariants in 24 ms
[2022-05-18 00:33:18] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 972/972 places, 2379/2379 transitions.
Graph (trivial) has 772 edges and 972 vertex of which 17 / 972 are part of one of the 1 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 299 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 669 transitions.
Graph (complete) has 2896 edges and 956 vertex of which 942 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 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 t1235.t1429 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 925 transition count 1600
Reduce places removed 108 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 299 rules applied. Total rules applied 411 place count 817 transition count 1409
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 261 rules applied. Total rules applied 672 place count 722 transition count 1243
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 3 with 211 rules applied. Total rules applied 883 place count 651 transition count 1103
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 187 rules applied. Total rules applied 1070 place count 582 transition count 985
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1215 place count 533 transition count 889
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1340 place count 486 transition count 811
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1431 place count 455 transition count 751
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1506 place count 426 transition count 705
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 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 50 rules applied. Total rules applied 1556 place count 409 transition count 672
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 1596 place count 393 transition count 648
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 1618 place count 385 transition count 634
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 1632 place count 379 transition count 626
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1637 place count 377 transition count 623
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1639 place count 376 transition count 622
Discarding 282 places :
Symmetric choice reduction at 15 with 282 rule applications. Total rules 1921 place count 94 transition count 340
Iterating global reduction 15 with 282 rules applied. Total rules applied 2203 place count 94 transition count 340
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 15 with 265 rules applied. Total rules applied 2468 place count 94 transition count 75
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 14 rules applied. Total rules applied 2482 place count 81 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2483 place count 80 transition count 74
Discarding 13 places :
Symmetric choice reduction at 18 with 13 rule applications. Total rules 2496 place count 67 transition count 61
Iterating global reduction 18 with 13 rules applied. Total rules applied 2509 place count 67 transition count 61
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 2515 place count 64 transition count 58
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 2518 place count 64 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 2522 place count 62 transition count 77
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 19 with 4 rules applied. Total rules applied 2526 place count 62 transition count 73
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 19 with 2 rules applied. Total rules applied 2528 place count 62 transition count 71
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 20 with 3 rules applied. Total rules applied 2531 place count 60 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 2532 place count 59 transition count 70
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 2533 place count 59 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 2534 place count 58 transition count 69
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 23 with 3 rules applied. Total rules applied 2537 place count 58 transition count 69
Applied a total of 2537 rules in 222 ms. Remains 58 /972 variables (removed 914) and now considering 69/2379 (removed 2310) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 69 rows 58 cols
[2022-05-18 00:33:18] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-18 00:33:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-18 00:33:19] [INFO ] [Real]Absence check using 5 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-18 00:33:19] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:33:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-18 00:33:19] [INFO ] [Nat]Absence check using 5 positive and 12 generalized place invariants in 2 ms returned sat
[2022-05-18 00:33:19] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 00:33:19] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-18 00:33:19] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-18 00:33:19] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:33:19] [INFO ] Flatten gal took : 3 ms
[2022-05-18 00:33:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11515951176436467022.gal : 1 ms
[2022-05-18 00:33:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8005734149154422848.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14020084890694918771;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11515951176436467022.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8005734149154422848.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8005734149154422848.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 21
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :21 after 41
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 63
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :63 after 141
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :141 after 861
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :861 after 1842
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3288,0.081586,6832,2,2847,12,15543,8,0,294,12143,0
Total reachable state count : 3288

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.082065,6832,2,59,12,15543,8,0,297,12143,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.083031,7096,2,59,12,15543,8,0,299,12143,0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 321 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[p1, p1, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 95 ms :[p1, p1, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[p1, p1, (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 1981 reset in 587 ms.
Product exploration explored 100000 steps with 1980 reset in 600 ms.
Built C files in :
/tmp/ltsmin611054444486893422
[2022-05-18 00:33:21] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin611054444486893422
Running compilation step : cd /tmp/ltsmin611054444486893422;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin611054444486893422;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin611054444486893422;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 1103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1103/1103 places, 2508/2508 transitions.
Applied a total of 0 rules in 48 ms. Remains 1103 /1103 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
[2022-05-18 00:33:24] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1103 cols
[2022-05-18 00:33:24] [INFO ] Computed 49 place invariants in 35 ms
[2022-05-18 00:33:25] [INFO ] Implicit Places using invariants in 804 ms returned []
[2022-05-18 00:33:25] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1103 cols
[2022-05-18 00:33:25] [INFO ] Computed 49 place invariants in 26 ms
[2022-05-18 00:33:25] [INFO ] State equation strengthened by 830 read => feed constraints.
[2022-05-18 00:33:33] [INFO ] Implicit Places using invariants and state equation in 8333 ms returned []
Implicit Place search using SMT with State Equation took 9137 ms to find 0 implicit places.
[2022-05-18 00:33:33] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1103 cols
[2022-05-18 00:33:33] [INFO ] Computed 49 place invariants in 39 ms
[2022-05-18 00:33:34] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1103/1103 places, 2508/2508 transitions.
Built C files in :
/tmp/ltsmin882854261190573445
[2022-05-18 00:33:34] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin882854261190573445
Running compilation step : cd /tmp/ltsmin882854261190573445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin882854261190573445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin882854261190573445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 00:33:37] [INFO ] Flatten gal took : 61 ms
[2022-05-18 00:33:37] [INFO ] Flatten gal took : 61 ms
[2022-05-18 00:33:37] [INFO ] Time to serialize gal into /tmp/LTL18146077833033599102.gal : 7 ms
[2022-05-18 00:33:37] [INFO ] Time to serialize properties into /tmp/LTL1570818066778464250.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18146077833033599102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1570818066778464250.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1814607...267
Read 1 LTL properties
Checking formula 0 : !((F(G(F(!((!(X("(((ThereIsAMasterInTheLeafSet>=1)&&(NoNodeManageTheCrashOfNode8>=1))&&((Node11WantsToManageTheCrashOfNode8>=1)&&(Node...289
Formula 0 simplified : !FGF!(!X"(((ThereIsAMasterInTheLeafSet>=1)&&(NoNodeManageTheCrashOfNode8>=1))&&((Node11WantsToManageTheCrashOfNode8>=1)&&(Node11HasD...275
Detected timeout of ITS tools.
[2022-05-18 00:33:52] [INFO ] Flatten gal took : 74 ms
[2022-05-18 00:33:52] [INFO ] Applying decomposition
[2022-05-18 00:33:52] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4605747703225917538.txt' '-o' '/tmp/graph4605747703225917538.bin' '-w' '/tmp/graph4605747703225917538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4605747703225917538.bin' '-l' '-1' '-v' '-w' '/tmp/graph4605747703225917538.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:33:52] [INFO ] Decomposing Gal with order
[2022-05-18 00:33:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:33:53] [INFO ] Removed a total of 3156 redundant transitions.
[2022-05-18 00:33:53] [INFO ] Flatten gal took : 164 ms
[2022-05-18 00:33:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 1147 labels/synchronizations in 84 ms.
[2022-05-18 00:33:53] [INFO ] Time to serialize gal into /tmp/LTL1105184964721409096.gal : 14 ms
[2022-05-18 00:33:53] [INFO ] Time to serialize properties into /tmp/LTL17228470366842664818.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1105184964721409096.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17228470366842664818.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1105184...246
Read 1 LTL properties
Checking formula 0 : !((F(G(F(!((!(X("(((i0.u10.ThereIsAMasterInTheLeafSet>=1)&&(i0.u10.NoNodeManageTheCrashOfNode8>=1))&&((i0.u10.Node11WantsToManageTheCr...332
Formula 0 simplified : !FGF!(!X"(((i0.u10.ThereIsAMasterInTheLeafSet>=1)&&(i0.u10.NoNodeManageTheCrashOfNode8>=1))&&((i0.u10.Node11WantsToManageTheCrashOfN...318
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2844087093301790758
[2022-05-18 00:34:08] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2844087093301790758
Running compilation step : cd /tmp/ltsmin2844087093301790758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2844087093301790758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2844087093301790758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-08 finished in 170264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(X((G(p1)||p0)))) U p2)))'
[2022-05-18 00:34:11] [INFO ] Flatten gal took : 81 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7285426915193416720
[2022-05-18 00:34:11] [INFO ] Too many transitions (2772) to apply POR reductions. Disabling POR matrices.
[2022-05-18 00:34:11] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7285426915193416720
Running compilation step : cd /tmp/ltsmin7285426915193416720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 00:34:11] [INFO ] Applying decomposition
[2022-05-18 00:34:11] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16400690199894658058.txt' '-o' '/tmp/graph16400690199894658058.bin' '-w' '/tmp/graph16400690199894658058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16400690199894658058.bin' '-l' '-1' '-v' '-w' '/tmp/graph16400690199894658058.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:34:12] [INFO ] Decomposing Gal with order
[2022-05-18 00:34:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:34:12] [INFO ] Removed a total of 3225 redundant transitions.
[2022-05-18 00:34:12] [INFO ] Flatten gal took : 188 ms
[2022-05-18 00:34:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1593 labels/synchronizations in 73 ms.
[2022-05-18 00:34:12] [INFO ] Time to serialize gal into /tmp/LTLFireability12087978525725180840.gal : 18 ms
[2022-05-18 00:34:12] [INFO ] Time to serialize properties into /tmp/LTLFireability8646854671618019072.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12087978525725180840.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8646854671618019072.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((F(G(F(!((!(X("(((i9.u0.ThereIsAMasterInTheLeafSet>=1)&&(i9.u0.NoNodeManageTheCrashOfNode8>=1))&&((i9.u0.Node11WantsToManageTheCrash...333
Formula 0 simplified : !FGF!(!X"(((i9.u0.ThereIsAMasterInTheLeafSet>=1)&&(i9.u0.NoNodeManageTheCrashOfNode8>=1))&&((i9.u0.Node11WantsToManageTheCrashOfNode...319
Compilation finished in 6333 ms.
Running link step : cd /tmp/ltsmin7285426915193416720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin7285426915193416720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>(!(!X((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin7285426915193416720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>(!(!X((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7285426915193416720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-18 00:59:54] [INFO ] Flatten gal took : 736 ms
[2022-05-18 00:59:54] [INFO ] Time to serialize gal into /tmp/LTLFireability3466116097658248919.gal : 56 ms
[2022-05-18 00:59:54] [INFO ] Time to serialize properties into /tmp/LTLFireability4874634325181924447.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3466116097658248919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4874634325181924447.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 3 LTL properties
Checking formula 0 : !((F(G(F(!((!(X("(((ThereIsAMasterInTheLeafSet>=1)&&(NoNodeManageTheCrashOfNode8>=1))&&((Node11WantsToManageTheCrashOfNode8>=1)&&(Node...289
Formula 0 simplified : !FGF!(!X"(((ThereIsAMasterInTheLeafSet>=1)&&(NoNodeManageTheCrashOfNode8>=1))&&((Node11WantsToManageTheCrashOfNode8>=1)&&(Node11HasD...275
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin7285426915193416720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7285426915193416720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp3==true) U X(X(([]((LTLAPp4==true))||(LTLAPp3==true))))) U (LTLAPp5==true)))' '--buchi-type=spotba'
LTSmin run took 457 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin7285426915193416720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>(!(!X((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C07, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821200692"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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