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.r066-tall-177946967700324.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 CO4-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.7K Mar 6 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 6 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 6 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 6 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 6 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:29 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 97K 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 CO4-PT-06-LTLFireability-00
FORMULA_NAME CO4-PT-06-LTLFireability-01
FORMULA_NAME CO4-PT-06-LTLFireability-02
FORMULA_NAME CO4-PT-06-LTLFireability-03
FORMULA_NAME CO4-PT-06-LTLFireability-04
FORMULA_NAME CO4-PT-06-LTLFireability-05
FORMULA_NAME CO4-PT-06-LTLFireability-06
FORMULA_NAME CO4-PT-06-LTLFireability-07
FORMULA_NAME CO4-PT-06-LTLFireability-08
FORMULA_NAME CO4-PT-06-LTLFireability-09
FORMULA_NAME CO4-PT-06-LTLFireability-10
FORMULA_NAME CO4-PT-06-LTLFireability-11
FORMULA_NAME CO4-PT-06-LTLFireability-12
FORMULA_NAME CO4-PT-06-LTLFireability-13
FORMULA_NAME CO4-PT-06-LTLFireability-14
FORMULA_NAME CO4-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779521292025

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 07:28:13] [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-23 07:28:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:28:13] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2026-05-23 07:28:13] [INFO ] Transformed 383 places.
[2026-05-23 07:28:13] [INFO ] Transformed 454 transitions.
[2026-05-23 07:28:13] [INFO ] Found NUPN structural information;
[2026-05-23 07:28:13] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 334/334 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 273 transition count 333
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 72 place count 212 transition count 270
Iterating global reduction 1 with 61 rules applied. Total rules applied 133 place count 212 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 136 place count 212 transition count 267
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 164 place count 184 transition count 239
Iterating global reduction 2 with 28 rules applied. Total rules applied 192 place count 184 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 184 transition count 238
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 197 place count 180 transition count 233
Iterating global reduction 3 with 4 rules applied. Total rules applied 201 place count 180 transition count 233
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 179 transition count 232
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 179 transition count 232
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 204 place count 178 transition count 231
Iterating global reduction 3 with 1 rules applied. Total rules applied 205 place count 178 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 206 place count 178 transition count 230
Applied a total of 206 rules in 76 ms. Remains 178 /283 variables (removed 105) and now considering 230/334 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15642363958244916471.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11506278953248544947.kers'
[2026-05-23 07:28:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15642363958244916471.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11506278953248544947.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 230 rows 178 cols 524 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-23 07:28:13] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11506278953248544947.kers
Total runtime 2 ms.
[2026-05-23 07:28:13] [INFO ] Implicit Places using invariants in 226 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 258 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 177/283 places, 230/334 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 355 ms. Remains : 177/283 places, 230/334 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 177 /177 variables (removed 0) and now considering 230/230 (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-12971311134040977728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6867176419385184889.kers'
[2026-05-23 07:28:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12971311134040977728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6867176419385184889.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 230 rows 177 cols 522 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-23 07:28:13] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6867176419385184889.kers
Total runtime 4 ms.
[2026-05-23 07:28:14] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-23 07:28:14] [INFO ] Invariant cache hit.
[2026-05-23 07:28:14] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2026-05-23 07:28:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/407 variables, 177/180 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/407 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 182 constraints, problems are : Problem set: 0 solved, 229 unsolved in 16072 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/407 variables, 177/182 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 229/411 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 412 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46174ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 46186ms
Finished structural reductions in LTL mode , in 1 iterations and 46427 ms. Remains : 177/177 places, 230/230 transitions.
Support contains 15 out of 177 places after structural reductions.
[2026-05-23 07:29:00] [INFO ] Flatten gal took : 35 ms
[2026-05-23 07:29:00] [INFO ] Flatten gal took : 14 ms
[2026-05-23 07:29:00] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 40000 steps (66 resets) in 1121 ms. (35 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40000 steps (71 resets) in 554 ms. (72 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (35 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (15 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (66 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (54 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (58 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
[2026-05-23 07:29:01] [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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/27 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 70/97 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 167/264 variables, 66/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 118/382 variables, 68/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 22/404 variables, 14/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 3/407 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/407 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 180 constraints, problems are : Problem set: 0 solved, 6 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/27 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 70/97 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 167/264 variables, 66/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 118/382 variables, 68/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 22/404 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 3/407 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/407 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/407 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 186 constraints, problems are : Problem set: 0 solved, 6 unsolved in 874 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1297ms problems are : Problem set: 0 solved, 6 unsolved
Finished Parikh walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 194 ms.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 296 edges and 177 vertex of which 174 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 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(X((p1 U p2))) U (p3 U X(X(p2)))))))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 230/230 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 174 transition count 227
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 174 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 174 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 172 transition count 224
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 172 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 171 transition count 222
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 171 transition count 222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 170 transition count 221
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 170 transition count 221
Applied a total of 15 rules in 15 ms. Remains 170 /177 variables (removed 7) and now considering 221/230 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11862666527537347622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2073157881978242174.kers'
[2026-05-23 07:29:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11862666527537347622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2073157881978242174.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 170 cols 502 entries
Finished phase 1 with 167 SingleSign rule and 0 generalized
[2026-05-23 07:29:03] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2073157881978242174.kers
Total runtime 1 ms.
[2026-05-23 07:29:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-23 07:29:03] [INFO ] Invariant cache hit.
[2026-05-23 07:29:03] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-23 07:29:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/391 variables, 170/173 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/391 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 175 constraints, problems are : Problem set: 0 solved, 220 unsolved in 14835 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/391 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 220/395 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/391 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 396 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44872ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 44874ms
Starting structural reductions in LTL mode, iteration 1 : 170/177 places, 221/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45038 ms. Remains : 170/177 places, 221/230 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(X(X((p1 U p2))) U (p3 U X(X(p2)))))))'
Stuttering acceptance computed with spot in 707 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p3), false, (AND (NOT p2) p3), true, (AND (NOT p2) p1), (AND (NOT p2) p1), (OR (AND (NOT p2) p3) (AND p1 (NOT p2)))]
Running random walk in product with property : CO4-PT-06-LTLFireability-01
Product exploration explored 100000 steps with 5 reset in 181 ms.
Product exploration explored 100000 steps with 3 reset in 110 ms.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 10 stabilizing places and 12 stable transitions
Detected a total of 10/170 stabilizing places and 12/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 9 factoid took 227 ms. Reduced automaton from 13 states, 26 edges and 4 AP (stutter sensitive) to 13 states, 26 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (41 resets) in 332 ms. (120 steps per ms) remains 5/14 properties
BEST_FIRST walk for 40000 steps (42 resets) in 221 ms. (180 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (43 resets) in 184 ms. (216 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (53 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (83 resets) in 141 ms. (281 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40000 steps (33 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
[2026-05-23 07:29:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 68/104 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/113 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 4/117 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 139/256 variables, 61/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 104/360 variables, 59/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 22/382 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/382 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 9/391 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/391 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/391 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 173 constraints, problems are : Problem set: 0 solved, 4 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 68/104 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 9/113 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/117 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/117 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 139/256 variables, 61/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 104/360 variables, 59/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/360 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 22/382 variables, 13/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/382 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 9/391 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/391 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/391 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 178 constraints, problems are : Problem set: 0 solved, 4 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 699ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 20 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 221/221 transitions.
Graph (trivial) has 178 edges and 170 vertex of which 2 / 170 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 284 edges and 169 vertex of which 155 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 155 transition count 144
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 56 rules applied. Total rules applied 121 place count 102 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 123 place count 100 transition count 141
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 123 place count 100 transition count 120
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 165 place count 79 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 77 transition count 117
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 77 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 77 transition count 116
Performed 24 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 218 place count 53 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 4 with 4 rules applied. Total rules applied 222 place count 53 transition count 83
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 224 place count 52 transition count 82
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 226 place count 50 transition count 80
Iterating global reduction 6 with 2 rules applied. Total rules applied 228 place count 50 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 48 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 116 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 5 rules applied. Total rules applied 237 place count 47 transition count 74
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 240 place count 44 transition count 71
Iterating global reduction 7 with 3 rules applied. Total rules applied 243 place count 44 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 244 place count 44 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 248 place count 42 transition count 68
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 250 place count 42 transition count 66
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 252 place count 40 transition count 64
Iterating global reduction 9 with 2 rules applied. Total rules applied 254 place count 40 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 256 place count 40 transition count 62
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 276 place count 30 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 294 place count 30 transition count 45
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 303 place count 21 transition count 36
Iterating global reduction 11 with 9 rules applied. Total rules applied 312 place count 21 transition count 36
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 320 place count 21 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 321 place count 21 transition count 27
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 322 place count 20 transition count 26
Iterating global reduction 12 with 1 rules applied. Total rules applied 323 place count 20 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 324 place count 20 transition count 25
Free-agglomeration rule applied 4 times.
Iterating global reduction 13 with 4 rules applied. Total rules applied 328 place count 20 transition count 21
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 333 place count 16 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 334 place count 16 transition count 19
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 335 place count 16 transition count 19
Graph (complete) has 33 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 336 place count 15 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 337 place count 15 transition count 18
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 338 place count 15 transition count 18
Graph (complete) has 29 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 339 place count 14 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 340 place count 14 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 341 place count 13 transition count 16
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 18 with 4 rules applied. Total rules applied 345 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 2 rules applied. Total rules applied 347 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 348 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 349 place count 9 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 21 with 2 rules applied. Total rules applied 351 place count 9 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 353 place count 7 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 354 place count 7 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 355 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 357 place count 6 transition count 7
Applied a total of 357 rules in 42 ms. Remains 6 /170 variables (removed 164) and now considering 7/221 (removed 214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 6/170 places, 7/221 transitions.
RANDOM walk for 39 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 482 ms. Reduced automaton from 13 states, 26 edges and 4 AP (stutter sensitive) to 13 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 527 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p3), false, (AND (NOT p2) p3), true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (OR (AND (NOT p2) p3) (AND p1 (NOT p2)))]
Knowledge-based reduction took 2401 ms.
Stuttering acceptance computed with spot in 548 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p3), false, (AND (NOT p2) p3), true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (OR (AND (NOT p2) p3) (AND p1 (NOT p2)))]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2026-05-23 07:29:52] [INFO ] Invariant cache hit.
[2026-05-23 07:29:52] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 07:29:52] [INFO ] Invariant cache hit.
[2026-05-23 07:29:52] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 170/170 places, 221/221 transitions.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Computed a total of 10 stabilizing places and 12 stable transitions
Detected a total of 10/170 stabilizing places and 12/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 9 factoid took 273 ms. Reduced automaton from 13 states, 26 edges and 4 AP (stutter sensitive) to 13 states, 26 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (83 resets) in 235 ms. (169 steps per ms) remains 5/14 properties
BEST_FIRST walk for 40000 steps (77 resets) in 206 ms. (193 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40000 steps (32 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (29 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (42 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
[2026-05-23 07:29:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 68/104 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/113 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 4/117 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 139/256 variables, 61/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 104/360 variables, 59/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 22/382 variables, 13/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/382 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 9/391 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/391 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/391 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 173 constraints, problems are : Problem set: 0 solved, 4 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 68/104 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 9/113 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/117 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/117 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 139/256 variables, 61/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 104/360 variables, 59/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/360 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 22/382 variables, 13/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/382 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 9/391 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/391 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/391 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 178 constraints, problems are : Problem set: 0 solved, 4 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 705ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 15 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 221/221 transitions.
Graph (trivial) has 178 edges and 170 vertex of which 2 / 170 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 284 edges and 169 vertex of which 155 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 155 transition count 144
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 56 rules applied. Total rules applied 121 place count 102 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 123 place count 100 transition count 141
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 123 place count 100 transition count 120
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 165 place count 79 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 77 transition count 117
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 77 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 77 transition count 116
Performed 24 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 218 place count 53 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 4 with 4 rules applied. Total rules applied 222 place count 53 transition count 83
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 224 place count 52 transition count 82
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 226 place count 50 transition count 80
Iterating global reduction 6 with 2 rules applied. Total rules applied 228 place count 50 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 48 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 116 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 5 rules applied. Total rules applied 237 place count 47 transition count 74
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 240 place count 44 transition count 71
Iterating global reduction 7 with 3 rules applied. Total rules applied 243 place count 44 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 244 place count 44 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 248 place count 42 transition count 68
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 250 place count 42 transition count 66
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 252 place count 40 transition count 64
Iterating global reduction 9 with 2 rules applied. Total rules applied 254 place count 40 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 256 place count 40 transition count 62
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 276 place count 30 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 294 place count 30 transition count 45
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 303 place count 21 transition count 36
Iterating global reduction 11 with 9 rules applied. Total rules applied 312 place count 21 transition count 36
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 320 place count 21 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 321 place count 21 transition count 27
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 322 place count 20 transition count 26
Iterating global reduction 12 with 1 rules applied. Total rules applied 323 place count 20 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 324 place count 20 transition count 25
Free-agglomeration rule applied 4 times.
Iterating global reduction 13 with 4 rules applied. Total rules applied 328 place count 20 transition count 21
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 333 place count 16 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 334 place count 16 transition count 19
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 335 place count 16 transition count 19
Graph (complete) has 33 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 336 place count 15 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 337 place count 15 transition count 18
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 338 place count 15 transition count 18
Graph (complete) has 29 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 339 place count 14 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 340 place count 14 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 341 place count 13 transition count 16
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 18 with 4 rules applied. Total rules applied 345 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 2 rules applied. Total rules applied 347 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 348 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 349 place count 9 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 21 with 2 rules applied. Total rules applied 351 place count 9 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 353 place count 7 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 354 place count 7 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 355 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 357 place count 6 transition count 7
Applied a total of 357 rules in 25 ms. Remains 6 /170 variables (removed 164) and now considering 7/221 (removed 214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 6/170 places, 7/221 transitions.
RANDOM walk for 46 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 488 ms. Reduced automaton from 13 states, 26 edges and 4 AP (stutter sensitive) to 13 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 541 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p3), false, (AND (NOT p2) p3), true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (OR (AND (NOT p2) p3) (AND p1 (NOT p2)))]
Knowledge-based reduction took 2422 ms.
Stuttering acceptance computed with spot in 528 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p3), false, (AND (NOT p2) p3), true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (OR (AND (NOT p2) p3) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 535 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p3), false, (AND (NOT p2) p3), true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (OR (AND (NOT p2) p3) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 16 reset in 92 ms.
Product exploration explored 100000 steps with 6 reset in 85 ms.
Spot run failed in 73 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/ltsmin3768926243281579210
[2026-05-23 07:29:56] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3768926243281579210
Running compilation step : cd /tmp/ltsmin3768926243281579210;'/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 422 ms.
Running link step : cd /tmp/ltsmin3768926243281579210;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3768926243281579210;'/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/stateBased9492124331178616292.hoa' '--buchi-type=spotba'
LTSmin run took 343 ms.
FORMULA CO4-PT-06-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-06-LTLFireability-01 finished in 53940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U X(X((p0&&F(G(p0)))))))))'
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 230/230 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 173 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 173 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 173 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 170 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 170 transition count 221
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 168 transition count 218
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 168 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 168 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 167 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 167 transition count 216
Applied a total of 22 rules in 9 ms. Remains 167 /177 variables (removed 10) and now considering 216/230 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18151325722715794924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-824458822872236571.kers'
[2026-05-23 07:29:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18151325722715794924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-824458822872236571.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 167 cols 492 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-23 07:29:57] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-824458822872236571.kers
Total runtime 1 ms.
[2026-05-23 07:29:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-23 07:29:57] [INFO ] Invariant cache hit.
[2026-05-23 07:29:57] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2026-05-23 07:29:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/383 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 172 constraints, problems are : Problem set: 0 solved, 215 unsolved in 14069 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/383 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 215/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/383 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 388 constraints, problems are : Problem set: 0 solved, 215 unsolved in 26281 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40369ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 40370ms
Starting structural reductions in LTL mode, iteration 1 : 167/177 places, 216/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40522 ms. Remains : 167/177 places, 216/230 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U X(X((p0&&F(G(p0)))))))))'
Stuttering acceptance computed with spot in 359 ms :[(NOT p0), (NOT p0), (NOT p0), false, (NOT p0), true, (NOT p0), false, false, (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA CO4-PT-06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-06 finished in 40926 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 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 230/230 transitions.
Graph (trivial) has 186 edges and 177 vertex of which 2 / 177 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 295 edges and 176 vertex of which 173 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 172 transition count 165
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 112 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 111 transition count 163
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 125 place count 111 transition count 143
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 165 place count 91 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 89 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 89 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 89 transition count 139
Performed 29 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 228 place count 60 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 230 place count 60 transition count 99
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 232 place count 58 transition count 97
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 58 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 238 place count 56 transition count 95
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 266 place count 42 transition count 96
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 274 place count 42 transition count 88
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 285 place count 31 transition count 66
Iterating global reduction 6 with 11 rules applied. Total rules applied 296 place count 31 transition count 66
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 303 place count 31 transition count 59
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 306 place count 28 transition count 50
Iterating global reduction 7 with 3 rules applied. Total rules applied 309 place count 28 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 310 place count 28 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 315 place count 28 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 316 place count 28 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 318 place count 26 transition count 42
Applied a total of 318 rules in 25 ms. Remains 26 /177 variables (removed 151) and now considering 42/230 (removed 188) transitions.
[2026-05-23 07:30:37] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17262853973763391130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8716434744539537289.kers'
[2026-05-23 07:30:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17262853973763391130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8716434744539537289.kers]
Normalized transition count is 38 out of 39 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 26 cols 92 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-23 07:30:37] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8716434744539537289.kers
Total runtime 0 ms.
[2026-05-23 07:30:38] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-23 07:30:38] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2026-05-23 07:30:38] [INFO ] Invariant cache hit.
[2026-05-23 07:30:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:30:38] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2026-05-23 07:30:38] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2026-05-23 07:30:38] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2026-05-23 07:30:38] [INFO ] Invariant cache hit.
[2026-05-23 07:30:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 38/64 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 30 constraints, problems are : Problem set: 0 solved, 32 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 38/64 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 32/61 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/65 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 62 constraints, problems are : Problem set: 0 solved, 32 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 965ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 966ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/177 places, 42/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1060 ms. Remains : 26/177 places, 42/230 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 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLFireability-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-08 finished in 1177 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||G(p1))))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 230/230 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 175 transition count 227
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 175 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 175 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 173 transition count 224
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 173 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 171 transition count 221
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 171 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 171 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 170 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 170 transition count 219
Applied a total of 16 rules in 12 ms. Remains 170 /177 variables (removed 7) and now considering 219/230 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7850666724008087810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1959332904933906274.kers'
[2026-05-23 07:30:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7850666724008087810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1959332904933906274.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 170 cols 500 entries
Finished phase 1 with 167 SingleSign rule and 0 generalized
[2026-05-23 07:30:39] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1959332904933906274.kers
Total runtime 1 ms.
[2026-05-23 07:30:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 07:30:39] [INFO ] Invariant cache hit.
[2026-05-23 07:30:39] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-23 07:30:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/389 variables, 170/173 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 175 constraints, problems are : Problem set: 0 solved, 218 unsolved in 14467 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/389 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 218/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/389 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 394 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44508ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 44509ms
Starting structural reductions in LTL mode, iteration 1 : 170/177 places, 219/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44679 ms. Remains : 170/177 places, 219/230 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||G(p1))))'
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-06-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 13 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 14 ms. Proved property starting from automaton with 4 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA CO4-PT-06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-06-LTLFireability-11 finished in 45116 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&&(!p0 U (!p1||G(!p0)))))))'
Support contains 2 out of 177 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 230/230 transitions.
Graph (trivial) has 181 edges and 177 vertex of which 2 / 177 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 295 edges and 176 vertex of which 173 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 172 transition count 170
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 59 rules applied. Total rules applied 116 place count 117 transition count 166
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 119 place count 114 transition count 166
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 119 place count 114 transition count 146
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 159 place count 94 transition count 146
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 91 transition count 142
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 91 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 3 rules applied. Total rules applied 168 place count 91 transition count 139
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 4 with 3 rules applied. Total rules applied 171 place count 90 transition count 137
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 174 place count 89 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 175 place count 88 transition count 135
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 176 place count 87 transition count 133
Iterating global reduction 7 with 1 rules applied. Total rules applied 177 place count 87 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 178 place count 87 transition count 132
Performed 26 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 8 with 52 rules applied. Total rules applied 230 place count 61 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 231 place count 61 transition count 98
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 233 place count 59 transition count 96
Iterating global reduction 9 with 2 rules applied. Total rules applied 235 place count 59 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 239 place count 57 transition count 94
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
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 267 place count 43 transition count 95
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 276 place count 43 transition count 86
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 286 place count 33 transition count 66
Iterating global reduction 10 with 10 rules applied. Total rules applied 296 place count 33 transition count 66
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 304 place count 33 transition count 58
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 306 place count 31 transition count 52
Iterating global reduction 11 with 2 rules applied. Total rules applied 308 place count 31 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 309 place count 31 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 312 place count 31 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 313 place count 30 transition count 47
Applied a total of 313 rules in 25 ms. Remains 30 /177 variables (removed 147) and now considering 47/230 (removed 183) transitions.
[2026-05-23 07:31:24] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5077673991213532963.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18430740323159229519.kers'
[2026-05-23 07:31:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5077673991213532963.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18430740323159229519.kers]
Normalized transition count is 43 out of 44 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 43 rows 30 cols 130 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-23 07:31:24] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18430740323159229519.kers
Total runtime 1 ms.
[2026-05-23 07:31:24] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-23 07:31:24] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2026-05-23 07:31:24] [INFO ] Invariant cache hit.
[2026-05-23 07:31:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 07:31:24] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2026-05-23 07:31:24] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2026-05-23 07:31:24] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2026-05-23 07:31:24] [INFO ] Invariant cache hit.
[2026-05-23 07:31:24] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 43/72 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 1/73 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/74 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/74 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 37 constraints, problems are : Problem set: 0 solved, 42 unsolved in 850 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 43/72 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 1/73 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 1/74 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/74 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 0/74 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 79 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1124 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1979ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1980ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/177 places, 47/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2085 ms. Remains : 30/177 places, 47/230 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 U (!p1||G(!p0)))&&!p0))))'
Stuttering acceptance computed with spot in 45 ms :[p0]
Running random walk in product with property : CO4-PT-06-LTLFireability-12
Product exploration explored 100000 steps with 19 reset in 132 ms.
Product exploration explored 100000 steps with 14 reset in 80 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 189 steps (19 resets) in 5 ms. (31 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p0]
Knowledge-based reduction took 137 ms.
Stuttering acceptance computed with spot in 45 ms :[p0]
Support contains 2 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 47/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2026-05-23 07:31:26] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2026-05-23 07:31:26] [INFO ] Invariant cache hit.
[2026-05-23 07:31:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-23 07:31:26] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2026-05-23 07:31:26] [INFO ] Invariant cache hit.
[2026-05-23 07:31:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 07:31:26] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2026-05-23 07:31:26] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 30/30 places, 47/47 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 3 factoid took 38 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 235 steps (22 resets) in 9 ms. (23 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[p0]
Knowledge-based reduction took 144 ms.
Stuttering acceptance computed with spot in 32 ms :[p0]
Stuttering acceptance computed with spot in 44 ms :[p0]
Product exploration explored 100000 steps with 9 reset in 38 ms.
Product exploration explored 100000 steps with 5 reset in 76 ms.
Built C files in :
/tmp/ltsmin5607835733749603376
[2026-05-23 07:31:27] [INFO ] Computing symmetric may disable matrix : 47 transitions.
[2026-05-23 07:31:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:31:27] [INFO ] Computing symmetric may enable matrix : 47 transitions.
[2026-05-23 07:31:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:31:27] [INFO ] Computing Do-Not-Accords matrix : 47 transitions.
[2026-05-23 07:31:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:31:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5607835733749603376
Running compilation step : cd /tmp/ltsmin5607835733749603376;'/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 127 ms.
Running link step : cd /tmp/ltsmin5607835733749603376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5607835733749603376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16092396503116309170.hoa' '--buchi-type=spotba'
LTSmin run took 34 ms.
FORMULA CO4-PT-06-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-06-LTLFireability-12 finished in 3220 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||G(p1)) U G(!p0))))'
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 230/230 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 174 transition count 226
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 174 transition count 226
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 172 transition count 224
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 172 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 171 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 171 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 171 transition count 222
Applied a total of 13 rules in 11 ms. Remains 171 /177 variables (removed 6) and now considering 222/230 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10497226916558676981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14566033498847437797.kers'
[2026-05-23 07:31:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10497226916558676981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14566033498847437797.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 171 cols 504 entries
Finished phase 1 with 168 SingleSign rule and 0 generalized
[2026-05-23 07:31:27] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14566033498847437797.kers
Total runtime 2 ms.
[2026-05-23 07:31:27] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-23 07:31:27] [INFO ] Invariant cache hit.
[2026-05-23 07:31:27] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-23 07:31:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/393 variables, 171/174 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/393 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 176 constraints, problems are : Problem set: 0 solved, 221 unsolved in 14756 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/393 variables, 171/176 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 221/397 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/393 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 398 constraints, problems are : Problem set: 0 solved, 221 unsolved in 28862 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43633ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 43633ms
Starting structural reductions in LTL mode, iteration 1 : 171/177 places, 222/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43797 ms. Remains : 171/177 places, 222/230 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||G(p1)) U G(!p0))))'
Stuttering acceptance computed with spot in 228 ms :[p0, p0, p0, (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : CO4-PT-06-LTLFireability-13
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA CO4-PT-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-13 finished in 44074 ms.
All properties solved by simple procedures.
Total runtime 238347 ms.

BK_STOP 1779521531578

--------------------
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="CO4-PT-06"
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 CO4-PT-06, 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 r066-tall-177946967700324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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