Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993700356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DES-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.2K Mar 6 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 6 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 6 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 6 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 6 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 6 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 73K 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 DES-PT-05b-LTLFireability-00
FORMULA_NAME DES-PT-05b-LTLFireability-01
FORMULA_NAME DES-PT-05b-LTLFireability-02
FORMULA_NAME DES-PT-05b-LTLFireability-03
FORMULA_NAME DES-PT-05b-LTLFireability-04
FORMULA_NAME DES-PT-05b-LTLFireability-05
FORMULA_NAME DES-PT-05b-LTLFireability-06
FORMULA_NAME DES-PT-05b-LTLFireability-07
FORMULA_NAME DES-PT-05b-LTLFireability-08
FORMULA_NAME DES-PT-05b-LTLFireability-09
FORMULA_NAME DES-PT-05b-LTLFireability-10
FORMULA_NAME DES-PT-05b-LTLFireability-11
FORMULA_NAME DES-PT-05b-LTLFireability-12
FORMULA_NAME DES-PT-05b-LTLFireability-13
FORMULA_NAME DES-PT-05b-LTLFireability-14
FORMULA_NAME DES-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779665703020

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 23:35:05] [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-24 23:35:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 23:35:06] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2026-05-24 23:35:06] [INFO ] Transformed 300 places.
[2026-05-24 23:35:06] [INFO ] Transformed 251 transitions.
[2026-05-24 23:35:06] [INFO ] Found NUPN structural information;
[2026-05-24 23:35:06] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 446 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-05b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 297 transition count 251
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 275 transition count 229
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 275 transition count 229
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 59 place count 263 transition count 217
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 263 transition count 217
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 81 place count 263 transition count 207
Applied a total of 81 rules in 169 ms. Remains 263 /300 variables (removed 37) and now considering 207/251 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4017559376779927515.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6878308692743434069.kers'
[2026-05-24 23:35:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4017559376779927515.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6878308692743434069.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 263 cols 635 entries
Finished phase 1 with 145 SingleSign rule and 56 generalized
[2026-05-24 23:35:06] [INFO ] Computed 62 invariants in 2 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6878308692743434069.kers
Total runtime 5 ms.
[2026-05-24 23:35:07] [INFO ] Implicit Places using invariants in 768 ms returned []
[2026-05-24 23:35:07] [INFO ] Invariant cache hit.
[2026-05-24 23:35:08] [INFO ] Implicit Places using invariants and state equation in 750 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1596 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 262/300 places, 207/251 transitions.
Applied a total of 0 rules in 14 ms. Remains 262 /262 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1810 ms. Remains : 262/300 places, 207/251 transitions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Applied a total of 0 rules in 12 ms. Remains 262 /262 variables (removed 0) and now considering 207/207 (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-1655523988793882317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7992052314400047709.kers'
[2026-05-24 23:35:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1655523988793882317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7992052314400047709.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 262 cols 633 entries
Finished phase 1 with 149 SingleSign rule and 52 generalized
[2026-05-24 23:35:08] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7992052314400047709.kers
Total runtime 4 ms.
[2026-05-24 23:35:08] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-24 23:35:08] [INFO ] Invariant cache hit.
[2026-05-24 23:35:09] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2026-05-24 23:35:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/262 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/469 variables, 262/323 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 9/332 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 7/342 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/469 variables, and 350 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/262 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 27/88 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (OVERLAPS) 207/469 variables, 262/383 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/469 variables, 206/589 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 592 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in LTL mode , in 1 iterations and 61094 ms. Remains : 262/262 places, 207/207 transitions.
Support contains 47 out of 262 places after structural reductions.
[2026-05-24 23:36:09] [INFO ] Flatten gal took : 92 ms
[2026-05-24 23:36:09] [INFO ] Flatten gal took : 41 ms
[2026-05-24 23:36:09] [INFO ] Input system was already deterministic with 207 transitions.
RANDOM walk for 40000 steps (358 resets) in 2050 ms. (19 steps per ms) remains 3/33 properties
BEST_FIRST walk for 40003 steps (48 resets) in 271 ms. (147 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (53 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
[2026-05-24 23:36:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 154/168 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 70/238 variables, 22/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/246 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 194/440 variables, 246/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 19/459 variables, 11/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/465 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/467 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/467 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/469 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/469 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/469 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 323 constraints, problems are : Problem set: 0 solved, 2 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 154/168 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 70/238 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/246 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 194/440 variables, 246/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 19/459 variables, 11/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/459 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/465 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/465 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/467 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/469 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/469 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/469 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 328 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1488 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1885ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 718 ms.
Support contains 4 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 207/207 transitions.
Graph (complete) has 485 edges and 262 vertex of which 257 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 257 transition count 184
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 39 place count 239 transition count 184
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 39 place count 239 transition count 173
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 61 place count 228 transition count 173
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 224 transition count 169
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 224 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 224 transition count 165
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 223 transition count 164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 75 place count 223 transition count 162
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 221 transition count 162
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 220 transition count 161
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 220 transition count 161
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 227 place count 147 transition count 88
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 233 place count 144 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 144 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 237 place count 142 transition count 94
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 238 place count 142 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 239 place count 141 transition count 93
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 240 place count 141 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 241 place count 140 transition count 92
Applied a total of 241 rules in 124 ms. Remains 140 /262 variables (removed 122) and now considering 92/207 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 140/262 places, 92/207 transitions.
RANDOM walk for 40000 steps (1698 resets) in 549 ms. (72 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (383 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16824813193663766033.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7029161946648834813.kers'
[2026-05-24 23:36:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16824813193663766033.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7029161946648834813.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 92 rows 131 cols 436 entries
Finished phase 1 with 34 SingleSign rule and 45 generalized
[2026-05-24 23:36:13] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7029161946648834813.kers
Total runtime 2 ms.
[2026-05-24 23:36:13] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/58 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/110 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/118 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/120 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/121 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 83/204 variables, 121/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 15/219 variables, 10/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/221 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/221 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/221 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/228 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/228 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/228 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/232 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/232 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/232 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/58 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/110 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/118 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/120 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/121 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 83/204 variables, 121/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/204 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/204 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 15/219 variables, 10/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/219 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/219 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/221 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/221 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/228 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/228 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/228 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/232 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/232 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/232 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 978ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 92/92 transitions.
Applied a total of 0 rules in 11 ms. Remains 140 /140 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 140/140 places, 92/92 transitions.
RANDOM walk for 40000 steps (1714 resets) in 347 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (378 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1341588 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :0 out of 1
Probabilistic random walk after 1341588 steps, saw 180729 distinct states, run finished after 3007 ms. (steps per millisecond=446 ) properties seen :0
[2026-05-24 23:36:17] [INFO ] Invariant cache hit.
[2026-05-24 23:36:17] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/58 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/110 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/118 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/120 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/121 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 83/204 variables, 121/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 15/219 variables, 10/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/221 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/221 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/221 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/228 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/228 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/228 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/232 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/232 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/232 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/58 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/110 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/118 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/120 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/121 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 83/204 variables, 121/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/204 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/204 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 15/219 variables, 10/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/219 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/219 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/221 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/221 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/228 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/228 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/228 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/232 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/232 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/232 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 789ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 92/92 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 140/140 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 92/92 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2026-05-24 23:36:18] [INFO ] Invariant cache hit.
[2026-05-24 23:36:18] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-24 23:36:18] [INFO ] Invariant cache hit.
[2026-05-24 23:36:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-24 23:36:19] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2026-05-24 23:36:19] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2026-05-24 23:36:19] [INFO ] Invariant cache hit.
[2026-05-24 23:36:19] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/139 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 92/231 variables, 139/200 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 1/232 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/232 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 211 constraints, problems are : Problem set: 0 solved, 89 unsolved in 7154 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/138 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 92/231 variables, 139/212 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 89/309 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 16 (OVERLAPS) 1/232 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 232/232 variables, and 312 constraints, problems are : Problem set: 0 solved, 89 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 140/140 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 37204ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 37206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37674 ms. Remains : 140/140 places, 92/92 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 457 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 139 transition count 92
Applied a total of 2 rules in 18 ms. Remains 139 /140 variables (removed 1) and now considering 92/92 (removed 0) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11001700672933057715.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1348691454238066936.kers'
[2026-05-24 23:36:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11001700672933057715.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1348691454238066936.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 92 rows 131 cols 437 entries
Finished phase 1 with 34 SingleSign rule and 45 generalized
[2026-05-24 23:36:56] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1348691454238066936.kers
Total runtime 2 ms.
[2026-05-24 23:36:56] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2026-05-24 23:36:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2026-05-24 23:36:56] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 23:36:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2026-05-24 23:36:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2026-05-24 23:36:56] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 23:36:57] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 23:36:57] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 578 ms.
FORMULA DES-PT-05b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 80 stabilizing places and 73 stable transitions
Graph (complete) has 485 edges and 262 vertex of which 257 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.10 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(X(X(!p0))) U p1))'
Support contains 4 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 256 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 256 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 256 transition count 198
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 253 transition count 195
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 253 transition count 194
Applied a total of 22 rules in 42 ms. Remains 253 /262 variables (removed 9) and now considering 194/207 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7430875712716186717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6903304528385077604.kers'
[2026-05-24 23:36:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7430875712716186717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6903304528385077604.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 253 cols 599 entries
Finished phase 1 with 140 SingleSign rule and 52 generalized
[2026-05-24 23:36:57] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6903304528385077604.kers
Total runtime 3 ms.
[2026-05-24 23:36:58] [INFO ] Implicit Places using invariants in 284 ms returned []
[2026-05-24 23:36:58] [INFO ] Invariant cache hit.
[2026-05-24 23:36:58] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-24 23:36:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/447 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 18/332 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 347 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 32/93 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 194/447 variables, 253/365 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 193/558 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 11/569 constraints. Problems are: Problem set: 0 solved, 193 unsolved
SMT process timed out in 60053ms, After SMT, problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 253/262 places, 194/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60943 ms. Remains : 253/262 places, 194/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(!p0))) U p1))'
Stuttering acceptance computed with spot in 336 ms :[(NOT p1), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : DES-PT-05b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 108 steps with 0 reset in 4 ms.
FORMULA DES-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-00 finished in 61408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((G((p0&&X(p1)))||G(p2))))))))'
Support contains 5 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 257 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 257 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 257 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 255 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 255 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 255 transition count 196
Applied a total of 18 rules in 17 ms. Remains 255 /262 variables (removed 7) and now considering 196/207 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5602210610224084014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17692925268156296314.kers'
[2026-05-24 23:37:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5602210610224084014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17692925268156296314.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 255 cols 603 entries
Finished phase 1 with 142 SingleSign rule and 52 generalized
[2026-05-24 23:37:59] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17692925268156296314.kers
Total runtime 2 ms.
[2026-05-24 23:37:59] [INFO ] Implicit Places using invariants in 265 ms returned []
[2026-05-24 23:37:59] [INFO ] Invariant cache hit.
[2026-05-24 23:37:59] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2026-05-24 23:37:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/451 variables, 255/316 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/451 variables, 11/347 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 9/356 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (OVERLAPS) 0/451 variables, 5/361 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 8/369 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 451/451 variables, and 369 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 53/114 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 196/451 variables, 255/375 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 195/570 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 4/574 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 574 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 255/262 places, 196/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60770 ms. Remains : 255/262 places, 196/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((G((p0&&X(p1)))||G(p2))))))))'
Stuttering acceptance computed with spot in 398 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : DES-PT-05b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-01 finished in 61206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G((p1&&X(X(X(G(p2))))))))))'
Support contains 3 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 256 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 256 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 256 transition count 198
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 253 transition count 195
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 253 transition count 194
Applied a total of 22 rules in 13 ms. Remains 253 /262 variables (removed 9) and now considering 194/207 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6444197676531946198.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8992887213774226180.kers'
[2026-05-24 23:39:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6444197676531946198.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8992887213774226180.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 253 cols 599 entries
Finished phase 1 with 140 SingleSign rule and 52 generalized
[2026-05-24 23:39:00] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8992887213774226180.kers
Total runtime 3 ms.
[2026-05-24 23:39:00] [INFO ] Implicit Places using invariants in 288 ms returned []
[2026-05-24 23:39:00] [INFO ] Invariant cache hit.
[2026-05-24 23:39:01] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-24 23:39:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/447 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 18/332 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 347 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 32/93 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 194/447 variables, 253/365 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 193/558 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 11/569 constraints. Problems are: Problem set: 0 solved, 193 unsolved
SMT process timed out in 60068ms, After SMT, problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 253/262 places, 194/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61009 ms. Remains : 253/262 places, 194/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G((p1&&X(X(X(G(p2))))))))))'
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-05b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 228 steps with 1 reset in 6 ms.
FORMULA DES-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-02 finished in 61298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U (!p0 U ((p2&&F(p1)) U p1))))'
Support contains 2 out of 262 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Graph (complete) has 485 edges and 262 vertex of which 257 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 256 transition count 186
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 239 transition count 186
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 239 transition count 176
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 229 transition count 176
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 226 transition count 173
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 226 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 226 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 63 place count 226 transition count 170
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 225 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 224 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 224 transition count 169
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 213 place count 151 transition count 96
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 219 place count 148 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 227 place count 148 transition count 103
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 228 place count 148 transition count 103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 230 place count 146 transition count 101
Applied a total of 230 rules in 97 ms. Remains 146 /262 variables (removed 116) and now considering 101/207 (removed 106) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13441837831344472438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4516735797160854242.kers'
[2026-05-24 23:40:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13441837831344472438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4516735797160854242.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 1 ms.
// Phase 1: matrix 101 rows 119 cols 401 entries
Finished phase 1 with 79 SingleSign rule and 8 generalized
[2026-05-24 23:40:01] [INFO ] Computed 59 invariants in 3 ms
Computed 59 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4516735797160854242.kers
Total runtime 4 ms.
[2026-05-24 23:40:02] [INFO ] Implicit Places using invariants in 303 ms returned []
[2026-05-24 23:40:02] [INFO ] Invariant cache hit.
[2026-05-24 23:40:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-24 23:40:02] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2026-05-24 23:40:02] [INFO ] Redundant transitions in 5 ms returned []
Running 97 sub problems to find dead transitions.
[2026-05-24 23:40:02] [INFO ] Invariant cache hit.
[2026-05-24 23:40:02] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 1/143 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 2/145 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 101/246 variables, 145/206 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 8/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 1/247 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/247 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 215 constraints, problems are : Problem set: 0 solved, 97 unsolved in 10737 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/143 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 2/145 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 101/246 variables, 145/207 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 97/312 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 1/247 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/247 variables, and 315 constraints, problems are : Problem set: 0 solved, 97 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40787ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 40789ms
Starting structural reductions in SI_LTL mode, iteration 1 : 146/262 places, 101/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41626 ms. Remains : 146/262 places, 101/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U (!p0 U ((p2&&F(p1)) U p1))))'
Stuttering acceptance computed with spot in 56 ms :[(NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-03
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA DES-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-03 finished in 41734 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((G(F(p0)) U (p1||X(X(p2)))))))'
Support contains 3 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 256 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 256 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 256 transition count 198
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 253 transition count 195
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 253 transition count 194
Applied a total of 22 rules in 19 ms. Remains 253 /262 variables (removed 9) and now considering 194/207 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2141052556753321878.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6374648209211714092.kers'
[2026-05-24 23:40:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2141052556753321878.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6374648209211714092.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 253 cols 599 entries
Finished phase 1 with 140 SingleSign rule and 52 generalized
[2026-05-24 23:40:43] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6374648209211714092.kers
Total runtime 2 ms.
[2026-05-24 23:40:43] [INFO ] Implicit Places using invariants in 346 ms returned []
[2026-05-24 23:40:43] [INFO ] Invariant cache hit.
[2026-05-24 23:40:44] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-24 23:40:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/447 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 18/332 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 347 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 32/93 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 194/447 variables, 253/365 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 193/558 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 11/569 constraints. Problems are: Problem set: 0 solved, 193 unsolved
SMT process timed out in 60046ms, After SMT, problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Starting structural reductions in LTL mode, iteration 1 : 253/262 places, 194/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61098 ms. Remains : 253/262 places, 194/207 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((G(F(p0)) U (p1||X(X(p2)))))))'
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-04
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 4 ms.
FORMULA DES-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-04 finished in 61421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U G(p1))))'
Support contains 2 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 256 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 256 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 256 transition count 198
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 253 transition count 195
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 253 transition count 194
Applied a total of 22 rules in 10 ms. Remains 253 /262 variables (removed 9) and now considering 194/207 (removed 13) transitions.
[2026-05-24 23:41:44] [INFO ] Invariant cache hit.
[2026-05-24 23:41:45] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-05-24 23:41:45] [INFO ] Invariant cache hit.
[2026-05-24 23:41:45] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 253/262 places, 194/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 660 ms. Remains : 253/262 places, 194/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U G(p1))))'
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-07
Product exploration explored 100000 steps with 2649 reset in 259 ms.
Product exploration explored 100000 steps with 2640 reset in 274 ms.
Computed a total of 76 stabilizing places and 69 stable transitions
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 76 stabilizing places and 69 stable transitions
Knowledge based reduction with 7 factoid took 61 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 150 steps (0 resets) in 7 ms. (18 steps per ms) remains 0/2 properties
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p0)]
[2026-05-24 23:41:46] [INFO ] Invariant cache hit.
[2026-05-24 23:41:46] [INFO ] [Real]Absence check using 35 positive place invariants in 22 ms returned sat
[2026-05-24 23:41:46] [INFO ] [Real]Absence check using 35 positive and 26 generalized place invariants in 36 ms returned sat
[2026-05-24 23:41:47] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2026-05-24 23:41:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:41:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-24 23:41:47] [INFO ] [Nat]Absence check using 35 positive and 26 generalized place invariants in 40 ms returned sat
[2026-05-24 23:41:49] [INFO ] [Nat]Absence check using state equation in 1395 ms returned sat
[2026-05-24 23:41:49] [INFO ] Computed and/alt/rep : 192/350/192 causal constraints (skipped 1 transitions) in 15 ms.
[2026-05-24 23:41:51] [INFO ] Added : 183 causal constraints over 37 iterations in 2695 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 5710 ms.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p0)]
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 194/194 transitions.
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 247 transition count 175
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 232 transition count 175
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 232 transition count 164
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 221 transition count 164
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 207 place count 144 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 143 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 211 place count 141 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 140 transition count 85
Applied a total of 212 rules in 28 ms. Remains 140 /253 variables (removed 113) and now considering 85/194 (removed 109) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9963793259341446757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-141083158325150473.kers'
[2026-05-24 23:41:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9963793259341446757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-141083158325150473.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 85 rows 113 cols 317 entries
Finished phase 1 with 61 SingleSign rule and 21 generalized
[2026-05-24 23:41:51] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-141083158325150473.kers
Total runtime 2 ms.
[2026-05-24 23:41:52] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-24 23:41:52] [INFO ] Invariant cache hit.
[2026-05-24 23:41:52] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2026-05-24 23:41:52] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2026-05-24 23:41:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/139 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 85/224 variables, 139/197 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/225 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/225 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 200 constraints, problems are : Problem set: 0 solved, 82 unsolved in 4583 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 2/139 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 85/224 variables, 139/199 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 82/281 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 1/225 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (OVERLAPS) 0/225 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 285 constraints, problems are : Problem set: 0 solved, 82 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34601ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 34602ms
Starting structural reductions in SI_LTL mode, iteration 1 : 140/253 places, 85/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35072 ms. Remains : 140/253 places, 85/194 transitions.
Computed a total of 35 stabilizing places and 30 stable transitions
Computed a total of 35 stabilizing places and 30 stable transitions
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 12 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/2 properties
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p0)]
[2026-05-24 23:42:27] [INFO ] Invariant cache hit.
[2026-05-24 23:42:27] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2026-05-24 23:42:27] [INFO ] [Real]Absence check using 36 positive and 22 generalized place invariants in 26 ms returned sat
[2026-05-24 23:42:27] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2026-05-24 23:42:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:42:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2026-05-24 23:42:27] [INFO ] [Nat]Absence check using 36 positive and 22 generalized place invariants in 18 ms returned sat
[2026-05-24 23:42:27] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2026-05-24 23:42:27] [INFO ] Computed and/alt/rep : 82/186/82 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-24 23:42:28] [INFO ] Added : 60 causal constraints over 12 iterations in 199 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 1131 ms.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p0)]
Stuttering criterion allowed to conclude after 1497 steps with 279 reset in 5 ms.
FORMULA DES-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-07 finished in 43486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((X(X(p0))&&F(p1)))))))'
Support contains 5 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 256 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 256 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 256 transition count 198
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 253 transition count 195
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 253 transition count 194
Applied a total of 22 rules in 10 ms. Remains 253 /262 variables (removed 9) and now considering 194/207 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14615266373120985517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16592217444148517973.kers'
[2026-05-24 23:42:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14615266373120985517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16592217444148517973.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 253 cols 599 entries
Finished phase 1 with 140 SingleSign rule and 52 generalized
[2026-05-24 23:42:28] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16592217444148517973.kers
Total runtime 2 ms.
[2026-05-24 23:42:28] [INFO ] Implicit Places using invariants in 210 ms returned []
[2026-05-24 23:42:28] [INFO ] Invariant cache hit.
[2026-05-24 23:42:28] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-24 23:42:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/447 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 18/332 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 12 (OVERLAPS) 0/447 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 347 constraints, problems are : Problem set: 0 solved, 193 unsolved in 24488 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 32/93 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 194/447 variables, 253/365 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 193/558 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 11/569 constraints. Problems are: Problem set: 0 solved, 193 unsolved
SMT process timed out in 54515ms, After SMT, problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 54516ms
Starting structural reductions in LTL mode, iteration 1 : 253/262 places, 194/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55162 ms. Remains : 253/262 places, 194/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((X(X(p0))&&F(p1)))))))'
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : DES-PT-05b-LTLFireability-08
Product exploration explored 100000 steps with 14285 reset in 147 ms.
Product exploration explored 100000 steps with 14285 reset in 199 ms.
Computed a total of 76 stabilizing places and 69 stable transitions
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 76 stabilizing places and 69 stable transitions
Detected a total of 76/253 stabilizing places and 69/194 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 9 states, 10 edges and 2 AP (stutter sensitive) to 9 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (341 resets) in 261 ms. (152 steps per ms) remains 1/2 properties
BEST_FIRST walk for 31074 steps (45 resets) in 106 ms. (290 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 9 states, 10 edges and 2 AP (stutter sensitive) to 9 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Knowledge-based reduction took 572 ms.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Support contains 5 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 194/194 transitions.
Applied a total of 0 rules in 4 ms. Remains 253 /253 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2026-05-24 23:43:24] [INFO ] Invariant cache hit.
[2026-05-24 23:43:25] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-24 23:43:25] [INFO ] Invariant cache hit.
[2026-05-24 23:43:25] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 629 ms. Remains : 253/253 places, 194/194 transitions.
Computed a total of 76 stabilizing places and 69 stable transitions
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 76 stabilizing places and 69 stable transitions
Detected a total of 76/253 stabilizing places and 69/194 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 9 states, 10 edges and 2 AP (stutter sensitive) to 9 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 29882 steps (260 resets) in 70 ms. (420 steps per ms) remains 0/2 properties
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 9 states, 10 edges and 2 AP (stutter sensitive) to 9 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Knowledge-based reduction took 462 ms.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Product exploration explored 100000 steps with 14285 reset in 97 ms.
Product exploration explored 100000 steps with 14285 reset in 117 ms.
Spot run failed in 100 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin13712781895175636085
[2026-05-24 23:43:27] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13712781895175636085
Running compilation step : cd /tmp/ltsmin13712781895175636085;'/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 664 ms.
Running link step : cd /tmp/ltsmin13712781895175636085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin13712781895175636085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased5063424444753967630.hoa' '--buchi-type=spotba'
LTSmin run took 66 ms.
FORMULA DES-PT-05b-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-05b-LTLFireability-08 finished in 59554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1) U (p2&&F(p3))))'
Support contains 6 out of 262 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Graph (complete) has 485 edges and 262 vertex of which 257 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 256 transition count 188
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 241 transition count 188
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 241 transition count 178
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 231 transition count 178
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 228 transition count 175
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 228 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 228 transition count 172
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 227 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 62 place count 227 transition count 170
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 226 transition count 170
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 225 transition count 169
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 225 transition count 169
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 202 place count 157 transition count 101
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 210 place count 153 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 151 transition count 108
Applied a total of 212 rules in 40 ms. Remains 151 /262 variables (removed 111) and now considering 108/207 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11716546571543308340.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15842235217874919449.kers'
[2026-05-24 23:43:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11716546571543308340.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15842235217874919449.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 108 rows 144 cols 491 entries
Finished phase 1 with 67 SingleSign rule and 25 generalized
[2026-05-24 23:43:27] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15842235217874919449.kers
Total runtime 1 ms.
[2026-05-24 23:43:28] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-24 23:43:28] [INFO ] Invariant cache hit.
[2026-05-24 23:43:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-24 23:43:28] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2026-05-24 23:43:28] [INFO ] Redundant transitions in 3 ms returned []
Running 103 sub problems to find dead transitions.
[2026-05-24 23:43:28] [INFO ] Invariant cache hit.
[2026-05-24 23:43:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 2/148 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 2/150 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 108/258 variables, 150/211 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 8/219 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 1/259 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 14 (OVERLAPS) 0/259 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 225 constraints, problems are : Problem set: 0 solved, 103 unsolved in 7197 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 151/151 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 2/148 variables, 25/48 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 2/150 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (OVERLAPS) 108/258 variables, 150/223 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 8/231 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 103/334 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/258 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/258 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 103 unsolved
SMT process timed out in 37220ms, After SMT, problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 37220ms
Starting structural reductions in SI_LTL mode, iteration 1 : 151/262 places, 108/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37760 ms. Remains : 151/262 places, 108/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1) U (p2&&F(p3))))'
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : DES-PT-05b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-09 finished in 37910 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)&&F(G(p1)))))'
Support contains 4 out of 262 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Graph (complete) has 485 edges and 262 vertex of which 257 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 256 transition count 186
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 239 transition count 186
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 239 transition count 176
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 229 transition count 176
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 226 transition count 173
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 226 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 226 transition count 170
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 225 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 66 place count 225 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 224 transition count 168
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 223 transition count 167
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 223 transition count 167
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 210 place count 153 transition count 97
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 218 place count 149 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 220 place count 147 transition count 104
Applied a total of 220 rules in 37 ms. Remains 147 /262 variables (removed 115) and now considering 104/207 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14119892737550208812.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7026041646838122608.kers'
[2026-05-24 23:44:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14119892737550208812.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7026041646838122608.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 104 rows 137 cols 470 entries
Finished phase 1 with 48 SingleSign rule and 40 generalized
[2026-05-24 23:44:05] [INFO ] Computed 59 invariants in 0 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7026041646838122608.kers
Total runtime 1 ms.
[2026-05-24 23:44:05] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-24 23:44:05] [INFO ] Invariant cache hit.
[2026-05-24 23:44:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-24 23:44:06] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2026-05-24 23:44:06] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2026-05-24 23:44:06] [INFO ] Invariant cache hit.
[2026-05-24 23:44:06] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/144 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/146 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/250 variables, 146/205 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 8/213 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 1/251 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 0/251 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 16 (OVERLAPS) 0/251 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 220 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8305 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 147/147 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/144 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 2/146 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 104/250 variables, 146/212 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 100/320 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 100 unsolved
SMT process timed out in 38327ms, After SMT, problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 38328ms
Starting structural reductions in SI_LTL mode, iteration 1 : 147/262 places, 104/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38835 ms. Remains : 147/262 places, 104/207 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-10
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-10 finished in 38966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(G(p0)) U (X(X(p2))&&p1))))))'
Support contains 5 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 256 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 256 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 256 transition count 198
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 253 transition count 195
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 253 transition count 194
Applied a total of 22 rules in 9 ms. Remains 253 /262 variables (removed 9) and now considering 194/207 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9348493464440034126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16971420053656150750.kers'
[2026-05-24 23:44:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9348493464440034126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16971420053656150750.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 253 cols 599 entries
Finished phase 1 with 140 SingleSign rule and 52 generalized
[2026-05-24 23:44:44] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16971420053656150750.kers
Total runtime 2 ms.
[2026-05-24 23:44:44] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-24 23:44:44] [INFO ] Invariant cache hit.
[2026-05-24 23:44:45] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-24 23:44:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/447 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 18/332 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 12 (OVERLAPS) 0/447 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 347 constraints, problems are : Problem set: 0 solved, 193 unsolved in 23524 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 32/93 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 194/447 variables, 253/365 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 193/558 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 11/569 constraints. Problems are: Problem set: 0 solved, 193 unsolved
SMT process timed out in 53543ms, After SMT, problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 53544ms
Starting structural reductions in LTL mode, iteration 1 : 253/262 places, 194/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54189 ms. Remains : 253/262 places, 194/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(G(p0)) U (X(X(p2))&&p1))))))'
Stuttering acceptance computed with spot in 473 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : DES-PT-05b-LTLFireability-11
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-11 finished in 54714 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 3 out of 262 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Graph (complete) has 485 edges and 262 vertex of which 257 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 256 transition count 187
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 240 transition count 187
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 33 place count 240 transition count 178
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 231 transition count 178
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 227 transition count 174
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 227 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 63 place count 227 transition count 170
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 226 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 65 place count 226 transition count 167
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 69 place count 224 transition count 167
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 223 transition count 166
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 223 transition count 166
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 221 place count 148 transition count 91
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 4 with 4 rules applied. Total rules applied 225 place count 146 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 144 transition count 91
Applied a total of 227 rules in 49 ms. Remains 144 /262 variables (removed 118) and now considering 91/207 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18215026581472757354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6707001606765607914.kers'
[2026-05-24 23:45:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18215026581472757354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6707001606765607914.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 91 rows 125 cols 363 entries
Finished phase 1 with 63 SingleSign rule and 22 generalized
[2026-05-24 23:45:39] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6707001606765607914.kers
Total runtime 2 ms.
[2026-05-24 23:45:39] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-24 23:45:39] [INFO ] Invariant cache hit.
[2026-05-24 23:45:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 23:45:40] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2026-05-24 23:45:40] [INFO ] Redundant transitions in 2 ms returned []
Running 87 sub problems to find dead transitions.
[2026-05-24 23:45:40] [INFO ] Invariant cache hit.
[2026-05-24 23:45:40] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/141 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 2/143 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 91/234 variables, 143/202 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 1/235 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/235 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 207 constraints, problems are : Problem set: 0 solved, 87 unsolved in 8728 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 144/144 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/141 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 2/143 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 91/234 variables, 143/204 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 87/295 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 1/235 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/235 variables, and 297 constraints, problems are : Problem set: 0 solved, 87 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 144/144 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38750ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 38750ms
Starting structural reductions in SI_LTL mode, iteration 1 : 144/262 places, 91/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39529 ms. Remains : 144/262 places, 91/207 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 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-13
Product exploration explored 100000 steps with 6004 reset in 400 ms.
Product exploration explored 100000 steps with 6019 reset in 444 ms.
Computed a total of 37 stabilizing places and 34 stable transitions
Computed a total of 37 stabilizing places and 34 stable transitions
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 41 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 257 ms.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2026-05-24 23:46:20] [INFO ] Invariant cache hit.
[2026-05-24 23:46:20] [INFO ] Implicit Places using invariants in 267 ms returned []
[2026-05-24 23:46:20] [INFO ] Invariant cache hit.
[2026-05-24 23:46:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 23:46:21] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2026-05-24 23:46:21] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 797 ms. Remains : 144/144 places, 91/91 transitions.
Computed a total of 37 stabilizing places and 34 stable transitions
Computed a total of 37 stabilizing places and 34 stable transitions
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 75 steps (2 resets) in 4 ms. (15 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 266 ms.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5973 reset in 376 ms.
Product exploration explored 100000 steps with 5955 reset in 414 ms.
Built C files in :
/tmp/ltsmin17914459666512541600
[2026-05-24 23:46:22] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2026-05-24 23:46:22] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 23:46:22] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2026-05-24 23:46:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 23:46:22] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2026-05-24 23:46:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 23:46:22] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17914459666512541600
Running compilation step : cd /tmp/ltsmin17914459666512541600;'/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 440 ms.
Running link step : cd /tmp/ltsmin17914459666512541600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17914459666512541600;'/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/stateBased11124642508963004602.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2026-05-24 23:46:37] [INFO ] Invariant cache hit.
[2026-05-24 23:46:37] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-24 23:46:37] [INFO ] Invariant cache hit.
[2026-05-24 23:46:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 23:46:37] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2026-05-24 23:46:37] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 524 ms. Remains : 144/144 places, 91/91 transitions.
Built C files in :
/tmp/ltsmin6478520251577000020
[2026-05-24 23:46:37] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2026-05-24 23:46:37] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 23:46:37] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2026-05-24 23:46:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 23:46:37] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2026-05-24 23:46:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 23:46:37] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6478520251577000020
Running compilation step : cd /tmp/ltsmin6478520251577000020;'/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 433 ms.
Running link step : cd /tmp/ltsmin6478520251577000020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6478520251577000020;'/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/stateBased13377929415681439702.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 23:46:52] [INFO ] Flatten gal took : 12 ms
[2026-05-24 23:46:52] [INFO ] Flatten gal took : 12 ms
[2026-05-24 23:46:52] [INFO ] Time to serialize gal into /tmp/LTL8612797835215115726.gal : 4 ms
[2026-05-24 23:46:53] [INFO ] Time to serialize properties into /tmp/LTL16840964655655449614.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8612797835215115726.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6311474234884816917.hoa' '-atoms' '/tmp/LTL16840964655655449614.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16840964655655449614.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6311474234884816917.hoa
Detected timeout of ITS tools.
[2026-05-24 23:47:08] [INFO ] Flatten gal took : 11 ms
[2026-05-24 23:47:08] [INFO ] Flatten gal took : 11 ms
[2026-05-24 23:47:08] [INFO ] Time to serialize gal into /tmp/LTL1271400085069962928.gal : 7 ms
[2026-05-24 23:47:08] [INFO ] Time to serialize properties into /tmp/LTL11137635523353639574.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1271400085069962928.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11137635523353639574.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p44!=1)&&((p162!=1)||(p171!=1)))"))))
Formula 0 simplified : FG!"((p44!=1)&&((p162!=1)||(p171!=1)))"
Detected timeout of ITS tools.
[2026-05-24 23:47:23] [INFO ] Flatten gal took : 10 ms
[2026-05-24 23:47:23] [INFO ] Applying decomposition
[2026-05-24 23:47:23] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3408219056937636981.txt' '-o' '/tmp/graph3408219056937636981.bin' '-w' '/tmp/graph3408219056937636981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3408219056937636981.bin' '-l' '-1' '-v' '-w' '/tmp/graph3408219056937636981.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:47:23] [INFO ] Decomposing Gal with order
[2026-05-24 23:47:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:47:23] [INFO ] Removed a total of 40 redundant transitions.
[2026-05-24 23:47:23] [INFO ] Flatten gal took : 89 ms
[2026-05-24 23:47:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 15 ms.
[2026-05-24 23:47:23] [INFO ] Time to serialize gal into /tmp/LTL12886989441252044887.gal : 5 ms
[2026-05-24 23:47:23] [INFO ] Time to serialize properties into /tmp/LTL8102923060864894027.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12886989441252044887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8102923060864894027.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i2.u1.p44!=1)&&((i1.u11.p162!=1)||(i13.i1.u14.p171!=1)))"))))
Formula 0 simplified : FG!"((i2.u1.p44!=1)&&((i1.u11.p162!=1)||(i13.i1.u14.p171!=1)))"
Reverse transition relation is NOT exact ! Due to transitions t201_t80, t7_t49_t40, t9_t35, t10_t35, t168_t35, t167_t26, t106_t107_t126_t206_t133_t134_t123...445
Computing Next relation with stutter on 1.20585e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-05b-LTLFireability-13 finished in 119107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U X(X(X(G(p1)))))) U (p2&&F(p3))))'
Support contains 4 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 256 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 256 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 256 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 254 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 254 transition count 196
Applied a total of 19 rules in 16 ms. Remains 254 /262 variables (removed 8) and now considering 196/207 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1678959633740649355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13912768367886875880.kers'
[2026-05-24 23:47:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1678959633740649355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13912768367886875880.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 254 cols 603 entries
Finished phase 1 with 141 SingleSign rule and 52 generalized
[2026-05-24 23:47:38] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13912768367886875880.kers
Total runtime 2 ms.
[2026-05-24 23:47:38] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-24 23:47:38] [INFO ] Invariant cache hit.
[2026-05-24 23:47:39] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2026-05-24 23:47:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/254 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/450 variables, 254/315 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 8/323 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 16/339 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 15/354 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/450 variables, and 360 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/254 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 45/106 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 7/113 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 196/450 variables, 254/368 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 195/563 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 10/573 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 573 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60043ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 60044ms
Starting structural reductions in LTL mode, iteration 1 : 254/262 places, 196/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60860 ms. Remains : 254/262 places, 196/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U X(X(X(G(p1)))))) U (p2&&F(p3))))'
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p2) (NOT p3)), (NOT p3), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-14 finished in 61150 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))))) U (p2||X(G(p0)))))'
Support contains 3 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 257 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 257 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 257 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 255 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 255 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 255 transition count 196
Applied a total of 18 rules in 10 ms. Remains 255 /262 variables (removed 7) and now considering 196/207 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16156086135497813966.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9579212097571347064.kers'
[2026-05-24 23:48:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16156086135497813966.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9579212097571347064.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 255 cols 605 entries
Finished phase 1 with 141 SingleSign rule and 53 generalized
[2026-05-24 23:48:39] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9579212097571347064.kers
Total runtime 2 ms.
[2026-05-24 23:48:39] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-24 23:48:39] [INFO ] Invariant cache hit.
[2026-05-24 23:48:40] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2026-05-24 23:48:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/451 variables, 255/316 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 16/352 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 8/360 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 451/451 variables, and 362 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 196/451 variables, 255/369 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 195/564 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 576 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60041ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Starting structural reductions in LTL mode, iteration 1 : 255/262 places, 196/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60893 ms. Remains : 255/262 places, 196/207 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))))) U (p2||X(G(p0)))))'
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) p0), (AND (NOT p1) (NOT p0)), (OR (NOT p1) p0), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 910 steps with 181 reset in 4 ms.
FORMULA DES-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-15 finished in 61232 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)))'
Spot run failed in 57 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-24 23:49:40] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1977506955278938252
[2026-05-24 23:49:40] [INFO ] Computing symmetric may disable matrix : 207 transitions.
[2026-05-24 23:49:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 23:49:40] [INFO ] Computing symmetric may enable matrix : 207 transitions.
[2026-05-24 23:49:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 23:49:40] [INFO ] Applying decomposition
[2026-05-24 23:49:41] [INFO ] Computing Do-Not-Accords matrix : 207 transitions.
[2026-05-24 23:49:41] [INFO ] Flatten gal took : 18 ms
[2026-05-24 23:49:41] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 23:49:41] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1977506955278938252
Running compilation step : cd /tmp/ltsmin1977506955278938252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16887499176844209444.txt' '-o' '/tmp/graph16887499176844209444.bin' '-w' '/tmp/graph16887499176844209444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16887499176844209444.bin' '-l' '-1' '-v' '-w' '/tmp/graph16887499176844209444.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:49:41] [INFO ] Decomposing Gal with order
[2026-05-24 23:49:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:49:41] [INFO ] Removed a total of 21 redundant transitions.
[2026-05-24 23:49:41] [INFO ] Flatten gal took : 46 ms
[2026-05-24 23:49:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 18 ms.
[2026-05-24 23:49:41] [INFO ] Time to serialize gal into /tmp/LTLFireability18158986008407851911.gal : 13 ms
[2026-05-24 23:49:41] [INFO ] Time to serialize properties into /tmp/LTLFireability16336910801362498602.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18158986008407851911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16336910801362498602.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.u8.p44!=1)&&((i11.i0.u38.p162!=1)||(i7.i1.u42.p171!=1)))"))))
Formula 0 simplified : FG!"((i1.u8.p44!=1)&&((i11.i0.u38.p162!=1)||(i7.i1.u42.p171!=1)))"
Compilation finished in 845 ms.
Running link step : cd /tmp/ltsmin1977506955278938252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1977506955278938252;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t63, t88, t152, t167, t168, t201, u35.t77, i0.i0.u34.t80, i1.t127, i1.u7.t133, i1.u7...851
Computing Next relation with stutter on 4.15068e+06 deadlock states
Detected timeout of ITS tools.
[2026-05-25 00:14:32] [INFO ] Applying decomposition
[2026-05-25 00:14:32] [INFO ] Flatten gal took : 30 ms
[2026-05-25 00:14:32] [INFO ] Decomposing Gal with order
[2026-05-25 00:14:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 00:14:32] [INFO ] Removed a total of 28 redundant transitions.
[2026-05-25 00:14:32] [INFO ] Flatten gal took : 30 ms
[2026-05-25 00:14:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 15 ms.
[2026-05-25 00:14:32] [INFO ] Time to serialize gal into /tmp/LTLFireability9822006960712609196.gal : 8 ms
[2026-05-25 00:14:32] [INFO ] Time to serialize properties into /tmp/LTLFireability4235173591308840199.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9822006960712609196.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4235173591308840199.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.i0.i0.i0.i0.i0.i0.u16.p44!=1)&&((i1.i1.i0.i1.i0.i0.i0.u45.p162!=1)||(i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.u146.p171!=1)))"))))
Formula 0 simplified : FG!"((i1.i0.i0.i0.i0.i0.i0.u16.p44!=1)&&((i1.i1.i0.i1.i0.i0.i0.u45.p162!=1)||(i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.u146.p171!=1)))"

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DES-PT-05b"
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 DES-PT-05b, 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 r082-smll-177946993700356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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