Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 12 06:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 06:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.2M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716626068050

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 08:34:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 08:34:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:34:29] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2024-05-25 08:34:29] [INFO ] Transformed 5568 places.
[2024-05-25 08:34:29] [INFO ] Transformed 7799 transitions.
[2024-05-25 08:34:29] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 446 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 5568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 5536 transition count 7799
Discarding 1601 places :
Symmetric choice reduction at 1 with 1601 rule applications. Total rules 1633 place count 3935 transition count 6198
Iterating global reduction 1 with 1601 rules applied. Total rules applied 3234 place count 3935 transition count 6198
Discarding 1395 places :
Symmetric choice reduction at 1 with 1395 rule applications. Total rules 4629 place count 2540 transition count 4803
Iterating global reduction 1 with 1395 rules applied. Total rules applied 6024 place count 2540 transition count 4803
Discarding 206 places :
Symmetric choice reduction at 1 with 206 rule applications. Total rules 6230 place count 2334 transition count 3567
Iterating global reduction 1 with 206 rules applied. Total rules applied 6436 place count 2334 transition count 3567
Applied a total of 6436 rules in 1106 ms. Remains 2334 /5568 variables (removed 3234) and now considering 3567/7799 (removed 4232) transitions.
[2024-05-25 08:34:31] [INFO ] Flow matrix only has 3295 transitions (discarded 272 similar events)
// Phase 1: matrix 3295 rows 2334 cols
[2024-05-25 08:34:31] [INFO ] Computed 541 invariants in 129 ms
[2024-05-25 08:34:34] [INFO ] Implicit Places using invariants in 3305 ms returned [4, 8, 14, 16, 18, 20, 22, 24, 29, 36, 45, 56, 72, 87, 103, 119, 121, 123, 125, 127, 129, 131, 145, 156, 165, 172, 177, 180, 207, 214, 217, 220, 221, 222, 223, 229, 234, 241, 250, 261, 274, 288, 302, 303, 304, 305, 306, 307, 308, 319, 328, 335, 340, 343, 345, 372, 379, 382, 383, 384, 385, 386, 387, 388, 390, 393, 398, 405, 414, 425, 437, 449, 450, 451, 452, 454, 455, 464, 471, 476, 479, 484, 486, 520, 523, 525, 526, 527, 530, 534, 536, 542, 547, 554, 563, 573, 584, 585, 586, 587, 588, 599, 604, 607, 609, 611, 613, 640, 647, 650, 651, 652, 653, 654, 655, 656, 658, 660, 662, 665, 670, 677, 685, 693, 694, 695, 696, 697, 698, 699, 704, 707, 709, 711, 713, 715, 742, 749, 752, 755, 756, 757, 758, 759, 763, 765, 767, 769, 772, 777, 783, 789, 790, 791, 792, 793, 795, 798, 800, 802, 806, 808, 810, 837, 844, 847, 848, 849, 851, 852, 853, 855, 857, 859, 861, 863, 868, 872, 876, 877, 878, 879, 880, 882, 884, 886, 888, 890, 892, 894, 923, 930, 933, 934, 935, 937, 938, 939, 946, 948, 950, 952, 954, 956, 959, 960, 964, 965, 967, 969, 971, 977, 979, 983, 1010, 1012, 1016, 1019, 1021, 1022, 1023, 1024, 1025, 1027, 1029, 1031, 1036, 1038, 1040, 1042, 1045, 1047, 1048, 1049, 1050, 1051, 1053, 1055, 1057, 1061, 1063, 1065, 1095, 1102, 1105, 1106, 1107, 1109, 1110, 1111, 1113, 1115, 1117, 1119, 1121, 1125, 1127, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1138, 1140, 1142, 1144, 1146, 1148, 1175, 1182, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1193, 1195, 1197, 1199, 1201, 1203, 1206, 1211, 1212, 1213, 1214, 1216, 1217, 1220, 1222, 1224, 1226, 1228, 1230, 1260, 1267, 1271, 1273, 1274, 1275, 1276, 1278, 1280, 1284, 1286, 1288, 1291, 1299, 1306, 1307, 1308, 1309, 1312, 1313, 1320, 1323, 1325, 1327, 1329, 1331, 1358, 1365, 1368, 1369, 1370, 1371, 1372, 1373, 1374, 1376, 1378, 1380, 1382, 1385, 1390, 1397, 1406, 1407, 1409, 1410, 1411, 1412, 1419, 1424, 1430, 1432, 1434, 1436, 1463, 1470, 1473, 1474, 1475, 1476, 1477, 1478, 1481, 1483, 1485, 1488, 1493, 1500, 1509, 1520, 1521, 1523, 1524, 1525, 1526, 1535, 1542, 1547, 1550, 1552, 1557, 1584, 1594, 1596, 1597, 1598, 1599, 1600, 1602, 1607, 1610, 1615, 1622, 1631, 1644, 1657, 1658, 1659, 1661, 1662, 1663, 1674, 1683, 1692, 1697, 1700, 1702, 1729, 1736, 1739, 1741, 1742, 1743, 1744, 1745, 1747, 1750, 1755, 1764, 1773, 1784, 1797, 1812, 1813, 1814, 1815, 1816, 1817, 1818, 1831, 1842, 1851, 1858, 1863, 1866, 1893, 1895, 1899, 1902, 1903, 1904, 1905, 1907, 1908, 1911, 1916, 1923, 1932, 1943, 1956, 1974, 1991, 1992, 1994, 1995, 1997, 2012, 2025, 2039, 2048, 2058, 2065, 2093]
Discarding 461 places :
Implicit Place search using SMT only with invariants took 3337 ms to find 461 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1873/5568 places, 3567/7799 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 1714 transition count 3408
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 1714 transition count 3408
Discarding 158 places :
Symmetric choice reduction at 0 with 158 rule applications. Total rules 476 place count 1556 transition count 3250
Iterating global reduction 0 with 158 rules applied. Total rules applied 634 place count 1556 transition count 3250
Discarding 156 places :
Symmetric choice reduction at 0 with 156 rule applications. Total rules 790 place count 1400 transition count 3094
Iterating global reduction 0 with 156 rules applied. Total rules applied 946 place count 1400 transition count 3094
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 950 place count 1396 transition count 3070
Iterating global reduction 0 with 4 rules applied. Total rules applied 954 place count 1396 transition count 3070
Applied a total of 954 rules in 231 ms. Remains 1396 /1873 variables (removed 477) and now considering 3070/3567 (removed 497) transitions.
[2024-05-25 08:34:34] [INFO ] Flow matrix only has 2798 transitions (discarded 272 similar events)
// Phase 1: matrix 2798 rows 1396 cols
[2024-05-25 08:34:34] [INFO ] Computed 80 invariants in 48 ms
[2024-05-25 08:34:36] [INFO ] Implicit Places using invariants in 1197 ms returned []
[2024-05-25 08:34:36] [INFO ] Flow matrix only has 2798 transitions (discarded 272 similar events)
[2024-05-25 08:34:36] [INFO ] Invariant cache hit.
[2024-05-25 08:34:37] [INFO ] State equation strengthened by 1128 read => feed constraints.
[2024-05-25 08:34:53] [INFO ] Implicit Places using invariants and state equation in 17002 ms returned []
Implicit Place search using SMT with State Equation took 18203 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1396/5568 places, 3070/7799 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22878 ms. Remains : 1396/5568 places, 3070/7799 transitions.
Support contains 56 out of 1396 places after structural reductions.
[2024-05-25 08:34:53] [INFO ] Flatten gal took : 384 ms
[2024-05-25 08:34:54] [INFO ] Flatten gal took : 185 ms
[2024-05-25 08:34:54] [INFO ] Input system was already deterministic with 3070 transitions.
Support contains 49 out of 1396 places (down from 56) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 160 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 27) seen :11
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-25 08:34:55] [INFO ] Flow matrix only has 2798 transitions (discarded 272 similar events)
[2024-05-25 08:34:55] [INFO ] Invariant cache hit.
[2024-05-25 08:34:55] [INFO ] After 537ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-25 08:34:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-25 08:34:56] [INFO ] [Nat]Absence check using 33 positive and 47 generalized place invariants in 7 ms returned sat
[2024-05-25 08:34:57] [INFO ] After 1491ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :7
[2024-05-25 08:34:58] [INFO ] State equation strengthened by 1128 read => feed constraints.
[2024-05-25 08:35:00] [INFO ] After 2319ms SMT Verify possible using 1128 Read/Feed constraints in natural domain returned unsat :11 sat :4
[2024-05-25 08:35:01] [INFO ] Deduced a trap composed of 300 places in 613 ms of which 7 ms to minimize.
[2024-05-25 08:35:02] [INFO ] Deduced a trap composed of 312 places in 624 ms of which 3 ms to minimize.
[2024-05-25 08:35:03] [INFO ] Deduced a trap composed of 341 places in 647 ms of which 2 ms to minimize.
[2024-05-25 08:35:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2320 ms
[2024-05-25 08:35:03] [INFO ] After 5695ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :4
Attempting to minimize the solution found.
Minimization took 1113 ms.
[2024-05-25 08:35:04] [INFO ] After 9063ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :4
Fused 15 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 8 out of 1396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1396 transition count 3042
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1368 transition count 3042
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 56 place count 1368 transition count 3010
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 120 place count 1336 transition count 3010
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 138 place count 1318 transition count 2987
Iterating global reduction 2 with 18 rules applied. Total rules applied 156 place count 1318 transition count 2987
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 170 place count 1304 transition count 2923
Iterating global reduction 2 with 14 rules applied. Total rules applied 184 place count 1304 transition count 2923
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 187 place count 1301 transition count 2905
Iterating global reduction 2 with 3 rules applied. Total rules applied 190 place count 1301 transition count 2905
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 270 place count 1261 transition count 2865
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 284 place count 1247 transition count 2851
Iterating global reduction 2 with 14 rules applied. Total rules applied 298 place count 1247 transition count 2851
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 312 place count 1233 transition count 2767
Iterating global reduction 2 with 14 rules applied. Total rules applied 326 place count 1233 transition count 2767
Free-agglomeration rule (complex) applied 163 times.
Iterating global reduction 2 with 163 rules applied. Total rules applied 489 place count 1233 transition count 3794
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 2 with 163 rules applied. Total rules applied 652 place count 1070 transition count 3794
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 682 place count 1070 transition count 3794
Applied a total of 682 rules in 975 ms. Remains 1070 /1396 variables (removed 326) and now considering 3794/3070 (removed -724) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 976 ms. Remains : 1070/1396 places, 3794/3070 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 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 36 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 08:35:06] [INFO ] Flow matrix only has 3396 transitions (discarded 398 similar events)
// Phase 1: matrix 3396 rows 1070 cols
[2024-05-25 08:35:06] [INFO ] Computed 80 invariants in 44 ms
[2024-05-25 08:35:06] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 08:35:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2024-05-25 08:35:06] [INFO ] [Nat]Absence check using 33 positive and 47 generalized place invariants in 10 ms returned sat
[2024-05-25 08:35:07] [INFO ] After 915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 08:35:07] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:35:09] [INFO ] After 1355ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 08:35:09] [INFO ] Deduced a trap composed of 204 places in 517 ms of which 2 ms to minimize.
[2024-05-25 08:35:10] [INFO ] Deduced a trap composed of 133 places in 501 ms of which 1 ms to minimize.
[2024-05-25 08:35:11] [INFO ] Deduced a trap composed of 174 places in 507 ms of which 1 ms to minimize.
[2024-05-25 08:35:12] [INFO ] Deduced a trap composed of 197 places in 504 ms of which 1 ms to minimize.
[2024-05-25 08:35:12] [INFO ] Deduced a trap composed of 164 places in 496 ms of which 1 ms to minimize.
[2024-05-25 08:35:15] [INFO ] Deduced a trap composed of 169 places in 537 ms of which 1 ms to minimize.
[2024-05-25 08:35:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 6657 ms
[2024-05-25 08:35:17] [INFO ] Deduced a trap composed of 169 places in 530 ms of which 1 ms to minimize.
[2024-05-25 08:35:18] [INFO ] Deduced a trap composed of 198 places in 528 ms of which 1 ms to minimize.
[2024-05-25 08:35:19] [INFO ] Deduced a trap composed of 192 places in 527 ms of which 1 ms to minimize.
[2024-05-25 08:35:19] [INFO ] Deduced a trap composed of 177 places in 510 ms of which 1 ms to minimize.
[2024-05-25 08:35:20] [INFO ] Deduced a trap composed of 160 places in 519 ms of which 1 ms to minimize.
[2024-05-25 08:35:21] [INFO ] Deduced a trap composed of 209 places in 503 ms of which 1 ms to minimize.
[2024-05-25 08:35:21] [INFO ] Deduced a trap composed of 179 places in 540 ms of which 1 ms to minimize.
[2024-05-25 08:35:22] [INFO ] Deduced a trap composed of 202 places in 521 ms of which 1 ms to minimize.
[2024-05-25 08:35:22] [INFO ] Deduced a trap composed of 204 places in 545 ms of which 1 ms to minimize.
[2024-05-25 08:35:23] [INFO ] Deduced a trap composed of 220 places in 505 ms of which 1 ms to minimize.
[2024-05-25 08:35:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6838 ms
[2024-05-25 08:35:23] [INFO ] After 16265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 522 ms.
[2024-05-25 08:35:24] [INFO ] After 17936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 1070 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1070/1070 places, 3794/3794 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 1070 transition count 3792
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1068 transition count 3792
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1067 transition count 3791
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1067 transition count 3791
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 1067 transition count 3791
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 12 place count 1064 transition count 3788
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 1064 transition count 3788
Applied a total of 15 rules in 290 ms. Remains 1064 /1070 variables (removed 6) and now considering 3788/3794 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 1064/1070 places, 3788/3794 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:35:24] [INFO ] Flow matrix only has 3390 transitions (discarded 398 similar events)
// Phase 1: matrix 3390 rows 1064 cols
[2024-05-25 08:35:25] [INFO ] Computed 80 invariants in 43 ms
[2024-05-25 08:35:25] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:35:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2024-05-25 08:35:25] [INFO ] [Nat]Absence check using 33 positive and 47 generalized place invariants in 9 ms returned sat
[2024-05-25 08:35:26] [INFO ] After 864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:35:26] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:35:26] [INFO ] After 524ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:35:27] [INFO ] Deduced a trap composed of 142 places in 541 ms of which 1 ms to minimize.
[2024-05-25 08:35:28] [INFO ] Deduced a trap composed of 154 places in 533 ms of which 1 ms to minimize.
[2024-05-25 08:35:28] [INFO ] Deduced a trap composed of 157 places in 538 ms of which 1 ms to minimize.
[2024-05-25 08:35:29] [INFO ] Deduced a trap composed of 188 places in 539 ms of which 1 ms to minimize.
[2024-05-25 08:35:30] [INFO ] Deduced a trap composed of 174 places in 519 ms of which 2 ms to minimize.
[2024-05-25 08:35:30] [INFO ] Deduced a trap composed of 231 places in 524 ms of which 1 ms to minimize.
[2024-05-25 08:35:31] [INFO ] Deduced a trap composed of 197 places in 477 ms of which 1 ms to minimize.
[2024-05-25 08:35:31] [INFO ] Deduced a trap composed of 222 places in 502 ms of which 1 ms to minimize.
[2024-05-25 08:35:32] [INFO ] Deduced a trap composed of 169 places in 503 ms of which 1 ms to minimize.
[2024-05-25 08:35:33] [INFO ] Deduced a trap composed of 176 places in 497 ms of which 1 ms to minimize.
[2024-05-25 08:35:33] [INFO ] Deduced a trap composed of 176 places in 487 ms of which 1 ms to minimize.
[2024-05-25 08:35:34] [INFO ] Deduced a trap composed of 174 places in 526 ms of which 1 ms to minimize.
[2024-05-25 08:35:34] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 7991 ms
[2024-05-25 08:35:34] [INFO ] After 8599ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2024-05-25 08:35:34] [INFO ] After 9757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 3788/3788 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1064 transition count 3787
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1063 transition count 3787
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1063 transition count 3787
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 1061 transition count 3785
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1061 transition count 3785
Applied a total of 8 rules in 250 ms. Remains 1061 /1064 variables (removed 3) and now considering 3785/3788 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 1061/1064 places, 3785/3788 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 71394 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71394 steps, saw 30364 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:35:38] [INFO ] Flow matrix only has 3387 transitions (discarded 398 similar events)
// Phase 1: matrix 3387 rows 1061 cols
[2024-05-25 08:35:38] [INFO ] Computed 80 invariants in 33 ms
[2024-05-25 08:35:38] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:35:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2024-05-25 08:35:38] [INFO ] [Nat]Absence check using 33 positive and 47 generalized place invariants in 8 ms returned sat
[2024-05-25 08:35:39] [INFO ] After 797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:35:39] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:35:40] [INFO ] After 627ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:35:40] [INFO ] Deduced a trap composed of 142 places in 550 ms of which 8 ms to minimize.
[2024-05-25 08:35:41] [INFO ] Deduced a trap composed of 159 places in 504 ms of which 1 ms to minimize.
[2024-05-25 08:35:42] [INFO ] Deduced a trap composed of 156 places in 490 ms of which 1 ms to minimize.
[2024-05-25 08:35:42] [INFO ] Deduced a trap composed of 154 places in 487 ms of which 1 ms to minimize.
[2024-05-25 08:35:43] [INFO ] Deduced a trap composed of 127 places in 491 ms of which 1 ms to minimize.
[2024-05-25 08:35:43] [INFO ] Deduced a trap composed of 170 places in 496 ms of which 1 ms to minimize.
[2024-05-25 08:35:44] [INFO ] Deduced a trap composed of 160 places in 526 ms of which 1 ms to minimize.
[2024-05-25 08:35:45] [INFO ] Deduced a trap composed of 197 places in 520 ms of which 1 ms to minimize.
[2024-05-25 08:35:45] [INFO ] Deduced a trap composed of 183 places in 521 ms of which 1 ms to minimize.
[2024-05-25 08:35:46] [INFO ] Deduced a trap composed of 166 places in 517 ms of which 1 ms to minimize.
[2024-05-25 08:35:47] [INFO ] Deduced a trap composed of 193 places in 595 ms of which 1 ms to minimize.
[2024-05-25 08:35:48] [INFO ] Deduced a trap composed of 140 places in 536 ms of which 1 ms to minimize.
[2024-05-25 08:35:49] [INFO ] Deduced a trap composed of 151 places in 496 ms of which 1 ms to minimize.
[2024-05-25 08:35:50] [INFO ] Deduced a trap composed of 156 places in 478 ms of which 1 ms to minimize.
[2024-05-25 08:35:50] [INFO ] Deduced a trap composed of 136 places in 505 ms of which 1 ms to minimize.
[2024-05-25 08:35:51] [INFO ] Deduced a trap composed of 161 places in 482 ms of which 1 ms to minimize.
[2024-05-25 08:35:52] [INFO ] Deduced a trap composed of 151 places in 485 ms of which 2 ms to minimize.
[2024-05-25 08:35:52] [INFO ] Deduced a trap composed of 120 places in 480 ms of which 1 ms to minimize.
[2024-05-25 08:35:53] [INFO ] Deduced a trap composed of 186 places in 480 ms of which 1 ms to minimize.
[2024-05-25 08:35:54] [INFO ] Deduced a trap composed of 136 places in 490 ms of which 1 ms to minimize.
[2024-05-25 08:35:54] [INFO ] Deduced a trap composed of 181 places in 482 ms of which 1 ms to minimize.
[2024-05-25 08:35:55] [INFO ] Deduced a trap composed of 159 places in 536 ms of which 1 ms to minimize.
[2024-05-25 08:35:56] [INFO ] Deduced a trap composed of 123 places in 536 ms of which 7 ms to minimize.
[2024-05-25 08:35:57] [INFO ] Deduced a trap composed of 114 places in 503 ms of which 1 ms to minimize.
[2024-05-25 08:35:58] [INFO ] Deduced a trap composed of 104 places in 516 ms of which 1 ms to minimize.
[2024-05-25 08:35:59] [INFO ] Deduced a trap composed of 114 places in 540 ms of which 1 ms to minimize.
[2024-05-25 08:35:59] [INFO ] Deduced a trap composed of 102 places in 505 ms of which 1 ms to minimize.
[2024-05-25 08:36:00] [INFO ] Deduced a trap composed of 113 places in 496 ms of which 1 ms to minimize.
[2024-05-25 08:36:01] [INFO ] Deduced a trap composed of 119 places in 499 ms of which 1 ms to minimize.
[2024-05-25 08:36:02] [INFO ] Deduced a trap composed of 128 places in 485 ms of which 2 ms to minimize.
[2024-05-25 08:36:03] [INFO ] Deduced a trap composed of 119 places in 507 ms of which 5 ms to minimize.
[2024-05-25 08:36:04] [INFO ] Deduced a trap composed of 126 places in 507 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 08:36:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 08:36:04] [INFO ] After 25529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1061/1061 places, 3785/3785 transitions.
Applied a total of 0 rules in 90 ms. Remains 1061 /1061 variables (removed 0) and now considering 3785/3785 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 1061/1061 places, 3785/3785 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1061/1061 places, 3785/3785 transitions.
Applied a total of 0 rules in 91 ms. Remains 1061 /1061 variables (removed 0) and now considering 3785/3785 (removed 0) transitions.
[2024-05-25 08:36:04] [INFO ] Flow matrix only has 3387 transitions (discarded 398 similar events)
[2024-05-25 08:36:04] [INFO ] Invariant cache hit.
[2024-05-25 08:36:05] [INFO ] Implicit Places using invariants in 1295 ms returned [7, 139, 140, 282, 304, 311, 312, 346, 347, 410, 426, 443, 453, 472, 482, 483, 484, 501, 510, 526, 559, 575, 576, 631, 653, 681, 708, 710, 748, 785, 878, 942, 943]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 1318 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1028/1061 places, 3785/3785 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1011 transition count 3768
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1011 transition count 3768
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 994 transition count 3751
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 994 transition count 3751
Applied a total of 68 rules in 135 ms. Remains 994 /1028 variables (removed 34) and now considering 3751/3785 (removed 34) transitions.
[2024-05-25 08:36:05] [INFO ] Flow matrix only has 3353 transitions (discarded 398 similar events)
// Phase 1: matrix 3353 rows 994 cols
[2024-05-25 08:36:05] [INFO ] Computed 47 invariants in 24 ms
[2024-05-25 08:36:06] [INFO ] Implicit Places using invariants in 1054 ms returned []
[2024-05-25 08:36:06] [INFO ] Flow matrix only has 3353 transitions (discarded 398 similar events)
[2024-05-25 08:36:06] [INFO ] Invariant cache hit.
[2024-05-25 08:36:07] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:36:25] [INFO ] Implicit Places using invariants and state equation in 18470 ms returned []
Implicit Place search using SMT with State Equation took 19535 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 994/1061 places, 3751/3785 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21080 ms. Remains : 994/1061 places, 3751/3785 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 74948 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74948 steps, saw 31494 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:36:28] [INFO ] Flow matrix only has 3353 transitions (discarded 398 similar events)
[2024-05-25 08:36:28] [INFO ] Invariant cache hit.
[2024-05-25 08:36:28] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:36:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 08:36:28] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-25 08:36:29] [INFO ] After 1039ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:36:29] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:36:30] [INFO ] After 418ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:36:30] [INFO ] Deduced a trap composed of 149 places in 445 ms of which 2 ms to minimize.
[2024-05-25 08:36:31] [INFO ] Deduced a trap composed of 157 places in 483 ms of which 8 ms to minimize.
[2024-05-25 08:36:32] [INFO ] Deduced a trap composed of 154 places in 476 ms of which 1 ms to minimize.
[2024-05-25 08:36:32] [INFO ] Deduced a trap composed of 179 places in 440 ms of which 0 ms to minimize.
[2024-05-25 08:36:33] [INFO ] Deduced a trap composed of 178 places in 444 ms of which 1 ms to minimize.
[2024-05-25 08:36:33] [INFO ] Deduced a trap composed of 198 places in 443 ms of which 1 ms to minimize.
[2024-05-25 08:36:34] [INFO ] Deduced a trap composed of 224 places in 445 ms of which 1 ms to minimize.
[2024-05-25 08:36:35] [INFO ] Deduced a trap composed of 169 places in 444 ms of which 1 ms to minimize.
[2024-05-25 08:36:35] [INFO ] Deduced a trap composed of 173 places in 437 ms of which 1 ms to minimize.
[2024-05-25 08:36:36] [INFO ] Deduced a trap composed of 217 places in 465 ms of which 1 ms to minimize.
[2024-05-25 08:36:36] [INFO ] Deduced a trap composed of 160 places in 429 ms of which 1 ms to minimize.
[2024-05-25 08:36:37] [INFO ] Deduced a trap composed of 172 places in 456 ms of which 1 ms to minimize.
[2024-05-25 08:36:38] [INFO ] Deduced a trap composed of 176 places in 439 ms of which 1 ms to minimize.
[2024-05-25 08:36:38] [INFO ] Deduced a trap composed of 81 places in 520 ms of which 2 ms to minimize.
[2024-05-25 08:36:39] [INFO ] Deduced a trap composed of 149 places in 423 ms of which 1 ms to minimize.
[2024-05-25 08:36:40] [INFO ] Deduced a trap composed of 152 places in 428 ms of which 0 ms to minimize.
[2024-05-25 08:36:41] [INFO ] Deduced a trap composed of 149 places in 437 ms of which 0 ms to minimize.
[2024-05-25 08:36:41] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 11207 ms
[2024-05-25 08:36:41] [INFO ] After 11701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-25 08:36:41] [INFO ] After 12979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 3751/3751 transitions.
Applied a total of 0 rules in 98 ms. Remains 994 /994 variables (removed 0) and now considering 3751/3751 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 994/994 places, 3751/3751 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 3751/3751 transitions.
Applied a total of 0 rules in 88 ms. Remains 994 /994 variables (removed 0) and now considering 3751/3751 (removed 0) transitions.
[2024-05-25 08:36:41] [INFO ] Flow matrix only has 3353 transitions (discarded 398 similar events)
[2024-05-25 08:36:41] [INFO ] Invariant cache hit.
[2024-05-25 08:36:42] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2024-05-25 08:36:42] [INFO ] Flow matrix only has 3353 transitions (discarded 398 similar events)
[2024-05-25 08:36:42] [INFO ] Invariant cache hit.
[2024-05-25 08:36:43] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:37:00] [INFO ] Implicit Places using invariants and state equation in 18082 ms returned []
Implicit Place search using SMT with State Equation took 19126 ms to find 0 implicit places.
[2024-05-25 08:37:01] [INFO ] Redundant transitions in 279 ms returned []
[2024-05-25 08:37:01] [INFO ] Flow matrix only has 3353 transitions (discarded 398 similar events)
[2024-05-25 08:37:01] [INFO ] Invariant cache hit.
[2024-05-25 08:37:02] [INFO ] Dead Transitions using invariants and state equation in 1387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20908 ms. Remains : 994/994 places, 3751/3751 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 564 stabilizing places and 1437 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 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 0 with 32 rules applied. Total rules applied 32 place count 1396 transition count 3038
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1364 transition count 3038
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1364 transition count 3006
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 1332 transition count 3006
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 148 place count 1312 transition count 2981
Iterating global reduction 2 with 20 rules applied. Total rules applied 168 place count 1312 transition count 2981
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 168 place count 1312 transition count 2980
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 170 place count 1311 transition count 2980
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 186 place count 1295 transition count 2904
Iterating global reduction 2 with 16 rules applied. Total rules applied 202 place count 1295 transition count 2904
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 205 place count 1292 transition count 2886
Iterating global reduction 2 with 3 rules applied. Total rules applied 208 place count 1292 transition count 2886
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 286 place count 1253 transition count 2847
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 304 place count 1235 transition count 2829
Iterating global reduction 2 with 18 rules applied. Total rules applied 322 place count 1235 transition count 2829
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 340 place count 1217 transition count 2721
Iterating global reduction 2 with 18 rules applied. Total rules applied 358 place count 1217 transition count 2721
Applied a total of 358 rules in 680 ms. Remains 1217 /1396 variables (removed 179) and now considering 2721/3070 (removed 349) transitions.
[2024-05-25 08:37:03] [INFO ] Flow matrix only has 2449 transitions (discarded 272 similar events)
// Phase 1: matrix 2449 rows 1217 cols
[2024-05-25 08:37:03] [INFO ] Computed 80 invariants in 32 ms
[2024-05-25 08:37:04] [INFO ] Implicit Places using invariants in 1203 ms returned [160, 161, 325, 352, 360, 361, 402, 403, 478, 499, 518, 532, 550, 552, 561, 562, 563, 581, 591, 609, 645, 663, 664, 682, 728, 753, 787, 818, 821, 866, 909, 1016, 1089, 1090]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 1215 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1183/1396 places, 2721/3070 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1165 transition count 2703
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1165 transition count 2703
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1147 transition count 2685
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1147 transition count 2685
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1137 transition count 2625
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1137 transition count 2625
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 114 place count 1126 transition count 2614
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 125 place count 1115 transition count 2603
Iterating global reduction 0 with 11 rules applied. Total rules applied 136 place count 1115 transition count 2603
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 149 place count 1102 transition count 2525
Iterating global reduction 0 with 13 rules applied. Total rules applied 162 place count 1102 transition count 2525
Applied a total of 162 rules in 322 ms. Remains 1102 /1183 variables (removed 81) and now considering 2525/2721 (removed 196) transitions.
[2024-05-25 08:37:05] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1102 cols
[2024-05-25 08:37:05] [INFO ] Computed 46 invariants in 21 ms
[2024-05-25 08:37:06] [INFO ] Implicit Places using invariants in 1041 ms returned []
[2024-05-25 08:37:06] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2024-05-25 08:37:06] [INFO ] Invariant cache hit.
[2024-05-25 08:37:06] [INFO ] State equation strengthened by 843 read => feed constraints.
[2024-05-25 08:37:14] [INFO ] Implicit Places using invariants and state equation in 8753 ms returned [1089]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9837 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1101/1396 places, 2525/3070 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 1101 transition count 2524
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 1100 transition count 2524
Applied a total of 2 rules in 70 ms. Remains 1100 /1101 variables (removed 1) and now considering 2524/2525 (removed 1) transitions.
[2024-05-25 08:37:14] [INFO ] Flow matrix only has 2252 transitions (discarded 272 similar events)
// Phase 1: matrix 2252 rows 1100 cols
[2024-05-25 08:37:15] [INFO ] Computed 45 invariants in 53 ms
[2024-05-25 08:37:15] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2024-05-25 08:37:15] [INFO ] Flow matrix only has 2252 transitions (discarded 272 similar events)
[2024-05-25 08:37:15] [INFO ] Invariant cache hit.
[2024-05-25 08:37:16] [INFO ] State equation strengthened by 843 read => feed constraints.
[2024-05-25 08:37:24] [INFO ] Implicit Places using invariants and state equation in 8690 ms returned []
Implicit Place search using SMT with State Equation took 9722 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1100/1396 places, 2524/3070 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 21846 ms. Remains : 1100/1396 places, 2524/3070 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 124 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-00 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 (LEQ 1 s343) (GT 2 s52))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-00 finished in 22034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 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 0 with 31 rules applied. Total rules applied 31 place count 1396 transition count 3039
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1365 transition count 3039
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 62 place count 1365 transition count 3007
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 126 place count 1333 transition count 3007
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 147 place count 1312 transition count 2981
Iterating global reduction 2 with 21 rules applied. Total rules applied 168 place count 1312 transition count 2981
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 168 place count 1312 transition count 2980
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 170 place count 1311 transition count 2980
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 187 place count 1294 transition count 2898
Iterating global reduction 2 with 17 rules applied. Total rules applied 204 place count 1294 transition count 2898
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 207 place count 1291 transition count 2880
Iterating global reduction 2 with 3 rules applied. Total rules applied 210 place count 1291 transition count 2880
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 288 place count 1252 transition count 2841
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 305 place count 1235 transition count 2824
Iterating global reduction 2 with 17 rules applied. Total rules applied 322 place count 1235 transition count 2824
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 339 place count 1218 transition count 2722
Iterating global reduction 2 with 17 rules applied. Total rules applied 356 place count 1218 transition count 2722
Applied a total of 356 rules in 346 ms. Remains 1218 /1396 variables (removed 178) and now considering 2722/3070 (removed 348) transitions.
[2024-05-25 08:37:25] [INFO ] Flow matrix only has 2450 transitions (discarded 272 similar events)
// Phase 1: matrix 2450 rows 1218 cols
[2024-05-25 08:37:25] [INFO ] Computed 80 invariants in 86 ms
[2024-05-25 08:37:26] [INFO ] Implicit Places using invariants in 1126 ms returned [9, 157, 158, 322, 348, 356, 357, 398, 399, 473, 494, 513, 527, 547, 559, 560, 561, 579, 589, 607, 643, 661, 662, 729, 754, 788, 819, 822, 867, 910, 1017, 1090, 1091]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 1152 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1185/1396 places, 2722/3070 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1168 transition count 2705
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1168 transition count 2705
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1151 transition count 2688
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1151 transition count 2688
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 1142 transition count 2634
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 1142 transition count 2634
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 108 place count 1131 transition count 2623
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 119 place count 1120 transition count 2612
Iterating global reduction 0 with 11 rules applied. Total rules applied 130 place count 1120 transition count 2612
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 143 place count 1107 transition count 2534
Iterating global reduction 0 with 13 rules applied. Total rules applied 156 place count 1107 transition count 2534
Applied a total of 156 rules in 261 ms. Remains 1107 /1185 variables (removed 78) and now considering 2534/2722 (removed 188) transitions.
[2024-05-25 08:37:26] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1107 cols
[2024-05-25 08:37:26] [INFO ] Computed 47 invariants in 21 ms
[2024-05-25 08:37:27] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-05-25 08:37:27] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-25 08:37:27] [INFO ] Invariant cache hit.
[2024-05-25 08:37:28] [INFO ] State equation strengthened by 848 read => feed constraints.
[2024-05-25 08:37:37] [INFO ] Implicit Places using invariants and state equation in 10028 ms returned []
Implicit Place search using SMT with State Equation took 10947 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1107/1396 places, 2534/3070 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12706 ms. Remains : 1107/1396 places, 2534/3070 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s625 s517)], 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 2278 reset in 646 ms.
Product exploration explored 100000 steps with 2278 reset in 578 ms.
Computed a total of 292 stabilizing places and 918 stable transitions
Computed a total of 292 stabilizing places and 918 stable transitions
Detected a total of 292/1107 stabilizing places and 918/2534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4616 steps, run visited all 1 properties in 165 ms. (steps per millisecond=27 )
Probabilistic random walk after 4616 steps, saw 2050 distinct states, run finished after 165 ms. (steps per millisecond=27 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 1107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1107/1107 places, 2534/2534 transitions.
Applied a total of 0 rules in 58 ms. Remains 1107 /1107 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
[2024-05-25 08:37:39] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-25 08:37:39] [INFO ] Invariant cache hit.
[2024-05-25 08:37:40] [INFO ] Implicit Places using invariants in 889 ms returned []
[2024-05-25 08:37:40] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-25 08:37:40] [INFO ] Invariant cache hit.
[2024-05-25 08:37:41] [INFO ] State equation strengthened by 848 read => feed constraints.
[2024-05-25 08:37:50] [INFO ] Implicit Places using invariants and state equation in 9636 ms returned []
Implicit Place search using SMT with State Equation took 10536 ms to find 0 implicit places.
[2024-05-25 08:37:50] [INFO ] Redundant transitions in 118 ms returned []
[2024-05-25 08:37:50] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-25 08:37:50] [INFO ] Invariant cache hit.
[2024-05-25 08:37:51] [INFO ] Dead Transitions using invariants and state equation in 1051 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11814 ms. Remains : 1107/1107 places, 2534/2534 transitions.
Computed a total of 292 stabilizing places and 918 stable transitions
Computed a total of 292 stabilizing places and 918 stable transitions
Detected a total of 292/1107 stabilizing places and 918/2534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 227 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 47 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4616 steps, run visited all 1 properties in 172 ms. (steps per millisecond=26 )
Probabilistic random walk after 4616 steps, saw 2050 distinct states, run finished after 172 ms. (steps per millisecond=26 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2277 reset in 489 ms.
Product exploration explored 100000 steps with 2279 reset in 505 ms.
Built C files in :
/tmp/ltsmin3980294541519125896
[2024-05-25 08:37:52] [INFO ] Too many transitions (2534) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:37:52] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3980294541519125896
Running compilation step : cd /tmp/ltsmin3980294541519125896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3980294541519125896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3980294541519125896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1107/1107 places, 2534/2534 transitions.
Applied a total of 0 rules in 66 ms. Remains 1107 /1107 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
[2024-05-25 08:37:56] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-25 08:37:56] [INFO ] Invariant cache hit.
[2024-05-25 08:37:56] [INFO ] Implicit Places using invariants in 874 ms returned []
[2024-05-25 08:37:56] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-25 08:37:56] [INFO ] Invariant cache hit.
[2024-05-25 08:37:57] [INFO ] State equation strengthened by 848 read => feed constraints.
[2024-05-25 08:38:07] [INFO ] Implicit Places using invariants and state equation in 10073 ms returned []
Implicit Place search using SMT with State Equation took 10968 ms to find 0 implicit places.
[2024-05-25 08:38:07] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-25 08:38:07] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-25 08:38:07] [INFO ] Invariant cache hit.
[2024-05-25 08:38:08] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12148 ms. Remains : 1107/1107 places, 2534/2534 transitions.
Built C files in :
/tmp/ltsmin4635445421928828527
[2024-05-25 08:38:08] [INFO ] Too many transitions (2534) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:38:08] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4635445421928828527
Running compilation step : cd /tmp/ltsmin4635445421928828527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4635445421928828527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4635445421928828527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:38:11] [INFO ] Flatten gal took : 93 ms
[2024-05-25 08:38:11] [INFO ] Flatten gal took : 159 ms
[2024-05-25 08:38:11] [INFO ] Time to serialize gal into /tmp/LTL807521708415711905.gal : 46 ms
[2024-05-25 08:38:11] [INFO ] Time to serialize properties into /tmp/LTL9981070297353253505.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL807521708415711905.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9879522765182222987.hoa' '-atoms' '/tmp/LTL9981070297353253505.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL9981070297353253505.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9879522765182222987.hoa
Detected timeout of ITS tools.
[2024-05-25 08:38:26] [INFO ] Flatten gal took : 71 ms
[2024-05-25 08:38:27] [INFO ] Flatten gal took : 87 ms
[2024-05-25 08:38:27] [INFO ] Time to serialize gal into /tmp/LTL8289930198763589599.gal : 23 ms
[2024-05-25 08:38:27] [INFO ] Time to serialize properties into /tmp/LTL5629738348887009984.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8289930198763589599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5629738348887009984.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(Node11HasTheLeafSetOfRx4ToReplaceNode8<=Node7HasTheLeafSetOfLx3ToReplaceNode2)"))))
Formula 0 simplified : GF!"(Node11HasTheLeafSetOfRx4ToReplaceNode8<=Node7HasTheLeafSetOfLx3ToReplaceNode2)"
Detected timeout of ITS tools.
[2024-05-25 08:38:42] [INFO ] Flatten gal took : 66 ms
[2024-05-25 08:38:42] [INFO ] Applying decomposition
[2024-05-25 08:38:42] [INFO ] Flatten gal took : 88 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1664639032333303706.txt' '-o' '/tmp/graph1664639032333303706.bin' '-w' '/tmp/graph1664639032333303706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1664639032333303706.bin' '-l' '-1' '-v' '-w' '/tmp/graph1664639032333303706.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:38:42] [INFO ] Decomposing Gal with order
[2024-05-25 08:38:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:38:43] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-25 08:38:43] [INFO ] Flatten gal took : 652 ms
[2024-05-25 08:38:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 24 ms.
[2024-05-25 08:38:44] [INFO ] Time to serialize gal into /tmp/LTL8919311354976153452.gal : 40 ms
[2024-05-25 08:38:44] [INFO ] Time to serialize properties into /tmp/LTL13830823628547220646.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8919311354976153452.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13830823628547220646.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu14.Node11HasTheLeafSetOfRx4ToReplaceNode8<=gu14.Node7HasTheLeafSetOfLx3ToReplaceNode2)"))))
Formula 0 simplified : GF!"(gu14.Node11HasTheLeafSetOfRx4ToReplaceNode8<=gu14.Node7HasTheLeafSetOfLx3ToReplaceNode2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16556380068558831316
[2024-05-25 08:38:59] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16556380068558831316
Running compilation step : cd /tmp/ltsmin16556380068558831316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16556380068558831316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16556380068558831316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-01 finished in 97613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 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 0 with 32 rules applied. Total rules applied 32 place count 1396 transition count 3038
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1364 transition count 3038
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1364 transition count 3006
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 1332 transition count 3006
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 149 place count 1311 transition count 2980
Iterating global reduction 2 with 21 rules applied. Total rules applied 170 place count 1311 transition count 2980
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 170 place count 1311 transition count 2979
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 172 place count 1310 transition count 2979
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 189 place count 1293 transition count 2897
Iterating global reduction 2 with 17 rules applied. Total rules applied 206 place count 1293 transition count 2897
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 209 place count 1290 transition count 2879
Iterating global reduction 2 with 3 rules applied. Total rules applied 212 place count 1290 transition count 2879
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 290 place count 1251 transition count 2840
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 308 place count 1233 transition count 2822
Iterating global reduction 2 with 18 rules applied. Total rules applied 326 place count 1233 transition count 2822
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 344 place count 1215 transition count 2714
Iterating global reduction 2 with 18 rules applied. Total rules applied 362 place count 1215 transition count 2714
Applied a total of 362 rules in 367 ms. Remains 1215 /1396 variables (removed 181) and now considering 2714/3070 (removed 356) transitions.
[2024-05-25 08:39:02] [INFO ] Flow matrix only has 2442 transitions (discarded 272 similar events)
// Phase 1: matrix 2442 rows 1215 cols
[2024-05-25 08:39:02] [INFO ] Computed 80 invariants in 30 ms
[2024-05-25 08:39:04] [INFO ] Implicit Places using invariants in 1444 ms returned [9, 157, 158, 322, 348, 356, 357, 398, 399, 473, 494, 513, 527, 545, 547, 556, 557, 558, 576, 607, 643, 661, 662, 680, 726, 785, 816, 819, 864, 907, 1014, 1087, 1088]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 1448 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1182/1396 places, 2714/3070 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1163 transition count 2695
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1163 transition count 2695
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1144 transition count 2676
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1144 transition count 2676
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 87 place count 1133 transition count 2610
Iterating global reduction 0 with 11 rules applied. Total rules applied 98 place count 1133 transition count 2610
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 118 place count 1123 transition count 2600
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 128 place count 1113 transition count 2590
Iterating global reduction 0 with 10 rules applied. Total rules applied 138 place count 1113 transition count 2590
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 150 place count 1101 transition count 2518
Iterating global reduction 0 with 12 rules applied. Total rules applied 162 place count 1101 transition count 2518
Applied a total of 162 rules in 269 ms. Remains 1101 /1182 variables (removed 81) and now considering 2518/2714 (removed 196) transitions.
[2024-05-25 08:39:04] [INFO ] Flow matrix only has 2246 transitions (discarded 272 similar events)
// Phase 1: matrix 2246 rows 1101 cols
[2024-05-25 08:39:04] [INFO ] Computed 47 invariants in 28 ms
[2024-05-25 08:39:05] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-05-25 08:39:05] [INFO ] Flow matrix only has 2246 transitions (discarded 272 similar events)
[2024-05-25 08:39:05] [INFO ] Invariant cache hit.
[2024-05-25 08:39:06] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 08:39:14] [INFO ] Implicit Places using invariants and state equation in 8669 ms returned [1075]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9567 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1100/1396 places, 2518/3070 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 1100 transition count 2517
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 1099 transition count 2517
Applied a total of 2 rules in 86 ms. Remains 1099 /1100 variables (removed 1) and now considering 2517/2518 (removed 1) transitions.
[2024-05-25 08:39:14] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
// Phase 1: matrix 2245 rows 1099 cols
[2024-05-25 08:39:14] [INFO ] Computed 46 invariants in 27 ms
[2024-05-25 08:39:15] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-05-25 08:39:15] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2024-05-25 08:39:15] [INFO ] Invariant cache hit.
[2024-05-25 08:39:15] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 08:39:23] [INFO ] Implicit Places using invariants and state equation in 8688 ms returned []
Implicit Place search using SMT with State Equation took 9599 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1099/1396 places, 2517/3070 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 21337 ms. Remains : 1099/1396 places, 2517/3070 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-03 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:(LEQ s550 s687)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2281 reset in 522 ms.
Product exploration explored 100000 steps with 2278 reset in 518 ms.
Computed a total of 284 stabilizing places and 901 stable transitions
Computed a total of 284 stabilizing places and 901 stable transitions
Detected a total of 284/1099 stabilizing places and 901/2517 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7340 steps, including 167 resets, run visited all 1 properties in 39 ms. (steps per millisecond=188 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1099 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1099/1099 places, 2517/2517 transitions.
Applied a total of 0 rules in 60 ms. Remains 1099 /1099 variables (removed 0) and now considering 2517/2517 (removed 0) transitions.
[2024-05-25 08:39:25] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2024-05-25 08:39:25] [INFO ] Invariant cache hit.
[2024-05-25 08:39:26] [INFO ] Implicit Places using invariants in 911 ms returned []
[2024-05-25 08:39:26] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2024-05-25 08:39:26] [INFO ] Invariant cache hit.
[2024-05-25 08:39:27] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 08:39:35] [INFO ] Implicit Places using invariants and state equation in 8808 ms returned []
Implicit Place search using SMT with State Equation took 9736 ms to find 0 implicit places.
[2024-05-25 08:39:35] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-25 08:39:35] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2024-05-25 08:39:35] [INFO ] Invariant cache hit.
[2024-05-25 08:39:36] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10895 ms. Remains : 1099/1099 places, 2517/2517 transitions.
Computed a total of 284 stabilizing places and 901 stable transitions
Computed a total of 284 stabilizing places and 901 stable transitions
Detected a total of 284/1099 stabilizing places and 901/2517 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1598 steps, including 36 resets, run visited all 1 properties in 13 ms. (steps per millisecond=122 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2280 reset in 490 ms.
Product exploration explored 100000 steps with 2283 reset in 517 ms.
Built C files in :
/tmp/ltsmin5875596642994273999
[2024-05-25 08:39:37] [INFO ] Too many transitions (2517) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:39:37] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5875596642994273999
Running compilation step : cd /tmp/ltsmin5875596642994273999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5875596642994273999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5875596642994273999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1099 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1099/1099 places, 2517/2517 transitions.
Applied a total of 0 rules in 69 ms. Remains 1099 /1099 variables (removed 0) and now considering 2517/2517 (removed 0) transitions.
[2024-05-25 08:39:41] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2024-05-25 08:39:41] [INFO ] Invariant cache hit.
[2024-05-25 08:39:41] [INFO ] Implicit Places using invariants in 874 ms returned []
[2024-05-25 08:39:41] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2024-05-25 08:39:41] [INFO ] Invariant cache hit.
[2024-05-25 08:39:42] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 08:39:50] [INFO ] Implicit Places using invariants and state equation in 8824 ms returned []
Implicit Place search using SMT with State Equation took 9700 ms to find 0 implicit places.
[2024-05-25 08:39:50] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-25 08:39:50] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2024-05-25 08:39:50] [INFO ] Invariant cache hit.
[2024-05-25 08:39:51] [INFO ] Dead Transitions using invariants and state equation in 1061 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10931 ms. Remains : 1099/1099 places, 2517/2517 transitions.
Built C files in :
/tmp/ltsmin4346925209384176734
[2024-05-25 08:39:51] [INFO ] Too many transitions (2517) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:39:51] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4346925209384176734
Running compilation step : cd /tmp/ltsmin4346925209384176734;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4346925209384176734;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4346925209384176734;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:39:55] [INFO ] Flatten gal took : 239 ms
[2024-05-25 08:39:55] [INFO ] Flatten gal took : 149 ms
[2024-05-25 08:39:55] [INFO ] Time to serialize gal into /tmp/LTL9834024855605980448.gal : 25 ms
[2024-05-25 08:39:55] [INFO ] Time to serialize properties into /tmp/LTL2118010343167293087.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9834024855605980448.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7057181169968185792.hoa' '-atoms' '/tmp/LTL2118010343167293087.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2118010343167293087.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7057181169968185792.hoa
Detected timeout of ITS tools.
[2024-05-25 08:40:10] [INFO ] Flatten gal took : 78 ms
[2024-05-25 08:40:10] [INFO ] Flatten gal took : 68 ms
[2024-05-25 08:40:10] [INFO ] Time to serialize gal into /tmp/LTL13090253702386454304.gal : 43 ms
[2024-05-25 08:40:10] [INFO ] Time to serialize properties into /tmp/LTL18296208760913231015.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13090253702386454304.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18296208760913231015.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node8HasTheLeafSetOfRx1ToReplaceNode16<=Node13WantsToManageTheCrashOfNode1)"))))
Formula 0 simplified : FG!"(Node8HasTheLeafSetOfRx1ToReplaceNode16<=Node13WantsToManageTheCrashOfNode1)"
Detected timeout of ITS tools.
[2024-05-25 08:40:25] [INFO ] Flatten gal took : 55 ms
[2024-05-25 08:40:25] [INFO ] Applying decomposition
[2024-05-25 08:40:26] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8829055320905538044.txt' '-o' '/tmp/graph8829055320905538044.bin' '-w' '/tmp/graph8829055320905538044.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8829055320905538044.bin' '-l' '-1' '-v' '-w' '/tmp/graph8829055320905538044.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:40:26] [INFO ] Decomposing Gal with order
[2024-05-25 08:40:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:40:26] [INFO ] Removed a total of 514 redundant transitions.
[2024-05-25 08:40:26] [INFO ] Flatten gal took : 161 ms
[2024-05-25 08:40:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-05-25 08:40:27] [INFO ] Time to serialize gal into /tmp/LTL3205034176836803633.gal : 31 ms
[2024-05-25 08:40:27] [INFO ] Time to serialize properties into /tmp/LTL18334027447578760239.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3205034176836803633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18334027447578760239.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu19.Node8HasTheLeafSetOfRx1ToReplaceNode16<=gu19.Node13WantsToManageTheCrashOfNode1)"))))
Formula 0 simplified : FG!"(gu19.Node8HasTheLeafSetOfRx1ToReplaceNode16<=gu19.Node13WantsToManageTheCrashOfNode1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11566651203101921572
[2024-05-25 08:40:42] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11566651203101921572
Running compilation step : cd /tmp/ltsmin11566651203101921572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11566651203101921572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11566651203101921572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-03 finished in 103197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p0)&&(p1 U X(X(G(p1))))))))'
Support contains 3 out of 1396 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1358 transition count 3027
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1358 transition count 3027
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 110 place count 1324 transition count 2928
Iterating global reduction 0 with 34 rules applied. Total rules applied 144 place count 1324 transition count 2928
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 165 place count 1303 transition count 2817
Iterating global reduction 0 with 21 rules applied. Total rules applied 186 place count 1303 transition count 2817
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 188 place count 1301 transition count 2805
Iterating global reduction 0 with 2 rules applied. Total rules applied 190 place count 1301 transition count 2805
Applied a total of 190 rules in 187 ms. Remains 1301 /1396 variables (removed 95) and now considering 2805/3070 (removed 265) transitions.
[2024-05-25 08:40:45] [INFO ] Flow matrix only has 2533 transitions (discarded 272 similar events)
// Phase 1: matrix 2533 rows 1301 cols
[2024-05-25 08:40:45] [INFO ] Computed 80 invariants in 28 ms
[2024-05-25 08:40:46] [INFO ] Implicit Places using invariants in 1105 ms returned [10, 183, 184, 352, 379, 389, 434, 516, 537, 559, 573, 594, 596, 605, 606, 607, 630, 640, 661, 699, 719, 720, 738, 788, 815, 849, 882, 885, 930, 976, 1085, 1158, 1159]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 1116 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1268/1396 places, 2805/3070 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1240 transition count 2777
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1240 transition count 2777
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 84 place count 1212 transition count 2749
Iterating global reduction 0 with 28 rules applied. Total rules applied 112 place count 1212 transition count 2749
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 140 place count 1184 transition count 2721
Iterating global reduction 0 with 28 rules applied. Total rules applied 168 place count 1184 transition count 2721
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 190 place count 1162 transition count 2589
Iterating global reduction 0 with 22 rules applied. Total rules applied 212 place count 1162 transition count 2589
Applied a total of 212 rules in 152 ms. Remains 1162 /1268 variables (removed 106) and now considering 2589/2805 (removed 216) transitions.
[2024-05-25 08:40:47] [INFO ] Flow matrix only has 2317 transitions (discarded 272 similar events)
// Phase 1: matrix 2317 rows 1162 cols
[2024-05-25 08:40:47] [INFO ] Computed 47 invariants in 28 ms
[2024-05-25 08:40:48] [INFO ] Implicit Places using invariants in 969 ms returned []
[2024-05-25 08:40:48] [INFO ] Flow matrix only has 2317 transitions (discarded 272 similar events)
[2024-05-25 08:40:48] [INFO ] Invariant cache hit.
[2024-05-25 08:40:49] [INFO ] State equation strengthened by 848 read => feed constraints.
[2024-05-25 08:40:57] [INFO ] Implicit Places using invariants and state equation in 9748 ms returned []
Implicit Place search using SMT with State Equation took 10718 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1162/1396 places, 2589/3070 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12174 ms. Remains : 1162/1396 places, 2589/3070 transitions.
Stuttering acceptance computed with spot in 417 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 5}, { cond=p0, acceptance={0} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 7}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 7}, { cond=p1, acceptance={0} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 7}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GT s379 s425), p1:(LEQ 1 s1124)], 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]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-05 finished in 12626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 4 out of 1396 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1360 transition count 3034
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1360 transition count 3034
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 105 place count 1327 transition count 2936
Iterating global reduction 0 with 33 rules applied. Total rules applied 138 place count 1327 transition count 2936
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 158 place count 1307 transition count 2821
Iterating global reduction 0 with 20 rules applied. Total rules applied 178 place count 1307 transition count 2821
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 179 place count 1306 transition count 2815
Iterating global reduction 0 with 1 rules applied. Total rules applied 180 place count 1306 transition count 2815
Applied a total of 180 rules in 165 ms. Remains 1306 /1396 variables (removed 90) and now considering 2815/3070 (removed 255) transitions.
[2024-05-25 08:40:58] [INFO ] Flow matrix only has 2543 transitions (discarded 272 similar events)
// Phase 1: matrix 2543 rows 1306 cols
[2024-05-25 08:40:58] [INFO ] Computed 80 invariants in 28 ms
[2024-05-25 08:40:59] [INFO ] Implicit Places using invariants in 1130 ms returned [10, 184, 185, 353, 380, 389, 390, 431, 432, 514, 535, 557, 571, 592, 594, 603, 604, 605, 628, 638, 659, 699, 719, 720, 738, 788, 815, 849, 882, 885, 930, 976, 1085, 1158]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 1147 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1272/1396 places, 2815/3070 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1243 transition count 2786
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1243 transition count 2786
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 87 place count 1214 transition count 2757
Iterating global reduction 0 with 29 rules applied. Total rules applied 116 place count 1214 transition count 2757
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 145 place count 1185 transition count 2728
Iterating global reduction 0 with 29 rules applied. Total rules applied 174 place count 1185 transition count 2728
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 196 place count 1163 transition count 2596
Iterating global reduction 0 with 22 rules applied. Total rules applied 218 place count 1163 transition count 2596
Applied a total of 218 rules in 176 ms. Remains 1163 /1272 variables (removed 109) and now considering 2596/2815 (removed 219) transitions.
[2024-05-25 08:40:59] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
// Phase 1: matrix 2324 rows 1163 cols
[2024-05-25 08:40:59] [INFO ] Computed 46 invariants in 18 ms
[2024-05-25 08:41:00] [INFO ] Implicit Places using invariants in 973 ms returned []
[2024-05-25 08:41:00] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-25 08:41:00] [INFO ] Invariant cache hit.
[2024-05-25 08:41:01] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 08:41:10] [INFO ] Implicit Places using invariants and state equation in 10244 ms returned []
Implicit Place search using SMT with State Equation took 11228 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1163/1396 places, 2596/3070 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12724 ms. Remains : 1163/1396 places, 2596/3070 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s608 s1088), p0:(LEQ s476 s106)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1604 reset in 502 ms.
Product exploration explored 100000 steps with 1603 reset in 513 ms.
Computed a total of 331 stabilizing places and 963 stable transitions
Computed a total of 331 stabilizing places and 963 stable transitions
Detected a total of 331/1163 stabilizing places and 963/2596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 179 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 159 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:41:12] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-25 08:41:12] [INFO ] Invariant cache hit.
[2024-05-25 08:41:12] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:41:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-25 08:41:12] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-25 08:41:12] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 268 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 1163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1163/1163 places, 2596/2596 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1163 transition count 2575
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1142 transition count 2575
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 42 place count 1142 transition count 2563
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 66 place count 1130 transition count 2563
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 108 place count 1109 transition count 2542
Applied a total of 108 rules in 184 ms. Remains 1109 /1163 variables (removed 54) and now considering 2542/2596 (removed 54) transitions.
[2024-05-25 08:41:13] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1109 cols
[2024-05-25 08:41:13] [INFO ] Computed 46 invariants in 21 ms
[2024-05-25 08:41:14] [INFO ] Implicit Places using invariants in 990 ms returned []
[2024-05-25 08:41:14] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:41:14] [INFO ] Invariant cache hit.
[2024-05-25 08:41:15] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 08:41:23] [INFO ] Implicit Places using invariants and state equation in 8768 ms returned []
Implicit Place search using SMT with State Equation took 9782 ms to find 0 implicit places.
[2024-05-25 08:41:23] [INFO ] Redundant transitions in 72 ms returned []
[2024-05-25 08:41:23] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:41:23] [INFO ] Invariant cache hit.
[2024-05-25 08:41:24] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1109/1163 places, 2542/2596 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11096 ms. Remains : 1109/1163 places, 2542/2596 transitions.
Computed a total of 294 stabilizing places and 926 stable transitions
Computed a total of 294 stabilizing places and 926 stable transitions
Detected a total of 294/1109 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 304 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:41:25] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:41:25] [INFO ] Invariant cache hit.
[2024-05-25 08:41:25] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:41:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 08:41:25] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-25 08:41:25] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 259 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2270 reset in 500 ms.
Product exploration explored 100000 steps with 2269 reset in 526 ms.
Built C files in :
/tmp/ltsmin990896602189826231
[2024-05-25 08:41:26] [INFO ] Too many transitions (2542) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:41:26] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin990896602189826231
Running compilation step : cd /tmp/ltsmin990896602189826231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin990896602189826231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin990896602189826231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1109/1109 places, 2542/2542 transitions.
Applied a total of 0 rules in 99 ms. Remains 1109 /1109 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-25 08:41:30] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:41:30] [INFO ] Invariant cache hit.
[2024-05-25 08:41:31] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2024-05-25 08:41:31] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:41:31] [INFO ] Invariant cache hit.
[2024-05-25 08:41:31] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 08:41:39] [INFO ] Implicit Places using invariants and state equation in 8789 ms returned []
Implicit Place search using SMT with State Equation took 9816 ms to find 0 implicit places.
[2024-05-25 08:41:39] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-25 08:41:39] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:41:39] [INFO ] Invariant cache hit.
[2024-05-25 08:41:41] [INFO ] Dead Transitions using invariants and state equation in 1048 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11062 ms. Remains : 1109/1109 places, 2542/2542 transitions.
Built C files in :
/tmp/ltsmin7645908286208222226
[2024-05-25 08:41:41] [INFO ] Too many transitions (2542) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:41:41] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7645908286208222226
Running compilation step : cd /tmp/ltsmin7645908286208222226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7645908286208222226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7645908286208222226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:41:44] [INFO ] Flatten gal took : 54 ms
[2024-05-25 08:41:44] [INFO ] Flatten gal took : 105 ms
[2024-05-25 08:41:44] [INFO ] Time to serialize gal into /tmp/LTL18304273694070093746.gal : 38 ms
[2024-05-25 08:41:44] [INFO ] Time to serialize properties into /tmp/LTL3956479300553181414.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18304273694070093746.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14268194591080741402.hoa' '-atoms' '/tmp/LTL3956479300553181414.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3956479300553181414.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14268194591080741402.hoa
Detected timeout of ITS tools.
[2024-05-25 08:41:59] [INFO ] Flatten gal took : 67 ms
[2024-05-25 08:41:59] [INFO ] Flatten gal took : 73 ms
[2024-05-25 08:41:59] [INFO ] Time to serialize gal into /tmp/LTL10019868494231312536.gal : 42 ms
[2024-05-25 08:41:59] [INFO ] Time to serialize properties into /tmp/LTL6153098231824582474.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10019868494231312536.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6153098231824582474.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(LeafSetOfRx0IsSentToNode4<=Node0ManageTheCrashOfNode10)")))||(G("(LeafSetOfLx2IsSentToNode9<=Node16HasTheLeafSetOfRx5ToRep...172
Formula 0 simplified : X(FG!"(LeafSetOfRx0IsSentToNode4<=Node0ManageTheCrashOfNode10)" & F!"(LeafSetOfLx2IsSentToNode9<=Node16HasTheLeafSetOfRx5ToReplaceNo...162
Detected timeout of ITS tools.
[2024-05-25 08:42:14] [INFO ] Flatten gal took : 60 ms
[2024-05-25 08:42:14] [INFO ] Applying decomposition
[2024-05-25 08:42:14] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10140902788617192393.txt' '-o' '/tmp/graph10140902788617192393.bin' '-w' '/tmp/graph10140902788617192393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10140902788617192393.bin' '-l' '-1' '-v' '-w' '/tmp/graph10140902788617192393.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:42:15] [INFO ] Decomposing Gal with order
[2024-05-25 08:42:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:42:15] [INFO ] Removed a total of 72 redundant transitions.
[2024-05-25 08:42:15] [INFO ] Flatten gal took : 78 ms
[2024-05-25 08:42:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2024-05-25 08:42:15] [INFO ] Time to serialize gal into /tmp/LTL15156235337615433125.gal : 36 ms
[2024-05-25 08:42:15] [INFO ] Time to serialize properties into /tmp/LTL5407970354315209990.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15156235337615433125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5407970354315209990.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(gu2.LeafSetOfRx0IsSentToNode4<=gu2.Node0ManageTheCrashOfNode10)")))||(G("(gu10.LeafSetOfLx2IsSentToNode9<=gu10.Node16HasTh...190
Formula 0 simplified : X(FG!"(gu2.LeafSetOfRx0IsSentToNode4<=gu2.Node0ManageTheCrashOfNode10)" & F!"(gu10.LeafSetOfLx2IsSentToNode9<=gu10.Node16HasTheLeafS...180
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17156038985427085102
[2024-05-25 08:42:30] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17156038985427085102
Running compilation step : cd /tmp/ltsmin17156038985427085102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17156038985427085102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17156038985427085102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-06 finished in 95467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 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 0 with 33 rules applied. Total rules applied 33 place count 1396 transition count 3037
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 1363 transition count 3037
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 66 place count 1363 transition count 3005
Deduced a syphon composed of 32 places in 3 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 130 place count 1331 transition count 3005
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 151 place count 1310 transition count 2979
Iterating global reduction 2 with 21 rules applied. Total rules applied 172 place count 1310 transition count 2979
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 172 place count 1310 transition count 2978
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 174 place count 1309 transition count 2978
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 191 place count 1292 transition count 2896
Iterating global reduction 2 with 17 rules applied. Total rules applied 208 place count 1292 transition count 2896
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 211 place count 1289 transition count 2878
Iterating global reduction 2 with 3 rules applied. Total rules applied 214 place count 1289 transition count 2878
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 292 place count 1250 transition count 2839
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 311 place count 1231 transition count 2820
Iterating global reduction 2 with 19 rules applied. Total rules applied 330 place count 1231 transition count 2820
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 349 place count 1212 transition count 2706
Iterating global reduction 2 with 19 rules applied. Total rules applied 368 place count 1212 transition count 2706
Applied a total of 368 rules in 429 ms. Remains 1212 /1396 variables (removed 184) and now considering 2706/3070 (removed 364) transitions.
[2024-05-25 08:42:34] [INFO ] Flow matrix only has 2434 transitions (discarded 272 similar events)
// Phase 1: matrix 2434 rows 1212 cols
[2024-05-25 08:42:34] [INFO ] Computed 80 invariants in 34 ms
[2024-05-25 08:42:35] [INFO ] Implicit Places using invariants in 1107 ms returned [9, 157, 158, 322, 356, 357, 398, 399, 473, 494, 513, 527, 545, 547, 556, 557, 558, 576, 586, 604, 640, 658, 659, 677, 723, 748, 782, 813, 816, 861, 904, 1011, 1084, 1085]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 1122 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1178/1396 places, 2706/3070 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1159 transition count 2687
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1159 transition count 2687
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 56 place count 1141 transition count 2669
Iterating global reduction 0 with 18 rules applied. Total rules applied 74 place count 1141 transition count 2669
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 84 place count 1131 transition count 2609
Iterating global reduction 0 with 10 rules applied. Total rules applied 94 place count 1131 transition count 2609
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 116 place count 1120 transition count 2598
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 127 place count 1109 transition count 2587
Iterating global reduction 0 with 11 rules applied. Total rules applied 138 place count 1109 transition count 2587
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 151 place count 1096 transition count 2509
Iterating global reduction 0 with 13 rules applied. Total rules applied 164 place count 1096 transition count 2509
Applied a total of 164 rules in 358 ms. Remains 1096 /1178 variables (removed 82) and now considering 2509/2706 (removed 197) transitions.
[2024-05-25 08:42:35] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1096 cols
[2024-05-25 08:42:35] [INFO ] Computed 46 invariants in 21 ms
[2024-05-25 08:42:36] [INFO ] Implicit Places using invariants in 905 ms returned []
[2024-05-25 08:42:36] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:42:36] [INFO ] Invariant cache hit.
[2024-05-25 08:42:37] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 08:42:45] [INFO ] Implicit Places using invariants and state equation in 8539 ms returned [1083]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9446 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1095/1396 places, 2509/3070 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 1095 transition count 2508
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 1094 transition count 2508
Applied a total of 2 rules in 73 ms. Remains 1094 /1095 variables (removed 1) and now considering 2508/2509 (removed 1) transitions.
[2024-05-25 08:42:45] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1094 cols
[2024-05-25 08:42:45] [INFO ] Computed 45 invariants in 21 ms
[2024-05-25 08:42:46] [INFO ] Implicit Places using invariants in 856 ms returned []
[2024-05-25 08:42:46] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-25 08:42:46] [INFO ] Invariant cache hit.
[2024-05-25 08:42:46] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 08:42:54] [INFO ] Implicit Places using invariants and state equation in 8366 ms returned []
Implicit Place search using SMT with State Equation took 9240 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1094/1396 places, 2508/3070 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 20670 ms. Remains : 1094/1396 places, 2508/3070 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s506 s337)], 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 2281 reset in 504 ms.
Product exploration explored 100000 steps with 2279 reset in 539 ms.
Computed a total of 279 stabilizing places and 892 stable transitions
Computed a total of 279 stabilizing places and 892 stable transitions
Detected a total of 279/1094 stabilizing places and 892/2508 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 2359 steps, including 53 resets, run visited all 1 properties in 15 ms. (steps per millisecond=157 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 1094 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1094/1094 places, 2508/2508 transitions.
Applied a total of 0 rules in 78 ms. Remains 1094 /1094 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
[2024-05-25 08:42:55] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-25 08:42:55] [INFO ] Invariant cache hit.
[2024-05-25 08:42:56] [INFO ] Implicit Places using invariants in 846 ms returned []
[2024-05-25 08:42:56] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-25 08:42:56] [INFO ] Invariant cache hit.
[2024-05-25 08:42:57] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 08:43:05] [INFO ] Implicit Places using invariants and state equation in 8289 ms returned []
Implicit Place search using SMT with State Equation took 9146 ms to find 0 implicit places.
[2024-05-25 08:43:05] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-25 08:43:05] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-25 08:43:05] [INFO ] Invariant cache hit.
[2024-05-25 08:43:06] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10351 ms. Remains : 1094/1094 places, 2508/2508 transitions.
Computed a total of 279 stabilizing places and 892 stable transitions
Computed a total of 279 stabilizing places and 892 stable transitions
Detected a total of 279/1094 stabilizing places and 892/2508 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 661 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2280 reset in 504 ms.
Product exploration explored 100000 steps with 2279 reset in 538 ms.
Built C files in :
/tmp/ltsmin17556475716974926613
[2024-05-25 08:43:08] [INFO ] Too many transitions (2508) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:43:08] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17556475716974926613
Running compilation step : cd /tmp/ltsmin17556475716974926613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17556475716974926613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17556475716974926613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1094 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1094/1094 places, 2508/2508 transitions.
Applied a total of 0 rules in 70 ms. Remains 1094 /1094 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
[2024-05-25 08:43:11] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-25 08:43:11] [INFO ] Invariant cache hit.
[2024-05-25 08:43:12] [INFO ] Implicit Places using invariants in 853 ms returned []
[2024-05-25 08:43:12] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-25 08:43:12] [INFO ] Invariant cache hit.
[2024-05-25 08:43:12] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-25 08:43:20] [INFO ] Implicit Places using invariants and state equation in 8223 ms returned []
Implicit Place search using SMT with State Equation took 9094 ms to find 0 implicit places.
[2024-05-25 08:43:20] [INFO ] Redundant transitions in 68 ms returned []
[2024-05-25 08:43:20] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-25 08:43:20] [INFO ] Invariant cache hit.
[2024-05-25 08:43:21] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10332 ms. Remains : 1094/1094 places, 2508/2508 transitions.
Built C files in :
/tmp/ltsmin17481070257224506553
[2024-05-25 08:43:21] [INFO ] Too many transitions (2508) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:43:21] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17481070257224506553
Running compilation step : cd /tmp/ltsmin17481070257224506553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17481070257224506553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17481070257224506553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:43:24] [INFO ] Flatten gal took : 50 ms
[2024-05-25 08:43:24] [INFO ] Flatten gal took : 51 ms
[2024-05-25 08:43:24] [INFO ] Time to serialize gal into /tmp/LTL9316685452672731227.gal : 9 ms
[2024-05-25 08:43:24] [INFO ] Time to serialize properties into /tmp/LTL15212609105758564918.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9316685452672731227.gal' '-t' 'CGAL' '-hoa' '/tmp/aut430124013480007842.hoa' '-atoms' '/tmp/LTL15212609105758564918.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL15212609105758564918.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut430124013480007842.hoa
Detected timeout of ITS tools.
[2024-05-25 08:43:39] [INFO ] Flatten gal took : 59 ms
[2024-05-25 08:43:39] [INFO ] Flatten gal took : 53 ms
[2024-05-25 08:43:39] [INFO ] Time to serialize gal into /tmp/LTL12636427893851434197.gal : 26 ms
[2024-05-25 08:43:39] [INFO ] Time to serialize properties into /tmp/LTL12585513405065585010.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12636427893851434197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12585513405065585010.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(RequestOfNode6IsSentToLx3<=NoNodeManageTheCrashOfNode2)"))))
Formula 0 simplified : GF!"(RequestOfNode6IsSentToLx3<=NoNodeManageTheCrashOfNode2)"
Detected timeout of ITS tools.
[2024-05-25 08:43:55] [INFO ] Flatten gal took : 50 ms
[2024-05-25 08:43:55] [INFO ] Applying decomposition
[2024-05-25 08:43:55] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7450150410607639169.txt' '-o' '/tmp/graph7450150410607639169.bin' '-w' '/tmp/graph7450150410607639169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7450150410607639169.bin' '-l' '-1' '-v' '-w' '/tmp/graph7450150410607639169.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:43:55] [INFO ] Decomposing Gal with order
[2024-05-25 08:43:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:43:55] [INFO ] Removed a total of 1448 redundant transitions.
[2024-05-25 08:43:55] [INFO ] Flatten gal took : 476 ms
[2024-05-25 08:43:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 285 labels/synchronizations in 79 ms.
[2024-05-25 08:43:56] [INFO ] Time to serialize gal into /tmp/LTL6196702596813165306.gal : 15 ms
[2024-05-25 08:43:56] [INFO ] Time to serialize properties into /tmp/LTL967323407475565741.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6196702596813165306.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL967323407475565741.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu52.RequestOfNode6IsSentToLx3<=gu52.NoNodeManageTheCrashOfNode2)"))))
Formula 0 simplified : GF!"(gu52.RequestOfNode6IsSentToLx3<=gu52.NoNodeManageTheCrashOfNode2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10150272058220029008
[2024-05-25 08:44:11] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10150272058220029008
Running compilation step : cd /tmp/ltsmin10150272058220029008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10150272058220029008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10150272058220029008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-08 finished in 100618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 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 0 with 33 rules applied. Total rules applied 33 place count 1396 transition count 3037
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 1363 transition count 3037
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 66 place count 1363 transition count 3005
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 130 place count 1331 transition count 3005
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 151 place count 1310 transition count 2979
Iterating global reduction 2 with 21 rules applied. Total rules applied 172 place count 1310 transition count 2979
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 172 place count 1310 transition count 2978
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 174 place count 1309 transition count 2978
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 191 place count 1292 transition count 2896
Iterating global reduction 2 with 17 rules applied. Total rules applied 208 place count 1292 transition count 2896
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 211 place count 1289 transition count 2878
Iterating global reduction 2 with 3 rules applied. Total rules applied 214 place count 1289 transition count 2878
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 292 place count 1250 transition count 2839
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 311 place count 1231 transition count 2820
Iterating global reduction 2 with 19 rules applied. Total rules applied 330 place count 1231 transition count 2820
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 349 place count 1212 transition count 2706
Iterating global reduction 2 with 19 rules applied. Total rules applied 368 place count 1212 transition count 2706
Applied a total of 368 rules in 615 ms. Remains 1212 /1396 variables (removed 184) and now considering 2706/3070 (removed 364) transitions.
[2024-05-25 08:44:14] [INFO ] Flow matrix only has 2434 transitions (discarded 272 similar events)
// Phase 1: matrix 2434 rows 1212 cols
[2024-05-25 08:44:15] [INFO ] Computed 80 invariants in 27 ms
[2024-05-25 08:44:16] [INFO ] Implicit Places using invariants in 1112 ms returned [9, 157, 158, 322, 348, 356, 357, 398, 399, 473, 494, 513, 527, 545, 547, 556, 557, 558, 576, 586, 604, 640, 658, 659, 677, 723, 748, 782, 816, 861, 904, 1011, 1084, 1085]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 1127 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1178/1396 places, 2706/3070 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1159 transition count 2687
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1159 transition count 2687
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1140 transition count 2668
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1140 transition count 2668
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 87 place count 1129 transition count 2602
Iterating global reduction 0 with 11 rules applied. Total rules applied 98 place count 1129 transition count 2602
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 120 place count 1118 transition count 2591
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 131 place count 1107 transition count 2580
Iterating global reduction 0 with 11 rules applied. Total rules applied 142 place count 1107 transition count 2580
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 155 place count 1094 transition count 2502
Iterating global reduction 0 with 13 rules applied. Total rules applied 168 place count 1094 transition count 2502
Applied a total of 168 rules in 355 ms. Remains 1094 /1178 variables (removed 84) and now considering 2502/2706 (removed 204) transitions.
[2024-05-25 08:44:16] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1094 cols
[2024-05-25 08:44:16] [INFO ] Computed 46 invariants in 24 ms
[2024-05-25 08:44:17] [INFO ] Implicit Places using invariants in 953 ms returned []
[2024-05-25 08:44:17] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-25 08:44:17] [INFO ] Invariant cache hit.
[2024-05-25 08:44:18] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-25 08:44:26] [INFO ] Implicit Places using invariants and state equation in 8635 ms returned [1069, 1081]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9605 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1092/1396 places, 2502/3070 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 1092 transition count 2500
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 1090 transition count 2500
Applied a total of 4 rules in 100 ms. Remains 1090 /1092 variables (removed 2) and now considering 2500/2502 (removed 2) transitions.
[2024-05-25 08:44:26] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1090 cols
[2024-05-25 08:44:26] [INFO ] Computed 44 invariants in 18 ms
[2024-05-25 08:44:27] [INFO ] Implicit Places using invariants in 854 ms returned []
[2024-05-25 08:44:27] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-25 08:44:27] [INFO ] Invariant cache hit.
[2024-05-25 08:44:27] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-25 08:44:35] [INFO ] Implicit Places using invariants and state equation in 8263 ms returned []
Implicit Place search using SMT with State Equation took 9117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1090/1396 places, 2500/3070 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 20920 ms. Remains : 1090/1396 places, 2500/3070 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s742 s214)], 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 2279 reset in 491 ms.
Product exploration explored 100000 steps with 2277 reset in 512 ms.
Computed a total of 275 stabilizing places and 884 stable transitions
Computed a total of 275 stabilizing places and 884 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 1122 steps, including 25 resets, run visited all 1 properties in 7 ms. (steps per millisecond=160 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2500/2500 transitions.
Applied a total of 0 rules in 74 ms. Remains 1090 /1090 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-25 08:44:36] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-25 08:44:36] [INFO ] Invariant cache hit.
[2024-05-25 08:44:37] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-05-25 08:44:37] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-25 08:44:37] [INFO ] Invariant cache hit.
[2024-05-25 08:44:38] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-25 08:44:45] [INFO ] Implicit Places using invariants and state equation in 8337 ms returned []
Implicit Place search using SMT with State Equation took 9173 ms to find 0 implicit places.
[2024-05-25 08:44:46] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-25 08:44:46] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-25 08:44:46] [INFO ] Invariant cache hit.
[2024-05-25 08:44:47] [INFO ] Dead Transitions using invariants and state equation in 1116 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10456 ms. Remains : 1090/1090 places, 2500/2500 transitions.
Computed a total of 275 stabilizing places and 884 stable transitions
Computed a total of 275 stabilizing places and 884 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 1805 steps, including 41 resets, run visited all 1 properties in 12 ms. (steps per millisecond=150 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2279 reset in 490 ms.
Product exploration explored 100000 steps with 2280 reset in 515 ms.
Built C files in :
/tmp/ltsmin7568773108977591347
[2024-05-25 08:44:48] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:44:48] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7568773108977591347
Running compilation step : cd /tmp/ltsmin7568773108977591347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7568773108977591347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7568773108977591347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2500/2500 transitions.
Applied a total of 0 rules in 82 ms. Remains 1090 /1090 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-25 08:44:51] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-25 08:44:51] [INFO ] Invariant cache hit.
[2024-05-25 08:44:52] [INFO ] Implicit Places using invariants in 832 ms returned []
[2024-05-25 08:44:52] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-25 08:44:52] [INFO ] Invariant cache hit.
[2024-05-25 08:44:53] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-25 08:45:00] [INFO ] Implicit Places using invariants and state equation in 8414 ms returned []
Implicit Place search using SMT with State Equation took 9248 ms to find 0 implicit places.
[2024-05-25 08:45:01] [INFO ] Redundant transitions in 68 ms returned []
[2024-05-25 08:45:01] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-25 08:45:01] [INFO ] Invariant cache hit.
[2024-05-25 08:45:02] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10396 ms. Remains : 1090/1090 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin5177381378535210991
[2024-05-25 08:45:02] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:45:02] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5177381378535210991
Running compilation step : cd /tmp/ltsmin5177381378535210991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5177381378535210991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5177381378535210991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:45:05] [INFO ] Flatten gal took : 49 ms
[2024-05-25 08:45:05] [INFO ] Flatten gal took : 50 ms
[2024-05-25 08:45:05] [INFO ] Time to serialize gal into /tmp/LTL13151603711919707969.gal : 8 ms
[2024-05-25 08:45:05] [INFO ] Time to serialize properties into /tmp/LTL8324621887403289997.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13151603711919707969.gal' '-t' 'CGAL' '-hoa' '/tmp/aut879906058763341090.hoa' '-atoms' '/tmp/LTL8324621887403289997.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8324621887403289997.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut879906058763341090.hoa
Detected timeout of ITS tools.
[2024-05-25 08:45:20] [INFO ] Flatten gal took : 75 ms
[2024-05-25 08:45:20] [INFO ] Flatten gal took : 52 ms
[2024-05-25 08:45:20] [INFO ] Time to serialize gal into /tmp/LTL7128812576713326828.gal : 9 ms
[2024-05-25 08:45:20] [INFO ] Time to serialize properties into /tmp/LTL6294586464431466615.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7128812576713326828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6294586464431466615.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(Node14WantsToManageTheCrashOfNode0<=Node1ThinksNode5ShouldBeNodeMasterToReplaceNode9)"))))
Formula 0 simplified : GF!"(Node14WantsToManageTheCrashOfNode0<=Node1ThinksNode5ShouldBeNodeMasterToReplaceNode9)"
Detected timeout of ITS tools.
[2024-05-25 08:45:35] [INFO ] Flatten gal took : 52 ms
[2024-05-25 08:45:35] [INFO ] Applying decomposition
[2024-05-25 08:45:35] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7762624624736181630.txt' '-o' '/tmp/graph7762624624736181630.bin' '-w' '/tmp/graph7762624624736181630.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7762624624736181630.bin' '-l' '-1' '-v' '-w' '/tmp/graph7762624624736181630.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:45:35] [INFO ] Decomposing Gal with order
[2024-05-25 08:45:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:45:35] [INFO ] Removed a total of 229 redundant transitions.
[2024-05-25 08:45:35] [INFO ] Flatten gal took : 78 ms
[2024-05-25 08:45:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-05-25 08:45:36] [INFO ] Time to serialize gal into /tmp/LTL7098470911004427380.gal : 14 ms
[2024-05-25 08:45:36] [INFO ] Time to serialize properties into /tmp/LTL14067732819131818946.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7098470911004427380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14067732819131818946.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu6.Node14WantsToManageTheCrashOfNode0<=gu6.Node1ThinksNode5ShouldBeNodeMasterToReplaceNode9)"))))
Formula 0 simplified : GF!"(gu6.Node14WantsToManageTheCrashOfNode0<=gu6.Node1ThinksNode5ShouldBeNodeMasterToReplaceNode9)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin860334710753462974
[2024-05-25 08:45:51] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin860334710753462974
Running compilation step : cd /tmp/ltsmin860334710753462974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin860334710753462974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin860334710753462974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-10 finished in 99935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((p1||X(G(p2)))))))'
Support contains 6 out of 1396 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1362 transition count 3031
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1362 transition count 3031
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 98 place count 1332 transition count 2946
Iterating global reduction 0 with 30 rules applied. Total rules applied 128 place count 1332 transition count 2946
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 147 place count 1313 transition count 2847
Iterating global reduction 0 with 19 rules applied. Total rules applied 166 place count 1313 transition count 2847
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 168 place count 1311 transition count 2835
Iterating global reduction 0 with 2 rules applied. Total rules applied 170 place count 1311 transition count 2835
Applied a total of 170 rules in 250 ms. Remains 1311 /1396 variables (removed 85) and now considering 2835/3070 (removed 235) transitions.
[2024-05-25 08:45:54] [INFO ] Flow matrix only has 2563 transitions (discarded 272 similar events)
// Phase 1: matrix 2563 rows 1311 cols
[2024-05-25 08:45:54] [INFO ] Computed 80 invariants in 31 ms
[2024-05-25 08:45:55] [INFO ] Implicit Places using invariants in 1103 ms returned [10, 183, 354, 381, 390, 391, 432, 433, 512, 533, 555, 569, 590, 592, 601, 602, 603, 662, 724, 745, 795, 822, 892, 895, 940, 986, 1095, 1168, 1169]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 1127 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1282/1396 places, 2835/3070 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1258 transition count 2811
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1258 transition count 2811
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 72 place count 1234 transition count 2787
Iterating global reduction 0 with 24 rules applied. Total rules applied 96 place count 1234 transition count 2787
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 120 place count 1210 transition count 2763
Iterating global reduction 0 with 24 rules applied. Total rules applied 144 place count 1210 transition count 2763
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 162 place count 1192 transition count 2655
Iterating global reduction 0 with 18 rules applied. Total rules applied 180 place count 1192 transition count 2655
Applied a total of 180 rules in 257 ms. Remains 1192 /1282 variables (removed 90) and now considering 2655/2835 (removed 180) transitions.
[2024-05-25 08:45:55] [INFO ] Flow matrix only has 2383 transitions (discarded 272 similar events)
// Phase 1: matrix 2383 rows 1192 cols
[2024-05-25 08:45:55] [INFO ] Computed 51 invariants in 30 ms
[2024-05-25 08:45:56] [INFO ] Implicit Places using invariants in 980 ms returned []
[2024-05-25 08:45:56] [INFO ] Flow matrix only has 2383 transitions (discarded 272 similar events)
[2024-05-25 08:45:56] [INFO ] Invariant cache hit.
[2024-05-25 08:45:57] [INFO ] State equation strengthened by 888 read => feed constraints.
[2024-05-25 08:46:08] [INFO ] Implicit Places using invariants and state equation in 11877 ms returned []
Implicit Place search using SMT with State Equation took 12868 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1192/1396 places, 2655/3070 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14503 ms. Remains : 1192/1396 places, 2655/3070 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(LEQ s590 s678), p0:(AND (LEQ s578 s810) (LEQ s652 s186)), p1:(LEQ s652 s186)], 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]]
Product exploration explored 100000 steps with 1607 reset in 475 ms.
Product exploration explored 100000 steps with 1603 reset in 478 ms.
Computed a total of 360 stabilizing places and 1022 stable transitions
Computed a total of 360 stabilizing places and 1022 stable transitions
Detected a total of 360/1192 stabilizing places and 1022/2655 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1377 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 160 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 08:46:12] [INFO ] Flow matrix only has 2383 transitions (discarded 272 similar events)
[2024-05-25 08:46:12] [INFO ] Invariant cache hit.
[2024-05-25 08:46:12] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-25 08:46:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2024-05-25 08:46:12] [INFO ] [Nat]Absence check using 31 positive and 20 generalized place invariants in 12 ms returned sat
[2024-05-25 08:46:13] [INFO ] After 840ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-25 08:46:13] [INFO ] State equation strengthened by 888 read => feed constraints.
[2024-05-25 08:46:13] [INFO ] After 246ms SMT Verify possible using 888 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-25 08:46:14] [INFO ] Deduced a trap composed of 237 places in 465 ms of which 1 ms to minimize.
[2024-05-25 08:46:15] [INFO ] Deduced a trap composed of 311 places in 481 ms of which 1 ms to minimize.
[2024-05-25 08:46:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1143 ms
[2024-05-25 08:46:15] [INFO ] After 1555ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 129 ms.
[2024-05-25 08:46:15] [INFO ] After 2758ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1192/1192 places, 2655/2655 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1192 transition count 2634
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1171 transition count 2634
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 42 place count 1171 transition count 2620
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 70 place count 1157 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 1156 transition count 2619
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 1156 transition count 2619
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 72 place count 1156 transition count 2618
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 74 place count 1155 transition count 2618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1154 transition count 2612
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1154 transition count 2612
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 128 place count 1128 transition count 2586
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 1125 transition count 2583
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 1125 transition count 2583
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 137 place count 1122 transition count 2565
Iterating global reduction 2 with 3 rules applied. Total rules applied 140 place count 1122 transition count 2565
Free-agglomeration rule (complex) applied 139 times.
Iterating global reduction 2 with 139 rules applied. Total rules applied 279 place count 1122 transition count 3736
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 2 with 139 rules applied. Total rules applied 418 place count 983 transition count 3736
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 423 place count 983 transition count 3736
Applied a total of 423 rules in 551 ms. Remains 983 /1192 variables (removed 209) and now considering 3736/2655 (removed -1081) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 551 ms. Remains : 983/1192 places, 3736/2655 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 237 ms. (steps per millisecond=42 ) 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
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 66252 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66252 steps, saw 27741 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 08:46:19] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
// Phase 1: matrix 3338 rows 983 cols
[2024-05-25 08:46:19] [INFO ] Computed 51 invariants in 25 ms
[2024-05-25 08:46:19] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 08:46:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 08:46:19] [INFO ] [Nat]Absence check using 31 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-25 08:46:20] [INFO ] After 962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 08:46:20] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:46:21] [INFO ] After 455ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 08:46:21] [INFO ] Deduced a trap composed of 149 places in 459 ms of which 0 ms to minimize.
[2024-05-25 08:46:22] [INFO ] Deduced a trap composed of 72 places in 505 ms of which 1 ms to minimize.
[2024-05-25 08:46:22] [INFO ] Deduced a trap composed of 154 places in 425 ms of which 1 ms to minimize.
[2024-05-25 08:46:23] [INFO ] Deduced a trap composed of 149 places in 466 ms of which 1 ms to minimize.
[2024-05-25 08:46:24] [INFO ] Deduced a trap composed of 61 places in 545 ms of which 1 ms to minimize.
[2024-05-25 08:46:24] [INFO ] Deduced a trap composed of 70 places in 536 ms of which 1 ms to minimize.
[2024-05-25 08:46:25] [INFO ] Deduced a trap composed of 144 places in 443 ms of which 1 ms to minimize.
[2024-05-25 08:46:26] [INFO ] Deduced a trap composed of 65 places in 528 ms of which 1 ms to minimize.
[2024-05-25 08:46:26] [INFO ] Deduced a trap composed of 73 places in 529 ms of which 1 ms to minimize.
[2024-05-25 08:46:27] [INFO ] Deduced a trap composed of 71 places in 521 ms of which 0 ms to minimize.
[2024-05-25 08:46:28] [INFO ] Deduced a trap composed of 71 places in 515 ms of which 1 ms to minimize.
[2024-05-25 08:46:28] [INFO ] Deduced a trap composed of 82 places in 508 ms of which 1 ms to minimize.
[2024-05-25 08:46:29] [INFO ] Deduced a trap composed of 65 places in 514 ms of which 1 ms to minimize.
[2024-05-25 08:46:30] [INFO ] Deduced a trap composed of 75 places in 526 ms of which 1 ms to minimize.
[2024-05-25 08:46:30] [INFO ] Deduced a trap composed of 83 places in 493 ms of which 1 ms to minimize.
[2024-05-25 08:46:31] [INFO ] Deduced a trap composed of 72 places in 538 ms of which 1 ms to minimize.
[2024-05-25 08:46:32] [INFO ] Deduced a trap composed of 79 places in 564 ms of which 1 ms to minimize.
[2024-05-25 08:46:33] [INFO ] Deduced a trap composed of 118 places in 449 ms of which 1 ms to minimize.
[2024-05-25 08:46:33] [INFO ] Deduced a trap composed of 141 places in 468 ms of which 1 ms to minimize.
[2024-05-25 08:46:33] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 12922 ms
[2024-05-25 08:46:34] [INFO ] After 13606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 155 ms.
[2024-05-25 08:46:34] [INFO ] After 14905ms 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 3 ms.
Support contains 2 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 3736/3736 transitions.
Applied a total of 0 rules in 91 ms. Remains 983 /983 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 983/983 places, 3736/3736 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 3736/3736 transitions.
Applied a total of 0 rules in 108 ms. Remains 983 /983 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
[2024-05-25 08:46:34] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
[2024-05-25 08:46:34] [INFO ] Invariant cache hit.
[2024-05-25 08:46:35] [INFO ] Implicit Places using invariants in 1050 ms returned [469, 478, 543, 640]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1065 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 979/983 places, 3736/3736 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 978 transition count 3735
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 978 transition count 3735
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 977 transition count 3734
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 977 transition count 3734
Applied a total of 4 rules in 148 ms. Remains 977 /979 variables (removed 2) and now considering 3734/3736 (removed 2) transitions.
[2024-05-25 08:46:35] [INFO ] Flow matrix only has 3336 transitions (discarded 398 similar events)
// Phase 1: matrix 3336 rows 977 cols
[2024-05-25 08:46:35] [INFO ] Computed 47 invariants in 31 ms
[2024-05-25 08:46:36] [INFO ] Implicit Places using invariants in 1057 ms returned []
[2024-05-25 08:46:36] [INFO ] Flow matrix only has 3336 transitions (discarded 398 similar events)
[2024-05-25 08:46:36] [INFO ] Invariant cache hit.
[2024-05-25 08:46:37] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:46:54] [INFO ] Implicit Places using invariants and state equation in 17889 ms returned []
Implicit Place search using SMT with State Equation took 18967 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 977/983 places, 3734/3736 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 20289 ms. Remains : 977/983 places, 3734/3736 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 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 36 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 70081 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70081 steps, saw 29313 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 08:46:58] [INFO ] Flow matrix only has 3336 transitions (discarded 398 similar events)
[2024-05-25 08:46:58] [INFO ] Invariant cache hit.
[2024-05-25 08:46:58] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 08:46:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 08:46:58] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-25 08:46:59] [INFO ] After 814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 08:46:59] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:46:59] [INFO ] After 473ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 08:47:00] [INFO ] Deduced a trap composed of 154 places in 448 ms of which 1 ms to minimize.
[2024-05-25 08:47:00] [INFO ] Deduced a trap composed of 153 places in 430 ms of which 1 ms to minimize.
[2024-05-25 08:47:01] [INFO ] Deduced a trap composed of 152 places in 436 ms of which 1 ms to minimize.
[2024-05-25 08:47:01] [INFO ] Deduced a trap composed of 192 places in 430 ms of which 1 ms to minimize.
[2024-05-25 08:47:02] [INFO ] Deduced a trap composed of 230 places in 450 ms of which 1 ms to minimize.
[2024-05-25 08:47:02] [INFO ] Deduced a trap composed of 170 places in 426 ms of which 1 ms to minimize.
[2024-05-25 08:47:03] [INFO ] Deduced a trap composed of 169 places in 435 ms of which 1 ms to minimize.
[2024-05-25 08:47:04] [INFO ] Deduced a trap composed of 202 places in 435 ms of which 1 ms to minimize.
[2024-05-25 08:47:04] [INFO ] Deduced a trap composed of 176 places in 413 ms of which 1 ms to minimize.
[2024-05-25 08:47:06] [INFO ] Deduced a trap composed of 136 places in 431 ms of which 1 ms to minimize.
[2024-05-25 08:47:06] [INFO ] Deduced a trap composed of 145 places in 445 ms of which 1 ms to minimize.
[2024-05-25 08:47:07] [INFO ] Deduced a trap composed of 136 places in 443 ms of which 0 ms to minimize.
[2024-05-25 08:47:08] [INFO ] Deduced a trap composed of 154 places in 452 ms of which 1 ms to minimize.
[2024-05-25 08:47:08] [INFO ] Deduced a trap composed of 139 places in 435 ms of which 1 ms to minimize.
[2024-05-25 08:47:10] [INFO ] Deduced a trap composed of 145 places in 427 ms of which 1 ms to minimize.
[2024-05-25 08:47:10] [INFO ] Deduced a trap composed of 167 places in 468 ms of which 1 ms to minimize.
[2024-05-25 08:47:10] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 11218 ms
[2024-05-25 08:47:11] [INFO ] After 11926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 165 ms.
[2024-05-25 08:47:11] [INFO ] After 13092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 3734/3734 transitions.
Applied a total of 0 rules in 91 ms. Remains 977 /977 variables (removed 0) and now considering 3734/3734 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 977/977 places, 3734/3734 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 3734/3734 transitions.
Applied a total of 0 rules in 91 ms. Remains 977 /977 variables (removed 0) and now considering 3734/3734 (removed 0) transitions.
[2024-05-25 08:47:11] [INFO ] Flow matrix only has 3336 transitions (discarded 398 similar events)
[2024-05-25 08:47:11] [INFO ] Invariant cache hit.
[2024-05-25 08:47:12] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2024-05-25 08:47:12] [INFO ] Flow matrix only has 3336 transitions (discarded 398 similar events)
[2024-05-25 08:47:12] [INFO ] Invariant cache hit.
[2024-05-25 08:47:13] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:47:30] [INFO ] Implicit Places using invariants and state equation in 17999 ms returned []
Implicit Place search using SMT with State Equation took 19135 ms to find 0 implicit places.
[2024-05-25 08:47:30] [INFO ] Redundant transitions in 142 ms returned []
[2024-05-25 08:47:30] [INFO ] Flow matrix only has 3336 transitions (discarded 398 similar events)
[2024-05-25 08:47:30] [INFO ] Invariant cache hit.
[2024-05-25 08:47:32] [INFO ] Dead Transitions using invariants and state equation in 1332 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20727 ms. Remains : 977/977 places, 3734/3734 transitions.
Graph (trivial) has 1054 edges and 977 vertex of which 17 / 977 are part of one of the 1 SCC in 3 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 4310 edges and 961 vertex of which 947 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 t1302.t1573 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 930 transition count 2965
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 833 transition count 2772
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 737 transition count 2604
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 665 transition count 2462
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 595 transition count 2342
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 545 transition count 2244
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 497 transition count 2164
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 465 transition count 2102
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 435 transition count 2054
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 417 transition count 2020
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 401 transition count 1996
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 393 transition count 1982
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 387 transition count 1974
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 384 transition count 1972
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 1640 place count 384 transition count 1957
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 14 with 30 rules applied. Total rules applied 1670 place count 369 transition count 1957
Discarding 282 places :
Symmetric choice reduction at 14 with 282 rule applications. Total rules 1952 place count 87 transition count 360
Iterating global reduction 14 with 282 rules applied. Total rules applied 2234 place count 87 transition count 360
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Iterating post reduction 14 with 214 rules applied. Total rules applied 2448 place count 87 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2448 place count 87 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2450 place count 86 transition count 145
Discarding 11 places :
Symmetric choice reduction at 15 with 11 rule applications. Total rules 2461 place count 75 transition count 99
Iterating global reduction 15 with 11 rules applied. Total rules applied 2472 place count 75 transition count 99
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 15 with 16 rules applied. Total rules applied 2488 place count 75 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 2492 place count 71 transition count 83
Discarding 9 places :
Symmetric choice reduction at 17 with 9 rule applications. Total rules 2501 place count 62 transition count 73
Iterating global reduction 17 with 9 rules applied. Total rules applied 2510 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2511 place count 61 transition count 72
Iterating global reduction 17 with 1 rules applied. Total rules applied 2512 place count 61 transition count 72
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 17 with 6 rules applied. Total rules applied 2518 place count 58 transition count 69
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2519 place count 57 transition count 67
Iterating global reduction 17 with 1 rules applied. Total rules applied 2520 place count 57 transition count 67
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 17 with 10 rules applied. Total rules applied 2530 place count 57 transition count 57
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 17 with 10 rules applied. Total rules applied 2540 place count 47 transition count 57
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 2542 place count 47 transition count 57
Applied a total of 2542 rules in 428 ms. Remains 47 /977 variables (removed 930) and now considering 57/3734 (removed 3677) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 57 rows 47 cols
[2024-05-25 08:47:32] [INFO ] Computed 16 invariants in 0 ms
[2024-05-25 08:47:32] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 08:47:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 08:47:32] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2024-05-25 08:47:32] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 08:47:32] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-25 08:47:32] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 5428 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 1192 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1192/1192 places, 2655/2655 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 0 with 18 rules applied. Total rules applied 18 place count 1192 transition count 2637
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 1174 transition count 2637
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 36 place count 1174 transition count 2623
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 64 place count 1160 transition count 2623
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 118 place count 1133 transition count 2596
Applied a total of 118 rules in 166 ms. Remains 1133 /1192 variables (removed 59) and now considering 2596/2655 (removed 59) transitions.
[2024-05-25 08:47:38] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
// Phase 1: matrix 2324 rows 1133 cols
[2024-05-25 08:47:38] [INFO ] Computed 51 invariants in 21 ms
[2024-05-25 08:47:39] [INFO ] Implicit Places using invariants in 917 ms returned []
[2024-05-25 08:47:39] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-25 08:47:39] [INFO ] Invariant cache hit.
[2024-05-25 08:47:40] [INFO ] State equation strengthened by 888 read => feed constraints.
[2024-05-25 08:47:50] [INFO ] Implicit Places using invariants and state equation in 10695 ms returned []
Implicit Place search using SMT with State Equation took 11637 ms to find 0 implicit places.
[2024-05-25 08:47:50] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-25 08:47:50] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-25 08:47:50] [INFO ] Invariant cache hit.
[2024-05-25 08:47:51] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1133/1192 places, 2596/2655 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12941 ms. Remains : 1133/1192 places, 2596/2655 transitions.
Computed a total of 318 stabilizing places and 980 stable transitions
Computed a total of 318 stabilizing places and 980 stable transitions
Detected a total of 318/1133 stabilizing places and 980/2596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 205 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 08:47:51] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-25 08:47:51] [INFO ] Invariant cache hit.
[2024-05-25 08:47:51] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 08:47:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 08:47:52] [INFO ] [Nat]Absence check using 31 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-25 08:47:52] [INFO ] After 726ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-25 08:47:52] [INFO ] State equation strengthened by 888 read => feed constraints.
[2024-05-25 08:47:53] [INFO ] After 214ms SMT Verify possible using 888 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-25 08:47:53] [INFO ] Deduced a trap composed of 240 places in 452 ms of which 1 ms to minimize.
[2024-05-25 08:47:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 567 ms
[2024-05-25 08:47:53] [INFO ] After 966ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 119 ms.
[2024-05-25 08:47:53] [INFO ] After 2016ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1133/1133 places, 2596/2596 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 1133 transition count 2594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1131 transition count 2594
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 1129 transition count 2592
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1129 transition count 2592
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 1127 transition count 2580
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1127 transition count 2580
Free-agglomeration rule (complex) applied 141 times.
Iterating global reduction 2 with 141 rules applied. Total rules applied 153 place count 1127 transition count 3739
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 2 with 141 rules applied. Total rules applied 294 place count 986 transition count 3739
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 300 place count 986 transition count 3739
Applied a total of 300 rules in 377 ms. Remains 986 /1133 variables (removed 147) and now considering 3739/2596 (removed -1143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 377 ms. Remains : 986/1133 places, 3739/2596 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 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 36 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 67815 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67815 steps, saw 28384 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 08:47:57] [INFO ] Flow matrix only has 3341 transitions (discarded 398 similar events)
// Phase 1: matrix 3341 rows 986 cols
[2024-05-25 08:47:57] [INFO ] Computed 51 invariants in 30 ms
[2024-05-25 08:47:57] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 08:47:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 08:47:58] [INFO ] [Nat]Absence check using 31 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-25 08:47:58] [INFO ] After 887ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 08:47:58] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:47:59] [INFO ] After 435ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 08:47:59] [INFO ] Deduced a trap composed of 150 places in 434 ms of which 1 ms to minimize.
[2024-05-25 08:48:00] [INFO ] Deduced a trap composed of 154 places in 437 ms of which 1 ms to minimize.
[2024-05-25 08:48:01] [INFO ] Deduced a trap composed of 170 places in 437 ms of which 1 ms to minimize.
[2024-05-25 08:48:01] [INFO ] Deduced a trap composed of 169 places in 426 ms of which 1 ms to minimize.
[2024-05-25 08:48:02] [INFO ] Deduced a trap composed of 199 places in 441 ms of which 1 ms to minimize.
[2024-05-25 08:48:03] [INFO ] Deduced a trap composed of 169 places in 438 ms of which 1 ms to minimize.
[2024-05-25 08:48:03] [INFO ] Deduced a trap composed of 184 places in 439 ms of which 1 ms to minimize.
[2024-05-25 08:48:04] [INFO ] Deduced a trap composed of 229 places in 435 ms of which 0 ms to minimize.
[2024-05-25 08:48:04] [INFO ] Deduced a trap composed of 168 places in 434 ms of which 1 ms to minimize.
[2024-05-25 08:48:05] [INFO ] Deduced a trap composed of 126 places in 441 ms of which 1 ms to minimize.
[2024-05-25 08:48:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6123 ms
[2024-05-25 08:48:05] [INFO ] After 6768ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 165 ms.
[2024-05-25 08:48:05] [INFO ] After 8006ms 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 4 out of 986 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 986/986 places, 3739/3739 transitions.
Applied a total of 0 rules in 104 ms. Remains 986 /986 variables (removed 0) and now considering 3739/3739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 986/986 places, 3739/3739 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 986/986 places, 3739/3739 transitions.
Applied a total of 0 rules in 91 ms. Remains 986 /986 variables (removed 0) and now considering 3739/3739 (removed 0) transitions.
[2024-05-25 08:48:06] [INFO ] Flow matrix only has 3341 transitions (discarded 398 similar events)
[2024-05-25 08:48:06] [INFO ] Invariant cache hit.
[2024-05-25 08:48:07] [INFO ] Implicit Places using invariants in 1084 ms returned [470, 644]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1103 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 984/986 places, 3739/3739 transitions.
Applied a total of 0 rules in 92 ms. Remains 984 /984 variables (removed 0) and now considering 3739/3739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1286 ms. Remains : 984/986 places, 3739/3739 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 69599 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69599 steps, saw 29120 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 08:48:10] [INFO ] Flow matrix only has 3341 transitions (discarded 398 similar events)
// Phase 1: matrix 3341 rows 984 cols
[2024-05-25 08:48:10] [INFO ] Computed 49 invariants in 26 ms
[2024-05-25 08:48:10] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 08:48:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 08:48:11] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-25 08:48:11] [INFO ] After 901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 08:48:11] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:48:12] [INFO ] After 450ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 08:48:12] [INFO ] Deduced a trap composed of 147 places in 459 ms of which 0 ms to minimize.
[2024-05-25 08:48:13] [INFO ] Deduced a trap composed of 153 places in 448 ms of which 1 ms to minimize.
[2024-05-25 08:48:14] [INFO ] Deduced a trap composed of 154 places in 459 ms of which 1 ms to minimize.
[2024-05-25 08:48:14] [INFO ] Deduced a trap composed of 170 places in 434 ms of which 2 ms to minimize.
[2024-05-25 08:48:15] [INFO ] Deduced a trap composed of 155 places in 451 ms of which 1 ms to minimize.
[2024-05-25 08:48:16] [INFO ] Deduced a trap composed of 152 places in 454 ms of which 0 ms to minimize.
[2024-05-25 08:48:16] [INFO ] Deduced a trap composed of 130 places in 460 ms of which 1 ms to minimize.
[2024-05-25 08:48:17] [INFO ] Deduced a trap composed of 152 places in 434 ms of which 1 ms to minimize.
[2024-05-25 08:48:17] [INFO ] Deduced a trap composed of 138 places in 512 ms of which 1 ms to minimize.
[2024-05-25 08:48:18] [INFO ] Deduced a trap composed of 85 places in 517 ms of which 0 ms to minimize.
[2024-05-25 08:48:19] [INFO ] Deduced a trap composed of 153 places in 476 ms of which 1 ms to minimize.
[2024-05-25 08:48:19] [INFO ] Deduced a trap composed of 157 places in 426 ms of which 1 ms to minimize.
[2024-05-25 08:48:20] [INFO ] Deduced a trap composed of 151 places in 459 ms of which 1 ms to minimize.
[2024-05-25 08:48:21] [INFO ] Deduced a trap composed of 214 places in 437 ms of which 1 ms to minimize.
[2024-05-25 08:48:21] [INFO ] Deduced a trap composed of 176 places in 448 ms of which 1 ms to minimize.
[2024-05-25 08:48:22] [INFO ] Deduced a trap composed of 159 places in 431 ms of which 1 ms to minimize.
[2024-05-25 08:48:22] [INFO ] Deduced a trap composed of 154 places in 453 ms of which 1 ms to minimize.
[2024-05-25 08:48:23] [INFO ] Deduced a trap composed of 111 places in 512 ms of which 1 ms to minimize.
[2024-05-25 08:48:25] [INFO ] Deduced a trap composed of 158 places in 421 ms of which 1 ms to minimize.
[2024-05-25 08:48:26] [INFO ] Deduced a trap composed of 154 places in 425 ms of which 1 ms to minimize.
[2024-05-25 08:48:26] [INFO ] Deduced a trap composed of 167 places in 429 ms of which 1 ms to minimize.
[2024-05-25 08:48:27] [INFO ] Deduced a trap composed of 184 places in 440 ms of which 1 ms to minimize.
[2024-05-25 08:48:27] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 15183 ms
[2024-05-25 08:48:27] [INFO ] After 15857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2024-05-25 08:48:27] [INFO ] After 17129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 3739/3739 transitions.
Applied a total of 0 rules in 92 ms. Remains 984 /984 variables (removed 0) and now considering 3739/3739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 984/984 places, 3739/3739 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 3739/3739 transitions.
Applied a total of 0 rules in 89 ms. Remains 984 /984 variables (removed 0) and now considering 3739/3739 (removed 0) transitions.
[2024-05-25 08:48:28] [INFO ] Flow matrix only has 3341 transitions (discarded 398 similar events)
[2024-05-25 08:48:28] [INFO ] Invariant cache hit.
[2024-05-25 08:48:29] [INFO ] Implicit Places using invariants in 1027 ms returned []
[2024-05-25 08:48:29] [INFO ] Flow matrix only has 3341 transitions (discarded 398 similar events)
[2024-05-25 08:48:29] [INFO ] Invariant cache hit.
[2024-05-25 08:48:30] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:48:47] [INFO ] Implicit Places using invariants and state equation in 18391 ms returned []
Implicit Place search using SMT with State Equation took 19440 ms to find 0 implicit places.
[2024-05-25 08:48:47] [INFO ] Redundant transitions in 144 ms returned []
[2024-05-25 08:48:47] [INFO ] Flow matrix only has 3341 transitions (discarded 398 similar events)
[2024-05-25 08:48:47] [INFO ] Invariant cache hit.
[2024-05-25 08:48:49] [INFO ] Dead Transitions using invariants and state equation in 1353 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21073 ms. Remains : 984/984 places, 3739/3739 transitions.
Graph (trivial) has 1055 edges and 984 vertex of which 17 / 984 are part of one of the 1 SCC in 1 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 4343 edges and 968 vertex of which 954 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 t1302.t1573 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 937 transition count 2970
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 840 transition count 2777
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 744 transition count 2609
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 672 transition count 2467
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 602 transition count 2347
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 552 transition count 2249
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 504 transition count 2169
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 472 transition count 2107
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 442 transition count 2059
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 424 transition count 2025
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 408 transition count 2001
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 400 transition count 1987
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 394 transition count 1979
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 391 transition count 1977
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 391 transition count 1963
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 14 with 28 rules applied. Total rules applied 1668 place count 377 transition count 1963
Discarding 278 places :
Symmetric choice reduction at 14 with 278 rule applications. Total rules 1946 place count 99 transition count 385
Iterating global reduction 14 with 278 rules applied. Total rules applied 2224 place count 99 transition count 385
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Iterating post reduction 14 with 206 rules applied. Total rules applied 2430 place count 99 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2430 place count 99 transition count 178
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2432 place count 98 transition count 178
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 2441 place count 89 transition count 138
Iterating global reduction 15 with 9 rules applied. Total rules applied 2450 place count 89 transition count 138
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 2459 place count 89 transition count 129
Discarding 7 places :
Symmetric choice reduction at 16 with 7 rule applications. Total rules 2466 place count 82 transition count 122
Iterating global reduction 16 with 7 rules applied. Total rules applied 2473 place count 82 transition count 122
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 16 with 22 rules applied. Total rules applied 2495 place count 71 transition count 111
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2496 place count 70 transition count 108
Iterating global reduction 16 with 1 rules applied. Total rules applied 2497 place count 70 transition count 108
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2505 place count 70 transition count 100
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 2513 place count 62 transition count 100
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 17 with 12 rules applied. Total rules applied 2525 place count 62 transition count 100
Applied a total of 2525 rules in 316 ms. Remains 62 /984 variables (removed 922) and now considering 100/3739 (removed 3639) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 100 rows 62 cols
[2024-05-25 08:48:49] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 08:48:49] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 08:48:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 08:48:49] [INFO ] [Nat]Absence check using 2 positive and 16 generalized place invariants in 2 ms returned sat
[2024-05-25 08:48:49] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 08:48:49] [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 7 ms.
[2024-05-25 08:48:49] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 13 factoid took 268 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 2265 reset in 520 ms.
Product exploration explored 100000 steps with 2266 reset in 536 ms.
Built C files in :
/tmp/ltsmin11302445581100893346
[2024-05-25 08:48:51] [INFO ] Too many transitions (2596) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:48:51] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11302445581100893346
Running compilation step : cd /tmp/ltsmin11302445581100893346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11302445581100893346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11302445581100893346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1133/1133 places, 2596/2596 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 1133 transition count 2594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1131 transition count 2594
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 1129 transition count 2592
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1129 transition count 2592
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 1127 transition count 2580
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1127 transition count 2580
Applied a total of 12 rules in 166 ms. Remains 1127 /1133 variables (removed 6) and now considering 2580/2596 (removed 16) transitions.
[2024-05-25 08:48:54] [INFO ] Flow matrix only has 2308 transitions (discarded 272 similar events)
// Phase 1: matrix 2308 rows 1127 cols
[2024-05-25 08:48:54] [INFO ] Computed 51 invariants in 22 ms
[2024-05-25 08:48:55] [INFO ] Implicit Places using invariants in 923 ms returned [539, 741]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 935 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1125/1133 places, 2580/2596 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 1123 transition count 2578
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1121 transition count 2576
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1121 transition count 2576
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1119 transition count 2564
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1119 transition count 2564
Applied a total of 12 rules in 212 ms. Remains 1119 /1125 variables (removed 6) and now considering 2564/2580 (removed 16) transitions.
[2024-05-25 08:48:55] [INFO ] Flow matrix only has 2292 transitions (discarded 272 similar events)
// Phase 1: matrix 2292 rows 1119 cols
[2024-05-25 08:48:55] [INFO ] Computed 49 invariants in 29 ms
[2024-05-25 08:48:56] [INFO ] Implicit Places using invariants in 923 ms returned []
[2024-05-25 08:48:56] [INFO ] Flow matrix only has 2292 transitions (discarded 272 similar events)
[2024-05-25 08:48:56] [INFO ] Invariant cache hit.
[2024-05-25 08:48:57] [INFO ] State equation strengthened by 868 read => feed constraints.
[2024-05-25 08:49:05] [INFO ] Implicit Places using invariants and state equation in 9345 ms returned []
Implicit Place search using SMT with State Equation took 10277 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1119/1133 places, 2564/2596 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11591 ms. Remains : 1119/1133 places, 2564/2596 transitions.
Built C files in :
/tmp/ltsmin8154672287676453538
[2024-05-25 08:49:05] [INFO ] Too many transitions (2564) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:49:05] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8154672287676453538
Running compilation step : cd /tmp/ltsmin8154672287676453538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8154672287676453538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8154672287676453538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:49:09] [INFO ] Flatten gal took : 51 ms
[2024-05-25 08:49:09] [INFO ] Flatten gal took : 51 ms
[2024-05-25 08:49:09] [INFO ] Time to serialize gal into /tmp/LTL2760029172126355624.gal : 9 ms
[2024-05-25 08:49:09] [INFO ] Time to serialize properties into /tmp/LTL14514990585304329957.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2760029172126355624.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6394826869827148149.hoa' '-atoms' '/tmp/LTL14514990585304329957.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14514990585304329957.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6394826869827148149.hoa
Detected timeout of ITS tools.
[2024-05-25 08:49:24] [INFO ] Flatten gal took : 52 ms
[2024-05-25 08:49:24] [INFO ] Flatten gal took : 52 ms
[2024-05-25 08:49:24] [INFO ] Time to serialize gal into /tmp/LTL922921726378724471.gal : 9 ms
[2024-05-25 08:49:24] [INFO ] Time to serialize properties into /tmp/LTL7548015670955619609.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL922921726378724471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7548015670955619609.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X((G("((Node8HasTheLeafSetOfLx1ToReplaceNode4<=Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(Node10HasTheLeafSetOfRx4ToReplaceNode16<=...398
Formula 0 simplified : X(F!"((Node8HasTheLeafSetOfLx1ToReplaceNode4<=Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(Node10HasTheLeafSetOfRx4ToReplaceNode16<=No...386
Detected timeout of ITS tools.
[2024-05-25 08:49:39] [INFO ] Flatten gal took : 52 ms
[2024-05-25 08:49:39] [INFO ] Applying decomposition
[2024-05-25 08:49:39] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15825913379291335012.txt' '-o' '/tmp/graph15825913379291335012.bin' '-w' '/tmp/graph15825913379291335012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15825913379291335012.bin' '-l' '-1' '-v' '-w' '/tmp/graph15825913379291335012.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:49:39] [INFO ] Decomposing Gal with order
[2024-05-25 08:49:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:49:39] [INFO ] Removed a total of 1722 redundant transitions.
[2024-05-25 08:49:39] [INFO ] Flatten gal took : 228 ms
[2024-05-25 08:49:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 23 ms.
[2024-05-25 08:49:40] [INFO ] Time to serialize gal into /tmp/LTL9730506204046721242.gal : 12 ms
[2024-05-25 08:49:40] [INFO ] Time to serialize properties into /tmp/LTL9978868585922936382.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9730506204046721242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9978868585922936382.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("((gu76.Node8HasTheLeafSetOfLx1ToReplaceNode4<=gu76.Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(gu56.Node10HasTheLeafSetOfRx4To...438
Formula 0 simplified : X(F!"((gu76.Node8HasTheLeafSetOfLx1ToReplaceNode4<=gu76.Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(gu56.Node10HasTheLeafSetOfRx4ToRe...426
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13561521483756370109
[2024-05-25 08:49:55] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13561521483756370109
Running compilation step : cd /tmp/ltsmin13561521483756370109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13561521483756370109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13561521483756370109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-14 finished in 243835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 3 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 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 0 with 32 rules applied. Total rules applied 32 place count 1396 transition count 3038
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1364 transition count 3038
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1364 transition count 3006
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 1332 transition count 3006
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 147 place count 1313 transition count 2982
Iterating global reduction 2 with 19 rules applied. Total rules applied 166 place count 1313 transition count 2982
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 166 place count 1313 transition count 2981
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 168 place count 1312 transition count 2981
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 184 place count 1296 transition count 2905
Iterating global reduction 2 with 16 rules applied. Total rules applied 200 place count 1296 transition count 2905
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 203 place count 1293 transition count 2887
Iterating global reduction 2 with 3 rules applied. Total rules applied 206 place count 1293 transition count 2887
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 284 place count 1254 transition count 2848
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 302 place count 1236 transition count 2830
Iterating global reduction 2 with 18 rules applied. Total rules applied 320 place count 1236 transition count 2830
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 338 place count 1218 transition count 2722
Iterating global reduction 2 with 18 rules applied. Total rules applied 356 place count 1218 transition count 2722
Applied a total of 356 rules in 410 ms. Remains 1218 /1396 variables (removed 178) and now considering 2722/3070 (removed 348) transitions.
[2024-05-25 08:49:58] [INFO ] Flow matrix only has 2450 transitions (discarded 272 similar events)
// Phase 1: matrix 2450 rows 1218 cols
[2024-05-25 08:49:58] [INFO ] Computed 80 invariants in 29 ms
[2024-05-25 08:49:59] [INFO ] Implicit Places using invariants in 1048 ms returned [9, 157, 158, 351, 359, 360, 401, 402, 476, 497, 516, 530, 549, 551, 560, 561, 562, 580, 590, 646, 664, 665, 683, 729, 754, 788, 819, 822, 867, 910, 1017, 1090, 1091]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 1050 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1185/1396 places, 2722/3070 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1168 transition count 2705
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1168 transition count 2705
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1151 transition count 2688
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1151 transition count 2688
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 1143 transition count 2640
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 1143 transition count 2640
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 106 place count 1132 transition count 2629
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 117 place count 1121 transition count 2618
Iterating global reduction 0 with 11 rules applied. Total rules applied 128 place count 1121 transition count 2618
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 141 place count 1108 transition count 2540
Iterating global reduction 0 with 13 rules applied. Total rules applied 154 place count 1108 transition count 2540
Applied a total of 154 rules in 363 ms. Remains 1108 /1185 variables (removed 77) and now considering 2540/2722 (removed 182) transitions.
[2024-05-25 08:49:59] [INFO ] Flow matrix only has 2268 transitions (discarded 272 similar events)
// Phase 1: matrix 2268 rows 1108 cols
[2024-05-25 08:49:59] [INFO ] Computed 47 invariants in 24 ms
[2024-05-25 08:50:00] [INFO ] Implicit Places using invariants in 924 ms returned []
[2024-05-25 08:50:00] [INFO ] Flow matrix only has 2268 transitions (discarded 272 similar events)
[2024-05-25 08:50:00] [INFO ] Invariant cache hit.
[2024-05-25 08:50:01] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 08:50:10] [INFO ] Implicit Places using invariants and state equation in 9701 ms returned []
Implicit Place search using SMT with State Equation took 10629 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1108/1396 places, 2540/3070 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12452 ms. Remains : 1108/1396 places, 2540/3070 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s511), p1:(LEQ s570 s338)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-15 finished in 12636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-06
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 1396 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 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 1396 transition count 3040
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1366 transition count 3040
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 60 place count 1366 transition count 3008
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 124 place count 1334 transition count 3008
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 142 place count 1316 transition count 2990
Iterating global reduction 2 with 18 rules applied. Total rules applied 160 place count 1316 transition count 2990
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 175 place count 1301 transition count 2910
Iterating global reduction 2 with 15 rules applied. Total rules applied 190 place count 1301 transition count 2910
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 192 place count 1299 transition count 2898
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 1299 transition count 2898
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 274 place count 1259 transition count 2858
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 292 place count 1241 transition count 2840
Iterating global reduction 2 with 18 rules applied. Total rules applied 310 place count 1241 transition count 2840
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 328 place count 1223 transition count 2732
Iterating global reduction 2 with 18 rules applied. Total rules applied 346 place count 1223 transition count 2732
Applied a total of 346 rules in 410 ms. Remains 1223 /1396 variables (removed 173) and now considering 2732/3070 (removed 338) transitions.
[2024-05-25 08:50:11] [INFO ] Flow matrix only has 2460 transitions (discarded 272 similar events)
// Phase 1: matrix 2460 rows 1223 cols
[2024-05-25 08:50:11] [INFO ] Computed 80 invariants in 28 ms
[2024-05-25 08:50:12] [INFO ] Implicit Places using invariants in 1052 ms returned [9, 159, 160, 324, 350, 358, 359, 400, 401, 478, 499, 518, 532, 550, 552, 561, 562, 563, 581, 591, 609, 647, 665, 666, 684, 730, 755, 789, 820, 823, 868, 911, 1018, 1091]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 1054 ms to find 34 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1189/1396 places, 2732/3070 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1172 transition count 2715
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1172 transition count 2715
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1155 transition count 2698
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1155 transition count 2698
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 1147 transition count 2650
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 1147 transition count 2650
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 108 place count 1135 transition count 2638
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 120 place count 1123 transition count 2626
Iterating global reduction 0 with 12 rules applied. Total rules applied 132 place count 1123 transition count 2626
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 146 place count 1109 transition count 2542
Iterating global reduction 0 with 14 rules applied. Total rules applied 160 place count 1109 transition count 2542
Applied a total of 160 rules in 342 ms. Remains 1109 /1189 variables (removed 80) and now considering 2542/2732 (removed 190) transitions.
[2024-05-25 08:50:13] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1109 cols
[2024-05-25 08:50:13] [INFO ] Computed 46 invariants in 28 ms
[2024-05-25 08:50:13] [INFO ] Implicit Places using invariants in 910 ms returned []
[2024-05-25 08:50:13] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:50:13] [INFO ] Invariant cache hit.
[2024-05-25 08:50:14] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 08:50:23] [INFO ] Implicit Places using invariants and state equation in 9143 ms returned []
Implicit Place search using SMT with State Equation took 10053 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1109/1396 places, 2542/3070 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11859 ms. Remains : 1109/1396 places, 2542/3070 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s575 s1048), p0:(LEQ s448 s94)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2267 reset in 562 ms.
Product exploration explored 100000 steps with 2269 reset in 592 ms.
Computed a total of 294 stabilizing places and 926 stable transitions
Computed a total of 294 stabilizing places and 926 stable transitions
Detected a total of 294/1109 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 156 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:50:24] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:50:24] [INFO ] Invariant cache hit.
[2024-05-25 08:50:24] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:50:24] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 08:50:24] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-25 08:50:24] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 269 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 1109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1109/1109 places, 2542/2542 transitions.
Applied a total of 0 rules in 72 ms. Remains 1109 /1109 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-25 08:50:25] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:50:25] [INFO ] Invariant cache hit.
[2024-05-25 08:50:26] [INFO ] Implicit Places using invariants in 873 ms returned []
[2024-05-25 08:50:26] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:50:26] [INFO ] Invariant cache hit.
[2024-05-25 08:50:27] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 08:50:35] [INFO ] Implicit Places using invariants and state equation in 8990 ms returned []
Implicit Place search using SMT with State Equation took 9873 ms to find 0 implicit places.
[2024-05-25 08:50:35] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-25 08:50:35] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:50:35] [INFO ] Invariant cache hit.
[2024-05-25 08:50:36] [INFO ] Dead Transitions using invariants and state equation in 940 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10966 ms. Remains : 1109/1109 places, 2542/2542 transitions.
Computed a total of 294 stabilizing places and 926 stable transitions
Computed a total of 294 stabilizing places and 926 stable transitions
Detected a total of 294/1109 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 144 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:50:36] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:50:36] [INFO ] Invariant cache hit.
[2024-05-25 08:50:36] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:50:36] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 08:50:37] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-25 08:50:37] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 255 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2269 reset in 574 ms.
Product exploration explored 100000 steps with 2271 reset in 583 ms.
Built C files in :
/tmp/ltsmin16557509187953653875
[2024-05-25 08:50:38] [INFO ] Too many transitions (2542) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:50:38] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16557509187953653875
Running compilation step : cd /tmp/ltsmin16557509187953653875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16557509187953653875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16557509187953653875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1109/1109 places, 2542/2542 transitions.
Applied a total of 0 rules in 74 ms. Remains 1109 /1109 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-25 08:50:41] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:50:41] [INFO ] Invariant cache hit.
[2024-05-25 08:50:42] [INFO ] Implicit Places using invariants in 877 ms returned []
[2024-05-25 08:50:42] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:50:42] [INFO ] Invariant cache hit.
[2024-05-25 08:50:43] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 08:50:51] [INFO ] Implicit Places using invariants and state equation in 8818 ms returned []
Implicit Place search using SMT with State Equation took 9700 ms to find 0 implicit places.
[2024-05-25 08:50:51] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-25 08:50:51] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 08:50:51] [INFO ] Invariant cache hit.
[2024-05-25 08:50:52] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10877 ms. Remains : 1109/1109 places, 2542/2542 transitions.
Built C files in :
/tmp/ltsmin13661109496711199071
[2024-05-25 08:50:52] [INFO ] Too many transitions (2542) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:50:52] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13661109496711199071
Running compilation step : cd /tmp/ltsmin13661109496711199071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13661109496711199071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13661109496711199071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:50:55] [INFO ] Flatten gal took : 53 ms
[2024-05-25 08:50:55] [INFO ] Flatten gal took : 53 ms
[2024-05-25 08:50:55] [INFO ] Time to serialize gal into /tmp/LTL10450391647350050205.gal : 10 ms
[2024-05-25 08:50:55] [INFO ] Time to serialize properties into /tmp/LTL13933104848363670363.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10450391647350050205.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7933046359242867913.hoa' '-atoms' '/tmp/LTL13933104848363670363.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13933104848363670363.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7933046359242867913.hoa
Detected timeout of ITS tools.
[2024-05-25 08:51:11] [INFO ] Flatten gal took : 52 ms
[2024-05-25 08:51:11] [INFO ] Flatten gal took : 52 ms
[2024-05-25 08:51:11] [INFO ] Time to serialize gal into /tmp/LTL15758176349058632577.gal : 10 ms
[2024-05-25 08:51:11] [INFO ] Time to serialize properties into /tmp/LTL13799093461758826584.ltl : 113 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15758176349058632577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13799093461758826584.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(LeafSetOfRx0IsSentToNode4<=Node0ManageTheCrashOfNode10)")))||(G("(LeafSetOfLx2IsSentToNode9<=Node16HasTheLeafSetOfRx5ToRep...172
Formula 0 simplified : X(FG!"(LeafSetOfRx0IsSentToNode4<=Node0ManageTheCrashOfNode10)" & F!"(LeafSetOfLx2IsSentToNode9<=Node16HasTheLeafSetOfRx5ToReplaceNo...162
Detected timeout of ITS tools.
[2024-05-25 08:51:26] [INFO ] Flatten gal took : 51 ms
[2024-05-25 08:51:26] [INFO ] Applying decomposition
[2024-05-25 08:51:26] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4839477101186024125.txt' '-o' '/tmp/graph4839477101186024125.bin' '-w' '/tmp/graph4839477101186024125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4839477101186024125.bin' '-l' '-1' '-v' '-w' '/tmp/graph4839477101186024125.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:51:26] [INFO ] Decomposing Gal with order
[2024-05-25 08:51:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:51:26] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-25 08:51:26] [INFO ] Flatten gal took : 77 ms
[2024-05-25 08:51:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2024-05-25 08:51:26] [INFO ] Time to serialize gal into /tmp/LTL16909910808042378856.gal : 9 ms
[2024-05-25 08:51:26] [INFO ] Time to serialize properties into /tmp/LTL14326705208803693498.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16909910808042378856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14326705208803693498.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(gu2.LeafSetOfRx0IsSentToNode4<=gu2.Node0ManageTheCrashOfNode10)")))||(G("(gu9.LeafSetOfLx2IsSentToNode9<=gu9.Node16HasTheL...188
Formula 0 simplified : X(FG!"(gu2.LeafSetOfRx0IsSentToNode4<=gu2.Node0ManageTheCrashOfNode10)" & F!"(gu9.LeafSetOfLx2IsSentToNode9<=gu9.Node16HasTheLeafSet...178
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2129008784568064380
[2024-05-25 08:51:41] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2129008784568064380
Running compilation step : cd /tmp/ltsmin2129008784568064380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2129008784568064380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2129008784568064380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-06 finished in 93869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((p1||X(G(p2)))))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-14
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Support contains 6 out of 1396 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 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 0 with 29 rules applied. Total rules applied 29 place count 1396 transition count 3041
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1367 transition count 3041
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 58 place count 1367 transition count 3009
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 122 place count 1335 transition count 3009
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 141 place count 1316 transition count 2985
Iterating global reduction 2 with 19 rules applied. Total rules applied 160 place count 1316 transition count 2985
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 175 place count 1301 transition count 2915
Iterating global reduction 2 with 15 rules applied. Total rules applied 190 place count 1301 transition count 2915
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 193 place count 1298 transition count 2897
Iterating global reduction 2 with 3 rules applied. Total rules applied 196 place count 1298 transition count 2897
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 276 place count 1258 transition count 2857
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 291 place count 1243 transition count 2842
Iterating global reduction 2 with 15 rules applied. Total rules applied 306 place count 1243 transition count 2842
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 321 place count 1228 transition count 2752
Iterating global reduction 2 with 15 rules applied. Total rules applied 336 place count 1228 transition count 2752
Applied a total of 336 rules in 403 ms. Remains 1228 /1396 variables (removed 168) and now considering 2752/3070 (removed 318) transitions.
[2024-05-25 08:51:45] [INFO ] Flow matrix only has 2480 transitions (discarded 272 similar events)
// Phase 1: matrix 2480 rows 1228 cols
[2024-05-25 08:51:45] [INFO ] Computed 80 invariants in 31 ms
[2024-05-25 08:51:46] [INFO ] Implicit Places using invariants in 1083 ms returned [9, 158, 325, 351, 359, 360, 401, 402, 476, 497, 516, 530, 548, 550, 559, 560, 561, 612, 670, 691, 737, 762, 830, 833, 878, 921, 1028, 1101, 1102]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 1085 ms to find 29 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1199/1396 places, 2752/3070 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1186 transition count 2739
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1186 transition count 2739
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1173 transition count 2726
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1173 transition count 2726
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 1167 transition count 2690
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 1167 transition count 2690
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 86 place count 1156 transition count 2679
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 97 place count 1145 transition count 2668
Iterating global reduction 0 with 11 rules applied. Total rules applied 108 place count 1145 transition count 2668
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 120 place count 1133 transition count 2596
Iterating global reduction 0 with 12 rules applied. Total rules applied 132 place count 1133 transition count 2596
Applied a total of 132 rules in 323 ms. Remains 1133 /1199 variables (removed 66) and now considering 2596/2752 (removed 156) transitions.
[2024-05-25 08:51:47] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
// Phase 1: matrix 2324 rows 1133 cols
[2024-05-25 08:51:47] [INFO ] Computed 51 invariants in 27 ms
[2024-05-25 08:51:48] [INFO ] Implicit Places using invariants in 910 ms returned []
[2024-05-25 08:51:48] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-25 08:51:48] [INFO ] Invariant cache hit.
[2024-05-25 08:51:48] [INFO ] State equation strengthened by 888 read => feed constraints.
[2024-05-25 08:51:58] [INFO ] Implicit Places using invariants and state equation in 10319 ms returned []
Implicit Place search using SMT with State Equation took 11229 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1133/1396 places, 2596/3070 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 13040 ms. Remains : 1133/1396 places, 2596/3070 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(LEQ s557 s639), p0:(AND (LEQ s545 s768) (LEQ s615 s161)), p1:(LEQ s615 s161)], 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, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2265 reset in 563 ms.
Product exploration explored 100000 steps with 2265 reset in 591 ms.
Computed a total of 318 stabilizing places and 980 stable transitions
Computed a total of 318 stabilizing places and 980 stable transitions
Detected a total of 318/1133 stabilizing places and 980/2596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1429 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 08:52:01] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-25 08:52:01] [INFO ] Invariant cache hit.
[2024-05-25 08:52:01] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-25 08:52:02] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 08:52:02] [INFO ] [Nat]Absence check using 31 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-25 08:52:02] [INFO ] After 748ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-25 08:52:02] [INFO ] State equation strengthened by 888 read => feed constraints.
[2024-05-25 08:52:03] [INFO ] After 279ms SMT Verify possible using 888 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-25 08:52:03] [INFO ] Deduced a trap composed of 248 places in 453 ms of which 1 ms to minimize.
[2024-05-25 08:52:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 616 ms
[2024-05-25 08:52:03] [INFO ] After 1062ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 133 ms.
[2024-05-25 08:52:04] [INFO ] After 2150ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1133/1133 places, 2596/2596 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 0 with 3 rules applied. Total rules applied 3 place count 1133 transition count 2593
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1130 transition count 2593
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 10 place count 1126 transition count 2589
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 1126 transition count 2589
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 1122 transition count 2565
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 1122 transition count 2565
Free-agglomeration rule (complex) applied 139 times.
Iterating global reduction 2 with 139 rules applied. Total rules applied 161 place count 1122 transition count 3736
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 2 with 139 rules applied. Total rules applied 300 place count 983 transition count 3736
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 306 place count 983 transition count 3736
Applied a total of 306 rules in 399 ms. Remains 983 /1133 variables (removed 150) and now considering 3736/2596 (removed -1140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 983/1133 places, 3736/2596 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 68868 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68868 steps, saw 28809 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 08:52:07] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
// Phase 1: matrix 3338 rows 983 cols
[2024-05-25 08:52:07] [INFO ] Computed 51 invariants in 26 ms
[2024-05-25 08:52:07] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 08:52:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 08:52:08] [INFO ] [Nat]Absence check using 31 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-25 08:52:08] [INFO ] After 816ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 08:52:08] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:52:09] [INFO ] After 552ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 08:52:10] [INFO ] Deduced a trap composed of 149 places in 450 ms of which 1 ms to minimize.
[2024-05-25 08:52:10] [INFO ] Deduced a trap composed of 154 places in 469 ms of which 1 ms to minimize.
[2024-05-25 08:52:11] [INFO ] Deduced a trap composed of 231 places in 419 ms of which 1 ms to minimize.
[2024-05-25 08:52:11] [INFO ] Deduced a trap composed of 162 places in 438 ms of which 1 ms to minimize.
[2024-05-25 08:52:12] [INFO ] Deduced a trap composed of 169 places in 459 ms of which 1 ms to minimize.
[2024-05-25 08:52:13] [INFO ] Deduced a trap composed of 169 places in 441 ms of which 1 ms to minimize.
[2024-05-25 08:52:13] [INFO ] Deduced a trap composed of 185 places in 444 ms of which 1 ms to minimize.
[2024-05-25 08:52:14] [INFO ] Deduced a trap composed of 201 places in 456 ms of which 1 ms to minimize.
[2024-05-25 08:52:15] [INFO ] Deduced a trap composed of 200 places in 477 ms of which 1 ms to minimize.
[2024-05-25 08:52:15] [INFO ] Deduced a trap composed of 193 places in 437 ms of which 1 ms to minimize.
[2024-05-25 08:52:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6672 ms
[2024-05-25 08:52:16] [INFO ] After 7435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 177 ms.
[2024-05-25 08:52:16] [INFO ] After 8618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 3736/3736 transitions.
Applied a total of 0 rules in 95 ms. Remains 983 /983 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 983/983 places, 3736/3736 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 3736/3736 transitions.
Applied a total of 0 rules in 98 ms. Remains 983 /983 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
[2024-05-25 08:52:16] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
[2024-05-25 08:52:16] [INFO ] Invariant cache hit.
[2024-05-25 08:52:17] [INFO ] Implicit Places using invariants in 1127 ms returned [469, 478, 543, 640]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1144 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 979/983 places, 3736/3736 transitions.
Applied a total of 0 rules in 94 ms. Remains 979 /979 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1336 ms. Remains : 979/983 places, 3736/3736 transitions.
Incomplete random walk after 10000 steps, including 283 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 70168 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70168 steps, saw 29345 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 08:52:21] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
// Phase 1: matrix 3338 rows 979 cols
[2024-05-25 08:52:21] [INFO ] Computed 47 invariants in 37 ms
[2024-05-25 08:52:21] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 08:52:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 08:52:21] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-25 08:52:22] [INFO ] After 864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 08:52:22] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:52:22] [INFO ] After 401ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 08:52:23] [INFO ] Deduced a trap composed of 154 places in 424 ms of which 1 ms to minimize.
[2024-05-25 08:52:24] [INFO ] Deduced a trap composed of 162 places in 453 ms of which 1 ms to minimize.
[2024-05-25 08:52:24] [INFO ] Deduced a trap composed of 147 places in 419 ms of which 1 ms to minimize.
[2024-05-25 08:52:25] [INFO ] Deduced a trap composed of 219 places in 434 ms of which 1 ms to minimize.
[2024-05-25 08:52:25] [INFO ] Deduced a trap composed of 209 places in 459 ms of which 1 ms to minimize.
[2024-05-25 08:52:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2931 ms
[2024-05-25 08:52:26] [INFO ] After 3578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 159 ms.
[2024-05-25 08:52:26] [INFO ] After 4777ms 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 9 ms.
Support contains 2 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 3736/3736 transitions.
Applied a total of 0 rules in 102 ms. Remains 979 /979 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 979/979 places, 3736/3736 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 3736/3736 transitions.
Applied a total of 0 rules in 91 ms. Remains 979 /979 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
[2024-05-25 08:52:26] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
[2024-05-25 08:52:26] [INFO ] Invariant cache hit.
[2024-05-25 08:52:27] [INFO ] Implicit Places using invariants in 1091 ms returned []
[2024-05-25 08:52:27] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
[2024-05-25 08:52:27] [INFO ] Invariant cache hit.
[2024-05-25 08:52:28] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-25 08:52:45] [INFO ] Implicit Places using invariants and state equation in 17864 ms returned []
Implicit Place search using SMT with State Equation took 18969 ms to find 0 implicit places.
[2024-05-25 08:52:45] [INFO ] Redundant transitions in 147 ms returned []
[2024-05-25 08:52:45] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
[2024-05-25 08:52:45] [INFO ] Invariant cache hit.
[2024-05-25 08:52:46] [INFO ] Dead Transitions using invariants and state equation in 1358 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20603 ms. Remains : 979/979 places, 3736/3736 transitions.
Graph (trivial) has 1055 edges and 979 vertex of which 17 / 979 are part of one of the 1 SCC in 1 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 4314 edges and 963 vertex of which 949 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1302.t1573 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 932 transition count 2967
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 835 transition count 2774
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 739 transition count 2606
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 667 transition count 2464
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 597 transition count 2344
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 547 transition count 2246
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 499 transition count 2166
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 467 transition count 2104
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 437 transition count 2056
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 419 transition count 2022
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 403 transition count 1998
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 395 transition count 1984
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 389 transition count 1976
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 386 transition count 1974
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 16 Pre rules applied. Total rules applied 1640 place count 386 transition count 1958
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 32 rules applied. Total rules applied 1672 place count 370 transition count 1958
Discarding 282 places :
Symmetric choice reduction at 14 with 282 rule applications. Total rules 1954 place count 88 transition count 366
Iterating global reduction 14 with 282 rules applied. Total rules applied 2236 place count 88 transition count 366
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Iterating post reduction 14 with 206 rules applied. Total rules applied 2442 place count 88 transition count 160
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2442 place count 88 transition count 159
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2444 place count 87 transition count 159
Discarding 12 places :
Symmetric choice reduction at 15 with 12 rule applications. Total rules 2456 place count 75 transition count 103
Iterating global reduction 15 with 12 rules applied. Total rules applied 2468 place count 75 transition count 103
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 15 with 20 rules applied. Total rules applied 2488 place count 75 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 2492 place count 71 transition count 83
Discarding 9 places :
Symmetric choice reduction at 17 with 9 rule applications. Total rules 2501 place count 62 transition count 73
Iterating global reduction 17 with 9 rules applied. Total rules applied 2510 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2511 place count 61 transition count 72
Iterating global reduction 17 with 1 rules applied. Total rules applied 2512 place count 61 transition count 72
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 17 with 6 rules applied. Total rules applied 2518 place count 58 transition count 69
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2519 place count 57 transition count 67
Iterating global reduction 17 with 1 rules applied. Total rules applied 2520 place count 57 transition count 67
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 17 with 10 rules applied. Total rules applied 2530 place count 57 transition count 57
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 17 with 10 rules applied. Total rules applied 2540 place count 47 transition count 57
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 2542 place count 47 transition count 57
Applied a total of 2542 rules in 327 ms. Remains 47 /979 variables (removed 932) and now considering 57/3736 (removed 3679) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 57 rows 47 cols
[2024-05-25 08:52:47] [INFO ] Computed 16 invariants in 0 ms
[2024-05-25 08:52:47] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 08:52:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 08:52:47] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2024-05-25 08:52:47] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 08:52:47] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-25 08:52:47] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 5333 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 1133 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1133/1133 places, 2596/2596 transitions.
Applied a total of 0 rules in 71 ms. Remains 1133 /1133 variables (removed 0) and now considering 2596/2596 (removed 0) transitions.
[2024-05-25 08:52:53] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
// Phase 1: matrix 2324 rows 1133 cols
[2024-05-25 08:52:53] [INFO ] Computed 51 invariants in 28 ms
[2024-05-25 08:52:54] [INFO ] Implicit Places using invariants in 952 ms returned []
[2024-05-25 08:52:54] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-25 08:52:54] [INFO ] Invariant cache hit.
[2024-05-25 08:52:54] [INFO ] State equation strengthened by 888 read => feed constraints.
[2024-05-25 08:53:04] [INFO ] Implicit Places using invariants and state equation in 10300 ms returned []
Implicit Place search using SMT with State Equation took 11269 ms to find 0 implicit places.
[2024-05-25 08:53:04] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-25 08:53:04] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-25 08:53:04] [INFO ] Invariant cache hit.
[2024-05-25 08:53:05] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12510 ms. Remains : 1133/1133 places, 2596/2596 transitions.
Computed a total of 318 stabilizing places and 980 stable transitions
Computed a total of 318 stabilizing places and 980 stable transitions
Detected a total of 318/1133 stabilizing places and 980/2596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 245 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-25 08:53:06] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-25 08:53:06] [INFO ] Invariant cache hit.
[2024-05-25 08:53:06] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:53:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 08:53:06] [INFO ] [Nat]Absence check using 31 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-25 08:53:06] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 13 factoid took 406 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 2265 reset in 521 ms.
Product exploration explored 100000 steps with 2267 reset in 536 ms.
Built C files in :
/tmp/ltsmin731369043654331773
[2024-05-25 08:53:08] [INFO ] Too many transitions (2596) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:53:08] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin731369043654331773
Running compilation step : cd /tmp/ltsmin731369043654331773;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin731369043654331773;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin731369043654331773;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1133/1133 places, 2596/2596 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 1133 transition count 2594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1131 transition count 2594
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 1129 transition count 2592
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1129 transition count 2592
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 1127 transition count 2580
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1127 transition count 2580
Applied a total of 12 rules in 165 ms. Remains 1127 /1133 variables (removed 6) and now considering 2580/2596 (removed 16) transitions.
[2024-05-25 08:53:11] [INFO ] Flow matrix only has 2308 transitions (discarded 272 similar events)
// Phase 1: matrix 2308 rows 1127 cols
[2024-05-25 08:53:11] [INFO ] Computed 51 invariants in 29 ms
[2024-05-25 08:53:12] [INFO ] Implicit Places using invariants in 975 ms returned [538, 740]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 989 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1125/1133 places, 2580/2596 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 1123 transition count 2578
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1121 transition count 2576
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1121 transition count 2576
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1119 transition count 2564
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1119 transition count 2564
Applied a total of 12 rules in 204 ms. Remains 1119 /1125 variables (removed 6) and now considering 2564/2580 (removed 16) transitions.
[2024-05-25 08:53:12] [INFO ] Flow matrix only has 2292 transitions (discarded 272 similar events)
// Phase 1: matrix 2292 rows 1119 cols
[2024-05-25 08:53:12] [INFO ] Computed 49 invariants in 24 ms
[2024-05-25 08:53:13] [INFO ] Implicit Places using invariants in 1270 ms returned []
[2024-05-25 08:53:13] [INFO ] Flow matrix only has 2292 transitions (discarded 272 similar events)
[2024-05-25 08:53:13] [INFO ] Invariant cache hit.
[2024-05-25 08:53:14] [INFO ] State equation strengthened by 868 read => feed constraints.
[2024-05-25 08:53:22] [INFO ] Implicit Places using invariants and state equation in 8973 ms returned []
Implicit Place search using SMT with State Equation took 10268 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1119/1133 places, 2564/2596 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11630 ms. Remains : 1119/1133 places, 2564/2596 transitions.
Built C files in :
/tmp/ltsmin12472712751615378994
[2024-05-25 08:53:22] [INFO ] Too many transitions (2564) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:53:22] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12472712751615378994
Running compilation step : cd /tmp/ltsmin12472712751615378994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12472712751615378994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12472712751615378994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:53:25] [INFO ] Flatten gal took : 52 ms
[2024-05-25 08:53:26] [INFO ] Flatten gal took : 52 ms
[2024-05-25 08:53:26] [INFO ] Time to serialize gal into /tmp/LTL9149513537814017754.gal : 9 ms
[2024-05-25 08:53:26] [INFO ] Time to serialize properties into /tmp/LTL3900800211619825940.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9149513537814017754.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10870678413866210649.hoa' '-atoms' '/tmp/LTL3900800211619825940.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3900800211619825940.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10870678413866210649.hoa
Detected timeout of ITS tools.
[2024-05-25 08:53:41] [INFO ] Flatten gal took : 65 ms
[2024-05-25 08:53:41] [INFO ] Flatten gal took : 54 ms
[2024-05-25 08:53:41] [INFO ] Time to serialize gal into /tmp/LTL3261931394340778710.gal : 9 ms
[2024-05-25 08:53:41] [INFO ] Time to serialize properties into /tmp/LTL10799961667981345110.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3261931394340778710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10799961667981345110.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((Node8HasTheLeafSetOfLx1ToReplaceNode4<=Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(Node10HasTheLeafSetOfRx4ToReplaceNode16<=...398
Formula 0 simplified : X(F!"((Node8HasTheLeafSetOfLx1ToReplaceNode4<=Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(Node10HasTheLeafSetOfRx4ToReplaceNode16<=No...386
Detected timeout of ITS tools.
[2024-05-25 08:53:56] [INFO ] Flatten gal took : 52 ms
[2024-05-25 08:53:56] [INFO ] Applying decomposition
[2024-05-25 08:53:56] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8909779728857361011.txt' '-o' '/tmp/graph8909779728857361011.bin' '-w' '/tmp/graph8909779728857361011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8909779728857361011.bin' '-l' '-1' '-v' '-w' '/tmp/graph8909779728857361011.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:53:56] [INFO ] Decomposing Gal with order
[2024-05-25 08:53:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:53:56] [INFO ] Removed a total of 154 redundant transitions.
[2024-05-25 08:53:56] [INFO ] Flatten gal took : 76 ms
[2024-05-25 08:53:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2024-05-25 08:53:56] [INFO ] Time to serialize gal into /tmp/LTL16467946960095856577.gal : 11 ms
[2024-05-25 08:53:56] [INFO ] Time to serialize properties into /tmp/LTL8915594018963404345.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16467946960095856577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8915594018963404345.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((gu10.Node8HasTheLeafSetOfLx1ToReplaceNode4<=gu10.Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(gu7.Node10HasTheLeafSetOfRx4ToR...434
Formula 0 simplified : X(F!"((gu10.Node8HasTheLeafSetOfLx1ToReplaceNode4<=gu10.Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(gu7.Node10HasTheLeafSetOfRx4ToRep...422
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14368443713339145420
[2024-05-25 08:54:11] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14368443713339145420
Running compilation step : cd /tmp/ltsmin14368443713339145420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14368443713339145420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14368443713339145420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-14 finished in 149879 ms.
[2024-05-25 08:54:14] [INFO ] Flatten gal took : 68 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1246279954725777244
[2024-05-25 08:54:15] [INFO ] Too many transitions (3070) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:54:15] [INFO ] Applying decomposition
[2024-05-25 08:54:15] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1246279954725777244
Running compilation step : cd /tmp/ltsmin1246279954725777244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 08:54:15] [INFO ] Flatten gal took : 130 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8617319850183387235.txt' '-o' '/tmp/graph8617319850183387235.bin' '-w' '/tmp/graph8617319850183387235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8617319850183387235.bin' '-l' '-1' '-v' '-w' '/tmp/graph8617319850183387235.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:54:15] [INFO ] Decomposing Gal with order
[2024-05-25 08:54:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:54:15] [INFO ] Removed a total of 2810 redundant transitions.
[2024-05-25 08:54:15] [INFO ] Flatten gal took : 340 ms
[2024-05-25 08:54:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 82 ms.
[2024-05-25 08:54:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality13546848268523687643.gal : 34 ms
[2024-05-25 08:54:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality16317127863498651230.ltl : 184 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13546848268523687643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16317127863498651230.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 6 LTL properties
Checking formula 0 : !((F(G("(gu138.Node11HasTheLeafSetOfRx4ToReplaceNode8<=gu138.Node7HasTheLeafSetOfLx3ToReplaceNode2)"))))
Formula 0 simplified : GF!"(gu138.Node11HasTheLeafSetOfRx4ToReplaceNode8<=gu138.Node7HasTheLeafSetOfLx3ToReplaceNode2)"
Compilation finished in 7500 ms.
Running link step : cd /tmp/ltsmin1246279954725777244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin1246279954725777244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1246279954725777244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1246279954725777244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1246279954725777244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1246279954725777244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp2==true)))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 09:21:13] [INFO ] Flatten gal took : 430 ms
[2024-05-25 09:21:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality17029581682946386061.gal : 129 ms
[2024-05-25 09:21:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality802413835820083207.ltl : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17029581682946386061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality802413835820083207.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 6 LTL properties
Checking formula 0 : !((F(G("(Node11HasTheLeafSetOfRx4ToReplaceNode8<=Node7HasTheLeafSetOfLx3ToReplaceNode2)"))))
Formula 0 simplified : GF!"(Node11HasTheLeafSetOfRx4ToReplaceNode8<=Node7HasTheLeafSetOfLx3ToReplaceNode2)"
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1246279954725777244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp2==true)))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1246279954725777244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1246279954725777244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1246279954725777244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp5==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8868952 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16230392 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654371900022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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