Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r130-smll-177955808900108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955808900108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 61K Mar 6 07:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 418K Mar 6 07:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Mar 6 07:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 280K Mar 6 07:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Mar 15 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 15 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Mar 15 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 96K Mar 15 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Mar 6 07:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 349K Mar 6 07:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 124K Mar 6 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Mar 6 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Mar 15 10:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779739491406

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00020M0002C001P001G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 20:04:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 20:04:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 20:04:54] [INFO ] Load time of PNML (sax parser for PT used): 438 ms
[2026-05-25 20:04:54] [INFO ] Transformed 3271 places.
[2026-05-25 20:04:54] [INFO ] Transformed 2753 transitions.
[2026-05-25 20:04:54] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 682 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 11 places and 0 transitions.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 632 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Reduce places removed 76 places and 0 transitions.
Discarding 311 places :
Implicit places reduction removed 311 places
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 2873 transition count 2753
Discarding 230 places :
Symmetric choice reduction at 1 with 230 rule applications. Total rules 617 place count 2643 transition count 2502
Iterating global reduction 1 with 230 rules applied. Total rules applied 847 place count 2643 transition count 2502
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 868 place count 2622 transition count 2502
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 933 place count 2557 transition count 2397
Iterating global reduction 2 with 65 rules applied. Total rules applied 998 place count 2557 transition count 2397
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 1061 place count 2515 transition count 2376
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1124 place count 2452 transition count 2313
Iterating global reduction 3 with 63 rules applied. Total rules applied 1187 place count 2452 transition count 2313
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1188 place count 2451 transition count 2292
Iterating global reduction 3 with 1 rules applied. Total rules applied 1189 place count 2451 transition count 2292
Applied a total of 1189 rules in 2345 ms. Remains 2451 /3260 variables (removed 809) and now considering 2292/2753 (removed 461) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10028072756307658567.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6562054900392076104.kers'
[2026-05-25 20:04:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10028072756307658567.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6562054900392076104.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2292 rows 2451 cols 5683 entries
Finished phase 1 with 1871 SingleSign rule and 256 generalized
[2026-05-25 20:04:57] [INFO ] Computed 324 invariants in 22 ms
Computed 324 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-6562054900392076104.kers
Total runtime 27 ms.
[2026-05-25 20:04:59] [INFO ] Implicit Places using invariants in 2322 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 249, 250, 251, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 901, 902, 903, 904, 905, 906, 907, 908, 1289, 1374, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1608, 1609, 1610, 1611, 1612, 1613, 1614, 1615, 1616, 1617, 1618, 1619, 1620, 1621, 1622, 1623, 1624, 1625, 1626, 1627, 1628, 2240]
Discarding 106 places :
Implicit Place search using SMT only with invariants took 2410 ms to find 106 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2345/3260 places, 2292/2753 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2325 transition count 2272
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2325 transition count 2272
Applied a total of 40 rules in 509 ms. Remains 2325 /2345 variables (removed 20) and now considering 2272/2292 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12068167250850081049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14900482422512518270.kers'
[2026-05-25 20:05:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12068167250850081049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14900482422512518270.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2272 rows 2325 cols 5267 entries
Finished phase 1 with 1936 SingleSign rule and 171 generalized
[2026-05-25 20:05:00] [INFO ] Computed 218 invariants in 18 ms
Computed 218 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-14900482422512518270.kers
Total runtime 24 ms.
[2026-05-25 20:05:01] [INFO ] Implicit Places using invariants in 1124 ms returned []
[2026-05-25 20:05:01] [INFO ] Invariant cache hit.
[2026-05-25 20:05:05] [INFO ] Implicit Places using invariants and state equation in 3871 ms returned []
Implicit Place search using SMT with State Equation took 5014 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2325/3260 places, 2272/2753 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10303 ms. Remains : 2325/3260 places, 2272/2753 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Applied a total of 0 rules in 195 ms. Remains 2325 /2325 variables (removed 0) and now considering 2272/2272 (removed 0) transitions.
[2026-05-25 20:05:05] [INFO ] Invariant cache hit.
[2026-05-25 20:05:06] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2026-05-25 20:05:06] [INFO ] Invariant cache hit.
[2026-05-25 20:05:10] [INFO ] Implicit Places using invariants and state equation in 3711 ms returned []
Implicit Place search using SMT with State Equation took 4816 ms to find 0 implicit places.
Running 2251 sub problems to find dead transitions.
[2026-05-25 20:05:10] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2304 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 2251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2304/4597 variables, and 215 constraints, problems are : Problem set: 0 solved, 2251 unsolved in 30147 ms.
Refiners :[Generalized P Invariants (flows): 215/218 constraints, State Equation: 0/2325 constraints, PredecessorRefiner: 2251/2251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2304 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 2251 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2304/4597 variables, and 215 constraints, problems are : Problem set: 0 solved, 2251 unsolved in 30083 ms.
Refiners :[Generalized P Invariants (flows): 215/218 constraints, State Equation: 0/2325 constraints, PredecessorRefiner: 0/2251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61223ms problems are : Problem set: 0 solved, 2251 unsolved
Search for dead transitions found 0 dead transitions in 61294ms
Finished structural reductions in LTL mode , in 1 iterations and 66370 ms. Remains : 2325/2325 places, 2272/2272 transitions.
Support contains 632 out of 2325 places after structural reductions.
[2026-05-25 20:06:12] [INFO ] Flatten gal took : 308 ms
[2026-05-25 20:06:12] [INFO ] Flatten gal took : 162 ms
[2026-05-25 20:06:13] [INFO ] Input system was already deterministic with 2272 transitions.
RANDOM walk for 40000 steps (32 resets) in 2659 ms. (15 steps per ms) remains 1/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
[2026-05-25 20:06:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1298/1301 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1301 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 813/2114 variables, 194/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2114 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/2154 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2154 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4234/4597 variables, and 2372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2911 ms.
Refiners :[Generalized P Invariants (flows): 218/218 constraints, State Equation: 2154/2325 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1298/1301 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1301 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 813/2114 variables, 194/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2114 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/2154 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2154 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4234/4597 variables, and 2372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2269 ms.
Refiners :[Generalized P Invariants (flows): 218/218 constraints, State Equation: 2154/2325 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5206ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 238 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=59 )
Parikh walk visited 1 properties in 14 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2325 stabilizing places and 2272 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2325 transition count 2272
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (X(p1)&&F(!p2))))'
Support contains 107 out of 2325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Discarding 67 places :
Implicit places reduction removed 67 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 2258 transition count 2272
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 134 place count 2191 transition count 2165
Iterating global reduction 1 with 67 rules applied. Total rules applied 201 place count 2191 transition count 2165
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 285 place count 2107 transition count 2081
Iterating global reduction 1 with 84 rules applied. Total rules applied 369 place count 2107 transition count 2081
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 452 place count 2024 transition count 1998
Iterating global reduction 1 with 83 rules applied. Total rules applied 535 place count 2024 transition count 1998
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 555 place count 2004 transition count 1958
Iterating global reduction 1 with 20 rules applied. Total rules applied 575 place count 2004 transition count 1958
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 595 place count 1984 transition count 1938
Iterating global reduction 1 with 20 rules applied. Total rules applied 615 place count 1984 transition count 1938
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 635 place count 1964 transition count 1918
Iterating global reduction 1 with 20 rules applied. Total rules applied 655 place count 1964 transition count 1918
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 675 place count 1944 transition count 1898
Iterating global reduction 1 with 20 rules applied. Total rules applied 695 place count 1944 transition count 1898
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 715 place count 1924 transition count 1878
Iterating global reduction 1 with 20 rules applied. Total rules applied 735 place count 1924 transition count 1878
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 755 place count 1904 transition count 1858
Iterating global reduction 1 with 20 rules applied. Total rules applied 775 place count 1904 transition count 1858
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 795 place count 1884 transition count 1838
Iterating global reduction 1 with 20 rules applied. Total rules applied 815 place count 1884 transition count 1838
Applied a total of 815 rules in 2176 ms. Remains 1884 /2325 variables (removed 441) and now considering 1838/2272 (removed 434) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8007363982287964514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6387757972269236608.kers'
[2026-05-25 20:06:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8007363982287964514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6387757972269236608.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1838 rows 1884 cols 4119 entries
Finished phase 1 with 1627 SingleSign rule and 106 generalized
[2026-05-25 20:06:21] [INFO ] Computed 151 invariants in 17 ms
Computed 151 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-6387757972269236608.kers
Total runtime 20 ms.
[2026-05-25 20:06:22] [INFO ] Implicit Places using invariants in 881 ms returned [210, 1102, 1401, 1402, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1420, 1421]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 884 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1861/2325 places, 1838/2272 transitions.
Applied a total of 0 rules in 242 ms. Remains 1861 /1861 variables (removed 0) and now considering 1838/1838 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3303 ms. Remains : 1861/2325 places, 1838/2272 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (X(p1)&&F(!p2))))'
Stuttering acceptance computed with spot in 500 ms :[(OR (NOT p1) p2), (NOT p1), p2, (NOT p1), true, p0]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-00
Entered a terminal (fully accepting) state of product in 249 steps with 0 reset in 20 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-00 finished in 3962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 66 out of 2325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Graph (complete) has 2910 edges and 2325 vertex of which 1561 are kept as prefixes of interest. Removing 764 places using SCC suffix rule.23 ms
Discarding 764 places :
Also discarding 718 output transitions
Drop transitions (Output transitions of discarded places.) removed 718 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 67 places :
Implicit places reduction removed 67 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1029 transitions
Trivial Post-agglo rules discarded 1029 transitions
Performed 1029 trivial Post agglomeration. Transition count delta: 1029
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1097 place count 1473 transition count 504
Reduce places removed 1029 places and 0 transitions.
Iterating post reduction 1 with 1029 rules applied. Total rules applied 2126 place count 444 transition count 504
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 168 Pre rules applied. Total rules applied 2126 place count 444 transition count 336
Deduced a syphon composed of 168 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 2 with 378 rules applied. Total rules applied 2504 place count 234 transition count 336
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 2546 place count 213 transition count 357
Applied a total of 2546 rules in 192 ms. Remains 213 /2325 variables (removed 2112) and now considering 357/2272 (removed 1915) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2972697049710501178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1609229326276468892.kers'
[2026-05-25 20:06:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2972697049710501178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1609229326276468892.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 357 rows 213 cols 861 entries
Finished phase 1 with 191 SingleSign rule and 21 generalized
[2026-05-25 20:06:23] [INFO ] Computed 1 invariants in 2 ms
Computed 1 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1609229326276468892.kers
Total runtime 4 ms.
[2026-05-25 20:06:23] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 20:06:23] [INFO ] Invariant cache hit.
[2026-05-25 20:06:24] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2026-05-25 20:06:24] [INFO ] Redundant transitions in 39 ms returned []
Running 294 sub problems to find dead transitions.
[2026-05-25 20:06:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 357/549 variables, 192/193 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/549 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 21/570 variables, 21/214 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 0/570 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 214 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 357/549 variables, 192/193 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/549 variables, 294/487 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 21/570 variables, 21/508 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 508 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in SI_LTL mode, iteration 1 : 213/2325 places, 357/2272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60712 ms. Remains : 213/2325 places, 357/2272 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 14 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01 finished in 60950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(X(!p0))&&F(p1))))))'
Support contains 126 out of 2325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Graph (complete) has 2910 edges and 2325 vertex of which 1624 are kept as prefixes of interest. Removing 701 places using SCC suffix rule.19 ms
Discarding 701 places :
Also discarding 676 output transitions
Drop transitions (Output transitions of discarded places.) removed 676 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 67 places :
Implicit places reduction removed 67 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 945 transitions
Trivial Post-agglo rules discarded 945 transitions
Performed 945 trivial Post agglomeration. Transition count delta: 945
Iterating post reduction 0 with 1012 rules applied. Total rules applied 1013 place count 1536 transition count 630
Reduce places removed 945 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 1008 rules applied. Total rules applied 2021 place count 591 transition count 567
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 2084 place count 528 transition count 567
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 168 Pre rules applied. Total rules applied 2084 place count 528 transition count 399
Deduced a syphon composed of 168 places in 1 ms
Ensure Unique test removed 42 places
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 3 with 378 rules applied. Total rules applied 2462 place count 318 transition count 399
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2464 place count 316 transition count 357
Iterating global reduction 3 with 2 rules applied. Total rules applied 2466 place count 316 transition count 357
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2508 place count 295 transition count 336
Applied a total of 2508 rules in 215 ms. Remains 295 /2325 variables (removed 2030) and now considering 336/2272 (removed 1936) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10792671272755900975.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10598785788866890482.kers'
[2026-05-25 20:07:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10792671272755900975.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10598785788866890482.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 336 rows 295 cols 798 entries
Finished phase 1 with 231 SingleSign rule and 42 generalized
[2026-05-25 20:07:24] [INFO ] Computed 22 invariants in 7 ms
Computed 22 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10598785788866890482.kers
Total runtime 8 ms.
[2026-05-25 20:07:25] [INFO ] Implicit Places using invariants in 169 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 171 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 294/2325 places, 336/2272 transitions.
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 21 Pre rules applied. Total rules applied 0 place count 294 transition count 315
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 273 transition count 315
Applied a total of 42 rules in 21 ms. Remains 273 /294 variables (removed 21) and now considering 315/336 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15200070822036211192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2385647893401732706.kers'
[2026-05-25 20:07:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15200070822036211192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2385647893401732706.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 273 cols 672 entries
Finished phase 1 with 231 SingleSign rule and 21 generalized
[2026-05-25 20:07:25] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2385647893401732706.kers
Total runtime 3 ms.
[2026-05-25 20:07:25] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 20:07:25] [INFO ] Invariant cache hit.
[2026-05-25 20:07:25] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 273/2325 places, 315/2272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 757 ms. Remains : 273/2325 places, 315/2272 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(X(!p0))&&F(p1))))))'
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03
Product exploration explored 100000 steps with 812 reset in 963 ms.
Product exploration explored 100000 steps with 816 reset in 611 ms.
Computed a total of 273 stabilizing places and 315 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 273 transition count 315
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 15 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 174 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03 finished in 2702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 84 out of 2325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Graph (complete) has 2910 edges and 2325 vertex of which 2322 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 67 places :
Implicit places reduction removed 67 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1259 transitions
Trivial Post-agglo rules discarded 1259 transitions
Performed 1259 trivial Post agglomeration. Transition count delta: 1259
Iterating post reduction 0 with 1326 rules applied. Total rules applied 1327 place count 2234 transition count 989
Reduce places removed 1259 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 1322 rules applied. Total rules applied 2649 place count 975 transition count 926
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 2712 place count 912 transition count 926
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 293 Pre rules applied. Total rules applied 2712 place count 912 transition count 633
Deduced a syphon composed of 293 places in 2 ms
Ensure Unique test removed 105 places
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 691 rules applied. Total rules applied 3403 place count 514 transition count 633
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 3404 place count 514 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3405 place count 513 transition count 632
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 3405 place count 513 transition count 612
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 3445 place count 493 transition count 612
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 3490 place count 448 transition count 527
Iterating global reduction 5 with 45 rules applied. Total rules applied 3535 place count 448 transition count 527
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 5 with 107 rules applied. Total rules applied 3642 place count 427 transition count 441
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 6 with 65 rules applied. Total rules applied 3707 place count 362 transition count 441
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 3707 place count 362 transition count 420
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 3749 place count 341 transition count 420
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3750 place count 340 transition count 399
Iterating global reduction 7 with 1 rules applied. Total rules applied 3751 place count 340 transition count 399
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 7 with 43 rules applied. Total rules applied 3794 place count 339 transition count 357
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 3815 place count 318 transition count 357
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 9 with 84 rules applied. Total rules applied 3899 place count 276 transition count 315
Applied a total of 3899 rules in 135 ms. Remains 276 /2325 variables (removed 2049) and now considering 315/2272 (removed 1957) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2576902789428579142.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4913578102530371235.kers'
[2026-05-25 20:07:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2576902789428579142.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4913578102530371235.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 276 cols 819 entries
Finished phase 1 with 210 SingleSign rule and 42 generalized
[2026-05-25 20:07:27] [INFO ] Computed 24 invariants in 2 ms
Computed 24 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4913578102530371235.kers
Total runtime 3 ms.
[2026-05-25 20:07:27] [INFO ] Implicit Places using invariants in 212 ms returned [147, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 233]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 215 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/2325 places, 315/2272 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 253 transition count 294
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 232 transition count 294
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 42 place count 232 transition count 273
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 84 place count 211 transition count 273
Applied a total of 84 rules in 15 ms. Remains 211 /253 variables (removed 42) and now considering 273/315 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12305422543743851033.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1929132832846169503.kers'
[2026-05-25 20:07:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12305422543743851033.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1929132832846169503.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 273 rows 211 cols 546 entries
Finished phase 1 with 189 SingleSign rule and 21 generalized
[2026-05-25 20:07:27] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1929132832846169503.kers
Total runtime 2 ms.
[2026-05-25 20:07:27] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 20:07:27] [INFO ] Invariant cache hit.
[2026-05-25 20:07:27] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 211/2325 places, 273/2272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 637 ms. Remains : 211/2325 places, 273/2272 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-04
Stuttering criterion allowed to conclude after 1474 steps with 133 reset in 12 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-04 finished in 753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(X(X(p1))&&((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(!p2&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))))))))'
Support contains 231 out of 2325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2321 transition count 2272
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 71 place count 2254 transition count 2165
Iterating global reduction 1 with 67 rules applied. Total rules applied 138 place count 2254 transition count 2165
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 223 place count 2169 transition count 2060
Iterating global reduction 1 with 85 rules applied. Total rules applied 308 place count 2169 transition count 2060
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 412 place count 2065 transition count 1956
Iterating global reduction 1 with 104 rules applied. Total rules applied 516 place count 2065 transition count 1956
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 22 rules applied. Total rules applied 538 place count 2064 transition count 1935
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 600 place count 2002 transition count 1853
Iterating global reduction 2 with 62 rules applied. Total rules applied 662 place count 2002 transition count 1853
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 724 place count 1940 transition count 1791
Iterating global reduction 2 with 62 rules applied. Total rules applied 786 place count 1940 transition count 1791
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 848 place count 1878 transition count 1729
Iterating global reduction 2 with 62 rules applied. Total rules applied 910 place count 1878 transition count 1729
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 972 place count 1816 transition count 1667
Iterating global reduction 2 with 62 rules applied. Total rules applied 1034 place count 1816 transition count 1667
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1096 place count 1754 transition count 1605
Iterating global reduction 2 with 62 rules applied. Total rules applied 1158 place count 1754 transition count 1605
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1220 place count 1692 transition count 1543
Iterating global reduction 2 with 62 rules applied. Total rules applied 1282 place count 1692 transition count 1543
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1344 place count 1630 transition count 1481
Iterating global reduction 2 with 62 rules applied. Total rules applied 1406 place count 1630 transition count 1481
Applied a total of 1406 rules in 1551 ms. Remains 1630 /2325 variables (removed 695) and now considering 1481/2272 (removed 791) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13163476544505547519.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12506379728287703290.kers'
[2026-05-25 20:07:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13163476544505547519.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12506379728287703290.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1481 rows 1630 cols 3487 entries
Finished phase 1 with 1250 SingleSign rule and 167 generalized
[2026-05-25 20:07:29] [INFO ] Computed 213 invariants in 17 ms
Computed 213 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-12506379728287703290.kers
Total runtime 20 ms.
[2026-05-25 20:07:30] [INFO ] Implicit Places using invariants in 1040 ms returned [462, 848, 1147, 1148, 1149, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1157, 1158, 1159, 1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 1042 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1607/2325 places, 1481/2272 transitions.
Applied a total of 0 rules in 151 ms. Remains 1607 /1607 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2744 ms. Remains : 1607/2325 places, 1481/2272 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(X(X(p1))&&((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(!p2&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))))))))'
Stuttering acceptance computed with spot in 457 ms :[p0, (AND p0 (NOT p1)), p0, false, false, (AND p0 (NOT p1)), false, false]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06
Product exploration explored 100000 steps with 6709 reset in 2809 ms.
Product exploration explored 100000 steps with 6954 reset in 2971 ms.
Computed a total of 1607 stabilizing places and 1481 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1607 transition count 1481
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 22 factoid took 20 ms. Proved property starting from automaton with 8 states, 28 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 687 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06 finished in 9773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(p1 U (p2 U G(!p3))))))'
Support contains 189 out of 2325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Discarding 67 places :
Implicit places reduction removed 67 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 2258 transition count 2272
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 92 place count 2233 transition count 2207
Iterating global reduction 1 with 25 rules applied. Total rules applied 117 place count 2233 transition count 2207
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 180 place count 2170 transition count 2144
Iterating global reduction 1 with 63 rules applied. Total rules applied 243 place count 2170 transition count 2144
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 305 place count 2108 transition count 2082
Iterating global reduction 1 with 62 rules applied. Total rules applied 367 place count 2108 transition count 2082
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 429 place count 2046 transition count 2000
Iterating global reduction 1 with 62 rules applied. Total rules applied 491 place count 2046 transition count 2000
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 553 place count 1984 transition count 1938
Iterating global reduction 1 with 62 rules applied. Total rules applied 615 place count 1984 transition count 1938
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 677 place count 1922 transition count 1876
Iterating global reduction 1 with 62 rules applied. Total rules applied 739 place count 1922 transition count 1876
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 801 place count 1860 transition count 1814
Iterating global reduction 1 with 62 rules applied. Total rules applied 863 place count 1860 transition count 1814
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 925 place count 1798 transition count 1752
Iterating global reduction 1 with 62 rules applied. Total rules applied 987 place count 1798 transition count 1752
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1049 place count 1736 transition count 1690
Iterating global reduction 1 with 62 rules applied. Total rules applied 1111 place count 1736 transition count 1690
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1173 place count 1674 transition count 1628
Iterating global reduction 1 with 62 rules applied. Total rules applied 1235 place count 1674 transition count 1628
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1277 place count 1632 transition count 1586
Iterating global reduction 1 with 42 rules applied. Total rules applied 1319 place count 1632 transition count 1586
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1361 place count 1590 transition count 1544
Iterating global reduction 1 with 42 rules applied. Total rules applied 1403 place count 1590 transition count 1544
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1445 place count 1548 transition count 1502
Iterating global reduction 1 with 42 rules applied. Total rules applied 1487 place count 1548 transition count 1502
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1529 place count 1506 transition count 1460
Iterating global reduction 1 with 42 rules applied. Total rules applied 1571 place count 1506 transition count 1460
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 1613 place count 1506 transition count 1418
Applied a total of 1613 rules in 2720 ms. Remains 1506 /2325 variables (removed 819) and now considering 1418/2272 (removed 854) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11588008531604024254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-334873258833811791.kers'
[2026-05-25 20:07:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11588008531604024254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-334873258833811791.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1418 rows 1506 cols 3342 entries
Finished phase 1 with 1249 SingleSign rule and 106 generalized
[2026-05-25 20:07:40] [INFO ] Computed 151 invariants in 9 ms
Computed 151 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-334873258833811791.kers
Total runtime 11 ms.
[2026-05-25 20:07:41] [INFO ] Implicit Places using invariants in 660 ms returned [168, 661]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 676 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1504/2325 places, 1418/2272 transitions.
Applied a total of 0 rules in 138 ms. Remains 1504 /1504 variables (removed 0) and now considering 1418/1418 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3534 ms. Remains : 1504/2325 places, 1418/2272 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1 U (p2 U G(!p3))))))'
Stuttering acceptance computed with spot in 467 ms :[(AND (NOT p0) p3), (AND (NOT p0) p3), true, (NOT p0), p3, p3, p3, (AND (NOT p0) p3), (AND (NOT p0) p3)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07
Entered a terminal (fully accepting) state of product in 484 steps with 0 reset in 5 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07 finished in 4080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (X(p2)||p1))))'
Support contains 3 out of 2325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Discarding 67 places :
Implicit places reduction removed 67 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 2258 transition count 2272
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 134 place count 2191 transition count 2165
Iterating global reduction 1 with 67 rules applied. Total rules applied 201 place count 2191 transition count 2165
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 286 place count 2106 transition count 2060
Iterating global reduction 1 with 85 rules applied. Total rules applied 371 place count 2106 transition count 2060
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 475 place count 2002 transition count 1956
Iterating global reduction 1 with 104 rules applied. Total rules applied 579 place count 2002 transition count 1956
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 22 rules applied. Total rules applied 601 place count 2001 transition count 1935
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 663 place count 1939 transition count 1853
Iterating global reduction 2 with 62 rules applied. Total rules applied 725 place count 1939 transition count 1853
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 787 place count 1877 transition count 1791
Iterating global reduction 2 with 62 rules applied. Total rules applied 849 place count 1877 transition count 1791
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 911 place count 1815 transition count 1729
Iterating global reduction 2 with 62 rules applied. Total rules applied 973 place count 1815 transition count 1729
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1035 place count 1753 transition count 1667
Iterating global reduction 2 with 62 rules applied. Total rules applied 1097 place count 1753 transition count 1667
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1159 place count 1691 transition count 1605
Iterating global reduction 2 with 62 rules applied. Total rules applied 1221 place count 1691 transition count 1605
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1283 place count 1629 transition count 1543
Iterating global reduction 2 with 62 rules applied. Total rules applied 1345 place count 1629 transition count 1543
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1407 place count 1567 transition count 1481
Iterating global reduction 2 with 62 rules applied. Total rules applied 1469 place count 1567 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1511 place count 1525 transition count 1439
Iterating global reduction 2 with 42 rules applied. Total rules applied 1553 place count 1525 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1595 place count 1483 transition count 1397
Iterating global reduction 2 with 42 rules applied. Total rules applied 1637 place count 1483 transition count 1397
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1679 place count 1441 transition count 1355
Iterating global reduction 2 with 42 rules applied. Total rules applied 1721 place count 1441 transition count 1355
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1763 place count 1399 transition count 1313
Iterating global reduction 2 with 42 rules applied. Total rules applied 1805 place count 1399 transition count 1313
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 1847 place count 1399 transition count 1271
Applied a total of 1847 rules in 2969 ms. Remains 1399 /2325 variables (removed 926) and now considering 1271/2272 (removed 1001) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12945450783070591293.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13905171959588995203.kers'
[2026-05-25 20:07:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12945450783070591293.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13905171959588995203.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1271 rows 1399 cols 2941 entries
Finished phase 1 with 1144 SingleSign rule and 105 generalized
[2026-05-25 20:07:44] [INFO ] Computed 150 invariants in 8 ms
Computed 150 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-13905171959588995203.kers
Total runtime 11 ms.
[2026-05-25 20:07:45] [INFO ] Implicit Places using invariants in 908 ms returned [273, 617, 916, 917, 918, 919, 920, 921, 922, 923, 924, 925, 926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 911 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1376/2325 places, 1271/2272 transitions.
Applied a total of 0 rules in 90 ms. Remains 1376 /1376 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3972 ms. Remains : 1376/2325 places, 1271/2272 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (X(p2)||p1))))'
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-08
Entered a terminal (fully accepting) state of product in 58 steps with 24 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-08 finished in 4210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G(p1))))))'
Support contains 3 out of 2325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 2259 transition count 2272
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 133 place count 2192 transition count 2165
Iterating global reduction 1 with 67 rules applied. Total rules applied 200 place count 2192 transition count 2165
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 285 place count 2107 transition count 2060
Iterating global reduction 1 with 85 rules applied. Total rules applied 370 place count 2107 transition count 2060
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 474 place count 2003 transition count 1956
Iterating global reduction 1 with 104 rules applied. Total rules applied 578 place count 2003 transition count 1956
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 22 rules applied. Total rules applied 600 place count 2002 transition count 1935
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 662 place count 1940 transition count 1853
Iterating global reduction 2 with 62 rules applied. Total rules applied 724 place count 1940 transition count 1853
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 785 place count 1879 transition count 1792
Iterating global reduction 2 with 61 rules applied. Total rules applied 846 place count 1879 transition count 1792
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 907 place count 1818 transition count 1731
Iterating global reduction 2 with 61 rules applied. Total rules applied 968 place count 1818 transition count 1731
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1029 place count 1757 transition count 1670
Iterating global reduction 2 with 61 rules applied. Total rules applied 1090 place count 1757 transition count 1670
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1151 place count 1696 transition count 1609
Iterating global reduction 2 with 61 rules applied. Total rules applied 1212 place count 1696 transition count 1609
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1273 place count 1635 transition count 1548
Iterating global reduction 2 with 61 rules applied. Total rules applied 1334 place count 1635 transition count 1548
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1395 place count 1574 transition count 1487
Iterating global reduction 2 with 61 rules applied. Total rules applied 1456 place count 1574 transition count 1487
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1497 place count 1533 transition count 1446
Iterating global reduction 2 with 41 rules applied. Total rules applied 1538 place count 1533 transition count 1446
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1579 place count 1492 transition count 1405
Iterating global reduction 2 with 41 rules applied. Total rules applied 1620 place count 1492 transition count 1405
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1661 place count 1451 transition count 1364
Iterating global reduction 2 with 41 rules applied. Total rules applied 1702 place count 1451 transition count 1364
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1742 place count 1411 transition count 1324
Iterating global reduction 2 with 40 rules applied. Total rules applied 1782 place count 1411 transition count 1324
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 1822 place count 1411 transition count 1284
Applied a total of 1822 rules in 3062 ms. Remains 1411 /2325 variables (removed 914) and now considering 1284/2272 (removed 988) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3301423437586320134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11686978219545668735.kers'
[2026-05-25 20:07:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3301423437586320134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11686978219545668735.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1284 rows 1411 cols 2969 entries
Finished phase 1 with 1154 SingleSign rule and 106 generalized
[2026-05-25 20:07:49] [INFO ] Computed 151 invariants in 9 ms
Computed 151 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-11686978219545668735.kers
Total runtime 10 ms.
[2026-05-25 20:07:50] [INFO ] Implicit Places using invariants in 844 ms returned [277, 629, 928, 929, 930, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945, 946, 947, 948]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 859 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1388/2325 places, 1284/2272 transitions.
Applied a total of 0 rules in 145 ms. Remains 1388 /1388 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4066 ms. Remains : 1388/2325 places, 1284/2272 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G(p1))))))'
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09
Product exploration explored 100000 steps with 83 reset in 681 ms.
Product exploration explored 100000 steps with 82 reset in 582 ms.
Computed a total of 1388 stabilizing places and 1284 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1388 transition count 1284
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (32 resets) in 719 ms. (55 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17797679772730540855.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6226314983245073140.kers'
[2026-05-25 20:07:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17797679772730540855.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6226314983245073140.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1284 rows 1388 cols 2843 entries
Finished phase 1 with 1175 SingleSign rule and 85 generalized
[2026-05-25 20:07:52] [INFO ] Computed 128 invariants in 13 ms
Computed 128 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-6226314983245073140.kers
Total runtime 16 ms.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 3/2672 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 36 ms.
Refiners :[Generalized P Invariants (flows): 0/128 constraints, State Equation: 0/1388 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1421 ms.
Stuttering acceptance computed with spot in 266 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1388/1388 places, 1284/1284 transitions.
Applied a total of 0 rules in 148 ms. Remains 1388 /1388 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2026-05-25 20:07:53] [INFO ] Invariant cache hit.
[2026-05-25 20:07:54] [INFO ] Implicit Places using invariants in 778 ms returned []
[2026-05-25 20:07:54] [INFO ] Invariant cache hit.
[2026-05-25 20:07:56] [INFO ] Implicit Places using invariants and state equation in 2128 ms returned []
Implicit Place search using SMT with State Equation took 2910 ms to find 0 implicit places.
Running 1263 sub problems to find dead transitions.
[2026-05-25 20:07:56] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1367 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1367/2672 variables, and 126 constraints, problems are : Problem set: 0 solved, 1263 unsolved in 30046 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/1388 constraints, PredecessorRefiner: 1263/1263 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1367 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1263 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1367/2672 variables, and 126 constraints, problems are : Problem set: 0 solved, 1263 unsolved in 30056 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/1388 constraints, PredecessorRefiner: 0/1263 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60382ms problems are : Problem set: 0 solved, 1263 unsolved
Search for dead transitions found 0 dead transitions in 60389ms
Finished structural reductions in LTL mode , in 1 iterations and 63459 ms. Remains : 1388/1388 places, 1284/1284 transitions.
Computed a total of 1388 stabilizing places and 1284 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1388 transition count 1284
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (32 resets) in 470 ms. (84 steps per ms) remains 1/2 properties
BEST_FIRST walk for 31351 steps (6 resets) in 39 ms. (783 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1307 ms.
Stuttering acceptance computed with spot in 200 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 82 reset in 351 ms.
Product exploration explored 100000 steps with 82 reset in 377 ms.
Spot run failed in 110 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin6624030804558728823
[2026-05-25 20:08:59] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6624030804558728823
Running compilation step : cd /tmp/ltsmin6624030804558728823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/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/ltsmin6624030804558728823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/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/ltsmin6624030804558728823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1388/1388 places, 1284/1284 transitions.
Applied a total of 0 rules in 101 ms. Remains 1388 /1388 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2026-05-25 20:09:02] [INFO ] Invariant cache hit.
[2026-05-25 20:09:03] [INFO ] Implicit Places using invariants in 645 ms returned []
[2026-05-25 20:09:03] [INFO ] Invariant cache hit.
[2026-05-25 20:09:04] [INFO ] Implicit Places using invariants and state equation in 1616 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2366 ms. Remains : 1388/1388 places, 1284/1284 transitions.
Built C files in :
/tmp/ltsmin5864555694575730008
[2026-05-25 20:09:05] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5864555694575730008
Running compilation step : cd /tmp/ltsmin5864555694575730008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/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/ltsmin5864555694575730008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/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/ltsmin5864555694575730008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 20:09:08] [INFO ] Flatten gal took : 51 ms
[2026-05-25 20:09:08] [INFO ] Flatten gal took : 73 ms
[2026-05-25 20:09:08] [INFO ] Time to serialize gal into /tmp/LTL7875906594801121462.gal : 24 ms
[2026-05-25 20:09:08] [INFO ] Time to serialize properties into /tmp/LTL8116452925421595090.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7875906594801121462.gal' '-t' 'CGAL' '-hoa' '/tmp/aut745744508159991415.hoa' '-atoms' '/tmp/LTL8116452925421595090.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL8116452925421595090.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut745744508159991415.hoa
Detected timeout of ITS tools.
[2026-05-25 20:09:23] [INFO ] Flatten gal took : 42 ms
[2026-05-25 20:09:23] [INFO ] Flatten gal took : 41 ms
[2026-05-25 20:09:23] [INFO ] Time to serialize gal into /tmp/LTL15391158817575365325.gal : 8 ms
[2026-05-25 20:09:23] [INFO ] Time to serialize properties into /tmp/LTL4808719704546740065.ltl : 4 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15391158817575365325.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4808719704546740065.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(m1_2_1>=1)")||(G("(((l5_7_2<1)||(ml2_7_2<1))||(m1_2_1<1))")))))))
Formula 0 simplified : XXX(!"(m1_2_1>=1)" & F!"(((l5_7_2<1)||(ml2_7_2<1))||(m1_2_1<1))")
Detected timeout of ITS tools.
[2026-05-25 20:09:38] [INFO ] Flatten gal took : 49 ms
[2026-05-25 20:09:38] [INFO ] Applying decomposition
[2026-05-25 20:09:38] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph54693357017011440.txt' '-o' '/tmp/graph54693357017011440.bin' '-w' '/tmp/graph54693357017011440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph54693357017011440.bin' '-l' '-1' '-v' '-w' '/tmp/graph54693357017011440.weights' '-q' '0' '-e' '0.001'
[2026-05-25 20:09:38] [INFO ] Decomposing Gal with order
[2026-05-25 20:09:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 20:09:39] [INFO ] Removed a total of 42 redundant transitions.
[2026-05-25 20:09:39] [INFO ] Flatten gal took : 232 ms
[2026-05-25 20:09:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2026-05-25 20:09:39] [INFO ] Time to serialize gal into /tmp/LTL9295643143362739883.gal : 37 ms
[2026-05-25 20:09:39] [INFO ] Time to serialize properties into /tmp/LTL6603462860065605568.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9295643143362739883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6603462860065605568.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(i16.i0.i0.u51.m1_2_1>=1)")||(G("(((i13.u202.l5_7_2<1)||(i13.u242.ml2_7_2<1))||(i16.i0.i0.u51.m1_2_1<1))")))))))
Formula 0 simplified : XXX(!"(i16.i0.i0.u51.m1_2_1>=1)" & F!"(((i13.u202.l5_7_2<1)||(i13.u242.ml2_7_2<1))||(i16.i0.i0.u51.m1_2_1<1))")
Detected timeout of ITS tools.
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09 finished in 128536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 2 out of 2325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Discarding 67 places :
Implicit places reduction removed 67 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 2258 transition count 2272
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 134 place count 2191 transition count 2165
Iterating global reduction 1 with 67 rules applied. Total rules applied 201 place count 2191 transition count 2165
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 286 place count 2106 transition count 2060
Iterating global reduction 1 with 85 rules applied. Total rules applied 371 place count 2106 transition count 2060
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 475 place count 2002 transition count 1956
Iterating global reduction 1 with 104 rules applied. Total rules applied 579 place count 2002 transition count 1956
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 22 rules applied. Total rules applied 601 place count 2001 transition count 1935
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 662 place count 1940 transition count 1854
Iterating global reduction 2 with 61 rules applied. Total rules applied 723 place count 1940 transition count 1854
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 784 place count 1879 transition count 1793
Iterating global reduction 2 with 61 rules applied. Total rules applied 845 place count 1879 transition count 1793
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 906 place count 1818 transition count 1732
Iterating global reduction 2 with 61 rules applied. Total rules applied 967 place count 1818 transition count 1732
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1028 place count 1757 transition count 1671
Iterating global reduction 2 with 61 rules applied. Total rules applied 1089 place count 1757 transition count 1671
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 1149 place count 1697 transition count 1611
Iterating global reduction 2 with 60 rules applied. Total rules applied 1209 place count 1697 transition count 1611
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 1269 place count 1637 transition count 1551
Iterating global reduction 2 with 60 rules applied. Total rules applied 1329 place count 1637 transition count 1551
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 1389 place count 1577 transition count 1491
Iterating global reduction 2 with 60 rules applied. Total rules applied 1449 place count 1577 transition count 1491
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1489 place count 1537 transition count 1451
Iterating global reduction 2 with 40 rules applied. Total rules applied 1529 place count 1537 transition count 1451
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1569 place count 1497 transition count 1411
Iterating global reduction 2 with 40 rules applied. Total rules applied 1609 place count 1497 transition count 1411
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1649 place count 1457 transition count 1371
Iterating global reduction 2 with 40 rules applied. Total rules applied 1689 place count 1457 transition count 1371
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1729 place count 1417 transition count 1331
Iterating global reduction 2 with 40 rules applied. Total rules applied 1769 place count 1417 transition count 1331
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 1809 place count 1417 transition count 1291
Applied a total of 1809 rules in 2486 ms. Remains 1417 /2325 variables (removed 908) and now considering 1291/2272 (removed 981) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12062613606128943564.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15464154774523118288.kers'
[2026-05-25 20:09:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12062613606128943564.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15464154774523118288.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1291 rows 1417 cols 2981 entries
Finished phase 1 with 1162 SingleSign rule and 105 generalized
[2026-05-25 20:09:57] [INFO ] Computed 150 invariants in 9 ms
Computed 150 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-15464154774523118288.kers
Total runtime 10 ms.
[2026-05-25 20:09:58] [INFO ] Implicit Places using invariants in 972 ms returned [279, 635, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945, 946, 947, 948, 949, 950, 951, 952, 953, 954]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 974 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1394/2325 places, 1291/2272 transitions.
Applied a total of 0 rules in 138 ms. Remains 1394 /1394 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3599 ms. Remains : 1394/2325 places, 1291/2272 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11 finished in 3818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&((p1&&F(!p2)) U X(p2))))'
Support contains 5 out of 2325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 2259 transition count 2272
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 132 place count 2193 transition count 2166
Iterating global reduction 1 with 66 rules applied. Total rules applied 198 place count 2193 transition count 2166
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 283 place count 2108 transition count 2061
Iterating global reduction 1 with 85 rules applied. Total rules applied 368 place count 2108 transition count 2061
Discarding 102 places :
Symmetric choice reduction at 1 with 102 rule applications. Total rules 470 place count 2006 transition count 1959
Iterating global reduction 1 with 102 rules applied. Total rules applied 572 place count 2006 transition count 1959
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 592 place count 2006 transition count 1939
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 654 place count 1944 transition count 1857
Iterating global reduction 2 with 62 rules applied. Total rules applied 716 place count 1944 transition count 1857
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 778 place count 1882 transition count 1795
Iterating global reduction 2 with 62 rules applied. Total rules applied 840 place count 1882 transition count 1795
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 902 place count 1820 transition count 1733
Iterating global reduction 2 with 62 rules applied. Total rules applied 964 place count 1820 transition count 1733
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1026 place count 1758 transition count 1671
Iterating global reduction 2 with 62 rules applied. Total rules applied 1088 place count 1758 transition count 1671
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1150 place count 1696 transition count 1609
Iterating global reduction 2 with 62 rules applied. Total rules applied 1212 place count 1696 transition count 1609
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1273 place count 1635 transition count 1548
Iterating global reduction 2 with 61 rules applied. Total rules applied 1334 place count 1635 transition count 1548
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1395 place count 1574 transition count 1487
Iterating global reduction 2 with 61 rules applied. Total rules applied 1456 place count 1574 transition count 1487
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1497 place count 1533 transition count 1446
Iterating global reduction 2 with 41 rules applied. Total rules applied 1538 place count 1533 transition count 1446
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1579 place count 1492 transition count 1405
Iterating global reduction 2 with 41 rules applied. Total rules applied 1620 place count 1492 transition count 1405
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1661 place count 1451 transition count 1364
Iterating global reduction 2 with 41 rules applied. Total rules applied 1702 place count 1451 transition count 1364
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1743 place count 1410 transition count 1323
Iterating global reduction 2 with 41 rules applied. Total rules applied 1784 place count 1410 transition count 1323
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 1825 place count 1410 transition count 1282
Applied a total of 1825 rules in 2560 ms. Remains 1410 /2325 variables (removed 915) and now considering 1282/2272 (removed 990) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8416410568081651212.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11996023510212918736.kers'
[2026-05-25 20:10:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8416410568081651212.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11996023510212918736.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1282 rows 1410 cols 2970 entries
Finished phase 1 with 1151 SingleSign rule and 107 generalized
[2026-05-25 20:10:01] [INFO ] Computed 152 invariants in 14 ms
Computed 152 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-11996023510212918736.kers
Total runtime 17 ms.
[2026-05-25 20:10:01] [INFO ] Implicit Places using invariants in 838 ms returned [279, 627, 926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945, 946]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 839 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1387/2325 places, 1282/2272 transitions.
Applied a total of 0 rules in 87 ms. Remains 1387 /1387 variables (removed 0) and now considering 1282/1282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3488 ms. Remains : 1387/2325 places, 1282/2272 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&((p1&&F(!p2)) U X(p2))))'
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p2), true, (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12
Entered a terminal (fully accepting) state of product in 7 steps with 2 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12 finished in 3722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 2259 transition count 2272
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 133 place count 2192 transition count 2165
Iterating global reduction 1 with 67 rules applied. Total rules applied 200 place count 2192 transition count 2165
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 285 place count 2107 transition count 2060
Iterating global reduction 1 with 85 rules applied. Total rules applied 370 place count 2107 transition count 2060
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 474 place count 2003 transition count 1956
Iterating global reduction 1 with 104 rules applied. Total rules applied 578 place count 2003 transition count 1956
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 22 rules applied. Total rules applied 600 place count 2002 transition count 1935
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 662 place count 1940 transition count 1853
Iterating global reduction 2 with 62 rules applied. Total rules applied 724 place count 1940 transition count 1853
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 786 place count 1878 transition count 1791
Iterating global reduction 2 with 62 rules applied. Total rules applied 848 place count 1878 transition count 1791
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 910 place count 1816 transition count 1729
Iterating global reduction 2 with 62 rules applied. Total rules applied 972 place count 1816 transition count 1729
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1033 place count 1755 transition count 1668
Iterating global reduction 2 with 61 rules applied. Total rules applied 1094 place count 1755 transition count 1668
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1155 place count 1694 transition count 1607
Iterating global reduction 2 with 61 rules applied. Total rules applied 1216 place count 1694 transition count 1607
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1277 place count 1633 transition count 1546
Iterating global reduction 2 with 61 rules applied. Total rules applied 1338 place count 1633 transition count 1546
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1399 place count 1572 transition count 1485
Iterating global reduction 2 with 61 rules applied. Total rules applied 1460 place count 1572 transition count 1485
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1501 place count 1531 transition count 1444
Iterating global reduction 2 with 41 rules applied. Total rules applied 1542 place count 1531 transition count 1444
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1583 place count 1490 transition count 1403
Iterating global reduction 2 with 41 rules applied. Total rules applied 1624 place count 1490 transition count 1403
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1665 place count 1449 transition count 1362
Iterating global reduction 2 with 41 rules applied. Total rules applied 1706 place count 1449 transition count 1362
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1747 place count 1408 transition count 1321
Iterating global reduction 2 with 41 rules applied. Total rules applied 1788 place count 1408 transition count 1321
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 1829 place count 1408 transition count 1280
Applied a total of 1829 rules in 2173 ms. Remains 1408 /2325 variables (removed 917) and now considering 1280/2272 (removed 992) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3084061327132246703.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12191183331781090652.kers'
[2026-05-25 20:10:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3084061327132246703.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12191183331781090652.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1280 rows 1408 cols 2961 entries
Finished phase 1 with 1151 SingleSign rule and 106 generalized
[2026-05-25 20:10:04] [INFO ] Computed 151 invariants in 14 ms
Computed 151 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-12191183331781090652.kers
Total runtime 17 ms.
[2026-05-25 20:10:05] [INFO ] Implicit Places using invariants in 861 ms returned [276, 626, 925, 926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 872 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1385/2325 places, 1280/2272 transitions.
Applied a total of 0 rules in 158 ms. Remains 1385 /1385 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3203 ms. Remains : 1385/2325 places, 1280/2272 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13
Stuttering criterion allowed to conclude after 1671 steps with 2 reset in 9 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13 finished in 3348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0 U p1)) U (X(p3)&&p2)))'
Support contains 5 out of 2325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 2259 transition count 2272
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 133 place count 2192 transition count 2165
Iterating global reduction 1 with 67 rules applied. Total rules applied 200 place count 2192 transition count 2165
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 285 place count 2107 transition count 2060
Iterating global reduction 1 with 85 rules applied. Total rules applied 370 place count 2107 transition count 2060
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 474 place count 2003 transition count 1956
Iterating global reduction 1 with 104 rules applied. Total rules applied 578 place count 2003 transition count 1956
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 22 rules applied. Total rules applied 600 place count 2002 transition count 1935
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 661 place count 1941 transition count 1854
Iterating global reduction 2 with 61 rules applied. Total rules applied 722 place count 1941 transition count 1854
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 783 place count 1880 transition count 1793
Iterating global reduction 2 with 61 rules applied. Total rules applied 844 place count 1880 transition count 1793
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 905 place count 1819 transition count 1732
Iterating global reduction 2 with 61 rules applied. Total rules applied 966 place count 1819 transition count 1732
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1027 place count 1758 transition count 1671
Iterating global reduction 2 with 61 rules applied. Total rules applied 1088 place count 1758 transition count 1671
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 1149 place count 1697 transition count 1610
Iterating global reduction 2 with 61 rules applied. Total rules applied 1210 place count 1697 transition count 1610
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 1270 place count 1637 transition count 1550
Iterating global reduction 2 with 60 rules applied. Total rules applied 1330 place count 1637 transition count 1550
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 1390 place count 1577 transition count 1490
Iterating global reduction 2 with 60 rules applied. Total rules applied 1450 place count 1577 transition count 1490
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1490 place count 1537 transition count 1450
Iterating global reduction 2 with 40 rules applied. Total rules applied 1530 place count 1537 transition count 1450
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 1568 place count 1499 transition count 1412
Iterating global reduction 2 with 38 rules applied. Total rules applied 1606 place count 1499 transition count 1412
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 1644 place count 1461 transition count 1374
Iterating global reduction 2 with 38 rules applied. Total rules applied 1682 place count 1461 transition count 1374
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 1720 place count 1423 transition count 1336
Iterating global reduction 2 with 38 rules applied. Total rules applied 1758 place count 1423 transition count 1336
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1796 place count 1423 transition count 1298
Applied a total of 1796 rules in 2615 ms. Remains 1423 /2325 variables (removed 902) and now considering 1298/2272 (removed 974) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6921128237228048902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8162678707913212831.kers'
[2026-05-25 20:10:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6921128237228048902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8162678707913212831.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1298 rows 1423 cols 2997 entries
Finished phase 1 with 1166 SingleSign rule and 106 generalized
[2026-05-25 20:10:08] [INFO ] Computed 151 invariants in 9 ms
Computed 151 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-8162678707913212831.kers
Total runtime 10 ms.
[2026-05-25 20:10:08] [INFO ] Implicit Places using invariants in 723 ms returned [285, 641, 940, 941, 942, 943, 944, 945, 946, 947, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 724 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1400/2325 places, 1298/2272 transitions.
Applied a total of 0 rules in 91 ms. Remains 1400 /1400 variables (removed 0) and now considering 1298/1298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3430 ms. Remains : 1400/2325 places, 1298/2272 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0 U p1)) U (X(p3)&&p2)))'
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (NOT p3), true]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-14 finished in 3604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 2325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2325/2325 places, 2272/2272 transitions.
Graph (complete) has 2910 edges and 2325 vertex of which 1394 are kept as prefixes of interest. Removing 931 places using SCC suffix rule.3 ms
Discarding 931 places :
Also discarding 864 output transitions
Drop transitions (Output transitions of discarded places.) removed 864 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 67 places :
Implicit places reduction removed 67 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1090 transitions
Trivial Post-agglo rules discarded 1090 transitions
Performed 1090 trivial Post agglomeration. Transition count delta: 1090
Iterating post reduction 0 with 1157 rules applied. Total rules applied 1158 place count 1306 transition count 297
Reduce places removed 1090 places and 0 transitions.
Iterating post reduction 1 with 1090 rules applied. Total rules applied 2248 place count 216 transition count 297
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 2248 place count 216 transition count 192
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 231 rules applied. Total rules applied 2479 place count 90 transition count 192
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2501 place count 68 transition count 130
Iterating global reduction 2 with 22 rules applied. Total rules applied 2523 place count 68 transition count 130
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 2565 place count 68 transition count 88
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 2585 place count 48 transition count 48
Iterating global reduction 3 with 20 rules applied. Total rules applied 2605 place count 48 transition count 48
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 2624 place count 29 transition count 29
Iterating global reduction 3 with 19 rules applied. Total rules applied 2643 place count 29 transition count 29
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 2662 place count 10 transition count 10
Iterating global reduction 3 with 19 rules applied. Total rules applied 2681 place count 10 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2683 place count 9 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2685 place count 7 transition count 8
Applied a total of 2685 rules in 29 ms. Remains 7 /2325 variables (removed 2318) and now considering 8/2272 (removed 2264) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16593255643251261758.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2423309770894704866.kers'
[2026-05-25 20:10:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16593255643251261758.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2423309770894704866.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 16 entries
Finished phase 1 with 5 SingleSign rule and 1 generalized
[2026-05-25 20:10:09] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2423309770894704866.kers
Total runtime 0 ms.
[2026-05-25 20:10:09] [INFO ] Implicit Places using invariants in 22 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/2325 places, 8/2272 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /6 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53 ms. Remains : 5/2325 places, 7/2272 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-15
Product exploration explored 100000 steps with 14228 reset in 95 ms.
Product exploration explored 100000 steps with 14212 reset in 145 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
RANDOM walk for 170 steps (4 resets) in 5 ms. (28 steps per ms) remains 0/4 properties
Knowledge based reduction with 4 factoid took 271 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1920661010229376287.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4292942724890936774.kers'
[2026-05-25 20:10:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1920661010229376287.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4292942724890936774.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 5 cols 11 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-25 20:10:10] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4292942724890936774.kers
Total runtime 0 ms.
[2026-05-25 20:10:10] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 20:10:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 20:10:10] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 20:10:10] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 20:10:10] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 640 ms.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2026-05-25 20:10:10] [INFO ] Invariant cache hit.
[2026-05-25 20:10:10] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-25 20:10:10] [INFO ] Invariant cache hit.
[2026-05-25 20:10:10] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-25 20:10:10] [INFO ] Redundant transitions in 1 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-25 20:10:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 71 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 72 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 145ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 5/5 places, 7/7 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
RANDOM walk for 222 steps (2 resets) in 4 ms. (44 steps per ms) remains 0/4 properties
Knowledge based reduction with 4 factoid took 296 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
[2026-05-25 20:10:10] [INFO ] Invariant cache hit.
[2026-05-25 20:10:10] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2026-05-25 20:10:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 20:10:11] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 20:10:11] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 20:10:11] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 627 ms.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14141 reset in 131 ms.
Product exploration explored 100000 steps with 14253 reset in 157 ms.
Built C files in :
/tmp/ltsmin1350935759728028882
[2026-05-25 20:10:11] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2026-05-25 20:10:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 20:10:11] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2026-05-25 20:10:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 20:10:11] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2026-05-25 20:10:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 20:10:11] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1350935759728028882
Running compilation step : cd /tmp/ltsmin1350935759728028882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 112 ms.
Running link step : cd /tmp/ltsmin1350935759728028882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 127 ms.
Running LTSmin : cd /tmp/ltsmin1350935759728028882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14325153456366923925.hoa' '--buchi-type=spotba'
LTSmin run took 71 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-15 finished in 2600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G(p1))))))'
Spot run failed in 56 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 20:10:11] [INFO ] Flatten gal took : 77 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11871792123539671610
[2026-05-25 20:10:11] [INFO ] Too many transitions (2272) to apply POR reductions. Disabling POR matrices.
[2026-05-25 20:10:11] [INFO ] Applying decomposition
[2026-05-25 20:10:12] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11871792123539671610
Running compilation step : cd /tmp/ltsmin11871792123539671610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 20:10:12] [INFO ] Flatten gal took : 80 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17077326837586409528.txt' '-o' '/tmp/graph17077326837586409528.bin' '-w' '/tmp/graph17077326837586409528.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17077326837586409528.bin' '-l' '-1' '-v' '-w' '/tmp/graph17077326837586409528.weights' '-q' '0' '-e' '0.001'
[2026-05-25 20:10:12] [INFO ] Decomposing Gal with order
[2026-05-25 20:10:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 20:10:13] [INFO ] Removed a total of 421 redundant transitions.
[2026-05-25 20:10:13] [INFO ] Flatten gal took : 129 ms
[2026-05-25 20:10:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 25 ms.
[2026-05-25 20:10:13] [INFO ] Time to serialize gal into /tmp/LTLFireability14233739684571945314.gal : 25 ms
[2026-05-25 20:10:13] [INFO ] Time to serialize properties into /tmp/LTLFireability11675759327211081643.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14233739684571945314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11675759327211081643.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(i31.u45.m1_2_1>=1)")||(G("(((i24.u415.l5_7_2<1)||(i24.u354.ml2_7_2<1))||(i31.u45.m1_2_1<1))")))))))
Formula 0 simplified : XXX(!"(i31.u45.m1_2_1>=1)" & F!"(((i24.u415.l5_7_2<1)||(i24.u354.ml2_7_2<1))||(i31.u45.m1_2_1<1))")
Compilation finished in 8627 ms.
Running link step : cd /tmp/ltsmin11871792123539671610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin11871792123539671610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(((LTLAPp0==true)||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 20:32:03] [INFO ] Flatten gal took : 741 ms
[2026-05-25 20:32:03] [INFO ] Time to serialize gal into /tmp/LTLFireability16766181078179262008.gal : 99 ms
[2026-05-25 20:32:03] [INFO ] Time to serialize properties into /tmp/LTLFireability11983316781236998747.ltl : 25 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16766181078179262008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11983316781236998747.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(m1_2_1>=1)")||(G("(((l5_7_2<1)||(ml2_7_2<1))||(m1_2_1<1))")))))))
Formula 0 simplified : XXX(!"(m1_2_1>=1)" & F!"(((l5_7_2<1)||(ml2_7_2<1))||(m1_2_1<1))")
Detected timeout of ITS tools.
[2026-05-25 20:53:54] [INFO ] Flatten gal took : 1202 ms
[2026-05-25 20:54:00] [INFO ] Input system was already deterministic with 2272 transitions.
[2026-05-25 20:54:01] [INFO ] Transformed 2325 places.
[2026-05-25 20:54:01] [INFO ] Transformed 2272 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 20:54:02] [INFO ] Time to serialize gal into /tmp/LTLFireability10180030984840754933.gal : 44 ms
[2026-05-25 20:54:02] [INFO ] Time to serialize properties into /tmp/LTLFireability14111375270915717022.ltl : 7 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10180030984840754933.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14111375270915717022.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X(("(m1_2_1>=1)")||(G("(((l5_7_2<1)||(ml2_7_2<1))||(m1_2_1<1))")))))))
Formula 0 simplified : XXX(!"(m1_2_1>=1)" & F!"(((l5_7_2<1)||(ml2_7_2<1))||(m1_2_1<1))")

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="FamilyReunion-PT-L00020M0002C001P001G001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955808900108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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