Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000196.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11: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 39K 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 MedleyA-PT-13-LTLFireability-00
FORMULA_NAME MedleyA-PT-13-LTLFireability-01
FORMULA_NAME MedleyA-PT-13-LTLFireability-02
FORMULA_NAME MedleyA-PT-13-LTLFireability-03
FORMULA_NAME MedleyA-PT-13-LTLFireability-04
FORMULA_NAME MedleyA-PT-13-LTLFireability-05
FORMULA_NAME MedleyA-PT-13-LTLFireability-06
FORMULA_NAME MedleyA-PT-13-LTLFireability-07
FORMULA_NAME MedleyA-PT-13-LTLFireability-08
FORMULA_NAME MedleyA-PT-13-LTLFireability-09
FORMULA_NAME MedleyA-PT-13-LTLFireability-10
FORMULA_NAME MedleyA-PT-13-LTLFireability-11
FORMULA_NAME MedleyA-PT-13-LTLFireability-12
FORMULA_NAME MedleyA-PT-13-LTLFireability-13
FORMULA_NAME MedleyA-PT-13-LTLFireability-14
FORMULA_NAME MedleyA-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779700245193

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:10:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:10:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:10:47] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2026-05-25 09:10:47] [INFO ] Transformed 173 places.
[2026-05-25 09:10:47] [INFO ] Transformed 159 transitions.
[2026-05-25 09:10:47] [INFO ] Found NUPN structural information;
[2026-05-25 09:10:47] [INFO ] Parsed PT model containing 173 places and 159 transitions and 401 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA MedleyA-PT-13-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 159/159 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 169 transition count 159
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 16 place count 157 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 157 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 156 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 156 transition count 146
Applied a total of 30 rules in 59 ms. Remains 156 /173 variables (removed 17) and now considering 146/159 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4109226559746309986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2723543035989313604.kers'
[2026-05-25 09:10:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4109226559746309986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2723543035989313604.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 156 cols 367 entries
Finished phase 1 with 124 SingleSign rule and 15 generalized
[2026-05-25 09:10:47] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2723543035989313604.kers
Total runtime 3 ms.
[2026-05-25 09:10:47] [INFO ] Implicit Places using invariants in 453 ms returned [35, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 493 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 154/173 places, 146/159 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 584 ms. Remains : 154/173 places, 146/159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 146/146 (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-14626529495699048666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14077197533715191712.kers'
[2026-05-25 09:10:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14626529495699048666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14077197533715191712.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 154 cols 362 entries
Finished phase 1 with 128 SingleSign rule and 11 generalized
[2026-05-25 09:10:47] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14077197533715191712.kers
Total runtime 1 ms.
[2026-05-25 09:10:48] [INFO ] Implicit Places using invariants in 234 ms returned []
[2026-05-25 09:10:48] [INFO ] Invariant cache hit.
[2026-05-25 09:10:48] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2026-05-25 09:10:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 146/300 variables, 154/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 0/300 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 184 constraints, problems are : Problem set: 0 solved, 145 unsolved in 19331 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/300 variables, 154/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 145/328 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/300 variables, and 335 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 49421ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 49435ms
Finished structural reductions in LTL mode , in 1 iterations and 49884 ms. Remains : 154/154 places, 146/146 transitions.
Support contains 26 out of 154 places after structural reductions.
[2026-05-25 09:11:37] [INFO ] Flatten gal took : 35 ms
[2026-05-25 09:11:37] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:11:37] [INFO ] Input system was already deterministic with 146 transitions.
RANDOM walk for 40000 steps (1159 resets) in 1107 ms. (36 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40004 steps (282 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (285 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
[2026-05-25 09:11:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/119 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 35/154 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 146/300 variables, 154/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/300 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 170 constraints, problems are : Problem set: 0 solved, 2 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 59/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/119 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 35/154 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 146/300 variables, 154/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/300 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 771ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 30 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 5 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(((X(X(p2))&&p1)||G(p2))))||p0)))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 146/146 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 147 transition count 139
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 147 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 144 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 144 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 143 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 141 transition count 133
Applied a total of 26 rules in 32 ms. Remains 141 /154 variables (removed 13) and now considering 133/146 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12591747944816277336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13834649448951534160.kers'
[2026-05-25 09:11:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12591747944816277336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13834649448951534160.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 141 cols 331 entries
Finished phase 1 with 115 SingleSign rule and 11 generalized
[2026-05-25 09:11:39] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13834649448951534160.kers
Total runtime 14 ms.
[2026-05-25 09:11:39] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-25 09:11:39] [INFO ] Invariant cache hit.
[2026-05-25 09:11:40] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2026-05-25 09:11:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/274 variables, 141/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 159 constraints, problems are : Problem set: 0 solved, 132 unsolved in 8963 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 133/274 variables, 141/163 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 132/295 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 13 (OVERLAPS) 0/274 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 300 constraints, problems are : Problem set: 0 solved, 132 unsolved in 25605 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 34587ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 34588ms
Starting structural reductions in LTL mode, iteration 1 : 141/154 places, 133/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34926 ms. Remains : 141/154 places, 133/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(((X(X(p2))&&p1)||G(p2))))||p0)))'
Stuttering acceptance computed with spot in 481 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-00
Product exploration explored 100000 steps with 2859 reset in 214 ms.
Product exploration explored 100000 steps with 2856 reset in 180 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge based reduction with 13 factoid took 110 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1130 resets) in 430 ms. (92 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (292 resets) in 324 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (291 resets) in 123 ms. (322 steps per ms) remains 1/3 properties
[2026-05-25 09:12:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/74 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/141 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 141/274 variables, and 16 constraints, problems are : Problem set: 1 solved, 0 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 14 factoid took 150 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Knowledge-based reduction took 901 ms.
Stuttering acceptance computed with spot in 347 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 133/133 transitions.
Applied a total of 0 rules in 6 ms. Remains 141 /141 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2026-05-25 09:12:16] [INFO ] Invariant cache hit.
[2026-05-25 09:12:17] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-25 09:12:17] [INFO ] Invariant cache hit.
[2026-05-25 09:12:17] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 141/141 places, 133/133 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1147 resets) in 209 ms. (190 steps per ms) remains 0/5 properties
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Knowledge-based reduction took 508 ms.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 2862 reset in 125 ms.
Product exploration explored 100000 steps with 2876 reset in 94 ms.
Spot run failed in 162 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/ltsmin6604611327913533274
[2026-05-25 09:12:18] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6604611327913533274
Running compilation step : cd /tmp/ltsmin6604611327913533274;'/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 513 ms.
Running link step : cd /tmp/ltsmin6604611327913533274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin6604611327913533274;'/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/stateBased6687031066069655876.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 133/133 transitions.
Applied a total of 0 rules in 4 ms. Remains 141 /141 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2026-05-25 09:12:33] [INFO ] Invariant cache hit.
[2026-05-25 09:12:33] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-25 09:12:33] [INFO ] Invariant cache hit.
[2026-05-25 09:12:34] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 141/141 places, 133/133 transitions.
Built C files in :
/tmp/ltsmin13792761803734340288
[2026-05-25 09:12:34] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13792761803734340288
Running compilation step : cd /tmp/ltsmin13792761803734340288;'/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 278 ms.
Running link step : cd /tmp/ltsmin13792761803734340288;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13792761803734340288;'/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/stateBased3120126028822000996.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 09:12:49] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:12:49] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:12:49] [INFO ] Time to serialize gal into /tmp/LTL16237623148088328288.gal : 3 ms
[2026-05-25 09:12:49] [INFO ] Time to serialize properties into /tmp/LTL11857738244759997628.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16237623148088328288.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4855220468269712141.hoa' '-atoms' '/tmp/LTL11857738244759997628.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11857738244759997628.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4855220468269712141.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t35, t38, t42, t50, t56, t59, t62, t65, t67, t82, t85, t96, Intersection with reach...231
Computing Next relation with stutter on 168 deadlock states
141 unique states visited
113 strongly connected components in search stack
143 transitions explored
141 items max in DFS search stack
405 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.11299,161572,1,0,4336,587093,309,4545,3990,1.11045e+06,8386
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-13-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property MedleyA-PT-13-LTLFireability-00 finished in 74717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(X(X(G(p1)))))))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 146/146 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 146
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 146 transition count 139
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 146 transition count 139
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 144 transition count 137
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 144 transition count 137
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 143 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 143 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 142 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 142 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 141 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 141 transition count 134
Applied a total of 25 rules in 9 ms. Remains 141 /154 variables (removed 13) and now considering 134/146 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17845688078927102093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8916677067346598767.kers'
[2026-05-25 09:12:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17845688078927102093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8916677067346598767.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 141 cols 331 entries
Finished phase 1 with 118 SingleSign rule and 9 generalized
[2026-05-25 09:12:54] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8916677067346598767.kers
Total runtime 2 ms.
[2026-05-25 09:12:54] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-25 09:12:54] [INFO ] Invariant cache hit.
[2026-05-25 09:12:54] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2026-05-25 09:12:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/275 variables, 141/158 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/275 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 159 constraints, problems are : Problem set: 0 solved, 133 unsolved in 11557 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/275 variables, 141/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 133/292 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 0/275 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 301 constraints, problems are : Problem set: 0 solved, 133 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 41619ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 41620ms
Starting structural reductions in LTL mode, iteration 1 : 141/154 places, 134/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41941 ms. Remains : 141/154 places, 134/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(X(X(G(p1)))))))'
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-02
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-02 finished in 42259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p1)) U (G((p0&&X(p1)))||(p0&&X(p1)&&G((p2&&(p3||G(p4))))))))'
Support contains 5 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 146/146 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 146
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 148 transition count 141
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 148 transition count 141
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 146 transition count 139
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 146 transition count 139
Applied a total of 15 rules in 5 ms. Remains 146 /154 variables (removed 8) and now considering 139/146 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15837744826885170264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12852179706707158814.kers'
[2026-05-25 09:13:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15837744826885170264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12852179706707158814.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 146 cols 346 entries
Finished phase 1 with 123 SingleSign rule and 9 generalized
[2026-05-25 09:13:36] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12852179706707158814.kers
Total runtime 1 ms.
[2026-05-25 09:13:37] [INFO ] Implicit Places using invariants in 812 ms returned []
[2026-05-25 09:13:37] [INFO ] Invariant cache hit.
[2026-05-25 09:13:37] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2026-05-25 09:13:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 139/285 variables, 146/172 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (OVERLAPS) 0/285 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 15895 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 139/285 variables, 146/172 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 138/310 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 323 constraints, problems are : Problem set: 0 solved, 138 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 45936ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 45937ms
Starting structural reductions in LTL mode, iteration 1 : 146/154 places, 139/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46951 ms. Remains : 146/154 places, 139/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p1)) U (G((p0&&X(p1)))||(p0&&X(p1)&&G((p2&&(p3||G(p4))))))))'
Stuttering acceptance computed with spot in 626 ms :[true, (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4))), (OR (NOT p1) (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (NOT p4) (NOT p2)), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-03
Product exploration explored 100000 steps with 2826 reset in 207 ms.
Product exploration explored 100000 steps with 2879 reset in 208 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Detected a total of 10/146 stabilizing places and 10/139 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge based reduction with 46 factoid took 178 ms. Reduced automaton from 10 states, 44 edges and 5 AP (stutter sensitive) to 10 states, 41 edges and 5 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40000 steps (1146 resets) in 524 ms. (76 steps per ms) remains 5/27 properties
BEST_FIRST walk for 40004 steps (303 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (332 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (302 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (288 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (332 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
[2026-05-25 09:14:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 30/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf19 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 47/82 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 64/146 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 139/285 variables, 146/164 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/285 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 164 constraints, problems are : Problem set: 1 solved, 4 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 30/35 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 47/82 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 64/146 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 139/285 variables, 146/164 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 4/168 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/285 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 168 constraints, problems are : Problem set: 1 solved, 4 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1179ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 334 ms.
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 139/139 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 146 transition count 110
Reduce places removed 29 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 1 with 31 rules applied. Total rules applied 60 place count 117 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 116 transition count 108
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 61 place count 116 transition count 80
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 118 place count 87 transition count 80
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 86 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 85 transition count 79
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 167 place count 62 transition count 56
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 181 place count 55 transition count 65
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 187 place count 55 transition count 59
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 193 place count 49 transition count 59
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 196 place count 49 transition count 56
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 200 place count 46 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 203 place count 46 transition count 52
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 204 place count 45 transition count 51
Iterating global reduction 7 with 1 rules applied. Total rules applied 205 place count 45 transition count 51
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 206 place count 44 transition count 50
Iterating global reduction 7 with 1 rules applied. Total rules applied 207 place count 44 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 208 place count 43 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 209 place count 42 transition count 49
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 210 place count 42 transition count 48
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 212 place count 40 transition count 48
Applied a total of 212 rules in 67 ms. Remains 40 /146 variables (removed 106) and now considering 48/139 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 40/146 places, 48/139 transitions.
RANDOM walk for 40000 steps (3586 resets) in 412 ms. (96 steps per ms) remains 3/4 properties
BEST_FIRST walk for 32309 steps (1206 resets) in 40 ms. (788 steps per ms) remains 0/3 properties
Found 1 invariant AP formulas.
Negative knowledge disproves property using: (G (AND (OR p0 p2) (OR p0 p3 p4) (OR p1 p2) (OR p1 p3 p4)))
Knowledge based reduction with 47 factoid took 166 ms. Proved property starting from automaton with 10 states, 41 edges and 5 AP (stutter sensitive
Knowledge-based reduction took 2347 ms.
FORMULA MedleyA-PT-13-LTLFireability-03 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyA-PT-13-LTLFireability-03 finished in 50424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p0))||G(p1)||G(p2)))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 146/146 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 146
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 146 transition count 139
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 146 transition count 139
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 144 transition count 137
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 144 transition count 137
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 143 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 143 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 142 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 142 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 141 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 141 transition count 134
Applied a total of 25 rules in 33 ms. Remains 141 /154 variables (removed 13) and now considering 134/146 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5640857643905201338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5160419535324631814.kers'
[2026-05-25 09:14:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5640857643905201338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5160419535324631814.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 141 cols 331 entries
Finished phase 1 with 118 SingleSign rule and 9 generalized
[2026-05-25 09:14:27] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5160419535324631814.kers
Total runtime 1 ms.
[2026-05-25 09:14:27] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 09:14:27] [INFO ] Invariant cache hit.
[2026-05-25 09:14:27] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2026-05-25 09:14:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/275 variables, 141/158 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/275 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 159 constraints, problems are : Problem set: 0 solved, 133 unsolved in 10217 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/275 variables, 141/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 133/292 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 4/299 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/275 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 299 constraints, problems are : Problem set: 0 solved, 133 unsolved in 24705 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 34954ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 34954ms
Starting structural reductions in LTL mode, iteration 1 : 141/154 places, 134/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35223 ms. Remains : 141/154 places, 134/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p0))||G(p1)||G(p2)))))'
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-04
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-04 finished in 35427 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||G(p1)))))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 146/146 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 152 transition count 112
Reduce places removed 33 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 1 with 35 rules applied. Total rules applied 69 place count 119 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 118 transition count 110
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 70 place count 118 transition count 82
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 127 place count 89 transition count 82
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 88 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 130 place count 87 transition count 81
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 135 place count 82 transition count 76
Iterating global reduction 5 with 5 rules applied. Total rules applied 140 place count 82 transition count 76
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 140 place count 82 transition count 73
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 146 place count 79 transition count 73
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 78 transition count 72
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 78 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 77 transition count 71
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 77 transition count 71
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 76 transition count 70
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 76 transition count 70
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 194 place count 55 transition count 49
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 208 place count 48 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 48 transition count 60
Applied a total of 209 rules in 45 ms. Remains 48 /154 variables (removed 106) and now considering 60/146 (removed 86) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8133433920971604790.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13646919405739533358.kers'
[2026-05-25 09:15:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8133433920971604790.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13646919405739533358.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 60 rows 48 cols 245 entries
Finished phase 1 with 29 SingleSign rule and 7 generalized
[2026-05-25 09:15:02] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-13646919405739533358.kers
Total runtime 11 ms.
[2026-05-25 09:15:02] [INFO ] Implicit Places using invariants in 97 ms returned [0, 12, 19, 23, 26]
[2026-05-25 09:15:02] [INFO ] Actually due to overlaps returned [12, 23, 0, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 111 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/154 places, 60/146 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 44 transition count 55
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 39 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 38 transition count 55
Applied a total of 12 rules in 6 ms. Remains 38 /44 variables (removed 6) and now considering 55/60 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4850730520034097548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5223477532345722859.kers'
[2026-05-25 09:15:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4850730520034097548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5223477532345722859.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 55 rows 38 cols 216 entries
Finished phase 1 with 26 SingleSign rule and 4 generalized
[2026-05-25 09:15:02] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5223477532345722859.kers
Total runtime 0 ms.
[2026-05-25 09:15:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 09:15:02] [INFO ] Invariant cache hit.
[2026-05-25 09:15:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 09:15:02] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/154 places, 55/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 278 ms. Remains : 38/154 places, 55/146 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||G(p1)))))'
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-05
Stuttering criterion allowed to conclude after 19 steps with 3 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-05 finished in 387 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 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 146/146 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 152 transition count 111
Reduce places removed 34 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 1 with 36 rules applied. Total rules applied 71 place count 118 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 117 transition count 109
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 72 place count 117 transition count 81
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 129 place count 88 transition count 81
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 87 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 132 place count 86 transition count 80
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 136 place count 82 transition count 76
Iterating global reduction 5 with 4 rules applied. Total rules applied 140 place count 82 transition count 76
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 140 place count 82 transition count 74
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 144 place count 80 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 79 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 79 transition count 73
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 78 transition count 72
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 78 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 77 transition count 71
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 77 transition count 71
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 198 place count 53 transition count 47
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 214 place count 45 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 45 transition count 58
Applied a total of 215 rules in 18 ms. Remains 45 /154 variables (removed 109) and now considering 58/146 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7778553823528210606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9898761198831241832.kers'
[2026-05-25 09:15:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7778553823528210606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9898761198831241832.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 58 rows 45 cols 239 entries
Finished phase 1 with 26 SingleSign rule and 7 generalized
[2026-05-25 09:15:02] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9898761198831241832.kers
Total runtime 0 ms.
[2026-05-25 09:15:02] [INFO ] Implicit Places using invariants in 83 ms returned [0, 11, 18, 22, 25]
[2026-05-25 09:15:02] [INFO ] Actually due to overlaps returned [11, 22, 0, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 84 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/154 places, 58/146 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 41 transition count 53
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 36 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 35 transition count 53
Applied a total of 12 rules in 4 ms. Remains 35 /41 variables (removed 6) and now considering 53/58 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3661374003682792968.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3709045168503414450.kers'
[2026-05-25 09:15:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3661374003682792968.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3709045168503414450.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 53 rows 35 cols 208 entries
Finished phase 1 with 23 SingleSign rule and 4 generalized
[2026-05-25 09:15:03] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3709045168503414450.kers
Total runtime 0 ms.
[2026-05-25 09:15:03] [INFO ] Implicit Places using invariants in 37 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/154 places, 53/146 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 54
Applied a total of 2 rules in 2 ms. Remains 33 /34 variables (removed 1) and now considering 54/53 (removed -1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12596032420998414578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4580056204374656381.kers'
[2026-05-25 09:15:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12596032420998414578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4580056204374656381.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 33 cols 214 entries
Finished phase 1 with 24 SingleSign rule and 2 generalized
[2026-05-25 09:15:03] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4580056204374656381.kers
Total runtime 0 ms.
[2026-05-25 09:15:03] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 09:15:03] [INFO ] Invariant cache hit.
[2026-05-25 09:15:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 09:15:03] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 33/154 places, 54/146 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 295 ms. Remains : 33/154 places, 54/146 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 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-06
Stuttering criterion allowed to conclude after 10 steps with 3 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-06 finished in 429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U p1)||X(X(F(p2)))))))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 146/146 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 152 transition count 113
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 120 transition count 113
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 65 place count 120 transition count 86
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 119 place count 93 transition count 86
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 92 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 91 transition count 85
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 127 place count 86 transition count 80
Iterating global reduction 4 with 5 rules applied. Total rules applied 132 place count 86 transition count 80
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 132 place count 86 transition count 77
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 138 place count 83 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 82 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 82 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 81 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 81 transition count 75
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 80 transition count 74
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 80 transition count 74
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 190 place count 57 transition count 51
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 206 place count 49 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 49 transition count 66
Applied a total of 207 rules in 40 ms. Remains 49 /154 variables (removed 105) and now considering 66/146 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7053468490715309207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2235543612262226070.kers'
[2026-05-25 09:15:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7053468490715309207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2235543612262226070.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 49 cols 319 entries
Finished phase 1 with 26 SingleSign rule and 10 generalized
[2026-05-25 09:15:03] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2235543612262226070.kers
Total runtime 0 ms.
[2026-05-25 09:15:03] [INFO ] Implicit Places using invariants in 78 ms returned [0, 8, 13, 20, 24, 27]
[2026-05-25 09:15:03] [INFO ] Actually due to overlaps returned [13, 24, 0, 27, 8]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 79 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/154 places, 66/146 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 44 transition count 62
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 40 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 39 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 37 transition count 65
Applied a total of 14 rules in 5 ms. Remains 37 /44 variables (removed 7) and now considering 65/66 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7978211471933234548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6606840936589765846.kers'
[2026-05-25 09:15:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7978211471933234548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6606840936589765846.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 37 cols 288 entries
Finished phase 1 with 25 SingleSign rule and 4 generalized
[2026-05-25 09:15:03] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6606840936589765846.kers
Total runtime 1 ms.
[2026-05-25 09:15:03] [INFO ] Implicit Places using invariants in 57 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/154 places, 65/146 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 67
Applied a total of 2 rules in 2 ms. Remains 35 /36 variables (removed 1) and now considering 67/65 (removed -2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2263046919822792161.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3981556997791651733.kers'
[2026-05-25 09:15:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2263046919822792161.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3981556997791651733.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 35 cols 294 entries
Finished phase 1 with 26 SingleSign rule and 2 generalized
[2026-05-25 09:15:03] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3981556997791651733.kers
Total runtime 0 ms.
[2026-05-25 09:15:03] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 09:15:03] [INFO ] Invariant cache hit.
[2026-05-25 09:15:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 09:15:03] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 35/154 places, 67/146 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 318 ms. Remains : 35/154 places, 67/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U p1)||X(X(F(p2)))))))'
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-07
Product exploration explored 100000 steps with 20218 reset in 129 ms.
Product exploration explored 100000 steps with 20170 reset in 165 ms.
Computed a total of 1 stabilizing places and 14 stable transitions
Computed a total of 1 stabilizing places and 14 stable transitions
Knowledge based reduction with 12 factoid took 71 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (7982 resets) in 139 ms. (285 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (1313 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1267 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
[2026-05-25 09:15:04] [INFO ] Invariant cache hit.
[2026-05-25 09:15:04] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/28 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/31 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/35 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/102 variables, 35/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 5/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 47 constraints, problems are : Problem set: 1 solved, 1 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 28/102 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/35 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 14 factoid took 160 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 516 ms.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2026-05-25 09:15:04] [INFO ] Invariant cache hit.
[2026-05-25 09:15:04] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 09:15:04] [INFO ] Invariant cache hit.
[2026-05-25 09:15:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 09:15:04] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2026-05-25 09:15:04] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2026-05-25 09:15:04] [INFO ] Invariant cache hit.
[2026-05-25 09:15:04] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 67/102 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/102 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 48 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 67/102 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 53/101 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 101 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1655 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2729ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2734ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2881 ms. Remains : 35/35 places, 67/67 transitions.
Computed a total of 1 stabilizing places and 14 stable transitions
Computed a total of 1 stabilizing places and 14 stable transitions
Knowledge based reduction with 6 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 268 steps (50 resets) in 6 ms. (38 steps per ms) remains 0/3 properties
Knowledge based reduction with 6 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 279 ms.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 20180 reset in 163 ms.
Product exploration explored 100000 steps with 20195 reset in 188 ms.
Built C files in :
/tmp/ltsmin15057378995321565435
[2026-05-25 09:15:08] [INFO ] Computing symmetric may disable matrix : 67 transitions.
[2026-05-25 09:15:08] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:15:08] [INFO ] Computing symmetric may enable matrix : 67 transitions.
[2026-05-25 09:15:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:15:08] [INFO ] Computing Do-Not-Accords matrix : 67 transitions.
[2026-05-25 09:15:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:15:08] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15057378995321565435
Running compilation step : cd /tmp/ltsmin15057378995321565435;'/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 198 ms.
Running link step : cd /tmp/ltsmin15057378995321565435;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15057378995321565435;'/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/stateBased7035981541611370503.hoa' '--buchi-type=spotba'
LTSmin run took 67 ms.
FORMULA MedleyA-PT-13-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-13-LTLFireability-07 finished in 5443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((F(p0) U p1)) U (p2 U p3))||G((p3 U p2))))'
Support contains 5 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 146/146 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 146
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 146 transition count 139
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 146 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 143 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 143 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 142 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 142 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 141 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 141 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 140 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 140 transition count 133
Applied a total of 27 rules in 10 ms. Remains 140 /154 variables (removed 14) and now considering 133/146 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17233277255294013019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14817012980697760903.kers'
[2026-05-25 09:15:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17233277255294013019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14817012980697760903.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 140 cols 329 entries
Finished phase 1 with 117 SingleSign rule and 9 generalized
[2026-05-25 09:15:08] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14817012980697760903.kers
Total runtime 1 ms.
[2026-05-25 09:15:08] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:15:08] [INFO ] Invariant cache hit.
[2026-05-25 09:15:09] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2026-05-25 09:15:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/158 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/273 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 160 constraints, problems are : Problem set: 0 solved, 132 unsolved in 11266 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/158 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 132/290 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 5/295 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 301 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 41314ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 41314ms
Starting structural reductions in LTL mode, iteration 1 : 140/154 places, 133/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41625 ms. Remains : 140/154 places, 133/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((F(p0) U p1)) U (p2 U p3))||G((p3 U p2))))'
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p2) (NOT p3)), (NOT p1), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) p1), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-10
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-10 finished in 42010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(p1||X(p2))))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 146/146 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 146
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 145 transition count 138
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 145 transition count 138
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 142 transition count 135
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 142 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 141 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 141 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 140 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 140 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 139 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 139 transition count 132
Applied a total of 29 rules in 6 ms. Remains 139 /154 variables (removed 15) and now considering 132/146 (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-3129838660524821851.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11822392104566042418.kers'
[2026-05-25 09:15:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3129838660524821851.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11822392104566042418.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 132 rows 139 cols 327 entries
Finished phase 1 with 116 SingleSign rule and 9 generalized
[2026-05-25 09:15:50] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11822392104566042418.kers
Total runtime 0 ms.
[2026-05-25 09:15:50] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-25 09:15:50] [INFO ] Invariant cache hit.
[2026-05-25 09:15:51] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2026-05-25 09:15:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/271 variables, 139/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/271 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 156 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8876 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/271 variables, 139/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 131/287 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/271 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 293 constraints, problems are : Problem set: 0 solved, 131 unsolved in 21065 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 29956ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 29957ms
Starting structural reductions in LTL mode, iteration 1 : 139/154 places, 132/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30281 ms. Remains : 139/154 places, 132/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(X(p1)||p2)))))'
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 16 ms. Proved property starting from automaton with 4 states, 6 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 18 ms.
FORMULA MedleyA-PT-13-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-13-LTLFireability-13 finished in 30728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 146/146 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 152 transition count 111
Reduce places removed 34 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 1 with 36 rules applied. Total rules applied 71 place count 118 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 117 transition count 109
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 72 place count 117 transition count 82
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 127 place count 89 transition count 82
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 88 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 130 place count 87 transition count 81
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 135 place count 82 transition count 76
Iterating global reduction 5 with 5 rules applied. Total rules applied 140 place count 82 transition count 76
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 140 place count 82 transition count 73
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 146 place count 79 transition count 73
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 78 transition count 72
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 78 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 77 transition count 71
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 77 transition count 71
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 76 transition count 70
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 76 transition count 70
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 198 place count 53 transition count 47
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 214 place count 45 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 45 transition count 62
Applied a total of 215 rules in 10 ms. Remains 45 /154 variables (removed 109) and now considering 62/146 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2974840032043913955.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7249929998081264503.kers'
[2026-05-25 09:16:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2974840032043913955.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7249929998081264503.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 62 rows 45 cols 311 entries
Finished phase 1 with 26 SingleSign rule and 7 generalized
[2026-05-25 09:16:21] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7249929998081264503.kers
Total runtime 0 ms.
[2026-05-25 09:16:21] [INFO ] Implicit Places using invariants in 56 ms returned [0, 10, 17, 21, 24]
[2026-05-25 09:16:21] [INFO ] Actually due to overlaps returned [10, 21, 0, 24]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 72 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/154 places, 62/146 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 41 transition count 57
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 36 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 35 transition count 57
Applied a total of 12 rules in 3 ms. Remains 35 /41 variables (removed 6) and now considering 57/62 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14053338745404646161.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5159843182890957091.kers'
[2026-05-25 09:16:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14053338745404646161.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5159843182890957091.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 57 rows 35 cols 256 entries
Finished phase 1 with 23 SingleSign rule and 4 generalized
[2026-05-25 09:16:21] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5159843182890957091.kers
Total runtime 0 ms.
[2026-05-25 09:16:21] [INFO ] Implicit Places using invariants in 53 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/154 places, 57/146 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 59
Applied a total of 2 rules in 3 ms. Remains 33 /34 variables (removed 1) and now considering 59/57 (removed -2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13484329286216694411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5356610439255480599.kers'
[2026-05-25 09:16:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13484329286216694411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5356610439255480599.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 59 rows 33 cols 266 entries
Finished phase 1 with 24 SingleSign rule and 2 generalized
[2026-05-25 09:16:21] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5356610439255480599.kers
Total runtime 0 ms.
[2026-05-25 09:16:21] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 09:16:21] [INFO ] Invariant cache hit.
[2026-05-25 09:16:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-25 09:16:21] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 33/154 places, 59/146 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 260 ms. Remains : 33/154 places, 59/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-15 finished in 320 ms.
All properties solved by simple procedures.
Total runtime 334982 ms.

BK_STOP 1779700581867

--------------------
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="MedleyA-PT-13"
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 MedleyA-PT-13, 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 r178-oct2-177969020000196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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