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.r194-tall-177969914000284.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 NoC3x3-PT-2B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 956K
-rw-r--r-- 1 mcc users 7.7K Mar 8 06:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 8 06:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 8 06:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 8 06:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 16 08:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 8 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 8 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 8 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 8 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 548K 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 NoC3x3-PT-2B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-2B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779745487751

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 21:44:48] [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 21:44:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 21:44:49] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2026-05-25 21:44:49] [INFO ] Transformed 2003 places.
[2026-05-25 21:44:49] [INFO ] Transformed 2292 transitions.
[2026-05-25 21:44:49] [INFO ] Found NUPN structural information;
[2026-05-25 21:44:49] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA NoC3x3-PT-2B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1994 transition count 2292
Discarding 500 places :
Symmetric choice reduction at 1 with 500 rule applications. Total rules 509 place count 1494 transition count 1792
Iterating global reduction 1 with 500 rules applied. Total rules applied 1009 place count 1494 transition count 1792
Discarding 172 places :
Symmetric choice reduction at 1 with 172 rule applications. Total rules 1181 place count 1322 transition count 1620
Iterating global reduction 1 with 172 rules applied. Total rules applied 1353 place count 1322 transition count 1620
Discarding 172 places :
Symmetric choice reduction at 1 with 172 rule applications. Total rules 1525 place count 1150 transition count 1438
Iterating global reduction 1 with 172 rules applied. Total rules applied 1697 place count 1150 transition count 1438
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 1738 place count 1109 transition count 1362
Iterating global reduction 1 with 41 rules applied. Total rules applied 1779 place count 1109 transition count 1362
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 1790 place count 1108 transition count 1352
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 1820 place count 1078 transition count 1322
Iterating global reduction 2 with 30 rules applied. Total rules applied 1850 place count 1078 transition count 1322
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 1852 place count 1076 transition count 1322
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1870 place count 1058 transition count 1286
Iterating global reduction 3 with 18 rules applied. Total rules applied 1888 place count 1058 transition count 1286
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1906 place count 1040 transition count 1268
Iterating global reduction 3 with 18 rules applied. Total rules applied 1924 place count 1040 transition count 1268
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 1927 place count 1037 transition count 1268
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1945 place count 1019 transition count 1250
Iterating global reduction 4 with 18 rules applied. Total rules applied 1963 place count 1019 transition count 1250
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1981 place count 1019 transition count 1232
Applied a total of 1981 rules in 705 ms. Remains 1019 /2003 variables (removed 984) and now considering 1232/2292 (removed 1060) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6996329878794839250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15630088204457778504.kers'
[2026-05-25 21:44:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6996329878794839250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15630088204457778504.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1232 rows 1019 cols 3265 entries
Finished phase 1 with 965 SingleSign rule and 0 generalized
[2026-05-25 21:44:50] [INFO ] Computed 54 invariants in 7 ms
Computed 54 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-15630088204457778504.kers
Total runtime 9 ms.
[2026-05-25 21:44:50] [INFO ] Implicit Places using invariants in 634 ms returned []
[2026-05-25 21:44:50] [INFO ] Invariant cache hit.
[2026-05-25 21:44:51] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned [72, 80, 133, 136, 141, 150, 153, 256, 257, 309, 310, 321, 324, 328, 422, 423, 424, 429, 430, 431, 439, 445, 454, 457, 460, 640, 641, 645, 646, 647, 651, 652, 653, 764, 772, 822, 823, 824, 828, 839, 842, 960, 961, 965, 966]
Discarding 45 places :
Implicit Place search using SMT with State Equation took 1686 ms to find 45 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 974/2003 places, 1232/2292 transitions.
Applied a total of 0 rules in 28 ms. Remains 974 /974 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2434 ms. Remains : 974/2003 places, 1232/2292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1232/1232 transitions.
Applied a total of 0 rules in 25 ms. Remains 974 /974 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8636100149917131667.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14874024366563830277.kers'
[2026-05-25 21:44:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8636100149917131667.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14874024366563830277.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1232 rows 974 cols 3087 entries
Finished phase 1 with 932 SingleSign rule and 0 generalized
[2026-05-25 21:44:51] [INFO ] Computed 42 invariants in 5 ms
Computed 42 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14874024366563830277.kers
Total runtime 7 ms.
[2026-05-25 21:44:52] [INFO ] Implicit Places using invariants in 292 ms returned []
[2026-05-25 21:44:52] [INFO ] Invariant cache hit.
[2026-05-25 21:44:53] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
Running 1231 sub problems to find dead transitions.
[2026-05-25 21:44:53] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 973/2206 variables, and 0 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/42 constraints, State Equation: 0/974 constraints, PredecessorRefiner: 1231/1231 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1231 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 973/2206 variables, and 0 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/42 constraints, State Equation: 0/974 constraints, PredecessorRefiner: 0/1231 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60353ms problems are : Problem set: 0 solved, 1231 unsolved
Search for dead transitions found 0 dead transitions in 60369ms
Finished structural reductions in LTL mode , in 1 iterations and 61595 ms. Remains : 974/974 places, 1232/1232 transitions.
Support contains 43 out of 974 places after structural reductions.
[2026-05-25 21:45:53] [INFO ] Flatten gal took : 100 ms
[2026-05-25 21:45:53] [INFO ] Flatten gal took : 53 ms
[2026-05-25 21:45:53] [INFO ] Input system was already deterministic with 1232 transitions.
Support contains 41 out of 974 places (down from 43) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 30
RANDOM walk for 40000 steps (61 resets) in 1654 ms. (24 steps per ms) remains 5/30 properties
BEST_FIRST walk for 40004 steps (9 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/5 properties
[2026-05-25 21:45:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 738/747 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/747 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 83/830 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/830 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1177/2007 variables, 830/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2007 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 199/2206 variables, 144/1016 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2206 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/2206 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2206/2206 variables, and 1016 constraints, problems are : Problem set: 0 solved, 4 unsolved in 992 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 974/974 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 738/747 variables, 37/37 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/747 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 83/830 variables, 5/42 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/830 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1177/2007 variables, 830/872 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2007 variables, 1/873 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2007 variables, 0/873 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 199/2206 variables, 144/1017 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2206 variables, 2/1019 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2206 variables, 0/1019 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2206 variables, 0/1019 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2206/2206 variables, and 1019 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1541 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 974/974 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2554ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 232 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=116 )
Parikh walk visited 3 properties in 134 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA NoC3x3-PT-2B-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 66 stabilizing places and 66 stable 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(F((p0 U (G(p0)||(G(!p2)&&p1)))))))'
Support contains 3 out of 974 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1232/1232 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 953 transition count 1206
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 953 transition count 1206
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 54 place count 941 transition count 1191
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 941 transition count 1191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 68 place count 941 transition count 1189
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 79 place count 930 transition count 1175
Iterating global reduction 1 with 11 rules applied. Total rules applied 90 place count 930 transition count 1175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 929 transition count 1172
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 923 transition count 1160
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 923 transition count 1160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 923 transition count 1158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 920 transition count 1155
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 920 transition count 1155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 920 transition count 1154
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 918 transition count 1151
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 918 transition count 1151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 918 transition count 1150
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 121 place count 917 transition count 1149
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 917 transition count 1149
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 916 transition count 1148
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 916 transition count 1148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 125 place count 916 transition count 1147
Applied a total of 125 rules in 188 ms. Remains 916 /974 variables (removed 58) and now considering 1147/1232 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6792669103300662751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9264298750118599500.kers'
[2026-05-25 21:45:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6792669103300662751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9264298750118599500.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1147 rows 916 cols 2872 entries
Finished phase 1 with 874 SingleSign rule and 0 generalized
[2026-05-25 21:45:58] [INFO ] Computed 42 invariants in 10 ms
Computed 42 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-9264298750118599500.kers
Total runtime 12 ms.
[2026-05-25 21:45:58] [INFO ] Implicit Places using invariants in 295 ms returned []
[2026-05-25 21:45:58] [INFO ] Invariant cache hit.
[2026-05-25 21:45:59] [INFO ] Implicit Places using invariants and state equation in 740 ms returned [136, 239, 398, 411]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1041 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 912/974 places, 1147/1232 transitions.
Applied a total of 0 rules in 19 ms. Remains 912 /912 variables (removed 0) and now considering 1147/1147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1251 ms. Remains : 912/974 places, 1147/1232 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(F((p0 U (G(p0)||(G(!p2)&&p1)))))))'
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Running random walk in product with property : NoC3x3-PT-2B-LTLFireability-00
Stuttering criterion allowed to conclude after 617 steps with 0 reset in 12 ms.
FORMULA NoC3x3-PT-2B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLFireability-00 finished in 1626 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(p0)))'
Support contains 3 out of 974 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 974/974 places, 1232/1232 transitions.
Graph (trivial) has 781 edges and 974 vertex of which 64 / 974 are part of one of the 8 SCC in 7 ms
Free SCC test removed 56 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 917 transition count 1061
Reduce places removed 114 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 803 transition count 1060
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 231 place count 802 transition count 1060
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 231 place count 802 transition count 981
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 389 place count 723 transition count 981
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 429 place count 683 transition count 900
Iterating global reduction 3 with 40 rules applied. Total rules applied 469 place count 683 transition count 900
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 470 place count 683 transition count 899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 471 place count 682 transition count 899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 471 place count 682 transition count 898
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 473 place count 681 transition count 898
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 482 place count 672 transition count 886
Iterating global reduction 5 with 9 rules applied. Total rules applied 491 place count 672 transition count 886
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 495 place count 672 transition count 882
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 499 place count 668 transition count 876
Iterating global reduction 6 with 4 rules applied. Total rules applied 503 place count 668 transition count 876
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 6 with 4 rules applied. Total rules applied 507 place count 667 transition count 873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 508 place count 666 transition count 873
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 510 place count 664 transition count 870
Iterating global reduction 8 with 2 rules applied. Total rules applied 512 place count 664 transition count 870
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 514 place count 664 transition count 868
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 0 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 9 with 694 rules applied. Total rules applied 1208 place count 317 transition count 521
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 1221 place count 304 transition count 497
Iterating global reduction 9 with 13 rules applied. Total rules applied 1234 place count 304 transition count 497
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1239 place count 299 transition count 487
Iterating global reduction 9 with 5 rules applied. Total rules applied 1244 place count 299 transition count 487
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1247 place count 299 transition count 484
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1249 place count 297 transition count 480
Iterating global reduction 10 with 2 rules applied. Total rules applied 1251 place count 297 transition count 480
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1277 place count 284 transition count 479
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1278 place count 284 transition count 479
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1279 place count 283 transition count 478
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1288 place count 274 transition count 478
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 11 with 48 rules applied. Total rules applied 1336 place count 250 transition count 454
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 1356 place count 250 transition count 434
Applied a total of 1356 rules in 294 ms. Remains 250 /974 variables (removed 724) and now considering 434/1232 (removed 798) transitions.
[2026-05-25 21:45:59] [INFO ] Flow matrix only has 427 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-146791443075376534.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10105361372481334637.kers'
[2026-05-25 21:45:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-146791443075376534.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10105361372481334637.kers]
Normalized transition count is 426 out of 427 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 426 rows 248 cols 1422 entries
Finished phase 1 with 217 SingleSign rule and 0 generalized
[2026-05-25 21:45:59] [INFO ] Computed 33 invariants in 4 ms
Computed 33 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10105361372481334637.kers
Total runtime 4 ms.
[2026-05-25 21:45:59] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-25 21:45:59] [INFO ] Flow matrix only has 427 transitions (discarded 7 similar events)
[2026-05-25 21:45:59] [INFO ] Invariant cache hit.
[2026-05-25 21:45:59] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-25 21:46:00] [INFO ] Implicit Places using invariants and state equation in 253 ms returned [23, 104, 110]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 382 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/974 places, 434/1232 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 244 transition count 431
Applied a total of 6 rules in 21 ms. Remains 244 /247 variables (removed 3) and now considering 431/434 (removed 3) transitions.
[2026-05-25 21:46:00] [INFO ] Flow matrix only has 424 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13216335919601803466.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9239771306697925646.kers'
[2026-05-25 21:46:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13216335919601803466.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9239771306697925646.kers]
Normalized transition count is 423 out of 424 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 423 rows 242 cols 1402 entries
Finished phase 1 with 211 SingleSign rule and 0 generalized
[2026-05-25 21:46:00] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9239771306697925646.kers
Total runtime 2 ms.
[2026-05-25 21:46:00] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 21:46:00] [INFO ] Flow matrix only has 424 transitions (discarded 7 similar events)
[2026-05-25 21:46:00] [INFO ] Invariant cache hit.
[2026-05-25 21:46:00] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-25 21:46:00] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 244/974 places, 431/1232 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1079 ms. Remains : 244/974 places, 431/1232 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(p0)))'
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-2B-LTLFireability-02
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-2B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLFireability-02 finished in 1158 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(((p1 U (p2||G(p1)))||p0))))'
Support contains 3 out of 974 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 974/974 places, 1232/1232 transitions.
Graph (trivial) has 780 edges and 974 vertex of which 72 / 974 are part of one of the 9 SCC in 2 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 910 transition count 1058
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 221 place count 800 transition count 1058
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 221 place count 800 transition count 980
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 377 place count 722 transition count 980
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 415 place count 684 transition count 902
Iterating global reduction 2 with 38 rules applied. Total rules applied 453 place count 684 transition count 902
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 2 with 1 rules applied. Total rules applied 454 place count 684 transition count 901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 455 place count 683 transition count 901
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 455 place count 683 transition count 900
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 457 place count 682 transition count 900
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 464 place count 675 transition count 891
Iterating global reduction 4 with 7 rules applied. Total rules applied 471 place count 675 transition count 891
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 475 place count 675 transition count 887
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 478 place count 672 transition count 883
Iterating global reduction 5 with 3 rules applied. Total rules applied 481 place count 672 transition count 883
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 5 with 4 rules applied. Total rules applied 485 place count 671 transition count 880
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 486 place count 670 transition count 880
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 487 place count 669 transition count 878
Iterating global reduction 7 with 1 rules applied. Total rules applied 488 place count 669 transition count 878
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 489 place count 669 transition count 877
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 0 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 8 with 694 rules applied. Total rules applied 1183 place count 322 transition count 530
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1195 place count 310 transition count 508
Iterating global reduction 8 with 12 rules applied. Total rules applied 1207 place count 310 transition count 508
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1212 place count 305 transition count 498
Iterating global reduction 8 with 5 rules applied. Total rules applied 1217 place count 305 transition count 498
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1220 place count 305 transition count 495
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1222 place count 303 transition count 491
Iterating global reduction 9 with 2 rules applied. Total rules applied 1224 place count 303 transition count 491
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 28 rules applied. Total rules applied 1252 place count 289 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1253 place count 288 transition count 492
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1262 place count 279 transition count 492
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 48 rules applied. Total rules applied 1310 place count 255 transition count 468
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 1331 place count 255 transition count 447
Applied a total of 1331 rules in 197 ms. Remains 255 /974 variables (removed 719) and now considering 447/1232 (removed 785) transitions.
[2026-05-25 21:46:00] [INFO ] Flow matrix only has 437 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1398607014660581839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3985233647787604281.kers'
[2026-05-25 21:46:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1398607014660581839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3985233647787604281.kers]
Normalized transition count is 436 out of 437 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 436 rows 253 cols 1452 entries
Finished phase 1 with 222 SingleSign rule and 0 generalized
[2026-05-25 21:46:00] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3985233647787604281.kers
Total runtime 4 ms.
[2026-05-25 21:46:00] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-25 21:46:00] [INFO ] Flow matrix only has 437 transitions (discarded 10 similar events)
[2026-05-25 21:46:00] [INFO ] Invariant cache hit.
[2026-05-25 21:46:01] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-25 21:46:01] [INFO ] Implicit Places using invariants and state equation in 271 ms returned [23, 55, 102, 108]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 402 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/974 places, 447/1232 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 247 transition count 443
Applied a total of 8 rules in 10 ms. Remains 247 /251 variables (removed 4) and now considering 443/447 (removed 4) transitions.
[2026-05-25 21:46:01] [INFO ] Flow matrix only has 433 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13305204144295097079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8091216454905641517.kers'
[2026-05-25 21:46:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13305204144295097079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8091216454905641517.kers]
Normalized transition count is 432 out of 433 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 432 rows 245 cols 1426 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-25 21:46:01] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8091216454905641517.kers
Total runtime 3 ms.
[2026-05-25 21:46:01] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-25 21:46:01] [INFO ] Flow matrix only has 433 transitions (discarded 10 similar events)
[2026-05-25 21:46:01] [INFO ] Invariant cache hit.
[2026-05-25 21:46:01] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-25 21:46:01] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 247/974 places, 443/1232 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1005 ms. Remains : 247/974 places, 443/1232 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(((p1 U (p2||G(p1)))||p0))))'
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-2B-LTLFireability-03
Stuttering criterion allowed to conclude after 19890 steps with 253 reset in 122 ms.
FORMULA NoC3x3-PT-2B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLFireability-03 finished in 1248 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) U X((X(X(p2))&&p1))))'
Support contains 6 out of 974 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1232/1232 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 955 transition count 1208
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 955 transition count 1208
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 51 place count 942 transition count 1192
Iterating global reduction 0 with 13 rules applied. Total rules applied 64 place count 942 transition count 1192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 942 transition count 1190
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 930 transition count 1174
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 930 transition count 1174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 929 transition count 1171
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 101 place count 922 transition count 1158
Iterating global reduction 2 with 7 rules applied. Total rules applied 108 place count 922 transition count 1158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 922 transition count 1156
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 918 transition count 1151
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 918 transition count 1151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 918 transition count 1150
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 122 place count 915 transition count 1146
Iterating global reduction 4 with 3 rules applied. Total rules applied 125 place count 915 transition count 1146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 915 transition count 1145
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 128 place count 913 transition count 1143
Iterating global reduction 5 with 2 rules applied. Total rules applied 130 place count 913 transition count 1143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 131 place count 913 transition count 1142
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 132 place count 912 transition count 1141
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 912 transition count 1141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 134 place count 912 transition count 1140
Applied a total of 134 rules in 182 ms. Remains 912 /974 variables (removed 62) and now considering 1140/1232 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9598620610501715238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4915866405074138743.kers'
[2026-05-25 21:46:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9598620610501715238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4915866405074138743.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1140 rows 912 cols 2861 entries
Finished phase 1 with 870 SingleSign rule and 0 generalized
[2026-05-25 21:46:02] [INFO ] Computed 42 invariants in 11 ms
Computed 42 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-4915866405074138743.kers
Total runtime 13 ms.
[2026-05-25 21:46:02] [INFO ] Implicit Places using invariants in 291 ms returned []
[2026-05-25 21:46:02] [INFO ] Invariant cache hit.
[2026-05-25 21:46:03] [INFO ] Implicit Places using invariants and state equation in 822 ms returned [241, 413]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1119 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 910/974 places, 1140/1232 transitions.
Applied a total of 0 rules in 16 ms. Remains 910 /910 variables (removed 0) and now considering 1140/1140 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1317 ms. Remains : 910/974 places, 1140/1232 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) U X((X(X(p2))&&p1))))'
Stuttering acceptance computed with spot in 529 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-2B-LTLFireability-06
Stuttering criterion allowed to conclude after 657 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-2B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLFireability-06 finished in 1889 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||(X((p2&&X(F(p2))))&&p1))))'
Support contains 5 out of 974 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1232/1232 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 955 transition count 1209
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 955 transition count 1209
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 945 transition count 1197
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 945 transition count 1197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 945 transition count 1196
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 70 place count 934 transition count 1181
Iterating global reduction 1 with 11 rules applied. Total rules applied 81 place count 934 transition count 1181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 933 transition count 1178
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 927 transition count 1167
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 927 transition count 1167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 927 transition count 1165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 924 transition count 1161
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 924 transition count 1161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 924 transition count 1160
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 108 place count 922 transition count 1157
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 922 transition count 1157
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 920 transition count 1155
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 920 transition count 1155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 920 transition count 1154
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 116 place count 919 transition count 1153
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 919 transition count 1153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 118 place count 919 transition count 1152
Applied a total of 118 rules in 236 ms. Remains 919 /974 variables (removed 55) and now considering 1152/1232 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14027238047101291851.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10473920630850533677.kers'
[2026-05-25 21:46:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14027238047101291851.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10473920630850533677.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1152 rows 919 cols 2883 entries
Finished phase 1 with 877 SingleSign rule and 0 generalized
[2026-05-25 21:46:03] [INFO ] Computed 42 invariants in 13 ms
Computed 42 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-10473920630850533677.kers
Total runtime 14 ms.
[2026-05-25 21:46:04] [INFO ] Implicit Places using invariants in 314 ms returned []
[2026-05-25 21:46:04] [INFO ] Invariant cache hit.
[2026-05-25 21:46:05] [INFO ] Implicit Places using invariants and state equation in 803 ms returned [136, 239, 400, 413]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1120 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 915/974 places, 1152/1232 transitions.
Applied a total of 0 rules in 22 ms. Remains 915 /915 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1378 ms. Remains : 915/974 places, 1152/1232 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||(X((p2&&X(F(p2))))&&p1))))'
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p2)]
Running random walk in product with property : NoC3x3-PT-2B-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLFireability-08 finished in 1610 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' '!((p0 U X(G((X((!p0 U (p2||G(!p0))))&&p1)))))'
Support contains 3 out of 974 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1232/1232 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 953 transition count 1207
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 953 transition count 1207
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 942 transition count 1194
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 942 transition count 1194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 942 transition count 1193
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 76 place count 931 transition count 1178
Iterating global reduction 1 with 11 rules applied. Total rules applied 87 place count 931 transition count 1178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 91 place count 930 transition count 1175
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 97 place count 924 transition count 1164
Iterating global reduction 2 with 6 rules applied. Total rules applied 103 place count 924 transition count 1164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 924 transition count 1162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 921 transition count 1158
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 921 transition count 1158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 921 transition count 1157
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 919 transition count 1154
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 919 transition count 1154
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 917 transition count 1152
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 917 transition count 1152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 917 transition count 1151
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 122 place count 916 transition count 1150
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 916 transition count 1150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 124 place count 916 transition count 1149
Applied a total of 124 rules in 184 ms. Remains 916 /974 variables (removed 58) and now considering 1149/1232 (removed 83) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2580986875421643339.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13778998279150187116.kers'
[2026-05-25 21:46:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2580986875421643339.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13778998279150187116.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1149 rows 916 cols 2876 entries
Finished phase 1 with 874 SingleSign rule and 0 generalized
[2026-05-25 21:46:05] [INFO ] Computed 42 invariants in 9 ms
Computed 42 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-13778998279150187116.kers
Total runtime 12 ms.
[2026-05-25 21:46:05] [INFO ] Implicit Places using invariants in 301 ms returned []
[2026-05-25 21:46:05] [INFO ] Invariant cache hit.
[2026-05-25 21:46:06] [INFO ] Implicit Places using invariants and state equation in 806 ms returned [136, 239, 398, 411]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1110 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 912/974 places, 1149/1232 transitions.
Applied a total of 0 rules in 16 ms. Remains 912 /912 variables (removed 0) and now considering 1149/1149 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1310 ms. Remains : 912/974 places, 1149/1232 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' '!((p0 U X(G((X((!p0 U (p2||G(!p0))))&&p1)))))'
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2))), true, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : NoC3x3-PT-2B-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 278 ms.
Product exploration explored 100000 steps with 25017 reset in 293 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 19 factoid took 71 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 33127 steps (54 resets) in 255 ms. (129 steps per ms) remains 0/4 properties
Knowledge based reduction with 19 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2)))]
Knowledge-based reduction took 429 ms.
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2)))]
Support contains 3 out of 912 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 912/912 places, 1149/1149 transitions.
Applied a total of 0 rules in 26 ms. Remains 912 /912 variables (removed 0) and now considering 1149/1149 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11460323322711066527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2004519548126300298.kers'
[2026-05-25 21:46:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11460323322711066527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2004519548126300298.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1149 rows 912 cols 2862 entries
Finished phase 1 with 870 SingleSign rule and 0 generalized
[2026-05-25 21:46:08] [INFO ] Computed 42 invariants in 9 ms
Computed 42 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-2004519548126300298.kers
Total runtime 12 ms.
[2026-05-25 21:46:08] [INFO ] Implicit Places using invariants in 271 ms returned []
[2026-05-25 21:46:08] [INFO ] Invariant cache hit.
[2026-05-25 21:46:09] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
Running 1148 sub problems to find dead transitions.
[2026-05-25 21:46:09] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/911 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
SMT process timed out in 30225ms, After SMT, problems are : Problem set: 0 solved, 1148 unsolved
Search for dead transitions found 0 dead transitions in 30229ms
Finished structural reductions in LTL mode , in 1 iterations and 31323 ms. Remains : 912/912 places, 1149/1149 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 35293 steps (54 resets) in 215 ms. (163 steps per ms) remains 0/4 properties
Knowledge based reduction with 6 factoid took 211 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2)))]
Knowledge-based reduction took 578 ms.
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 118 ms :[true, (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2)))]
Entered a terminal (fully accepting) state of product in 820 steps with 1 reset in 3 ms.
FORMULA NoC3x3-PT-2B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLFireability-09 finished in 35244 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(F((G(p0)||(p0&&F(p1)))))||(p1&&F((G(p0)||(p0&&F(p1))))))) U p2))'
Support contains 4 out of 974 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 974/974 places, 1232/1232 transitions.
Graph (trivial) has 780 edges and 974 vertex of which 72 / 974 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 910 transition count 1057
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 223 place count 799 transition count 1057
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 223 place count 799 transition count 980
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 377 place count 722 transition count 980
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 415 place count 684 transition count 901
Iterating global reduction 2 with 38 rules applied. Total rules applied 453 place count 684 transition count 901
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 2 with 1 rules applied. Total rules applied 454 place count 684 transition count 900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 455 place count 683 transition count 900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 455 place count 683 transition count 899
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 457 place count 682 transition count 899
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 464 place count 675 transition count 890
Iterating global reduction 4 with 7 rules applied. Total rules applied 471 place count 675 transition count 890
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 475 place count 675 transition count 886
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 477 place count 673 transition count 883
Iterating global reduction 5 with 2 rules applied. Total rules applied 479 place count 673 transition count 883
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 5 with 3 rules applied. Total rules applied 482 place count 672 transition count 881
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 483 place count 671 transition count 881
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 484 place count 670 transition count 880
Iterating global reduction 7 with 1 rules applied. Total rules applied 485 place count 670 transition count 880
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 486 place count 670 transition count 879
Performed 344 Post agglomeration using F-continuation condition.Transition count delta: 344
Deduced a syphon composed of 344 places in 0 ms
Reduce places removed 344 places and 0 transitions.
Iterating global reduction 8 with 688 rules applied. Total rules applied 1174 place count 326 transition count 535
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1187 place count 313 transition count 511
Iterating global reduction 8 with 13 rules applied. Total rules applied 1200 place count 313 transition count 511
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1205 place count 308 transition count 501
Iterating global reduction 8 with 5 rules applied. Total rules applied 1210 place count 308 transition count 501
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1213 place count 308 transition count 498
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1215 place count 306 transition count 494
Iterating global reduction 9 with 2 rules applied. Total rules applied 1217 place count 306 transition count 494
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 1247 place count 291 transition count 493
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1248 place count 291 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1249 place count 290 transition count 492
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1253 place count 286 transition count 492
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1273 place count 276 transition count 482
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1282 place count 276 transition count 473
Applied a total of 1282 rules in 147 ms. Remains 276 /974 variables (removed 698) and now considering 473/1232 (removed 759) transitions.
[2026-05-25 21:46:40] [INFO ] Flow matrix only has 465 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10087049468280513041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8659150624974113570.kers'
[2026-05-25 21:46:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10087049468280513041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8659150624974113570.kers]
Normalized transition count is 464 out of 465 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 464 rows 271 cols 1577 entries
Finished phase 1 with 238 SingleSign rule and 0 generalized
[2026-05-25 21:46:40] [INFO ] Computed 38 invariants in 1 ms
Computed 38 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8659150624974113570.kers
Total runtime 2 ms.
[2026-05-25 21:46:40] [INFO ] Implicit Places using invariants in 294 ms returned [8, 32, 70, 94]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 295 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/974 places, 473/1232 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 262 transition count 463
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 27 place count 262 transition count 456
Applied a total of 27 rules in 9 ms. Remains 262 /272 variables (removed 10) and now considering 456/473 (removed 17) transitions.
[2026-05-25 21:46:40] [INFO ] Flow matrix only has 448 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8676063210246886055.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2969589199807455920.kers'
[2026-05-25 21:46:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8676063210246886055.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2969589199807455920.kers]
Normalized transition count is 447 out of 448 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 447 rows 261 cols 1523 entries
Finished phase 1 with 228 SingleSign rule and 0 generalized
[2026-05-25 21:46:41] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2969589199807455920.kers
Total runtime 2 ms.
[2026-05-25 21:46:41] [INFO ] Implicit Places using invariants in 290 ms returned []
[2026-05-25 21:46:41] [INFO ] Flow matrix only has 448 transitions (discarded 8 similar events)
[2026-05-25 21:46:41] [INFO ] Invariant cache hit.
[2026-05-25 21:46:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-25 21:46:41] [INFO ] Implicit Places using invariants and state equation in 421 ms returned [25, 60, 107, 113]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 722 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/974 places, 456/1232 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 254 transition count 452
Applied a total of 8 rules in 9 ms. Remains 254 /258 variables (removed 4) and now considering 452/456 (removed 4) transitions.
[2026-05-25 21:46:41] [INFO ] Flow matrix only has 444 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7176009033430220753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1092792595358555914.kers'
[2026-05-25 21:46:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7176009033430220753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1092792595358555914.kers]
Normalized transition count is 443 out of 444 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 443 rows 253 cols 1497 entries
Finished phase 1 with 220 SingleSign rule and 0 generalized
[2026-05-25 21:46:41] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1092792595358555914.kers
Total runtime 2 ms.
[2026-05-25 21:46:42] [INFO ] Implicit Places using invariants in 585 ms returned []
[2026-05-25 21:46:42] [INFO ] Flow matrix only has 444 transitions (discarded 8 similar events)
[2026-05-25 21:46:42] [INFO ] Invariant cache hit.
[2026-05-25 21:46:42] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-25 21:46:42] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 254/974 places, 452/1232 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2102 ms. Remains : 254/974 places, 452/1232 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(F((G(p0)||(p0&&F(p1)))))||(p1&&F((G(p0)||(p0&&F(p1))))))) U p2))'
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-2B-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLFireability-10 finished in 2305 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(((p0&&X((p0 U (!p1||G(p0)))))||(X(X(p2)) U ((!p2&&X(X(p2)))||X(X(G(p2))))))))'
Support contains 4 out of 974 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1232/1232 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 954 transition count 1207
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 954 transition count 1207
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 942 transition count 1192
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 942 transition count 1192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 942 transition count 1190
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 930 transition count 1174
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 930 transition count 1174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 929 transition count 1171
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 101 place count 922 transition count 1158
Iterating global reduction 2 with 7 rules applied. Total rules applied 108 place count 922 transition count 1158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 922 transition count 1156
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 918 transition count 1151
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 918 transition count 1151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 918 transition count 1150
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 122 place count 915 transition count 1146
Iterating global reduction 4 with 3 rules applied. Total rules applied 125 place count 915 transition count 1146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 915 transition count 1145
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 128 place count 913 transition count 1143
Iterating global reduction 5 with 2 rules applied. Total rules applied 130 place count 913 transition count 1143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 131 place count 913 transition count 1142
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 132 place count 912 transition count 1141
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 912 transition count 1141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 134 place count 912 transition count 1140
Applied a total of 134 rules in 170 ms. Remains 912 /974 variables (removed 62) and now considering 1140/1232 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5598053971133076973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5461813510613071851.kers'
[2026-05-25 21:46:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5598053971133076973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5461813510613071851.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1140 rows 912 cols 2858 entries
Finished phase 1 with 870 SingleSign rule and 0 generalized
[2026-05-25 21:46:43] [INFO ] Computed 42 invariants in 4 ms
Computed 42 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5461813510613071851.kers
Total runtime 5 ms.
[2026-05-25 21:46:43] [INFO ] Implicit Places using invariants in 313 ms returned []
[2026-05-25 21:46:43] [INFO ] Invariant cache hit.
[2026-05-25 21:46:44] [INFO ] Implicit Places using invariants and state equation in 791 ms returned [136, 239, 400]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1141 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 909/974 places, 1140/1232 transitions.
Applied a total of 0 rules in 17 ms. Remains 909 /909 variables (removed 0) and now considering 1140/1140 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1328 ms. Remains : 909/974 places, 1140/1232 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(((X(X(p0)) U ((!p0&&X(X(p0)))||X(X(G(p0)))))||(p1&&X((p1 U (!p2||G(p1))))))))'
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND p1 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0) p2), true, (AND (NOT p1) p0 p2)]
Running random walk in product with property : NoC3x3-PT-2B-LTLFireability-11
Product exploration explored 100000 steps with 33312 reset in 317 ms.
Product exploration explored 100000 steps with 33439 reset in 423 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 13 factoid took 135 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (63 resets) in 400 ms. (99 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12824342524109656595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15224460969156418944.kers'
[2026-05-25 21:46:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12824342524109656595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15224460969156418944.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1140 rows 909 cols 2848 entries
Finished phase 1 with 867 SingleSign rule and 0 generalized
[2026-05-25 21:46:46] [INFO ] Computed 42 invariants in 4 ms
Computed 42 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15224460969156418944.kers
Total runtime 6 ms.
Problem apf4 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 117/121 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 649/770 variables, 39/42 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1083/1853 variables, 770/812 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1853 variables, 0/812 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 196/2049 variables, 139/951 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2049 variables, 0/951 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/2049 variables, 0/951 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2049/2049 variables, and 951 constraints, problems are : Problem set: 2 solved, 6 unsolved in 2316 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 909/909 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 117/121 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 649/770 variables, 39/42 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1083/1853 variables, 770/812 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1853 variables, 0/812 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 196/2049 variables, 139/951 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2049 variables, 6/957 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2049 variables, 0/957 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/2049 variables, 0/957 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2049/2049 variables, and 957 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1856 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 909/909 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4202ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 2302 ms.
Support contains 4 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1140/1140 transitions.
Graph (trivial) has 719 edges and 909 vertex of which 72 / 909 are part of one of the 9 SCC in 0 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 846 transition count 971
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 749 transition count 971
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 195 place count 749 transition count 883
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 371 place count 661 transition count 883
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 393 place count 639 transition count 827
Iterating global reduction 2 with 22 rules applied. Total rules applied 415 place count 639 transition count 827
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 2 with 668 rules applied. Total rules applied 1083 place count 305 transition count 493
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1092 place count 296 transition count 477
Iterating global reduction 2 with 9 rules applied. Total rules applied 1101 place count 296 transition count 477
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1103 place count 294 transition count 473
Iterating global reduction 2 with 2 rules applied. Total rules applied 1105 place count 294 transition count 473
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1107 place count 292 transition count 469
Iterating global reduction 2 with 2 rules applied. Total rules applied 1109 place count 292 transition count 469
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1141 place count 276 transition count 500
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1165 place count 276 transition count 476
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 1196 place count 252 transition count 469
Free-agglomeration rule (complex) applied 42 times.
Iterating global reduction 3 with 42 rules applied. Total rules applied 1238 place count 252 transition count 438
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 53 rules applied. Total rules applied 1291 place count 210 transition count 427
Applied a total of 1291 rules in 95 ms. Remains 210 /909 variables (removed 699) and now considering 427/1140 (removed 713) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 210/909 places, 427/1140 transitions.
RANDOM walk for 40000 steps (538 resets) in 446 ms. (89 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (20 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (22 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
[2026-05-25 21:46:52] [INFO ] Flow matrix only has 423 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-647915974599847446.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3348909346011386861.kers'
[2026-05-25 21:46:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-647915974599847446.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3348909346011386861.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 423 rows 197 cols 2249 entries
Finished phase 1 with 168 SingleSign rule and 0 generalized
[2026-05-25 21:46:52] [INFO ] Computed 42 invariants in 2 ms
Computed 42 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3348909346011386861.kers
Total runtime 3 ms.
[2026-05-25 21:46:52] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 131/150 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 333/483 variables, 150/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 24/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 150/633 variables, 60/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/633 variables, 114/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/633 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/633 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 633/633 variables, and 390 constraints, problems are : Problem set: 0 solved, 2 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 210/210 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 131/150 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 333/483 variables, 150/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 24/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 150/633 variables, 60/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/633 variables, 114/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/633 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/633 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/633 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 633/633 variables, and 392 constraints, problems are : Problem set: 0 solved, 2 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 210/210 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 653ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 20 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 2 ms.
Found 2 invariant AP formulas.
Knowledge based reduction with 15 factoid took 211 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p2 (NOT p0)), (AND p1 (NOT p0)), (NOT p0), true]
Knowledge-based reduction took 8845 ms.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p2 (NOT p0)), (AND p1 (NOT p0)), (NOT p0), true]
Support contains 4 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1140/1140 transitions.
Applied a total of 0 rules in 25 ms. Remains 909 /909 variables (removed 0) and now considering 1140/1140 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9142477212059804054.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4272646434460899088.kers'
[2026-05-25 21:46:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9142477212059804054.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4272646434460899088.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1140 rows 909 cols 2848 entries
Finished phase 1 with 867 SingleSign rule and 0 generalized
[2026-05-25 21:46:54] [INFO ] Computed 42 invariants in 9 ms
Computed 42 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-4272646434460899088.kers
Total runtime 12 ms.
[2026-05-25 21:46:54] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-25 21:46:54] [INFO ] Invariant cache hit.
[2026-05-25 21:46:55] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
Running 1139 sub problems to find dead transitions.
[2026-05-25 21:46:55] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
SMT process timed out in 30163ms, After SMT, problems are : Problem set: 0 solved, 1139 unsolved
Search for dead transitions found 0 dead transitions in 30166ms
Finished structural reductions in LTL mode , in 1 iterations and 31279 ms. Remains : 909/909 places, 1140/1140 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 9 factoid took 54 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (60 resets) in 316 ms. (126 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
[2026-05-25 21:47:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 117/121 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 649/770 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1083/1853 variables, 770/812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1853 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 196/2049 variables, 139/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2049 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/2049 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2049/2049 variables, and 951 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1449 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 909/909 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 117/121 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 649/770 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1083/1853 variables, 770/812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1853 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 196/2049 variables, 139/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2049 variables, 3/954 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2049 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2049 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2049/2049 variables, and 954 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 909/909 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2570ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 399 ms.
Support contains 4 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1140/1140 transitions.
Graph (trivial) has 719 edges and 909 vertex of which 72 / 909 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 846 transition count 971
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 749 transition count 971
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 195 place count 749 transition count 883
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 371 place count 661 transition count 883
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 393 place count 639 transition count 827
Iterating global reduction 2 with 22 rules applied. Total rules applied 415 place count 639 transition count 827
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 2 with 668 rules applied. Total rules applied 1083 place count 305 transition count 493
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1092 place count 296 transition count 477
Iterating global reduction 2 with 9 rules applied. Total rules applied 1101 place count 296 transition count 477
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1103 place count 294 transition count 473
Iterating global reduction 2 with 2 rules applied. Total rules applied 1105 place count 294 transition count 473
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1107 place count 292 transition count 469
Iterating global reduction 2 with 2 rules applied. Total rules applied 1109 place count 292 transition count 469
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 1141 place count 276 transition count 500
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1165 place count 276 transition count 476
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 1196 place count 252 transition count 469
Free-agglomeration rule (complex) applied 42 times.
Iterating global reduction 3 with 42 rules applied. Total rules applied 1238 place count 252 transition count 438
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 53 rules applied. Total rules applied 1291 place count 210 transition count 427
Applied a total of 1291 rules in 80 ms. Remains 210 /909 variables (removed 699) and now considering 427/1140 (removed 713) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 210/909 places, 427/1140 transitions.
RANDOM walk for 40000 steps (527 resets) in 309 ms. (129 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (23 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
[2026-05-25 21:47:29] [INFO ] Flow matrix only has 423 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4582993197184582512.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-632846372018922339.kers'
[2026-05-25 21:47:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4582993197184582512.kers, --Pflows, --basisKERS=/tmp/petrispot-output-632846372018922339.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 1 ms.
// Phase 1: matrix 423 rows 197 cols 2249 entries
Finished phase 1 with 168 SingleSign rule and 0 generalized
[2026-05-25 21:47:29] [INFO ] Computed 42 invariants in 7 ms
Computed 42 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-632846372018922339.kers
Total runtime 8 ms.
[2026-05-25 21:47:29] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/150 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 333/483 variables, 150/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 24/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 150/633 variables, 60/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/633 variables, 114/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/633 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/633 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 633/633 variables, and 390 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 210/210 constraints, ReadFeed: 138/138 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/150 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 333/483 variables, 150/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 24/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 150/633 variables, 60/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/633 variables, 114/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/633 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/633 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/633 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 633/633 variables, and 391 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 210/210 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 9 factoid took 159 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p2 (NOT p0)), (AND p1 (NOT p0)), (NOT p0), true]
Knowledge-based reduction took 4306 ms.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p2 (NOT p0)), (AND p1 (NOT p0)), (NOT p0), true]
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p2 (NOT p0)), (AND p1 (NOT p0)), (NOT p0), true]
Product exploration explored 100000 steps with 33357 reset in 207 ms.
Product exploration explored 100000 steps with 33508 reset in 207 ms.
Spot run failed in 83 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/ltsmin16820307858418594305
[2026-05-25 21:47:30] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16820307858418594305
Running compilation step : cd /tmp/ltsmin16820307858418594305;'/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 1912 ms.
Running link step : cd /tmp/ltsmin16820307858418594305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin16820307858418594305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10671909165407779296.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1140/1140 transitions.
Applied a total of 0 rules in 16 ms. Remains 909 /909 variables (removed 0) and now considering 1140/1140 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4157190610015984129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3380382873886941565.kers'
[2026-05-25 21:47:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4157190610015984129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3380382873886941565.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1140 rows 909 cols 2848 entries
Finished phase 1 with 867 SingleSign rule and 0 generalized
[2026-05-25 21:47:45] [INFO ] Computed 42 invariants in 16 ms
Computed 42 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-3380382873886941565.kers
Total runtime 18 ms.
[2026-05-25 21:47:46] [INFO ] Implicit Places using invariants in 360 ms returned []
[2026-05-25 21:47:46] [INFO ] Invariant cache hit.
[2026-05-25 21:47:47] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1175 ms. Remains : 909/909 places, 1140/1140 transitions.
Built C files in :
/tmp/ltsmin1194031205360512928
[2026-05-25 21:47:47] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1194031205360512928
Running compilation step : cd /tmp/ltsmin1194031205360512928;'/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 1845 ms.
Running link step : cd /tmp/ltsmin1194031205360512928;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1194031205360512928;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased5571798526505267797.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 21:48:02] [INFO ] Flatten gal took : 37 ms
[2026-05-25 21:48:02] [INFO ] Flatten gal took : 38 ms
[2026-05-25 21:48:02] [INFO ] Time to serialize gal into /tmp/LTL11316464543207086551.gal : 8 ms
[2026-05-25 21:48:02] [INFO ] Time to serialize properties into /tmp/LTL12951426260418497146.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11316464543207086551.gal' '-t' 'CGAL' '-hoa' '/tmp/aut844479276948858930.hoa' '-atoms' '/tmp/LTL12951426260418497146.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...318
Loading property file /tmp/LTL12951426260418497146.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut844479276948858930.hoa
Detected timeout of ITS tools.
[2026-05-25 21:48:17] [INFO ] Flatten gal took : 63 ms
[2026-05-25 21:48:17] [INFO ] Flatten gal took : 44 ms
[2026-05-25 21:48:17] [INFO ] Time to serialize gal into /tmp/LTL12184641858588695316.gal : 7 ms
[2026-05-25 21:48:17] [INFO ] Time to serialize properties into /tmp/LTL421949062400718517.ltl : 17 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/LTL12184641858588695316.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL421949062400718517.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...275
Read 1 LTL properties
Checking formula 0 : !((G(((X(X("(p622==1)")))U((X(X(G("(p622==1)"))))||(("(p622!=1)")&&(X(X("(p622==1)"))))))||(("(p1689!=1)")&&(X(("(p1689!=1)")U((!("(((...216
Formula 0 simplified : F((XX!"(p622==1)" R (XXF!"(p622==1)" & (!"(p622!=1)" | XX!"(p622==1)"))) & (!"(p1689!=1)" | X(!"(p1689!=1)" M "(((p718==1)&&(p894==1...173
Detected timeout of ITS tools.
[2026-05-25 21:48:32] [INFO ] Flatten gal took : 33 ms
[2026-05-25 21:48:32] [INFO ] Applying decomposition
[2026-05-25 21:48:32] [INFO ] Flatten gal took : 21 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/graph9969619743467823689.txt' '-o' '/tmp/graph9969619743467823689.bin' '-w' '/tmp/graph9969619743467823689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9969619743467823689.bin' '-l' '-1' '-v' '-w' '/tmp/graph9969619743467823689.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:48:32] [INFO ] Decomposing Gal with order
[2026-05-25 21:48:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:48:33] [INFO ] Removed a total of 465 redundant transitions.
[2026-05-25 21:48:33] [INFO ] Flatten gal took : 172 ms
[2026-05-25 21:48:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 33 ms.
[2026-05-25 21:48:33] [INFO ] Time to serialize gal into /tmp/LTL319905997533557140.gal : 15 ms
[2026-05-25 21:48:33] [INFO ] Time to serialize properties into /tmp/LTL11909773380156630702.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/LTL319905997533557140.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11909773380156630702.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 : !((G(((X(X("(i6.i1.i0.u143.p622==1)")))U((X(X(G("(i6.i1.i0.u143.p622==1)"))))||(("(i6.i1.i0.u143.p622!=1)")&&(X(X("(i6.i1.i0.u143.p622...329
Formula 0 simplified : F((XX!"(i6.i1.i0.u143.p622==1)" R (XXF!"(i6.i1.i0.u143.p622==1)" & (!"(i6.i1.i0.u143.p622!=1)" | XX!"(i6.i1.i0.u143.p622==1)"))) & (...277
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-2B-LTLFireability-11 finished in 125515 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((G(F(p0))||(F(p0)&&X((F(p1)&&X(!p2))))))))'
Support contains 4 out of 974 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1232/1232 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 954 transition count 1207
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 954 transition count 1207
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 942 transition count 1193
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 942 transition count 1193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 942 transition count 1191
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 77 place count 931 transition count 1176
Iterating global reduction 1 with 11 rules applied. Total rules applied 88 place count 931 transition count 1176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 90 place count 931 transition count 1174
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 97 place count 924 transition count 1161
Iterating global reduction 2 with 7 rules applied. Total rules applied 104 place count 924 transition count 1161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 924 transition count 1159
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 110 place count 920 transition count 1154
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 920 transition count 1154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 920 transition count 1153
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 118 place count 917 transition count 1149
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 917 transition count 1149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 122 place count 917 transition count 1148
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 124 place count 915 transition count 1146
Iterating global reduction 5 with 2 rules applied. Total rules applied 126 place count 915 transition count 1146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 127 place count 915 transition count 1145
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 128 place count 914 transition count 1144
Iterating global reduction 6 with 1 rules applied. Total rules applied 129 place count 914 transition count 1144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 130 place count 914 transition count 1143
Applied a total of 130 rules in 171 ms. Remains 914 /974 variables (removed 60) and now considering 1143/1232 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13876253016526878690.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12632277625990543917.kers'
[2026-05-25 21:48:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13876253016526878690.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12632277625990543917.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1143 rows 914 cols 2867 entries
Finished phase 1 with 872 SingleSign rule and 0 generalized
[2026-05-25 21:48:48] [INFO ] Computed 42 invariants in 10 ms
Computed 42 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-12632277625990543917.kers
Total runtime 13 ms.
[2026-05-25 21:48:48] [INFO ] Implicit Places using invariants in 308 ms returned []
[2026-05-25 21:48:48] [INFO ] Invariant cache hit.
[2026-05-25 21:48:49] [INFO ] Implicit Places using invariants and state equation in 781 ms returned [136, 239, 398, 411]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1090 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 910/974 places, 1143/1232 transitions.
Applied a total of 0 rules in 18 ms. Remains 910 /910 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1280 ms. Remains : 910/974 places, 1143/1232 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((G(F(p0))||(F(p0)&&X((F(p1)&&X(p2))))))))'
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-2B-LTLFireability-12
Product exploration explored 100000 steps with 998 reset in 178 ms.
Product exploration explored 100000 steps with 1038 reset in 200 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Detected a total of 65/910 stabilizing places and 65/1143 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 6 factoid took 83 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (61 resets) in 272 ms. (146 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7307757322134757265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7309167079498452464.kers'
[2026-05-25 21:48:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7307757322134757265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7309167079498452464.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1143 rows 910 cols 2853 entries
Finished phase 1 with 868 SingleSign rule and 0 generalized
[2026-05-25 21:48:50] [INFO ] Computed 42 invariants in 9 ms
Computed 42 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7309167079498452464.kers
Total runtime 10 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 354/358 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 413/771 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1086/1857 variables, 771/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1857 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 196/2053 variables, 139/952 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2053 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/2053 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2053/2053 variables, and 952 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1568 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 910/910 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 354/358 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 413/771 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1086/1857 variables, 771/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1857 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 196/2053 variables, 139/952 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2053 variables, 4/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2053 variables, 2/958 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2053 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/2053 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2053/2053 variables, and 958 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2022 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 910/910 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3621ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 188 ms.
Support contains 4 out of 910 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 910/910 places, 1143/1143 transitions.
Graph (trivial) has 723 edges and 910 vertex of which 72 / 910 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 847 transition count 976
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 191 place count 752 transition count 976
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 191 place count 752 transition count 888
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 367 place count 664 transition count 888
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 389 place count 642 transition count 832
Iterating global reduction 2 with 22 rules applied. Total rules applied 411 place count 642 transition count 832
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 335
Deduced a syphon composed of 335 places in 1 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 2 with 670 rules applied. Total rules applied 1081 place count 307 transition count 497
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1090 place count 298 transition count 481
Iterating global reduction 2 with 9 rules applied. Total rules applied 1099 place count 298 transition count 481
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1101 place count 296 transition count 477
Iterating global reduction 2 with 2 rules applied. Total rules applied 1103 place count 296 transition count 477
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1105 place count 294 transition count 473
Iterating global reduction 2 with 2 rules applied. Total rules applied 1107 place count 294 transition count 473
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 1141 place count 277 transition count 514
Free-agglomeration rule applied 22 times.
Iterating global reduction 2 with 22 rules applied. Total rules applied 1163 place count 277 transition count 492
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 1192 place count 255 transition count 485
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1193 place count 255 transition count 484
Free-agglomeration rule (complex) applied 43 times.
Iterating global reduction 3 with 43 rules applied. Total rules applied 1236 place count 255 transition count 456
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 53 rules applied. Total rules applied 1289 place count 212 transition count 446
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1290 place count 212 transition count 446
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1291 place count 212 transition count 446
Applied a total of 1291 rules in 99 ms. Remains 212 /910 variables (removed 698) and now considering 446/1143 (removed 697) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 212/910 places, 446/1143 transitions.
RANDOM walk for 40000 steps (27 resets) in 112 ms. (353 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 32127 steps (9 resets) in 64 ms. (494 steps per ms) remains 0/2 properties
Knowledge based reduction with 6 factoid took 163 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 4794 ms.
Stuttering acceptance computed with spot in 334 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 910/910 places, 1143/1143 transitions.
Applied a total of 0 rules in 22 ms. Remains 910 /910 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
[2026-05-25 21:48:55] [INFO ] Invariant cache hit.
[2026-05-25 21:48:55] [INFO ] Implicit Places using invariants in 271 ms returned []
[2026-05-25 21:48:55] [INFO ] Invariant cache hit.
[2026-05-25 21:48:56] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
Running 1142 sub problems to find dead transitions.
[2026-05-25 21:48:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/909 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1142 unsolved
SMT process timed out in 30167ms, After SMT, problems are : Problem set: 0 solved, 1142 unsolved
Search for dead transitions found 0 dead transitions in 30169ms
Finished structural reductions in LTL mode , in 1 iterations and 31280 ms. Remains : 910/910 places, 1143/1143 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Detected a total of 65/910 stabilizing places and 65/1143 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (63 resets) in 146 ms. (272 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
[2026-05-25 21:49:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 354/358 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 413/771 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1086/1857 variables, 771/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1857 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 196/2053 variables, 139/952 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2053 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2053 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2053/2053 variables, and 952 constraints, problems are : Problem set: 0 solved, 2 unsolved in 999 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 910/910 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 354/358 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 413/771 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1086/1857 variables, 771/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1857 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 196/2053 variables, 139/952 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2053 variables, 2/954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2053 variables, 2/956 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2053 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2053 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2053/2053 variables, and 956 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1434 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 910/910 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2444ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 26642 steps, including 78 resets, run visited all 2 properties in 198 ms. (steps per millisecond=134 )
Parikh walk visited 2 properties in 199 ms.
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 3367 ms.
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 359 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 959 reset in 188 ms.
Product exploration explored 100000 steps with 1055 reset in 292 ms.
Spot run failed in 53 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/ltsmin15178856935249188210
[2026-05-25 21:49:31] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15178856935249188210
Running compilation step : cd /tmp/ltsmin15178856935249188210;'/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 1835 ms.
Running link step : cd /tmp/ltsmin15178856935249188210;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15178856935249188210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased1315632829321959226.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 910/910 places, 1143/1143 transitions.
Applied a total of 0 rules in 20 ms. Remains 910 /910 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
[2026-05-25 21:49:46] [INFO ] Invariant cache hit.
[2026-05-25 21:49:46] [INFO ] Implicit Places using invariants in 284 ms returned []
[2026-05-25 21:49:46] [INFO ] Invariant cache hit.
[2026-05-25 21:49:47] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1113 ms. Remains : 910/910 places, 1143/1143 transitions.
Built C files in :
/tmp/ltsmin2490491038670541048
[2026-05-25 21:49:47] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2490491038670541048
Running compilation step : cd /tmp/ltsmin2490491038670541048;'/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 1877 ms.
Running link step : cd /tmp/ltsmin2490491038670541048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2490491038670541048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased831916340514000070.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 21:50:02] [INFO ] Flatten gal took : 19 ms
[2026-05-25 21:50:02] [INFO ] Flatten gal took : 18 ms
[2026-05-25 21:50:02] [INFO ] Time to serialize gal into /tmp/LTL16762882930064553626.gal : 9 ms
[2026-05-25 21:50:02] [INFO ] Time to serialize properties into /tmp/LTL13496578239640422927.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16762882930064553626.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16448541574102655205.hoa' '-atoms' '/tmp/LTL13496578239640422927.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...320
Loading property file /tmp/LTL13496578239640422927.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16448541574102655205.hoa
Detected timeout of ITS tools.
[2026-05-25 21:50:17] [INFO ] Flatten gal took : 16 ms
[2026-05-25 21:50:17] [INFO ] Flatten gal took : 15 ms
[2026-05-25 21:50:17] [INFO ] Time to serialize gal into /tmp/LTL9813207990907784653.gal : 4 ms
[2026-05-25 21:50:17] [INFO ] Time to serialize properties into /tmp/LTL5335763171774270922.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/LTL9813207990907784653.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5335763171774270922.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...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(p1571!=1)")))||((F("(p1571!=1)"))&&(X((F("(p37==1)"))&&(X("((p1621!=1)||(p1639!=1))")))))))))
Formula 0 simplified : XG(FG!"(p1571!=1)" & (G!"(p1571!=1)" | X(G!"(p37==1)" | X!"((p1621!=1)||(p1639!=1))")))
Detected timeout of ITS tools.
[2026-05-25 21:50:32] [INFO ] Flatten gal took : 17 ms
[2026-05-25 21:50:32] [INFO ] Applying decomposition
[2026-05-25 21:50:32] [INFO ] Flatten gal took : 16 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/graph4925040766814519050.txt' '-o' '/tmp/graph4925040766814519050.bin' '-w' '/tmp/graph4925040766814519050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4925040766814519050.bin' '-l' '-1' '-v' '-w' '/tmp/graph4925040766814519050.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:50:32] [INFO ] Decomposing Gal with order
[2026-05-25 21:50:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:50:33] [INFO ] Removed a total of 463 redundant transitions.
[2026-05-25 21:50:33] [INFO ] Flatten gal took : 42 ms
[2026-05-25 21:50:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 19 ms.
[2026-05-25 21:50:33] [INFO ] Time to serialize gal into /tmp/LTL14936313605039053978.gal : 13 ms
[2026-05-25 21:50:33] [INFO ] Time to serialize properties into /tmp/LTL13740779998498285541.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/LTL14936313605039053978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13740779998498285541.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...256
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(i13.i0.i4.u296.p1571!=1)")))||((F("(i13.i0.i4.u296.p1571!=1)"))&&(X((F("(i9.i0.i2.u16.p37==1)"))&&(X("((i15.i0.i1.u310.p...201
Formula 0 simplified : XG(FG!"(i13.i0.i4.u296.p1571!=1)" & (G!"(i13.i0.i4.u296.p1571!=1)" | X(G!"(i9.i0.i2.u16.p37==1)" | X!"((i15.i0.i1.u310.p1621!=1)||(i...183
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-2B-LTLFireability-12 finished in 119803 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 1 out of 974 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 974/974 places, 1232/1232 transitions.
Graph (trivial) has 782 edges and 974 vertex of which 72 / 974 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 910 transition count 1057
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 223 place count 799 transition count 1057
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 223 place count 799 transition count 979
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 379 place count 721 transition count 979
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 419 place count 681 transition count 899
Iterating global reduction 2 with 40 rules applied. Total rules applied 459 place count 681 transition count 899
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 2 with 1 rules applied. Total rules applied 460 place count 681 transition count 898
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 461 place count 680 transition count 898
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 461 place count 680 transition count 897
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 463 place count 679 transition count 897
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 471 place count 671 transition count 886
Iterating global reduction 4 with 8 rules applied. Total rules applied 479 place count 671 transition count 886
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 482 place count 671 transition count 883
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 486 place count 667 transition count 877
Iterating global reduction 5 with 4 rules applied. Total rules applied 490 place count 667 transition count 877
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 5 with 4 rules applied. Total rules applied 494 place count 666 transition count 874
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 495 place count 665 transition count 874
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 497 place count 663 transition count 871
Iterating global reduction 7 with 2 rules applied. Total rules applied 499 place count 663 transition count 871
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 501 place count 663 transition count 869
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 0 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 8 with 694 rules applied. Total rules applied 1195 place count 316 transition count 522
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1208 place count 303 transition count 498
Iterating global reduction 8 with 13 rules applied. Total rules applied 1221 place count 303 transition count 498
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1226 place count 298 transition count 488
Iterating global reduction 8 with 5 rules applied. Total rules applied 1231 place count 298 transition count 488
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1234 place count 298 transition count 485
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1236 place count 296 transition count 481
Iterating global reduction 9 with 2 rules applied. Total rules applied 1238 place count 296 transition count 481
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1264 place count 283 transition count 480
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1265 place count 282 transition count 479
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1274 place count 273 transition count 479
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 48 rules applied. Total rules applied 1322 place count 249 transition count 455
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 1342 place count 249 transition count 435
Applied a total of 1342 rules in 127 ms. Remains 249 /974 variables (removed 725) and now considering 435/1232 (removed 797) transitions.
[2026-05-25 21:50:48] [INFO ] Flow matrix only has 427 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8569808473302753330.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-452925149979870654.kers'
[2026-05-25 21:50:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8569808473302753330.kers, --Pflows, --basisKERS=/tmp/petrispot-output-452925149979870654.kers]
Normalized transition count is 426 out of 427 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 426 rows 247 cols 1424 entries
Finished phase 1 with 216 SingleSign rule and 0 generalized
[2026-05-25 21:50:48] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-452925149979870654.kers
Total runtime 3 ms.
[2026-05-25 21:50:48] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-25 21:50:48] [INFO ] Flow matrix only has 427 transitions (discarded 8 similar events)
[2026-05-25 21:50:48] [INFO ] Invariant cache hit.
[2026-05-25 21:50:48] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-25 21:50:48] [INFO ] Implicit Places using invariants and state equation in 269 ms returned [23, 55, 102, 108]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 392 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/974 places, 435/1232 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 241 transition count 431
Applied a total of 8 rules in 6 ms. Remains 241 /245 variables (removed 4) and now considering 431/435 (removed 4) transitions.
[2026-05-25 21:50:48] [INFO ] Flow matrix only has 423 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8333721554591011253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18413940293292090956.kers'
[2026-05-25 21:50:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8333721554591011253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18413940293292090956.kers]
Normalized transition count is 422 out of 423 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 422 rows 239 cols 1398 entries
Finished phase 1 with 208 SingleSign rule and 0 generalized
[2026-05-25 21:50:48] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18413940293292090956.kers
Total runtime 3 ms.
[2026-05-25 21:50:48] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-25 21:50:48] [INFO ] Flow matrix only has 423 transitions (discarded 8 similar events)
[2026-05-25 21:50:48] [INFO ] Invariant cache hit.
[2026-05-25 21:50:48] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-25 21:50:49] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 241/974 places, 431/1232 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 901 ms. Remains : 241/974 places, 431/1232 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 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2B-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLFireability-14 finished in 1032 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)&&F(p1)))'
Support contains 3 out of 974 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 974/974 places, 1232/1232 transitions.
Graph (trivial) has 780 edges and 974 vertex of which 72 / 974 are part of one of the 9 SCC in 0 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 910 transition count 1058
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 221 place count 800 transition count 1058
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 221 place count 800 transition count 980
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 377 place count 722 transition count 980
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 417 place count 682 transition count 899
Iterating global reduction 2 with 40 rules applied. Total rules applied 457 place count 682 transition count 899
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 2 with 1 rules applied. Total rules applied 458 place count 682 transition count 898
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 459 place count 681 transition count 898
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 468 place count 672 transition count 886
Iterating global reduction 4 with 9 rules applied. Total rules applied 477 place count 672 transition count 886
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 481 place count 672 transition count 882
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 485 place count 668 transition count 876
Iterating global reduction 5 with 4 rules applied. Total rules applied 489 place count 668 transition count 876
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 5 with 4 rules applied. Total rules applied 493 place count 667 transition count 873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 494 place count 666 transition count 873
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 496 place count 664 transition count 870
Iterating global reduction 7 with 2 rules applied. Total rules applied 498 place count 664 transition count 870
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 500 place count 664 transition count 868
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 0 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 8 with 690 rules applied. Total rules applied 1190 place count 319 transition count 523
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1202 place count 307 transition count 501
Iterating global reduction 8 with 12 rules applied. Total rules applied 1214 place count 307 transition count 501
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1218 place count 303 transition count 493
Iterating global reduction 8 with 4 rules applied. Total rules applied 1222 place count 303 transition count 493
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1224 place count 303 transition count 491
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1225 place count 302 transition count 489
Iterating global reduction 9 with 1 rules applied. Total rules applied 1226 place count 302 transition count 489
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1252 place count 289 transition count 490
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1253 place count 289 transition count 490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1254 place count 288 transition count 489
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1256 place count 286 transition count 489
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1266 place count 281 transition count 484
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1271 place count 281 transition count 479
Applied a total of 1271 rules in 123 ms. Remains 281 /974 variables (removed 693) and now considering 479/1232 (removed 753) transitions.
[2026-05-25 21:50:49] [INFO ] Flow matrix only has 471 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7465088990503211767.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16002131485573271558.kers'
[2026-05-25 21:50:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7465088990503211767.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16002131485573271558.kers]
Normalized transition count is 470 out of 471 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 470 rows 274 cols 1611 entries
Finished phase 1 with 241 SingleSign rule and 0 generalized
[2026-05-25 21:50:49] [INFO ] Computed 40 invariants in 5 ms
Computed 40 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16002131485573271558.kers
Total runtime 7 ms.
[2026-05-25 21:50:49] [INFO ] Implicit Places using invariants in 156 ms returned [7, 31, 66, 90, 127, 181, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 157 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/974 places, 479/1232 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 255 transition count 460
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 53 place count 255 transition count 445
Applied a total of 53 rules in 8 ms. Remains 255 /274 variables (removed 19) and now considering 445/479 (removed 34) transitions.
[2026-05-25 21:50:49] [INFO ] Flow matrix only has 437 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3240592819780010282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13503976449091962335.kers'
[2026-05-25 21:50:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3240592819780010282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13503976449091962335.kers]
Normalized transition count is 436 out of 437 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 436 rows 255 cols 1505 entries
Finished phase 1 with 222 SingleSign rule and 0 generalized
[2026-05-25 21:50:49] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13503976449091962335.kers
Total runtime 3 ms.
[2026-05-25 21:50:49] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-25 21:50:49] [INFO ] Flow matrix only has 437 transitions (discarded 8 similar events)
[2026-05-25 21:50:49] [INFO ] Invariant cache hit.
[2026-05-25 21:50:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-25 21:50:49] [INFO ] Implicit Places using invariants and state equation in 310 ms returned [24, 56, 103, 109]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 446 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 251/974 places, 445/1232 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 247 transition count 441
Applied a total of 8 rules in 10 ms. Remains 247 /251 variables (removed 4) and now considering 441/445 (removed 4) transitions.
[2026-05-25 21:50:49] [INFO ] Flow matrix only has 433 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9711207856221192402.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7145781186033686390.kers'
[2026-05-25 21:50:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9711207856221192402.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7145781186033686390.kers]
Normalized transition count is 432 out of 433 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 432 rows 247 cols 1479 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-25 21:50:49] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7145781186033686390.kers
Total runtime 4 ms.
[2026-05-25 21:50:50] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-25 21:50:50] [INFO ] Flow matrix only has 433 transitions (discarded 8 similar events)
[2026-05-25 21:50:50] [INFO ] Invariant cache hit.
[2026-05-25 21:50:50] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-25 21:50:50] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 247/974 places, 441/1232 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1167 ms. Remains : 247/974 places, 441/1232 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)&&F(p1)))'
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-2B-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLFireability-15 finished in 1313 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(((p0&&X((p0 U (!p1||G(p0)))))||(X(X(p2)) U ((!p2&&X(X(p2)))||X(X(G(p2))))))))'
Spot run failed in 44 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.
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((G(F(p0))||(F(p0)&&X((F(p1)&&X(!p2))))))))'
Spot run failed in 44 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 21:50:50] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12639438752673260541
[2026-05-25 21:50:50] [INFO ] Computing symmetric may disable matrix : 1232 transitions.
[2026-05-25 21:50:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 21:50:50] [INFO ] Computing symmetric may enable matrix : 1232 transitions.
[2026-05-25 21:50:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 21:50:50] [INFO ] Applying decomposition
[2026-05-25 21:50:50] [INFO ] Flatten gal took : 16 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/graph4888329933090573920.txt' '-o' '/tmp/graph4888329933090573920.bin' '-w' '/tmp/graph4888329933090573920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4888329933090573920.bin' '-l' '-1' '-v' '-w' '/tmp/graph4888329933090573920.weights' '-q' '0' '-e' '0.001'
[2026-05-25 21:50:50] [INFO ] Decomposing Gal with order
[2026-05-25 21:50:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:50:50] [INFO ] Removed a total of 525 redundant transitions.
[2026-05-25 21:50:50] [INFO ] Flatten gal took : 45 ms
[2026-05-25 21:50:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 18 ms.
[2026-05-25 21:50:50] [INFO ] Time to serialize gal into /tmp/LTLFireability5611850097824019706.gal : 10 ms
[2026-05-25 21:50:50] [INFO ] Time to serialize properties into /tmp/LTLFireability14693962679440007413.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/LTLFireability5611850097824019706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14693962679440007413.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...277
Read 2 LTL properties
[2026-05-25 21:50:50] [INFO ] Computing Do-Not-Accords matrix : 1232 transitions.
[2026-05-25 21:50:51] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 21:50:51] [INFO ] Built C files in 343ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12639438752673260541
Running compilation step : cd /tmp/ltsmin12639438752673260541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
Checking formula 0 : !((G((("(i13.u330.p1689!=1)")&&(X(("(i13.u330.p1689!=1)")U((!("(((i6.i1.i0.u265.p718==1)&&(i6.i2.i0.u191.p894==1))&&(i5.i0.i5.u147.p62...341
Formula 0 simplified : F((XX!"(i5.i0.i5.u147.p622==1)" R (XXF!"(i5.i0.i5.u147.p622==1)" & (!"(i5.i0.i5.u147.p622!=1)" | XX!"(i5.i0.i5.u147.p622==1)"))) & (...289
Compilation finished in 3875 ms.
Running link step : cd /tmp/ltsmin12639438752673260541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin12639438752673260541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true))))))||(X(X((LTLAPp2==true))) U ((!(LTLAPp2==true)&&X(X((LTLAPp2==true))))||X(X([]((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12639438752673260541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true))))))||(X(X((LTLAPp2==true))) U ((!(LTLAPp2==true)&&X(X((LTLAPp2==true))))||X(X([]((LTLAPp2==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12639438752673260541;'/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(<>(([](<>((LTLAPp3==true)))||(<>((LTLAPp3==true))&&X((<>((LTLAPp4==true))&&X(!(LTLAPp5==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 22:12:52] [INFO ] Applying decomposition
[2026-05-25 22:12:52] [INFO ] Flatten gal took : 247 ms
[2026-05-25 22:12:52] [INFO ] Decomposing Gal with order
[2026-05-25 22:12:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 22:12:53] [INFO ] Removed a total of 280 redundant transitions.
[2026-05-25 22:12:53] [INFO ] Flatten gal took : 227 ms
[2026-05-25 22:12:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 969 labels/synchronizations in 501 ms.
[2026-05-25 22:12:54] [INFO ] Time to serialize gal into /tmp/LTLFireability5625170818095179298.gal : 55 ms
[2026-05-25 22:12:54] [INFO ] Time to serialize properties into /tmp/LTLFireability3786102772333684784.ltl : 3 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/LTLFireability5625170818095179298.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3786102772333684784.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...276
Read 2 LTL properties
Checking formula 0 : !((G((("(i0.i0.i0.i0.i0.i0.i0.i0.u122.p1689!=1)")&&(X(("(i0.i0.i0.i0.i0.i0.i0.i0.u122.p1689!=1)")U((!("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i...1099
Formula 0 simplified : F((XX!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u92.p622==...1027
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12639438752673260541;'/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(<>(([](<>((LTLAPp3==true)))||(<>((LTLAPp3==true))&&X((<>((LTLAPp4==true))&&X(!(LTLAPp5==true))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin12639438752673260541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((((LTLAPp0==true)&&X(((LTLAPp0==true) U (!(LTLAPp1==true)||[]((LTLAPp0==true))))))||(X(X((LTLAPp2==true))) U ((!(LTLAPp2==true)&&X(X((LTLAPp2==true))))||X(X([]((LTLAPp2==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 22:35:00] [INFO ] Flatten gal took : 311 ms
[2026-05-25 22:35:02] [INFO ] Input system was already deterministic with 1232 transitions.
[2026-05-25 22:35:02] [INFO ] Transformed 974 places.
[2026-05-25 22:35:02] [INFO ] Transformed 1232 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 22:35:03] [INFO ] Time to serialize gal into /tmp/LTLFireability15520022810716375775.gal : 15 ms
[2026-05-25 22:35:03] [INFO ] Time to serialize properties into /tmp/LTLFireability8293686807376544032.ltl : 3 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/LTLFireability15520022810716375775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8293686807376544032.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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((("(p1689!=1)")&&(X(("(p1689!=1)")U((!("(((p718==1)&&(p894==1))&&(p622==1))"))||(G("(p1689!=1)"))))))||((X(X("(p622==1)")))U((("(...216
Formula 0 simplified : F((XX!"(p622==1)" R (XXF!"(p622==1)" & (!"(p622!=1)" | XX!"(p622==1)"))) & (!"(p1689!=1)" | X(!"(p1689!=1)" M "(((p718==1)&&(p894==1...173

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="NoC3x3-PT-2B"
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 NoC3x3-PT-2B, 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 r194-tall-177969914000284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-2B.tgz
mv NoC3x3-PT-2B 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 ;