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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.9K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 18:21 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 28K 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-04-LTLFireability-00
FORMULA_NAME MedleyA-PT-04-LTLFireability-01
FORMULA_NAME MedleyA-PT-04-LTLFireability-02
FORMULA_NAME MedleyA-PT-04-LTLFireability-03
FORMULA_NAME MedleyA-PT-04-LTLFireability-04
FORMULA_NAME MedleyA-PT-04-LTLFireability-05
FORMULA_NAME MedleyA-PT-04-LTLFireability-06
FORMULA_NAME MedleyA-PT-04-LTLFireability-07
FORMULA_NAME MedleyA-PT-04-LTLFireability-08
FORMULA_NAME MedleyA-PT-04-LTLFireability-09
FORMULA_NAME MedleyA-PT-04-LTLFireability-10
FORMULA_NAME MedleyA-PT-04-LTLFireability-11
FORMULA_NAME MedleyA-PT-04-LTLFireability-12
FORMULA_NAME MedleyA-PT-04-LTLFireability-13
FORMULA_NAME MedleyA-PT-04-LTLFireability-14
FORMULA_NAME MedleyA-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779699094448

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-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 08:51:36] [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:51:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:51:36] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2026-05-25 08:51:36] [INFO ] Transformed 115 places.
[2026-05-25 08:51:36] [INFO ] Transformed 107 transitions.
[2026-05-25 08:51:36] [INFO ] Found NUPN structural information;
[2026-05-25 08:51:36] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-04-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 107
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 109 transition count 102
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 109 transition count 102
Applied a total of 11 rules in 38 ms. Remains 109 /115 variables (removed 6) and now considering 102/107 (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-12161326162226836847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3267397415296701847.kers'
[2026-05-25 08:51:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12161326162226836847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3267397415296701847.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 109 cols 289 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-25 08:51:36] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3267397415296701847.kers
Total runtime 1 ms.
[2026-05-25 08:51:36] [INFO ] Implicit Places using invariants in 328 ms returned []
[2026-05-25 08:51:36] [INFO ] Invariant cache hit.
[2026-05-25 08:51:37] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2026-05-25 08:51:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 102/211 variables, 109/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 10/157 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/211 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 161 constraints, problems are : Problem set: 0 solved, 101 unsolved in 12138 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 102/211 variables, 109/161 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 101/262 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 211/211 variables, and 264 constraints, problems are : Problem set: 0 solved, 101 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42230ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 42240ms
Starting structural reductions in LTL mode, iteration 1 : 109/115 places, 102/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42986 ms. Remains : 109/115 places, 102/107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2026-05-25 08:52:19] [INFO ] Invariant cache hit.
[2026-05-25 08:52:19] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 08:52:19] [INFO ] Invariant cache hit.
[2026-05-25 08:52:19] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 109/109 places, 102/102 transitions.
Support contains 32 out of 109 places after structural reductions.
[2026-05-25 08:52:19] [INFO ] Flatten gal took : 24 ms
[2026-05-25 08:52:19] [INFO ] Flatten gal took : 13 ms
[2026-05-25 08:52:19] [INFO ] Input system was already deterministic with 102 transitions.
Support contains 31 out of 109 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (1112 resets) in 1389 ms. (28 steps per ms) remains 8/31 properties
BEST_FIRST walk for 40003 steps (281 resets) in 261 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (334 resets) in 199 ms. (200 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (347 resets) in 212 ms. (187 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (332 resets) in 223 ms. (178 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (296 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (304 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (295 resets) in 90 ms. (439 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (303 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
[2026-05-25 08:52:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 54/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 22/86 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 102/188 variables, 86/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 23/211 variables, 23/123 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/211 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 123 constraints, problems are : Problem set: 1 solved, 6 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 45/53 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 33/86 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 102/188 variables, 86/99 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 3/102 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/103 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/104 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 23/211 variables, 23/127 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 3/130 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/211 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/211 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 130 constraints, problems are : Problem set: 1 solved, 6 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1656ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3222 ms.
Support contains 8 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 102/102 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 109 transition count 84
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 91 transition count 84
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 36 place count 91 transition count 76
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 52 place count 83 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 79 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 79 transition count 72
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 100 place count 59 transition count 52
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 59 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 58 transition count 51
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 56 transition count 50
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 55 transition count 49
Applied a total of 107 rules in 56 ms. Remains 55 /109 variables (removed 54) and now considering 49/102 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 55/109 places, 49/102 transitions.
RANDOM walk for 40000 steps (3380 resets) in 304 ms. (131 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1808 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1767 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1846 resets) in 252 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1866 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1788 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1810 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 5660 steps, run visited all 6 properties in 26 ms. (steps per millisecond=217 )
Probabilistic random walk after 5660 steps, saw 2822 distinct states, run finished after 29 ms. (steps per millisecond=195 ) properties seen :6
FORMULA MedleyA-PT-04-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 109 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 102
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' '!(F(G((G(p0) U p1))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 108 transition count 85
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 92 transition count 85
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 32 place count 92 transition count 79
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 86 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 84 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 84 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 84 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 83 transition count 76
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 56 transition count 50
Applied a total of 102 rules in 37 ms. Remains 56 /109 variables (removed 53) and now considering 50/102 (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-2048298098581780578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6289337107897082256.kers'
[2026-05-25 08:52:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2048298098581780578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6289337107897082256.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 50 rows 56 cols 187 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-25 08:52:27] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6289337107897082256.kers
Total runtime 0 ms.
[2026-05-25 08:52:27] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-25 08:52:27] [INFO ] Invariant cache hit.
[2026-05-25 08:52:27] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2026-05-25 08:52:27] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2026-05-25 08:52:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 50/105 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 1/106 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 3010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 48/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 1/106 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 122 constraints, problems are : Problem set: 0 solved, 48 unsolved in 7550 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 10584ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 10585ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/109 places, 50/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11029 ms. Remains : 56/109 places, 50/102 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U p1))))'
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-00
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-00 finished in 11520 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||X(p1)))||G(p2)) U p3) U X(p1))))'
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 98 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 98 transition count 91
Applied a total of 22 rules in 6 ms. Remains 98 /109 variables (removed 11) and now considering 91/102 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8116455526919620042.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4522968850858511760.kers'
[2026-05-25 08:52:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8116455526919620042.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4522968850858511760.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 98 cols 267 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-25 08:52:38] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4522968850858511760.kers
Total runtime 0 ms.
[2026-05-25 08:52:38] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 08:52:38] [INFO ] Invariant cache hit.
[2026-05-25 08:52:38] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-25 08:52:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5359 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/189 variables, and 217 constraints, problems are : Problem set: 0 solved, 90 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 35387ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 35388ms
Starting structural reductions in LTL mode, iteration 1 : 98/109 places, 91/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35534 ms. Remains : 98/109 places, 91/102 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||X(p1)))||G(p2)) U p3) U X(p1))))'
Stuttering acceptance computed with spot in 424 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p3)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-01
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-01 finished in 36005 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(p1)||p0))))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 108 transition count 84
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 91 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 90 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 36 place count 90 transition count 77
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 48 place count 84 transition count 77
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 51 place count 81 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 54 place count 81 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 81 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 80 transition count 73
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 3 with 44 rules applied. Total rules applied 100 place count 58 transition count 51
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 56 transition count 50
Applied a total of 103 rules in 30 ms. Remains 56 /109 variables (removed 53) and now considering 50/102 (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-9744652004831499377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7418794689246732217.kers'
[2026-05-25 08:53:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9744652004831499377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7418794689246732217.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 50 rows 56 cols 187 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-25 08:53:14] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7418794689246732217.kers
Total runtime 0 ms.
[2026-05-25 08:53:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 08:53:14] [INFO ] Invariant cache hit.
[2026-05-25 08:53:14] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2026-05-25 08:53:14] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2026-05-25 08:53:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 69 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2254 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 49/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 1/106 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 119 constraints, problems are : Problem set: 0 solved, 49 unsolved in 3718 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5996ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 5997ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/109 places, 50/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6180 ms. Remains : 56/109 places, 50/102 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(p1)||p0))))'
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-03
Product exploration explored 100000 steps with 14818 reset in 148 ms.
Product exploration explored 100000 steps with 14711 reset in 133 ms.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
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 11 factoid took 67 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 117 ms.
FORMULA MedleyA-PT-04-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-03 finished in 6671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((F(p0) U p1)||G(p2))) U X((p0 U p3))))'
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 101 transition count 94
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 101 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 100 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 100 transition count 93
Applied a total of 18 rules in 5 ms. Remains 100 /109 variables (removed 9) and now considering 93/102 (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-3245640772049218628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1062810799361590213.kers'
[2026-05-25 08:53:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3245640772049218628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1062810799361590213.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 100 cols 271 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-25 08:53:21] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1062810799361590213.kers
Total runtime 0 ms.
[2026-05-25 08:53:21] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 08:53:21] [INFO ] Invariant cache hit.
[2026-05-25 08:53:21] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2026-05-25 08:53:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/193 variables, 100/118 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 122 constraints, problems are : Problem set: 0 solved, 92 unsolved in 6421 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/193 variables, 100/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 92/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 219 constraints, problems are : Problem set: 0 solved, 92 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36457ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 36458ms
Starting structural reductions in LTL mode, iteration 1 : 100/109 places, 93/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36700 ms. Remains : 100/109 places, 93/102 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((F(p0) U p1)||G(p2))) U X((p0 U p3))))'
Stuttering acceptance computed with spot in 460 ms :[(NOT p3), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-04
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-04 finished in 37223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(G(p2)))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 101 transition count 94
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 101 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 100 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 100 transition count 93
Applied a total of 18 rules in 3 ms. Remains 100 /109 variables (removed 9) and now considering 93/102 (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-1253531077858279078.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13273537459430183968.kers'
[2026-05-25 08:53:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1253531077858279078.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13273537459430183968.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 100 cols 271 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-25 08:53:58] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13273537459430183968.kers
Total runtime 0 ms.
[2026-05-25 08:53:58] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 08:53:58] [INFO ] Invariant cache hit.
[2026-05-25 08:53:58] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 100/109 places, 93/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 100/109 places, 93/102 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(G(p2)))))'
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Computed a total of 100 stabilizing places and 93 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 100 transition count 93
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 15 factoid took 12 ms. Proved property starting from automaton with 6 states, 12 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 78 ms.
FORMULA MedleyA-PT-04-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-05 finished in 723 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((((!p1 U (p2||G(!p1))) U p3)||p0)))'
Support contains 4 out of 109 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 108 transition count 87
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 94 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 93 transition count 86
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 30 place count 93 transition count 80
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 42 place count 87 transition count 80
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 45 place count 84 transition count 77
Iterating global reduction 3 with 3 rules applied. Total rules applied 48 place count 84 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 48 place count 84 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 83 transition count 76
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 90 place count 63 transition count 56
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 63 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 62 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 61 transition count 55
Applied a total of 94 rules in 28 ms. Remains 61 /109 variables (removed 48) and now considering 55/102 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11851463354160586516.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7167167934642359169.kers'
[2026-05-25 08:53:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11851463354160586516.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7167167934642359169.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 55 rows 60 cols 193 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-25 08:53:59] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7167167934642359169.kers
Total runtime 0 ms.
[2026-05-25 08:53:59] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 08:53:59] [INFO ] Invariant cache hit.
[2026-05-25 08:53:59] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2026-05-25 08:53:59] [INFO ] Redundant transitions in 0 ms returned []
Running 53 sub problems to find dead transitions.
[2026-05-25 08:53:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 55/115 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 1/116 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/116 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 76 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2584 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 55/115 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 53/128 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/116 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/116 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 131 constraints, problems are : Problem set: 0 solved, 53 unsolved in 4646 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7282ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 7283ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/109 places, 55/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7508 ms. Remains : 61/109 places, 55/102 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((((!p1 U (p2||G(!p1))) U p3)||p0)))'
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p3))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-07
Product exploration explored 100000 steps with 31360 reset in 316 ms.
Product exploration explored 100000 steps with 31256 reset in 171 ms.
Computed a total of 61 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 55
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 5 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
RANDOM walk for 78 steps (6 resets) in 6 ms. (11 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 246 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p3))]
[2026-05-25 08:54:07] [INFO ] Invariant cache hit.
[2026-05-25 08:54:07] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 08:54:07] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-25 08:54:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:54:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 08:54:08] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2026-05-25 08:54:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 821 ms
[2026-05-25 08:54:08] [INFO ] Computed and/alt/rep : 51/75/51 causal constraints (skipped 2 transitions) in 6 ms.
[2026-05-25 08:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2026-05-25 08:54:09] [INFO ] Added : 32 causal constraints over 7 iterations in 269 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Knowledge-based reduction took 1976 ms.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p3))]
Support contains 4 out of 61 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2026-05-25 08:54:09] [INFO ] Invariant cache hit.
[2026-05-25 08:54:09] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 08:54:09] [INFO ] Invariant cache hit.
[2026-05-25 08:54:09] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2026-05-25 08:54:09] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 61/61 places, 55/55 transitions.
Computed a total of 61 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 55
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 5 factoid took 169 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
RANDOM walk for 101 steps (9 resets) in 4 ms. (20 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p3))]
[2026-05-25 08:54:09] [INFO ] Invariant cache hit.
[2026-05-25 08:54:09] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 08:54:09] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-25 08:54:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:54:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 08:54:10] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2026-05-25 08:54:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 127 ms
[2026-05-25 08:54:10] [INFO ] Computed and/alt/rep : 51/75/51 causal constraints (skipped 2 transitions) in 6 ms.
[2026-05-25 08:54:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2026-05-25 08:54:10] [INFO ] Added : 32 causal constraints over 7 iterations in 169 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Knowledge-based reduction took 982 ms.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 31356 reset in 77 ms.
Product exploration explored 100000 steps with 31211 reset in 91 ms.
Built C files in :
/tmp/ltsmin11486038650863797372
[2026-05-25 08:54:10] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2026-05-25 08:54:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:54:10] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2026-05-25 08:54:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:54:10] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2026-05-25 08:54:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:54:10] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11486038650863797372
Running compilation step : cd /tmp/ltsmin11486038650863797372;'/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 501 ms.
Running link step : cd /tmp/ltsmin11486038650863797372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin11486038650863797372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2280409767541755985.hoa' '--buchi-type=spotba'
LTSmin run took 91 ms.
FORMULA MedleyA-PT-04-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-04-LTLFireability-07 finished in 12269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1 U p2)))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 100 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 100 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 92
Applied a total of 20 rules in 9 ms. Remains 99 /109 variables (removed 10) and now considering 92/102 (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-2533876595553037544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5568712736796631362.kers'
[2026-05-25 08:54:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2533876595553037544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5568712736796631362.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 99 cols 269 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-25 08:54:11] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5568712736796631362.kers
Total runtime 0 ms.
[2026-05-25 08:54:11] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-25 08:54:11] [INFO ] Invariant cache hit.
[2026-05-25 08:54:11] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2026-05-25 08:54:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 122 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5952 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/191 variables, and 223 constraints, problems are : Problem set: 0 solved, 91 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 35993ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 35994ms
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 92/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36270 ms. Remains : 99/109 places, 92/102 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1 U p2)))'
Stuttering acceptance computed with spot in 200 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-09
Stuttering criterion allowed to conclude after 247 steps with 5 reset in 1 ms.
FORMULA MedleyA-PT-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-09 finished in 36520 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(X(p0))) U ((p1&&X(X(X(p0))))||X(X(X(G(p0))))))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 100 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 100 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 92
Applied a total of 20 rules in 2 ms. Remains 99 /109 variables (removed 10) and now considering 92/102 (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-4238965503018997473.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4925349006878145407.kers'
[2026-05-25 08:54:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4238965503018997473.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4925349006878145407.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 99 cols 269 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-25 08:54:47] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4925349006878145407.kers
Total runtime 1 ms.
[2026-05-25 08:54:47] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 08:54:47] [INFO ] Invariant cache hit.
[2026-05-25 08:54:48] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 92/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 99/109 places, 92/102 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(X(p0))) U (X(X(X(G(p0))))||(p1&&X(X(X(p0))))))))'
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-11 finished in 547 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((F(!p0)&&F(G(p1))))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 100 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 100 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 92
Applied a total of 20 rules in 2 ms. Remains 99 /109 variables (removed 10) and now considering 92/102 (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-16706457781380874753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16042086569065000420.kers'
[2026-05-25 08:54:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16706457781380874753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16042086569065000420.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 99 cols 269 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-25 08:54:48] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16042086569065000420.kers
Total runtime 0 ms.
[2026-05-25 08:54:48] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 08:54:48] [INFO ] Invariant cache hit.
[2026-05-25 08:54:48] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 92/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 99/109 places, 92/102 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(G(p1))))))'
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-12
Stuttering criterion allowed to conclude after 85 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-12 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 109 transition count 86
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 93 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 92 transition count 85
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 34 place count 92 transition count 78
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 48 place count 85 transition count 78
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 52 place count 81 transition count 74
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 81 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 56 place count 81 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 80 transition count 73
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 3 with 44 rules applied. Total rules applied 102 place count 58 transition count 51
Applied a total of 102 rules in 21 ms. Remains 58 /109 variables (removed 51) and now considering 51/102 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10872547250579904833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9679371482175074284.kers'
[2026-05-25 08:54:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10872547250579904833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9679371482175074284.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 51 rows 58 cols 195 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-25 08:54:48] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9679371482175074284.kers
Total runtime 0 ms.
[2026-05-25 08:54:48] [INFO ] Implicit Places using invariants in 53 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/109 places, 51/102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 50
Applied a total of 2 rules in 2 ms. Remains 56 /57 variables (removed 1) and now considering 50/51 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9278550735882939141.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1080936918252656289.kers'
[2026-05-25 08:54:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9278550735882939141.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1080936918252656289.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 50 rows 56 cols 192 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-25 08:54:49] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1080936918252656289.kers
Total runtime 0 ms.
[2026-05-25 08:54:49] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 08:54:49] [INFO ] Invariant cache hit.
[2026-05-25 08:54:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 08:54:49] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/109 places, 50/102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 56/109 places, 50/102 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-13
Stuttering criterion allowed to conclude after 8 steps with 2 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-13 finished in 421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U X(X(X(G(p1))))) U p2))))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 100 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 100 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 92
Applied a total of 20 rules in 2 ms. Remains 99 /109 variables (removed 10) and now considering 92/102 (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-18276027280034811763.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16622333059835730499.kers'
[2026-05-25 08:54:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18276027280034811763.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16622333059835730499.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 99 cols 269 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-25 08:54:49] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16622333059835730499.kers
Total runtime 0 ms.
[2026-05-25 08:54:49] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 08:54:49] [INFO ] Invariant cache hit.
[2026-05-25 08:54:49] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 92/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 99/109 places, 92/102 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U X(X(X(G(p1))))) U p2))))'
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 72 ms.
Product exploration explored 100000 steps with 33333 reset in 66 ms.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
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 8 factoid took 13 ms. Proved property starting from automaton with 8 states, 13 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 91 ms.
FORMULA MedleyA-PT-04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-14 finished in 719 ms.
All properties solved by simple procedures.
Total runtime 194021 ms.

BK_STOP 1779699290412

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-04"
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-04, 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-177969019900124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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