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-177969019900116.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-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.2K Mar 7 18:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 7 18:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 7 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 7 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:26 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 26K 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-03-LTLFireability-00
FORMULA_NAME MedleyA-PT-03-LTLFireability-01
FORMULA_NAME MedleyA-PT-03-LTLFireability-02
FORMULA_NAME MedleyA-PT-03-LTLFireability-03
FORMULA_NAME MedleyA-PT-03-LTLFireability-04
FORMULA_NAME MedleyA-PT-03-LTLFireability-05
FORMULA_NAME MedleyA-PT-03-LTLFireability-06
FORMULA_NAME MedleyA-PT-03-LTLFireability-07
FORMULA_NAME MedleyA-PT-03-LTLFireability-08
FORMULA_NAME MedleyA-PT-03-LTLFireability-09
FORMULA_NAME MedleyA-PT-03-LTLFireability-10
FORMULA_NAME MedleyA-PT-03-LTLFireability-11
FORMULA_NAME MedleyA-PT-03-LTLFireability-12
FORMULA_NAME MedleyA-PT-03-LTLFireability-13
FORMULA_NAME MedleyA-PT-03-LTLFireability-14
FORMULA_NAME MedleyA-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779699028656

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 08:50:30] [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 08:50:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:50:30] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2026-05-25 08:50:30] [INFO ] Transformed 108 places.
[2026-05-25 08:50:30] [INFO ] Transformed 100 transitions.
[2026-05-25 08:50:30] [INFO ] Found NUPN structural information;
[2026-05-25 08:50:30] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-03-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 102 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 102 transition count 95
Applied a total of 11 rules in 48 ms. Remains 102 /108 variables (removed 6) and now considering 95/100 (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-10779543620768968694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8861777751009052898.kers'
[2026-05-25 08:50:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10779543620768968694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8861777751009052898.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 95 rows 102 cols 261 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-25 08:50:30] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8861777751009052898.kers
Total runtime 1 ms.
[2026-05-25 08:50:31] [INFO ] Implicit Places using invariants in 273 ms returned []
[2026-05-25 08:50:31] [INFO ] Invariant cache hit.
[2026-05-25 08:50:31] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2026-05-25 08:50:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 95/197 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 129 constraints, problems are : Problem set: 0 solved, 94 unsolved in 7269 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 95/197 variables, 102/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 94/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 197/197 variables, and 239 constraints, problems are : Problem set: 0 solved, 94 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37360ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 37372ms
Starting structural reductions in LTL mode, iteration 1 : 102/108 places, 95/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38037 ms. Remains : 102/108 places, 95/100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2026-05-25 08:51:08] [INFO ] Invariant cache hit.
[2026-05-25 08:51:08] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 08:51:09] [INFO ] Invariant cache hit.
[2026-05-25 08:51:09] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 102/102 places, 95/95 transitions.
Support contains 39 out of 102 places after structural reductions.
[2026-05-25 08:51:09] [INFO ] Flatten gal took : 29 ms
[2026-05-25 08:51:09] [INFO ] Flatten gal took : 10 ms
[2026-05-25 08:51:09] [INFO ] Input system was already deterministic with 95 transitions.
RANDOM walk for 40000 steps (655 resets) in 1148 ms. (34 steps per ms) remains 3/36 properties
BEST_FIRST walk for 40001 steps (188 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (194 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (173 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
[2026-05-25 08:51:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/76 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/85 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/180 variables, 85/93 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/197 variables, 17/110 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 1/111 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 111 constraints, problems are : Problem set: 2 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/84 variables, 7/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 95/179 variables, 84/94 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/197 variables, 18/112 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 1/113 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 2/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/197 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 115 constraints, problems are : Problem set: 2 solved, 1 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 726ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 446 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=223 )
Parikh walk visited 1 properties in 4 ms.
FORMULA MedleyA-PT-03-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA MedleyA-PT-03-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-03-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 102 stabilizing places and 95 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 102 transition count 95
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 92 transition count 85
Applied a total of 20 rules in 10 ms. Remains 92 /102 variables (removed 10) and now considering 85/95 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15746902144688564129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4869829494857390889.kers'
[2026-05-25 08:51:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15746902144688564129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4869829494857390889.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 85 rows 92 cols 241 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-25 08:51:11] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4869829494857390889.kers
Total runtime 1 ms.
[2026-05-25 08:51:11] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-25 08:51:11] [INFO ] Invariant cache hit.
[2026-05-25 08:51:11] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2026-05-25 08:51:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 103 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4580 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 84/187 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 177/177 variables, and 201 constraints, problems are : Problem set: 0 solved, 84 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34654ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 34656ms
Starting structural reductions in LTL mode, iteration 1 : 92/102 places, 85/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34918 ms. Remains : 92/102 places, 85/95 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Stuttering acceptance computed with spot in 409 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-00 finished in 35463 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(X(X((p1 U (p2||G(p1))))))) U (G((p0&&X(X(X((p1 U (p2||G(p1))))))))||(X(X(X((p1 U (p2||G(p1))))))&&p3))))'
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 92 transition count 85
Applied a total of 20 rules in 58 ms. Remains 92 /102 variables (removed 10) and now considering 85/95 (removed 10) transitions.
[2026-05-25 08:51:46] [INFO ] Invariant cache hit.
[2026-05-25 08:51:46] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 08:51:46] [INFO ] Invariant cache hit.
[2026-05-25 08:51:46] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 92/102 places, 85/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 92/102 places, 85/95 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(X(X((p1 U (p2||G(p1))))))) U (G((p0&&X(X(X((p1 U (p2||G(p1))))))))||(X(X(X((p1 U (p2||G(p1))))))&&p3))))'
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 264 ms.
Product exploration explored 100000 steps with 25000 reset in 143 ms.
Computed a total of 92 stabilizing places and 85 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 92 transition count 85
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 15 factoid took 82 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 3236 steps (51 resets) in 20 ms. (154 steps per ms) remains 0/3 properties
Knowledge based reduction with 15 factoid took 90 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 437 ms.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 92 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2026-05-25 08:51:48] [INFO ] Invariant cache hit.
[2026-05-25 08:51:48] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-25 08:51:48] [INFO ] Invariant cache hit.
[2026-05-25 08:51:48] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 92/92 places, 85/85 transitions.
Computed a total of 92 stabilizing places and 85 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 92 transition count 85
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 6079 steps (98 resets) in 29 ms. (202 steps per ms) remains 0/3 properties
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 380 ms.
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 77 ms.
Product exploration explored 100000 steps with 25000 reset in 120 ms.
Spot run failed in 74 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/ltsmin291498671645897811
[2026-05-25 08:51:49] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin291498671645897811
Running compilation step : cd /tmp/ltsmin291498671645897811;'/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 316 ms.
Running link step : cd /tmp/ltsmin291498671645897811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin291498671645897811;'/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/stateBased16570787199726453333.hoa' '--buchi-type=spotba'
LTSmin run took 38 ms.
FORMULA MedleyA-PT-03-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-03-LTLFireability-01 finished in 3159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p0)&&F(p1)))))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 92 transition count 85
Applied a total of 20 rules in 4 ms. Remains 92 /102 variables (removed 10) and now considering 85/95 (removed 10) transitions.
[2026-05-25 08:51:49] [INFO ] Invariant cache hit.
[2026-05-25 08:51:49] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 08:51:49] [INFO ] Invariant cache hit.
[2026-05-25 08:51:49] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 92/102 places, 85/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 92/102 places, 85/95 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p0)&&F(p1)))))))'
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-03
Product exploration explored 100000 steps with 20000 reset in 73 ms.
Product exploration explored 100000 steps with 20000 reset in 58 ms.
Computed a total of 92 stabilizing places and 85 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 92 transition count 85
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 10 ms. Proved property starting from automaton with 6 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 86 ms.
FORMULA MedleyA-PT-03-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLFireability-03 finished in 600 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)&&(p2||X((p2 U G(!p2)))))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 93 transition count 86
Applied a total of 18 rules in 7 ms. Remains 93 /102 variables (removed 9) and now considering 86/95 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1537034319753157916.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3616514693161948988.kers'
[2026-05-25 08:51:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1537034319753157916.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3616514693161948988.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 93 cols 243 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-25 08:51:50] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3616514693161948988.kers
Total runtime 0 ms.
[2026-05-25 08:51:50] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-25 08:51:50] [INFO ] Invariant cache hit.
[2026-05-25 08:51:50] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-05-25 08:51:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 86/179 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/179 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 113 constraints, problems are : Problem set: 0 solved, 85 unsolved in 7210 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 85/198 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/179 variables, and 212 constraints, problems are : Problem set: 0 solved, 85 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37240ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 37240ms
Starting structural reductions in LTL mode, iteration 1 : 93/102 places, 86/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37507 ms. Remains : 93/102 places, 86/95 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)&&(p2||X((p2 U G(!p2)))))))'
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), p2, p2, true]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-04
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-04 finished in 37880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 77
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 84 transition count 77
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 36 place count 84 transition count 68
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 54 place count 75 transition count 68
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 71 transition count 64
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 71 transition count 64
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 2 with 42 rules applied. Total rules applied 104 place count 50 transition count 43
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 50 transition count 43
Applied a total of 105 rules in 38 ms. Remains 50 /102 variables (removed 52) and now considering 43/95 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3985741603628017239.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13525688564769271254.kers'
[2026-05-25 08:52:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3985741603628017239.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13525688564769271254.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 43 rows 50 cols 167 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-25 08:52:28] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13525688564769271254.kers
Total runtime 0 ms.
[2026-05-25 08:52:28] [INFO ] Implicit Places using invariants in 152 ms returned []
[2026-05-25 08:52:28] [INFO ] Invariant cache hit.
[2026-05-25 08:52:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 08:52:28] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2026-05-25 08:52:28] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2026-05-25 08:52:28] [INFO ] Invariant cache hit.
[2026-05-25 08:52:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 43/93 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/93 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 59 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 43/93 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 42/101 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/93 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 101 constraints, problems are : Problem set: 0 solved, 42 unsolved in 4591 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5715ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 5716ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/102 places, 43/95 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6146 ms. Remains : 50/102 places, 43/95 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-05
Stuttering criterion allowed to conclude after 53 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-05 finished in 6285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 93 transition count 86
Applied a total of 18 rules in 2 ms. Remains 93 /102 variables (removed 9) and now considering 86/95 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8727671679802469875.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16469154615147512569.kers'
[2026-05-25 08:52:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8727671679802469875.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16469154615147512569.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 93 cols 243 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-25 08:52:34] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16469154615147512569.kers
Total runtime 1 ms.
[2026-05-25 08:52:34] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 08:52:34] [INFO ] Invariant cache hit.
[2026-05-25 08:52:34] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-05-25 08:52:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/179 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 109 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4778 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/179 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 85/195 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/179 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/179 variables, and 204 constraints, problems are : Problem set: 0 solved, 85 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 34799ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 34801ms
Starting structural reductions in LTL mode, iteration 1 : 93/102 places, 86/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34926 ms. Remains : 93/102 places, 86/95 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Stuttering acceptance computed with spot in 184 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-06 finished in 35134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((F(p0)||X(p1)||G(p2)))))&&F(p3)))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 95 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 95 transition count 88
Applied a total of 14 rules in 2 ms. Remains 95 /102 variables (removed 7) and now considering 88/95 (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-5488957888793099368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2286151492981072968.kers'
[2026-05-25 08:53:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5488957888793099368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2286151492981072968.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 88 rows 95 cols 247 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-25 08:53:09] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2286151492981072968.kers
Total runtime 0 ms.
[2026-05-25 08:53:09] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 08:53:09] [INFO ] Invariant cache hit.
[2026-05-25 08:53:09] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2026-05-25 08:53:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/183 variables, 95/106 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 107 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3765 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/183 variables, 95/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 87/194 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 7/201 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/183 variables, and 216 constraints, problems are : Problem set: 0 solved, 87 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33784ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 33785ms
Starting structural reductions in LTL mode, iteration 1 : 95/102 places, 88/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33945 ms. Remains : 95/102 places, 88/95 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((F(p0)||X(p1)||G(p2)))))&&F(p3)))'
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-07
Stuttering criterion allowed to conclude after 128 steps with 3 reset in 1 ms.
FORMULA MedleyA-PT-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-07 finished in 34306 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)&&X(X(X(X(F(p1)))))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 92 transition count 85
Applied a total of 20 rules in 2 ms. Remains 92 /102 variables (removed 10) and now considering 85/95 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-426616460797228204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5818366867803132178.kers'
[2026-05-25 08:53:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-426616460797228204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5818366867803132178.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 85 rows 92 cols 241 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-25 08:53:43] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5818366867803132178.kers
Total runtime 1 ms.
[2026-05-25 08:53:44] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 08:53:44] [INFO ] Invariant cache hit.
[2026-05-25 08:53:44] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2026-05-25 08:53:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 103 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3815 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 84/187 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 13 (OVERLAPS) 0/177 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 177/177 variables, and 203 constraints, problems are : Problem set: 0 solved, 84 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 33861ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 33861ms
Starting structural reductions in LTL mode, iteration 1 : 92/102 places, 85/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34036 ms. Remains : 92/102 places, 85/95 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)&&X(X(X(X(F(p1)))))))'
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-08
Stuttering criterion allowed to conclude after 108 steps with 2 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-08 finished in 34309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(!p1))||(F(p2)&&X(X(p3)))))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 101 transition count 76
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 83 transition count 76
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 36 place count 83 transition count 67
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 54 place count 74 transition count 67
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 70 transition count 63
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 70 transition count 63
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 100 place count 51 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 50 transition count 43
Applied a total of 101 rules in 8 ms. Remains 50 /102 variables (removed 52) and now considering 43/95 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10478338976325556510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15409572624635930813.kers'
[2026-05-25 08:54:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10478338976325556510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15409572624635930813.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 43 rows 49 cols 157 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-25 08:54:18] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15409572624635930813.kers
Total runtime 0 ms.
[2026-05-25 08:54:18] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 08:54:18] [INFO ] Invariant cache hit.
[2026-05-25 08:54:18] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2026-05-25 08:54:18] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2026-05-25 08:54:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 43/93 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/93 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 58 constraints, problems are : Problem set: 0 solved, 42 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 43/93 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 100 constraints, problems are : Problem set: 0 solved, 42 unsolved in 2534 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3538ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 3539ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/102 places, 43/95 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3708 ms. Remains : 50/102 places, 43/95 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&F(p1))||(F(p2)&&X(X(p3)))))))'
Stuttering acceptance computed with spot in 415 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-09
Product exploration explored 100000 steps with 5620 reset in 116 ms.
Product exploration explored 100000 steps with 5559 reset in 134 ms.
Computed a total of 50 stabilizing places and 43 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 43
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 25 factoid took 25 ms. Proved property starting from automaton with 9 states, 24 edges and 4 AP (stutter insensitive
Knowledge-based reduction took 83 ms.
FORMULA MedleyA-PT-03-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLFireability-09 finished in 4556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(p1)))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 93 transition count 86
Applied a total of 18 rules in 3 ms. Remains 93 /102 variables (removed 9) and now considering 86/95 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18335997573616440170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16020857402634678241.kers'
[2026-05-25 08:54:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18335997573616440170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16020857402634678241.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 93 cols 243 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-25 08:54:22] [INFO ] Computed 8 invariants in 4 ms
Computed 8 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16020857402634678241.kers
Total runtime 5 ms.
[2026-05-25 08:54:22] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 08:54:22] [INFO ] Invariant cache hit.
[2026-05-25 08:54:23] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-05-25 08:54:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/103 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 104 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4279 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/104 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 85/189 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/179 variables, and 201 constraints, problems are : Problem set: 0 solved, 85 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34341ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 34341ms
Starting structural reductions in LTL mode, iteration 1 : 93/102 places, 86/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34573 ms. Remains : 93/102 places, 86/95 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(p1)))))'
Stuttering acceptance computed with spot in 399 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLFireability-13 finished in 34999 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)||(p1&&F(G(p2))))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 93 transition count 86
Applied a total of 18 rules in 6 ms. Remains 93 /102 variables (removed 9) and now considering 86/95 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-318457956733096929.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10253209113173229087.kers'
[2026-05-25 08:54:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-318457956733096929.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10253209113173229087.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 93 cols 243 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-25 08:54:57] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10253209113173229087.kers
Total runtime 0 ms.
[2026-05-25 08:54:57] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 08:54:57] [INFO ] Invariant cache hit.
[2026-05-25 08:54:58] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 93/102 places, 86/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 93/102 places, 86/95 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)||(p1&&F(G(p2))))))'
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Computed a total of 93 stabilizing places and 86 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 93 transition count 86
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 11 ms. Proved property starting from automaton with 4 states, 6 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 53 ms.
FORMULA MedleyA-PT-03-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLFireability-14 finished in 700 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((F(p0)&&G(p1))))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 101 transition count 75
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 82 transition count 75
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 38 place count 82 transition count 67
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 54 place count 74 transition count 67
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 71 transition count 64
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 71 transition count 64
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 104 place count 49 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 48 transition count 41
Applied a total of 105 rules in 26 ms. Remains 48 /102 variables (removed 54) and now considering 41/95 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16117399032355877317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-783654875994079978.kers'
[2026-05-25 08:54:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16117399032355877317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-783654875994079978.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 41 rows 47 cols 153 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-25 08:54:58] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-783654875994079978.kers
Total runtime 1 ms.
[2026-05-25 08:54:58] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 08:54:58] [INFO ] Invariant cache hit.
[2026-05-25 08:54:58] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2026-05-25 08:54:58] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2026-05-25 08:54:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/88 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/89 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 56 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1614 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/88 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 40/95 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/89 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/89 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 96 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2006 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3641ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 3641ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/102 places, 41/95 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3833 ms. Remains : 48/102 places, 41/95 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((F(p0)&&G(p1))))'
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-03-LTLFireability-15
Product exploration explored 100000 steps with 5975 reset in 70 ms.
Product exploration explored 100000 steps with 5936 reset in 93 ms.
Computed a total of 48 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 12 ms. Proved property starting from automaton with 3 states, 6 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 57 ms.
FORMULA MedleyA-PT-03-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLFireability-15 finished in 4232 ms.
All properties solved by simple procedures.
Total runtime 272329 ms.

BK_STOP 1779699303105

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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-03"
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-03, 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-177969019900116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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