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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 18:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 7 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 7 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 46K 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-14-LTLFireability-00
FORMULA_NAME MedleyA-PT-14-LTLFireability-01
FORMULA_NAME MedleyA-PT-14-LTLFireability-02
FORMULA_NAME MedleyA-PT-14-LTLFireability-03
FORMULA_NAME MedleyA-PT-14-LTLFireability-04
FORMULA_NAME MedleyA-PT-14-LTLFireability-05
FORMULA_NAME MedleyA-PT-14-LTLFireability-06
FORMULA_NAME MedleyA-PT-14-LTLFireability-07
FORMULA_NAME MedleyA-PT-14-LTLFireability-08
FORMULA_NAME MedleyA-PT-14-LTLFireability-09
FORMULA_NAME MedleyA-PT-14-LTLFireability-10
FORMULA_NAME MedleyA-PT-14-LTLFireability-11
FORMULA_NAME MedleyA-PT-14-LTLFireability-12
FORMULA_NAME MedleyA-PT-14-LTLFireability-13
FORMULA_NAME MedleyA-PT-14-LTLFireability-14
FORMULA_NAME MedleyA-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779700375188

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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:12:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:12:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:12:56] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2026-05-25 09:12:56] [INFO ] Transformed 184 places.
[2026-05-25 09:12:56] [INFO ] Transformed 178 transitions.
[2026-05-25 09:12:56] [INFO ] Found NUPN structural information;
[2026-05-25 09:12:56] [INFO ] Parsed PT model containing 184 places and 178 transitions and 492 arcs in 188 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 2 formulas.
FORMULA MedleyA-PT-14-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 178/178 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 154 transition count 148
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 154 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 151 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 151 transition count 145
Applied a total of 66 rules in 46 ms. Remains 151 /184 variables (removed 33) and now considering 145/178 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9642264639323332003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10668768578086793042.kers'
[2026-05-25 09:12:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9642264639323332003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10668768578086793042.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 151 cols 420 entries
Finished phase 1 with 118 SingleSign rule and 9 generalized
[2026-05-25 09:12:56] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10668768578086793042.kers
Total runtime 1 ms.
[2026-05-25 09:12:57] [INFO ] Implicit Places using invariants in 400 ms returned [41, 79, 118]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 432 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 148/184 places, 145/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 498 ms. Remains : 148/184 places, 145/178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 145/145 transitions.
Applied a total of 0 rules in 13 ms. Remains 148 /148 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3164844365877317074.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10555123577381638016.kers'
[2026-05-25 09:12:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3164844365877317074.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10555123577381638016.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 148 cols 414 entries
Finished phase 1 with 121 SingleSign rule and 6 generalized
[2026-05-25 09:12:57] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10555123577381638016.kers
Total runtime 1 ms.
[2026-05-25 09:12:57] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-25 09:12:57] [INFO ] Invariant cache hit.
[2026-05-25 09:12:57] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2026-05-25 09:12:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 17/38 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/38 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 145/293 variables, 148/186 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 1/187 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 1/188 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 1/189 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/189 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/189 constraints. Problems are: Problem set: 6 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 189 constraints, problems are : Problem set: 6 solved, 138 unsolved in 15988 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 6 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 7/148 variables, 16/19 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 2/21 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 19/40 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/40 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 145/293 variables, 148/188 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 138/326 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 4/330 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 2/332 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 1/333 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 1/334 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 1/335 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 1/336 constraints. Problems are: Problem set: 6 solved, 138 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/293 variables, 6/342 constraints. Problems are: Problem set: 6 solved, 138 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/293 variables, and 342 constraints, problems are : Problem set: 6 solved, 138 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 138/144 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 46057ms problems are : Problem set: 6 solved, 138 unsolved
Search for dead transitions found 6 dead transitions in 46068ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 148/148 places, 139/145 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 146 transition count 139
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 146 /148 variables (removed 2) and now considering 139/139 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3577674039046598898.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4944443885786740032.kers'
[2026-05-25 09:13:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3577674039046598898.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4944443885786740032.kers]
Culling trivial invariants: removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 139 rows 145 cols 389 entries
Finished phase 1 with 120 SingleSign rule and 6 generalized
[2026-05-25 09:13:43] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4944443885786740032.kers
Total runtime 1 ms.
[2026-05-25 09:13:43] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-25 09:13:43] [INFO ] Invariant cache hit.
[2026-05-25 09:13:43] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/148 places, 139/145 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46608 ms. Remains : 146/148 places, 139/145 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 35 out of 145 places after structural reductions.
[2026-05-25 09:13:44] [INFO ] Flatten gal took : 49 ms
[2026-05-25 09:13:44] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:13:44] [INFO ] Input system was already deterministic with 139 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (8 resets) in 1799 ms. (22 steps per ms) remains 8/31 properties
BEST_FIRST walk for 40001 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3869768062893799217.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2975733213490348188.kers'
[2026-05-25 09:13:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3869768062893799217.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2975733213490348188.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 145 cols 389 entries
Finished phase 1 with 120 SingleSign rule and 6 generalized
[2026-05-25 09:13:45] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2975733213490348188.kers
Total runtime 0 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 65/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 36/109 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 23/132 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 132/264 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 19/283 variables, 12/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/284 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/284 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 164 constraints, problems are : Problem set: 0 solved, 6 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 65/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 36/109 variables, 8/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 23/132 variables, 5/20 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 132/264 variables, 132/152 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 1/153 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/153 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 19/283 variables, 12/165 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 3/168 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 2/170 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/171 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 1/172 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/172 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/284 variables, 0/172 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 172 constraints, problems are : Problem set: 4 solved, 2 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1014ms problems are : Problem set: 4 solved, 2 unsolved
Finished Parikh walk after 1445 steps, including 30 resets, run visited all 2 properties in 8 ms. (steps per millisecond=180 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 12 ms.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-14-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 272 edges and 145 vertex of which 142 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 139/139 transitions.
Graph (complete) has 272 edges and 145 vertex of which 142 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 141 transition count 130
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 133 transition count 130
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 17 place count 133 transition count 111
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 55 place count 114 transition count 111
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 107 transition count 104
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 107 transition count 104
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 69 place count 107 transition count 101
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 104 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 102 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 102 transition count 99
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 121 place count 81 transition count 78
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 147 place count 68 transition count 93
Applied a total of 147 rules in 40 ms. Remains 68 /145 variables (removed 77) and now considering 93/139 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13038915560421359194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12773007965011714424.kers'
[2026-05-25 09:13:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13038915560421359194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12773007965011714424.kers]
Normalized transition count is 92 out of 93 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 92 rows 67 cols 423 entries
Finished phase 1 with 44 SingleSign rule and 6 generalized
[2026-05-25 09:13:46] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12773007965011714424.kers
Total runtime 3 ms.
[2026-05-25 09:13:46] [INFO ] Implicit Places using invariants in 104 ms returned [6, 10, 24, 28, 42, 46]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 119 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/145 places, 93/139 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 62 transition count 90
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 59 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 53 transition count 92
Applied a total of 18 rules in 7 ms. Remains 53 /62 variables (removed 9) and now considering 92/93 (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-3923334324425982750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2951603957820749552.kers'
[2026-05-25 09:13:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3923334324425982750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2951603957820749552.kers]
Normalized transition count is 91 out of 92 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 91 rows 52 cols 395 entries
Finished phase 1 with 38 SingleSign rule and 3 generalized
[2026-05-25 09:13:46] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2951603957820749552.kers
Total runtime 0 ms.
[2026-05-25 09:13:46] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 09:13:47] [INFO ] Invariant cache hit.
[2026-05-25 09:13:47] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 09:13:47] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [11, 24, 37]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 176 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/145 places, 92/139 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 91
Applied a total of 2 rules in 4 ms. Remains 49 /50 variables (removed 1) and now considering 91/92 (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-10783760449627904375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5536669458672153087.kers'
[2026-05-25 09:13:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10783760449627904375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5536669458672153087.kers]
Normalized transition count is 90 out of 91 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 90 rows 48 cols 348 entries
Finished phase 1 with 38 SingleSign rule and 2 generalized
[2026-05-25 09:13:47] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5536669458672153087.kers
Total runtime 0 ms.
[2026-05-25 09:13:47] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 09:13:47] [INFO ] Invariant cache hit.
[2026-05-25 09:13:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-25 09:13:47] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 49/145 places, 91/139 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 466 ms. Remains : 49/145 places, 91/139 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 368 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-14-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-00 finished in 945 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(p0))&&F((p1&&X(F(p2)))))))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 139/139 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 142 transition count 139
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 135 transition count 132
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 135 transition count 132
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 133 transition count 130
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 133 transition count 130
Applied a total of 21 rules in 7 ms. Remains 133 /145 variables (removed 12) and now considering 130/139 (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-7693487753720217667.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16599423891488321773.kers'
[2026-05-25 09:13:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7693487753720217667.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16599423891488321773.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 133 cols 364 entries
Finished phase 1 with 109 SingleSign rule and 6 generalized
[2026-05-25 09:13:47] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16599423891488321773.kers
Total runtime 1 ms.
[2026-05-25 09:13:47] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 09:13:47] [INFO ] Invariant cache hit.
[2026-05-25 09:13:47] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-25 09:13:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 130/263 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/263 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 160 constraints, problems are : Problem set: 0 solved, 129 unsolved in 10037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 130/263 variables, 133/161 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 129/290 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 7/301 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 15 (OVERLAPS) 0/263 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 301 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 40071ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40072ms
Starting structural reductions in LTL mode, iteration 1 : 133/145 places, 130/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40338 ms. Remains : 133/145 places, 130/139 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(p0))&&F((p1&&X(F(p2)))))))'
Stuttering acceptance computed with spot in 452 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 214 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 1 ms.
FORMULA MedleyA-PT-14-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLFireability-01 finished in 41061 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)))'
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 139/139 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 142 transition count 139
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 134 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 134 transition count 131
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 132 transition count 129
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 132 transition count 129
Applied a total of 23 rules in 9 ms. Remains 132 /145 variables (removed 13) and now considering 129/139 (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-1090096825442523427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2695841040480004625.kers'
[2026-05-25 09:14:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1090096825442523427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2695841040480004625.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 132 cols 362 entries
Finished phase 1 with 108 SingleSign rule and 6 generalized
[2026-05-25 09:14:28] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2695841040480004625.kers
Total runtime 1 ms.
[2026-05-25 09:14:28] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 09:14:28] [INFO ] Invariant cache hit.
[2026-05-25 09:14:28] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2026-05-25 09:14:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 129/261 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/261 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 159 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8221 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 129/261 variables, 132/160 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 128/288 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/261 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 261/261 variables, and 297 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 38263ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38265ms
Starting structural reductions in LTL mode, iteration 1 : 132/145 places, 129/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38438 ms. Remains : 132/145 places, 129/139 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)))'
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-02
Product exploration explored 100000 steps with 1559 reset in 161 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 0 ms.
FORMULA MedleyA-PT-14-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLFireability-02 finished in 38731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((F(p1)&&X(G(p2))) U (p3&&X(F(p1))))))'
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 139/139 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 142 transition count 139
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 134 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 134 transition count 131
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 132 transition count 129
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 132 transition count 129
Applied a total of 23 rules in 10 ms. Remains 132 /145 variables (removed 13) and now considering 129/139 (removed 10) transitions.
[2026-05-25 09:15:07] [INFO ] Invariant cache hit.
[2026-05-25 09:15:07] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-25 09:15:07] [INFO ] Invariant cache hit.
[2026-05-25 09:15:07] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 132/145 places, 129/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 132/145 places, 129/139 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((F(p1)&&X(G(p2))) U (p3&&X(F(p1))))))'
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p0) (NOT p3)), (NOT p0), (NOT p1), (NOT p2), (OR (NOT p3) (NOT p1)), true]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-14-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-04 finished in 548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 139/139 transitions.
Graph (complete) has 272 edges and 145 vertex of which 142 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 141 transition count 131
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 134 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 133 transition count 130
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 17 place count 133 transition count 113
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 51 place count 116 transition count 113
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 59 place count 108 transition count 105
Iterating global reduction 3 with 8 rules applied. Total rules applied 67 place count 108 transition count 105
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 67 place count 108 transition count 101
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 75 place count 104 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 102 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 102 transition count 99
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 119 place count 82 transition count 79
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 141 place count 71 transition count 92
Applied a total of 141 rules in 14 ms. Remains 71 /145 variables (removed 74) and now considering 92/139 (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-10180252463206295270.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14430583036575179216.kers'
[2026-05-25 09:15:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10180252463206295270.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14430583036575179216.kers]
Normalized transition count is 91 out of 92 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 91 rows 70 cols 414 entries
Finished phase 1 with 47 SingleSign rule and 6 generalized
[2026-05-25 09:15:07] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14430583036575179216.kers
Total runtime 0 ms.
[2026-05-25 09:15:08] [INFO ] Implicit Places using invariants in 74 ms returned [5, 9, 25, 45, 49]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 75 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/145 places, 92/139 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 66 transition count 89
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 63 transition count 89
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 59 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 58 transition count 87
Applied a total of 16 rules in 6 ms. Remains 58 /66 variables (removed 8) and now considering 87/92 (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-10294293092320060455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8383526884138232394.kers'
[2026-05-25 09:15:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10294293092320060455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8383526884138232394.kers]
Normalized transition count is 86 out of 87 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 86 rows 57 cols 370 entries
Finished phase 1 with 42 SingleSign rule and 3 generalized
[2026-05-25 09:15:08] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8383526884138232394.kers
Total runtime 0 ms.
[2026-05-25 09:15:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 09:15:08] [INFO ] Invariant cache hit.
[2026-05-25 09:15:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 09:15:08] [INFO ] Implicit Places using invariants and state equation in 226 ms returned [12, 27, 42]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 291 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/145 places, 87/139 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 86
Applied a total of 2 rules in 5 ms. Remains 54 /55 variables (removed 1) and now considering 86/87 (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-11315422621505903644.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1095830840144740634.kers'
[2026-05-25 09:15:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11315422621505903644.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1095830840144740634.kers]
Normalized transition count is 85 out of 86 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 85 rows 53 cols 329 entries
Finished phase 1 with 42 SingleSign rule and 2 generalized
[2026-05-25 09:15:08] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1095830840144740634.kers
Total runtime 0 ms.
[2026-05-25 09:15:08] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 09:15:08] [INFO ] Invariant cache hit.
[2026-05-25 09:15:08] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-25 09:15:08] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 54/145 places, 86/139 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 526 ms. Remains : 54/145 places, 86/139 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 118 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 23370 steps (6 resets) in 382 ms. (61 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 45 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Knowledge-based reduction took 283 ms.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2026-05-25 09:15:09] [INFO ] Invariant cache hit.
[2026-05-25 09:15:09] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 09:15:09] [INFO ] Invariant cache hit.
[2026-05-25 09:15:09] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-25 09:15:09] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2026-05-25 09:15:09] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2026-05-25 09:15:09] [INFO ] Invariant cache hit.
[2026-05-25 09:15:09] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 85/139 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 23/87 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 1/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3608 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 85/139 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 78/168 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 1/140 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (OVERLAPS) 0/140 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 170 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3959 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7603ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7604ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7781 ms. Remains : 54/54 places, 86/86 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 26693 steps (6 resets) in 88 ms. (299 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Knowledge-based reduction took 178 ms.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 0 reset in 147 ms.
Built C files in :
/tmp/ltsmin2230727791628189544
[2026-05-25 09:15:17] [INFO ] Computing symmetric may disable matrix : 86 transitions.
[2026-05-25 09:15:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:15:17] [INFO ] Computing symmetric may enable matrix : 86 transitions.
[2026-05-25 09:15:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:15:17] [INFO ] Computing Do-Not-Accords matrix : 86 transitions.
[2026-05-25 09:15:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:15:17] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2230727791628189544
Running compilation step : cd /tmp/ltsmin2230727791628189544;'/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 374 ms.
Running link step : cd /tmp/ltsmin2230727791628189544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin2230727791628189544;'/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/stateBased4362043673966087336.hoa' '--buchi-type=spotba'
LTSmin run took 56 ms.
FORMULA MedleyA-PT-14-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-14-LTLFireability-06 finished in 10075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U (F(p1) U X((p1 U p2))))))'
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 139/139 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 142 transition count 139
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 134 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 134 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 133 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 133 transition count 130
Applied a total of 21 rules in 8 ms. Remains 133 /145 variables (removed 12) and now considering 130/139 (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-7762540225049585339.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3470121293876923114.kers'
[2026-05-25 09:15:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7762540225049585339.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3470121293876923114.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 133 cols 366 entries
Finished phase 1 with 109 SingleSign rule and 6 generalized
[2026-05-25 09:15:18] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3470121293876923114.kers
Total runtime 1 ms.
[2026-05-25 09:15:18] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 09:15:18] [INFO ] Invariant cache hit.
[2026-05-25 09:15:18] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-25 09:15:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 130/263 variables, 133/158 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 0/263 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 161 constraints, problems are : Problem set: 0 solved, 129 unsolved in 10478 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 130/263 variables, 133/161 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 129/290 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 7/300 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (OVERLAPS) 0/263 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 302 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 40529ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40529ms
Starting structural reductions in LTL mode, iteration 1 : 133/145 places, 130/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40779 ms. Remains : 133/145 places, 130/139 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U (F(p1) U X((p1 U p2))))))'
Stuttering acceptance computed with spot in 277 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 97 ms.
Stack based approach found an accepted trace after 91 steps with 0 reset with depth 92 and stack size 92 in 0 ms.
FORMULA MedleyA-PT-14-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLFireability-07 finished in 41201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((F(p0)||p1) U X(!(p0 U p2))))&&F(p3)))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 139/139 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 142 transition count 139
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 135 transition count 132
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 135 transition count 132
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 133 transition count 130
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 133 transition count 130
Applied a total of 21 rules in 12 ms. Remains 133 /145 variables (removed 12) and now considering 130/139 (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-6494964547931566241.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9045017991726006014.kers'
[2026-05-25 09:15:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6494964547931566241.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9045017991726006014.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 133 cols 364 entries
Finished phase 1 with 109 SingleSign rule and 6 generalized
[2026-05-25 09:15:59] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9045017991726006014.kers
Total runtime 3 ms.
[2026-05-25 09:15:59] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-25 09:15:59] [INFO ] Invariant cache hit.
[2026-05-25 09:15:59] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-25 09:15:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 130/263 variables, 133/158 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 0/263 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 161 constraints, problems are : Problem set: 0 solved, 129 unsolved in 11527 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 130/263 variables, 133/161 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 129/290 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/263 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 302 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 41558ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 41559ms
Starting structural reductions in LTL mode, iteration 1 : 133/145 places, 130/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41801 ms. Remains : 133/145 places, 130/139 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((F(p0)||p1) U X(!(p0 U p2))))&&F(p3)))'
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p3) p2), p2, (NOT p3), p2, (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 93 ms.
Product exploration explored 100000 steps with 33333 reset in 98 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 12 ms. Proved property starting from automaton with 6 states, 10 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 17 ms.
FORMULA MedleyA-PT-14-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-14-LTLFireability-08 finished in 42297 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&&F((p1||(p2&&X(G(p3))))))))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 139/139 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 142 transition count 139
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 137 transition count 134
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 137 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 136 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 136 transition count 133
Applied a total of 15 rules in 3 ms. Remains 136 /145 variables (removed 9) and now considering 133/139 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3817787712549374902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2062074123768828715.kers'
[2026-05-25 09:16:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3817787712549374902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2062074123768828715.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 136 cols 372 entries
Finished phase 1 with 112 SingleSign rule and 6 generalized
[2026-05-25 09:16:41] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2062074123768828715.kers
Total runtime 1 ms.
[2026-05-25 09:16:41] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 09:16:41] [INFO ] Invariant cache hit.
[2026-05-25 09:16:41] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2026-05-25 09:16:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 133/269 variables, 136/162 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/269 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 165 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10227 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/269 variables, 136/165 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 132/297 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 6/308 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/269 variables, and 312 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 40246ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 40247ms
Starting structural reductions in LTL mode, iteration 1 : 136/145 places, 133/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40421 ms. Remains : 136/145 places, 133/139 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&&F((p1||(p2&&X(G(p3))))))))'
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-14-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-09 finished in 40734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 139/139 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 142 transition count 139
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 135 transition count 132
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 135 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 134 transition count 131
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 134 transition count 131
Applied a total of 19 rules in 5 ms. Remains 134 /145 variables (removed 11) and now considering 131/139 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9550452438877199393.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13684341048700961115.kers'
[2026-05-25 09:17:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9550452438877199393.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13684341048700961115.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 131 rows 134 cols 368 entries
Finished phase 1 with 110 SingleSign rule and 6 generalized
[2026-05-25 09:17:22] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13684341048700961115.kers
Total runtime 2 ms.
[2026-05-25 09:17:22] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-25 09:17:22] [INFO ] Invariant cache hit.
[2026-05-25 09:17:22] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2026-05-25 09:17:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 131/265 variables, 134/160 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 163 constraints, problems are : Problem set: 0 solved, 130 unsolved in 10943 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/265 variables, 134/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 130/293 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 307 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 10/10 constraints]
After SMT, in 40985ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 40986ms
Starting structural reductions in LTL mode, iteration 1 : 134/145 places, 131/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41272 ms. Remains : 134/145 places, 131/139 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-14-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-11 finished in 41438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 139/139 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 142 transition count 139
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 134 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 134 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 133 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 133 transition count 130
Applied a total of 21 rules in 4 ms. Remains 133 /145 variables (removed 12) and now considering 130/139 (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-15260329376740979610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11314605131655107528.kers'
[2026-05-25 09:18:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15260329376740979610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11314605131655107528.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 133 cols 366 entries
Finished phase 1 with 109 SingleSign rule and 6 generalized
[2026-05-25 09:18:03] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11314605131655107528.kers
Total runtime 2 ms.
[2026-05-25 09:18:03] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 09:18:03] [INFO ] Invariant cache hit.
[2026-05-25 09:18:03] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-25 09:18:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 130/263 variables, 133/158 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 0/263 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 161 constraints, problems are : Problem set: 0 solved, 129 unsolved in 10522 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 130/263 variables, 133/161 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 129/290 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 7/300 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (OVERLAPS) 0/263 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 302 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 40543ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40543ms
Starting structural reductions in LTL mode, iteration 1 : 133/145 places, 130/139 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40758 ms. Remains : 133/145 places, 130/139 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p1)))'
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-14-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-13 finished in 40921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 139/139 transitions.
Graph (complete) has 272 edges and 145 vertex of which 142 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 141 transition count 130
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 133 transition count 130
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 17 place count 133 transition count 111
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 55 place count 114 transition count 111
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 107 transition count 104
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 107 transition count 104
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 69 place count 107 transition count 101
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 104 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 102 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 102 transition count 99
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 121 place count 81 transition count 78
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 147 place count 68 transition count 93
Applied a total of 147 rules in 11 ms. Remains 68 /145 variables (removed 77) and now considering 93/139 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2917072177125006620.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3841744730330818501.kers'
[2026-05-25 09:18:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2917072177125006620.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3841744730330818501.kers]
Normalized transition count is 92 out of 93 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 92 rows 67 cols 423 entries
Finished phase 1 with 44 SingleSign rule and 6 generalized
[2026-05-25 09:18:44] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3841744730330818501.kers
Total runtime 0 ms.
[2026-05-25 09:18:44] [INFO ] Implicit Places using invariants in 81 ms returned [5, 9, 23, 27, 41, 46]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 92 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/145 places, 93/139 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 62 transition count 90
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 59 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 57 transition count 88
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 54 transition count 93
Applied a total of 16 rules in 4 ms. Remains 54 /62 variables (removed 8) and now considering 93/93 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12487724233662377780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6605197653373422102.kers'
[2026-05-25 09:18:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12487724233662377780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6605197653373422102.kers]
Normalized transition count is 92 out of 93 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 92 rows 53 cols 390 entries
Finished phase 1 with 39 SingleSign rule and 3 generalized
[2026-05-25 09:18:44] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6605197653373422102.kers
Total runtime 0 ms.
[2026-05-25 09:18:44] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 09:18:44] [INFO ] Invariant cache hit.
[2026-05-25 09:18:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 09:18:44] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [10, 23, 37]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 132 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/145 places, 93/139 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 92
Applied a total of 2 rules in 3 ms. Remains 50 /51 variables (removed 1) and now considering 92/93 (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-4984985662584326843.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-725910292857964097.kers'
[2026-05-25 09:18:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4984985662584326843.kers, --Pflows, --basisKERS=/tmp/petrispot-output-725910292857964097.kers]
Normalized transition count is 91 out of 92 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 91 rows 49 cols 348 entries
Finished phase 1 with 39 SingleSign rule and 2 generalized
[2026-05-25 09:18:44] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-725910292857964097.kers
Total runtime 2 ms.
[2026-05-25 09:18:44] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 09:18:44] [INFO ] Invariant cache hit.
[2026-05-25 09:18:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 09:18:44] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 50/145 places, 92/139 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 352 ms. Remains : 50/145 places, 92/139 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-14-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-14 finished in 399 ms.
All properties solved by simple procedures.
Total runtime 348538 ms.

BK_STOP 1779700725043

--------------------
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-14"
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-14, 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-177969020000204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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