fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r082-smll-177946993700324
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DES-PT-01b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
529.027 462218.00 543431.00 1291.20 FTFFFFFTFFFTFFFT normal

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-177946993700324.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-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.5K Mar 6 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 6 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 6 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 18:27 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.3K Mar 15 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Mar 6 18:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 6 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:55 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 68K 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-01b-LTLFireability-00
FORMULA_NAME DES-PT-01b-LTLFireability-01
FORMULA_NAME DES-PT-01b-LTLFireability-02
FORMULA_NAME DES-PT-01b-LTLFireability-03
FORMULA_NAME DES-PT-01b-LTLFireability-04
FORMULA_NAME DES-PT-01b-LTLFireability-05
FORMULA_NAME DES-PT-01b-LTLFireability-06
FORMULA_NAME DES-PT-01b-LTLFireability-07
FORMULA_NAME DES-PT-01b-LTLFireability-08
FORMULA_NAME DES-PT-01b-LTLFireability-09
FORMULA_NAME DES-PT-01b-LTLFireability-10
FORMULA_NAME DES-PT-01b-LTLFireability-11
FORMULA_NAME DES-PT-01b-LTLFireability-12
FORMULA_NAME DES-PT-01b-LTLFireability-13
FORMULA_NAME DES-PT-01b-LTLFireability-14
FORMULA_NAME DES-PT-01b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779652881088

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-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 20:01:23] [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 20:01:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 20:01:24] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2026-05-24 20:01:24] [INFO ] Transformed 284 places.
[2026-05-24 20:01:24] [INFO ] Transformed 235 transitions.
[2026-05-24 20:01:24] [INFO ] Found NUPN structural information;
[2026-05-24 20:01:24] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 437 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-01b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 281 transition count 235
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 259 transition count 213
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 259 transition count 213
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 58 place count 248 transition count 202
Iterating global reduction 1 with 11 rules applied. Total rules applied 69 place count 248 transition count 202
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 77 place count 248 transition count 194
Applied a total of 77 rules in 153 ms. Remains 248 /284 variables (removed 36) and now considering 194/235 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7233635036493108867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6492440956392060087.kers'
[2026-05-24 20:01:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7233635036493108867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6492440956392060087.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 248 cols 581 entries
Finished phase 1 with 140 SingleSign rule and 46 generalized
[2026-05-24 20:01:24] [INFO ] Computed 62 invariants in 2 ms
Computed 62 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6492440956392060087.kers
Total runtime 5 ms.
[2026-05-24 20:01:25] [INFO ] Implicit Places using invariants in 807 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 892 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/284 places, 194/235 transitions.
Applied a total of 0 rules in 19 ms. Remains 246 /246 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1110 ms. Remains : 246/284 places, 194/235 transitions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 194/194 transitions.
Applied a total of 0 rules in 20 ms. Remains 246 /246 variables (removed 0) and now considering 194/194 (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-14054991099760902529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4154415995100677611.kers'
[2026-05-24 20:01:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14054991099760902529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4154415995100677611.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 246 cols 577 entries
Finished phase 1 with 140 SingleSign rule and 46 generalized
[2026-05-24 20:01:25] [INFO ] Computed 60 invariants in 5 ms
Computed 60 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4154415995100677611.kers
Total runtime 6 ms.
[2026-05-24 20:01:25] [INFO ] Implicit Places using invariants in 418 ms returned []
[2026-05-24 20:01:25] [INFO ] Invariant cache hit.
[2026-05-24 20:01:26] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-24 20:01:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/246 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 194/440 variables, 246/351 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 353 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/246 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 47/107 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 194/440 variables, 246/353 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 193/546 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 10/556 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 556 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Finished structural reductions in LTL mode , in 1 iterations and 61276 ms. Remains : 246/246 places, 194/194 transitions.
Support contains 52 out of 246 places after structural reductions.
[2026-05-24 20:02:27] [INFO ] Flatten gal took : 92 ms
[2026-05-24 20:02:27] [INFO ] Flatten gal took : 39 ms
[2026-05-24 20:02:27] [INFO ] Input system was already deterministic with 194 transitions.
RANDOM walk for 40000 steps (389 resets) in 1849 ms. (21 steps per ms) remains 1/35 properties
BEST_FIRST walk for 40004 steps (58 resets) in 514 ms. (77 steps per ms) remains 1/1 properties
[2026-05-24 20:02:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/193 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/224 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/230 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 181/411 variables, 230/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/430 variables, 11/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/436 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/438 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/440 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/440 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/440 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 246/246 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/193 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 31/224 variables, 21/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/230 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 181/411 variables, 230/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 7/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/411 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/430 variables, 11/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/436 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/436 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/438 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/438 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/440 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/440 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/440 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1969 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2262ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1543 steps, including 18 resets, run visited all 1 properties in 25 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 34 ms.
FORMULA DES-PT-01b-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 52 stabilizing places and 48 stable transitions
Graph (complete) has 441 edges and 246 vertex of which 241 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.18 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&&(p0 U p2)))))))'
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 194/194 transitions.
Graph (complete) has 441 edges and 246 vertex of which 241 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 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 240 transition count 172
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 222 transition count 171
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 38 place count 222 transition count 159
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 62 place count 210 transition count 159
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 204 transition count 153
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 204 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 204 transition count 151
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 79 place count 201 transition count 148
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 201 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 201 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 85 place count 201 transition count 143
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 89 place count 199 transition count 143
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 227 place count 130 transition count 74
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 231 place count 128 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 126 transition count 74
Applied a total of 233 rules in 118 ms. Remains 126 /246 variables (removed 120) and now considering 74/194 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1644075937991479248.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15197353087422337614.kers'
[2026-05-24 20:02:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1644075937991479248.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15197353087422337614.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 74 rows 120 cols 357 entries
Finished phase 1 with 24 SingleSign rule and 44 generalized
[2026-05-24 20:02:31] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15197353087422337614.kers
Total runtime 2 ms.
[2026-05-24 20:02:31] [INFO ] Implicit Places using invariants in 279 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 282 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/246 places, 74/194 transitions.
Applied a total of 0 rules in 10 ms. Remains 125 /125 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 410 ms. Remains : 125/246 places, 74/194 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&&(p0 U p2)))))))'
Stuttering acceptance computed with spot in 448 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DES-PT-01b-LTLFireability-00
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 4 ms.
FORMULA DES-PT-01b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-00 finished in 1007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1) U (X(p2) U (!p3||X(X(p4))))))))'
Support contains 7 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 194/194 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 239 transition count 187
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 239 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 239 transition count 184
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 236 transition count 181
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 236 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 236 transition count 178
Applied a total of 26 rules in 30 ms. Remains 236 /246 variables (removed 10) and now considering 178/194 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18403952827530395577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2625495062725686237.kers'
[2026-05-24 20:02:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18403952827530395577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2625495062725686237.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 236 cols 533 entries
Finished phase 1 with 132 SingleSign rule and 44 generalized
[2026-05-24 20:02:32] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2625495062725686237.kers
Total runtime 2 ms.
[2026-05-24 20:02:32] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-24 20:02:32] [INFO ] Invariant cache hit.
[2026-05-24 20:02:32] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2026-05-24 20:02:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 11/103 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 178/414 variables, 236/339 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 347 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 49/109 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 178/414 variables, 236/345 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 177/522 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 8/535 constraints. Problems are: Problem set: 0 solved, 177 unsolved
SMT process timed out in 60066ms, After SMT, problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 236/246 places, 178/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60849 ms. Remains : 236/246 places, 178/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1) U (X(p2) U (!p3||X(X(p4))))))))'
Stuttering acceptance computed with spot in 871 ms :[(AND p3 (NOT p4)), (AND p3 (NOT p4)), (AND p3 (NOT p4)), (OR (AND (NOT p2) (NOT p4)) (AND p3 (NOT p4))), (AND p3 (NOT p4)), (OR (AND p0 (NOT p1) p3 (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (NOT p4), true, (OR (AND (NOT p2) (NOT p4)) (AND p3 (NOT p4))), (AND p3 (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND p3 (NOT p1) p0 (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 435 ms.
Product exploration explored 100000 steps with 33333 reset in 276 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 416 edges and 236 vertex of which 231 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 21 ms. Proved property starting from automaton with 14 states, 27 edges and 5 AP (stutter sensitive
Knowledge-based reduction took 42 ms.
FORMULA DES-PT-01b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-01b-LTLFireability-01 finished in 62604 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 X(((F(p1)&&X(p2)) U p2))))'
Support contains 8 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 194/194 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 239 transition count 187
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 239 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 239 transition count 184
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 236 transition count 181
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 236 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 236 transition count 178
Applied a total of 26 rules in 20 ms. Remains 236 /246 variables (removed 10) and now considering 178/194 (removed 16) transitions.
[2026-05-24 20:03:34] [INFO ] Invariant cache hit.
[2026-05-24 20:03:34] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-24 20:03:34] [INFO ] Invariant cache hit.
[2026-05-24 20:03:35] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 236/246 places, 178/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 740 ms. Remains : 236/246 places, 178/194 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 X(((F(p1)&&X(p2)) U p2))))'
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), true]
Running random walk in product with property : DES-PT-01b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-03 finished in 1062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0)) U p1)||G(p2)))'
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 194/194 transitions.
Graph (complete) has 441 edges and 246 vertex of which 241 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 240 transition count 174
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 224 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 223 transition count 172
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 36 place count 223 transition count 160
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 60 place count 211 transition count 160
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 66 place count 205 transition count 154
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 205 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 205 transition count 152
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 77 place count 202 transition count 149
Iterating global reduction 4 with 3 rules applied. Total rules applied 80 place count 202 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 83 place count 202 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 83 place count 202 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 85 place count 201 transition count 145
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 229 place count 129 transition count 73
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 5 with 4 rules applied. Total rules applied 233 place count 127 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 125 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 124 transition count 73
Applied a total of 236 rules in 75 ms. Remains 124 /246 variables (removed 122) and now considering 73/194 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7106274765042450058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7295125981276142923.kers'
[2026-05-24 20:03:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7106274765042450058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7295125981276142923.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 0 ms.
// Phase 1: matrix 73 rows 98 cols 268 entries
Finished phase 1 with 57 SingleSign rule and 10 generalized
[2026-05-24 20:03:35] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7295125981276142923.kers
Total runtime 1 ms.
[2026-05-24 20:03:36] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-24 20:03:36] [INFO ] Invariant cache hit.
[2026-05-24 20:03:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 20:03:36] [INFO ] Implicit Places using invariants and state equation in 381 ms returned [7, 33, 37, 38, 42, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 98, 119]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 642 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/246 places, 73/194 transitions.
Graph (complete) has 233 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 97 transition count 60
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 87 transition count 60
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 57 place count 62 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 60 transition count 48
Applied a total of 60 rules in 13 ms. Remains 60 /101 variables (removed 41) and now considering 48/73 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2934416015259733088.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15436158739506861336.kers'
[2026-05-24 20:03:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2934416015259733088.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15436158739506861336.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 174 entries
Finished phase 1 with 35 SingleSign rule and 7 generalized
[2026-05-24 20:03:36] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15436158739506861336.kers
Total runtime 1 ms.
[2026-05-24 20:03:36] [INFO ] Implicit Places using invariants in 121 ms returned [46, 49]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 122 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/246 places, 48/194 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 56 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 56 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 55 transition count 44
Applied a total of 6 rules in 13 ms. Remains 55 /58 variables (removed 3) and now considering 44/48 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4521896905305595377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4054810658122510451.kers'
[2026-05-24 20:03:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4521896905305595377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4054810658122510451.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 44 rows 48 cols 158 entries
Finished phase 1 with 34 SingleSign rule and 5 generalized
[2026-05-24 20:03:36] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4054810658122510451.kers
Total runtime 1 ms.
[2026-05-24 20:03:36] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-24 20:03:36] [INFO ] Invariant cache hit.
[2026-05-24 20:03:36] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 55/246 places, 44/194 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1134 ms. Remains : 55/246 places, 44/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0)) U p1)||G(p2)))'
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-01b-LTLFireability-04
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA DES-PT-01b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-04 finished in 1390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 194/194 transitions.
Graph (complete) has 441 edges and 246 vertex of which 241 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 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 240 transition count 173
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 223 transition count 173
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 223 transition count 161
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 211 transition count 161
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 205 transition count 155
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 205 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 205 transition count 153
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 76 place count 202 transition count 150
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 202 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 82 place count 202 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 82 place count 202 transition count 145
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 86 place count 200 transition count 145
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 234 place count 126 transition count 71
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 4 with 2 rules applied. Total rules applied 236 place count 125 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 123 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 240 place count 121 transition count 69
Applied a total of 240 rules in 68 ms. Remains 121 /246 variables (removed 125) and now considering 69/194 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15651985020760099298.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2684451928389609.kers'
[2026-05-24 20:03:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15651985020760099298.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2684451928389609.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 69 rows 93 cols 236 entries
Finished phase 1 with 53 SingleSign rule and 12 generalized
[2026-05-24 20:03:37] [INFO ] Computed 56 invariants in 0 ms
Computed 56 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2684451928389609.kers
Total runtime 1 ms.
[2026-05-24 20:03:37] [INFO ] Implicit Places using invariants in 260 ms returned []
[2026-05-24 20:03:37] [INFO ] Invariant cache hit.
[2026-05-24 20:03:37] [INFO ] Implicit Places using invariants and state equation in 387 ms returned [7, 31, 35, 39, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 95, 116]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 650 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/246 places, 69/194 transitions.
Graph (complete) has 229 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 95 transition count 56
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 85 transition count 56
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 59 place count 59 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 57 transition count 43
Applied a total of 62 rules in 15 ms. Remains 57 /99 variables (removed 42) and now considering 43/69 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4360493509072960641.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13302859952648568062.kers'
[2026-05-24 20:03:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4360493509072960641.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13302859952648568062.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 43 rows 48 cols 146 entries
Finished phase 1 with 32 SingleSign rule and 7 generalized
[2026-05-24 20:03:37] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13302859952648568062.kers
Total runtime 1 ms.
[2026-05-24 20:03:37] [INFO ] Implicit Places using invariants in 104 ms returned [43, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 106 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/246 places, 43/194 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 53 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 53 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 52 transition count 39
Applied a total of 6 rules in 9 ms. Remains 52 /55 variables (removed 3) and now considering 39/43 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3923929511857451736.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6764595513678557759.kers'
[2026-05-24 20:03:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3923929511857451736.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6764595513678557759.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 39 rows 43 cols 130 entries
Finished phase 1 with 31 SingleSign rule and 5 generalized
[2026-05-24 20:03:38] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6764595513678557759.kers
Total runtime 1 ms.
[2026-05-24 20:03:38] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-24 20:03:38] [INFO ] Invariant cache hit.
[2026-05-24 20:03:38] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 52/246 places, 39/194 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1095 ms. Remains : 52/246 places, 39/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-05
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-05 finished in 1178 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(((!p1||X(!p2)) U (p3&&(!p1||X(!p2)))))||p0))) U G(p4)))'
Support contains 5 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 194/194 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 241 transition count 189
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 241 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 241 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 239 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 239 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 239 transition count 183
Applied a total of 18 rules in 16 ms. Remains 239 /246 variables (removed 7) and now considering 183/194 (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-15347263535800784541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3307553698811221421.kers'
[2026-05-24 20:03:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15347263535800784541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3307553698811221421.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 239 cols 547 entries
Finished phase 1 with 134 SingleSign rule and 45 generalized
[2026-05-24 20:03:38] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3307553698811221421.kers
Total runtime 2 ms.
[2026-05-24 20:03:38] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-24 20:03:38] [INFO ] Invariant cache hit.
[2026-05-24 20:03:39] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2026-05-24 20:03:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 17/102 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 183/422 variables, 239/344 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 5/349 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/422 variables, and 350 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 183/422 variables, 239/355 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 182/537 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 8/545 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 550 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 239/246 places, 183/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60771 ms. Remains : 239/246 places, 183/194 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(((!p1||X(!p2)) U (p3&&(!p1||X(!p2)))))||p0))) U G(p4)))'
Stuttering acceptance computed with spot in 581 ms :[(NOT p4), (OR (AND (NOT p0) p1 p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 p2 (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) p1 p2) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (AND p1 p2)), p2, true, (OR (AND (NOT p0) p1 p2 (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND p0 (NOT p3) (NOT p4)) (AND p1 p2 (NOT p4))), (AND (NOT p4) p2), (NOT p4)]
Running random walk in product with property : DES-PT-01b-LTLFireability-06
Stuttering criterion allowed to conclude after 5656 steps with 470 reset in 23 ms.
FORMULA DES-PT-01b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-06 finished in 61461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U X(X(!p2))))'
Support contains 5 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 194/194 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 240 transition count 188
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 240 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 240 transition count 186
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 237 transition count 183
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 237 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 237 transition count 180
Applied a total of 23 rules in 18 ms. Remains 237 /246 variables (removed 9) and now considering 180/194 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4180968384719784668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11106532814705529056.kers'
[2026-05-24 20:04:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4180968384719784668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11106532814705529056.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 237 cols 539 entries
Finished phase 1 with 133 SingleSign rule and 44 generalized
[2026-05-24 20:04:39] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11106532814705529056.kers
Total runtime 2 ms.
[2026-05-24 20:04:40] [INFO ] Implicit Places using invariants in 271 ms returned []
[2026-05-24 20:04:40] [INFO ] Invariant cache hit.
[2026-05-24 20:04:40] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2026-05-24 20:04:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 180/417 variables, 237/344 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/417 variables, and 348 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 180/417 variables, 237/348 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 179/527 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 6/533 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 537 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 237/246 places, 180/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60813 ms. Remains : 237/246 places, 180/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U X(X(!p2))))'
Stuttering acceptance computed with spot in 549 ms :[p2, p2, (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, p2, true, (AND (NOT p0) p2), (AND (NOT p1) p0 p2), p2, (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 131 ms.
Product exploration explored 100000 steps with 33333 reset in 167 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 419 edges and 237 vertex of which 232 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 14 factoid took 18 ms. Proved property starting from automaton with 13 states, 27 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA DES-PT-01b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-01b-LTLFireability-07 finished in 61742 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((X(p0)||G(p1)))||F(p2))))'
Support contains 6 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 194/194 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 240 transition count 188
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 240 transition count 188
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 240 transition count 185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 237 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 237 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 237 transition count 179
Applied a total of 24 rules in 21 ms. Remains 237 /246 variables (removed 9) and now considering 179/194 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4988138012628132012.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16113316518828561187.kers'
[2026-05-24 20:05:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4988138012628132012.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16113316518828561187.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 237 cols 537 entries
Finished phase 1 with 132 SingleSign rule and 45 generalized
[2026-05-24 20:05:41] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16113316518828561187.kers
Total runtime 3 ms.
[2026-05-24 20:05:41] [INFO ] Implicit Places using invariants in 316 ms returned []
[2026-05-24 20:05:41] [INFO ] Invariant cache hit.
[2026-05-24 20:05:42] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2026-05-24 20:05:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 19/101 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 179/416 variables, 237/348 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/416 variables, and 355 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 58/118 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 11 (OVERLAPS) 179/416 variables, 237/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 178/542 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 543 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 237/246 places, 179/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60901 ms. Remains : 237/246 places, 179/194 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((X(p0)||G(p1)))||F(p2))))'
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DES-PT-01b-LTLFireability-08
Stuttering criterion allowed to conclude after 129 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-08 finished in 61234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||((p1 U (p2||G(p1))) U (F(p0) U p3))))))'
Support contains 5 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 194/194 transitions.
Graph (complete) has 441 edges and 246 vertex of which 241 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 240 transition count 175
Reduce places removed 15 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 225 transition count 172
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 222 transition count 171
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 38 place count 222 transition count 159
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 62 place count 210 transition count 159
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 67 place count 205 transition count 154
Iterating global reduction 3 with 5 rules applied. Total rules applied 72 place count 205 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 205 transition count 152
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 76 place count 203 transition count 150
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 203 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 203 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 80 place count 203 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 82 place count 202 transition count 147
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 224 place count 131 transition count 76
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 5 with 2 rules applied. Total rules applied 226 place count 130 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 228 place count 128 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 230 place count 126 transition count 74
Applied a total of 230 rules in 49 ms. Remains 126 /246 variables (removed 120) and now considering 74/194 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17917304467193621046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15825252388215294006.kers'
[2026-05-24 20:06:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17917304467193621046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15825252388215294006.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 74 rows 107 cols 268 entries
Finished phase 1 with 59 SingleSign rule and 11 generalized
[2026-05-24 20:06:42] [INFO ] Computed 56 invariants in 0 ms
Computed 56 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15825252388215294006.kers
Total runtime 1 ms.
[2026-05-24 20:06:43] [INFO ] Implicit Places using invariants in 243 ms returned []
[2026-05-24 20:06:43] [INFO ] Invariant cache hit.
[2026-05-24 20:06:43] [INFO ] Implicit Places using invariants and state equation in 373 ms returned [7, 37, 41, 62, 64, 66, 68, 70, 72, 74, 76, 78, 100, 121]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 619 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/246 places, 74/194 transitions.
Graph (complete) has 262 edges and 112 vertex of which 110 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 108 transition count 63
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 20 place count 97 transition count 63
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 52 place count 75 transition count 53
Applied a total of 52 rules in 8 ms. Remains 75 /112 variables (removed 37) and now considering 53/74 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12978243933715548421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8768528824481132357.kers'
[2026-05-24 20:06:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12978243933715548421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8768528824481132357.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 53 rows 66 cols 185 entries
Finished phase 1 with 41 SingleSign rule and 8 generalized
[2026-05-24 20:06:43] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8768528824481132357.kers
Total runtime 1 ms.
[2026-05-24 20:06:43] [INFO ] Implicit Places using invariants in 149 ms returned [44, 45, 49, 52, 55, 61, 64]
[2026-05-24 20:06:43] [INFO ] Actually due to overlaps returned [44, 52, 55, 61, 64]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 151 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/246 places, 53/194 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 69 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 69 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 68 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 68 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 66 transition count 48
Applied a total of 8 rules in 7 ms. Remains 66 /70 variables (removed 4) and now considering 48/53 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9586599827926878884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1155440821085665360.kers'
[2026-05-24 20:06:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9586599827926878884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1155440821085665360.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 48 rows 58 cols 163 entries
Finished phase 1 with 40 SingleSign rule and 5 generalized
[2026-05-24 20:06:43] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1155440821085665360.kers
Total runtime 1 ms.
[2026-05-24 20:06:43] [INFO ] Implicit Places using invariants in 120 ms returned [44, 48]
[2026-05-24 20:06:43] [INFO ] Actually due to overlaps returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 65/246 places, 48/194 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 960 ms. Remains : 65/246 places, 48/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||((p1 U (p2||G(p1))) U (F(p0) U p3))))))'
Stuttering acceptance computed with spot in 480 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), false]
Running random walk in product with property : DES-PT-01b-LTLFireability-10
Product exploration explored 100000 steps with 15101 reset in 315 ms.
Product exploration explored 100000 steps with 15054 reset in 359 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge based reduction with 17 factoid took 510 ms. Reduced automaton from 8 states, 36 edges and 4 AP (stutter insensitive) to 8 states, 34 edges and 4 AP (stutter insensitive).
RANDOM walk for 31379 steps (2221 resets) in 312 ms. (100 steps per ms) remains 0/15 properties
Knowledge based reduction with 17 factoid took 794 ms. Reduced automaton from 8 states, 34 edges and 4 AP (stutter insensitive) to 8 states, 34 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 455 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), false]
Knowledge-based reduction took 1887 ms.
Stuttering acceptance computed with spot in 469 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), false]
Support contains 5 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 48/48 (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-16857312531320728872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17445030556972072816.kers'
[2026-05-24 20:06:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16857312531320728872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17445030556972072816.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 48 rows 58 cols 163 entries
Finished phase 1 with 40 SingleSign rule and 5 generalized
[2026-05-24 20:06:47] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17445030556972072816.kers
Total runtime 1 ms.
[2026-05-24 20:06:47] [INFO ] Implicit Places using invariants in 109 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/65 places, 48/48 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 64 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 47
Applied a total of 2 rules in 2 ms. Remains 63 /64 variables (removed 1) and now considering 47/48 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14173675021326219987.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6649179108938157389.kers'
[2026-05-24 20:06:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14173675021326219987.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6649179108938157389.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 47 rows 55 cols 157 entries
Finished phase 1 with 40 SingleSign rule and 4 generalized
[2026-05-24 20:06:47] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6649179108938157389.kers
Total runtime 1 ms.
[2026-05-24 20:06:47] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-24 20:06:47] [INFO ] Invariant cache hit.
[2026-05-24 20:06:47] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/65 places, 47/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 362 ms. Remains : 63/65 places, 47/48 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge based reduction with 17 factoid took 574 ms. Reduced automaton from 8 states, 34 edges and 4 AP (stutter insensitive) to 8 states, 34 edges and 4 AP (stutter insensitive).
RANDOM walk for 33992 steps (2423 resets) in 282 ms. (120 steps per ms) remains 0/15 properties
Knowledge based reduction with 17 factoid took 904 ms. Reduced automaton from 8 states, 34 edges and 4 AP (stutter insensitive) to 8 states, 34 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 434 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), false]
Knowledge-based reduction took 2030 ms.
Stuttering acceptance computed with spot in 418 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), false]
Stuttering acceptance computed with spot in 432 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), false]
Product exploration explored 100000 steps with 15162 reset in 451 ms.
Product exploration explored 100000 steps with 15124 reset in 625 ms.
Built C files in :
/tmp/ltsmin1157377605453568289
[2026-05-24 20:06:51] [INFO ] Computing symmetric may disable matrix : 47 transitions.
[2026-05-24 20:06:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 20:06:51] [INFO ] Computing symmetric may enable matrix : 47 transitions.
[2026-05-24 20:06:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 20:06:51] [INFO ] Computing Do-Not-Accords matrix : 47 transitions.
[2026-05-24 20:06:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 20:06:51] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1157377605453568289
Running compilation step : cd /tmp/ltsmin1157377605453568289;'/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 384 ms.
Running link step : cd /tmp/ltsmin1157377605453568289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin1157377605453568289;'/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/stateBased13989211053372449054.hoa' '--buchi-type=spotba'
LTSmin run took 740 ms.
FORMULA DES-PT-01b-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-10 finished in 10217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X((p0&&X(p1)))))&&(p1||G(p0)))))'
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 194/194 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 240 transition count 188
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 240 transition count 188
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 240 transition count 185
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 238 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 238 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 238 transition count 181
Applied a total of 21 rules in 12 ms. Remains 238 /246 variables (removed 8) and now considering 181/194 (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-5020067805624232240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9074142953479454240.kers'
[2026-05-24 20:06:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5020067805624232240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9074142953479454240.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 238 cols 541 entries
Finished phase 1 with 134 SingleSign rule and 44 generalized
[2026-05-24 20:06:53] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9074142953479454240.kers
Total runtime 2 ms.
[2026-05-24 20:06:53] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-24 20:06:53] [INFO ] Invariant cache hit.
[2026-05-24 20:06:53] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2026-05-24 20:06:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (OVERLAPS) 181/419 variables, 238/348 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/419 variables, and 348 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 181/419 variables, 238/349 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 180/529 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 12/541 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/419 variables, and 543 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60044ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 60045ms
Starting structural reductions in LTL mode, iteration 1 : 238/246 places, 181/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60708 ms. Remains : 238/246 places, 181/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X((p0&&X(p1)))))&&(p1||G(p0)))))'
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-01b-LTLFireability-11
Product exploration explored 100000 steps with 16666 reset in 144 ms.
Product exploration explored 100000 steps with 16666 reset in 161 ms.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 421 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 308 steps (1 resets) in 5 ms. (51 steps per ms) remains 0/2 properties
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Knowledge-based reduction took 544 ms.
Stuttering acceptance computed with spot in 321 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 181/181 transitions.
Applied a total of 0 rules in 6 ms. Remains 238 /238 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2026-05-24 20:07:55] [INFO ] Invariant cache hit.
[2026-05-24 20:07:55] [INFO ] Implicit Places using invariants in 299 ms returned []
[2026-05-24 20:07:55] [INFO ] Invariant cache hit.
[2026-05-24 20:07:56] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 824 ms. Remains : 238/238 places, 181/181 transitions.
Computed a total of 51 stabilizing places and 47 stable transitions
Graph (complete) has 421 edges and 238 vertex of which 233 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 51 stabilizing places and 47 stable transitions
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 812 steps (7 resets) in 6 ms. (116 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Knowledge-based reduction took 474 ms.
Stuttering acceptance computed with spot in 301 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 321 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16666 reset in 385 ms.
Product exploration explored 100000 steps with 16666 reset in 440 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/ltsmin16056528933582517677
[2026-05-24 20:07:58] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16056528933582517677
Running compilation step : cd /tmp/ltsmin16056528933582517677;'/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 579 ms.
Running link step : cd /tmp/ltsmin16056528933582517677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16056528933582517677;'/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/stateBased8125380500730807698.hoa' '--buchi-type=spotba'
LTSmin run took 45 ms.
FORMULA DES-PT-01b-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01b-LTLFireability-11 finished in 65820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 194/194 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 239 transition count 187
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 239 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 239 transition count 184
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 236 transition count 181
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 236 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 236 transition count 178
Applied a total of 26 rules in 16 ms. Remains 236 /246 variables (removed 10) and now considering 178/194 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-578249821768377595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16565052507692674815.kers'
[2026-05-24 20:07:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-578249821768377595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16565052507692674815.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 236 cols 533 entries
Finished phase 1 with 132 SingleSign rule and 44 generalized
[2026-05-24 20:07:58] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16565052507692674815.kers
Total runtime 3 ms.
[2026-05-24 20:07:59] [INFO ] Implicit Places using invariants in 275 ms returned []
[2026-05-24 20:07:59] [INFO ] Invariant cache hit.
[2026-05-24 20:07:59] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2026-05-24 20:07:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 11/103 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 178/414 variables, 236/339 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 345 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 49/109 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/414 variables, 236/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 177/523 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 5/528 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 534 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60041ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Starting structural reductions in LTL mode, iteration 1 : 236/246 places, 178/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60806 ms. Remains : 236/246 places, 178/194 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&&G(p1))))'
Stuttering acceptance computed with spot in 159 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-01b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-01b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01b-LTLFireability-14 finished in 61003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 194/194 transitions.
Graph (complete) has 441 edges and 246 vertex of which 241 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 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 240 transition count 172
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 222 transition count 171
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 38 place count 222 transition count 159
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 62 place count 210 transition count 159
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 204 transition count 153
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 204 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 204 transition count 151
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 79 place count 201 transition count 148
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 201 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 201 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 85 place count 201 transition count 143
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 89 place count 199 transition count 143
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 233 place count 127 transition count 71
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 237 place count 125 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 123 transition count 71
Applied a total of 239 rules in 45 ms. Remains 123 /246 variables (removed 123) and now considering 71/194 (removed 123) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3045971712752435581.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13297245227558174616.kers'
[2026-05-24 20:08:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3045971712752435581.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13297245227558174616.kers]
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 0 ms.
// Phase 1: matrix 71 rows 101 cols 304 entries
Finished phase 1 with 38 SingleSign rule and 27 generalized
[2026-05-24 20:08:59] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13297245227558174616.kers
Total runtime 2 ms.
[2026-05-24 20:09:00] [INFO ] Implicit Places using invariants in 267 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 269 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/246 places, 71/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 319 ms. Remains : 122/246 places, 71/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01b-LTLFireability-15
Product exploration explored 100000 steps with 40065 reset in 439 ms.
Product exploration explored 100000 steps with 39979 reset in 372 ms.
Computed a total of 15 stabilizing places and 12 stable transitions
Computed a total of 15 stabilizing places and 12 stable transitions
Detected a total of 15/122 stabilizing places and 12/71 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14710292948862343503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8328511234458985181.kers'
[2026-05-24 20:09:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14710292948862343503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8328511234458985181.kers]
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 0 ms.
// Phase 1: matrix 71 rows 101 cols 304 entries
Finished phase 1 with 38 SingleSign rule and 27 generalized
[2026-05-24 20:09:01] [INFO ] Computed 57 invariants in 0 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8328511234458985181.kers
Total runtime 1 ms.
[2026-05-24 20:09:01] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2026-05-24 20:09:01] [INFO ] [Real]Absence check using 34 positive and 23 generalized place invariants in 25 ms returned sat
[2026-05-24 20:09:01] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2026-05-24 20:09:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 20:09:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2026-05-24 20:09:01] [INFO ] [Nat]Absence check using 34 positive and 23 generalized place invariants in 17 ms returned sat
[2026-05-24 20:09:01] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2026-05-24 20:09:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-24 20:09:01] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2026-05-24 20:09:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2026-05-24 20:09:02] [INFO ] Computed and/alt/rep : 61/186/61 causal constraints (skipped 8 transitions) in 6 ms.
[2026-05-24 20:09:02] [INFO ] Added : 15 causal constraints over 3 iterations in 92 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1209 ms.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 71/71 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2026-05-24 20:09:02] [INFO ] Invariant cache hit.
[2026-05-24 20:09:02] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-24 20:09:02] [INFO ] Invariant cache hit.
[2026-05-24 20:09:02] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-24 20:09:02] [INFO ] Implicit Places using invariants and state equation in 395 ms returned [31, 35, 36, 40, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 96, 117]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 577 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/122 places, 71/71 transitions.
Graph (complete) has 243 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 97 transition count 59
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 87 transition count 59
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 59 place count 61 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 59 transition count 46
Applied a total of 62 rules in 8 ms. Remains 59 /100 variables (removed 41) and now considering 46/71 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15136045792274240727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12219600505726909257.kers'
[2026-05-24 20:09:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15136045792274240727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12219600505726909257.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 46 rows 56 cols 214 entries
Finished phase 1 with 36 SingleSign rule and 4 generalized
[2026-05-24 20:09:02] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12219600505726909257.kers
Total runtime 1 ms.
[2026-05-24 20:09:02] [INFO ] Implicit Places using invariants in 88 ms returned [45, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/122 places, 46/71 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 55 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 55 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 54 transition count 42
Applied a total of 6 rules in 6 ms. Remains 54 /57 variables (removed 3) and now considering 42/46 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14037743422491700916.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17476395564575830957.kers'
[2026-05-24 20:09:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14037743422491700916.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17476395564575830957.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 42 rows 51 cols 198 entries
Finished phase 1 with 34 SingleSign rule and 3 generalized
[2026-05-24 20:09:02] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17476395564575830957.kers
Total runtime 1 ms.
[2026-05-24 20:09:03] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-24 20:09:03] [INFO ] Invariant cache hit.
[2026-05-24 20:09:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-24 20:09:03] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 54/122 places, 42/71 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 899 ms. Remains : 54/122 places, 42/71 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/54 stabilizing places and 6/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 3 factoid took 87 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 89 ms.
FORMULA DES-PT-01b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-01b-LTLFireability-15 finished in 3440 ms.
All properties solved by simple procedures.
Total runtime 459671 ms.

BK_STOP 1779653343306

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

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