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.r338-smll-178021499100076.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 ErlangenMainframeV1-PT-bP04C04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.9K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 27 10:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 27 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 27 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 200K May 26 18:17 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 ErlangenMainframeV1-PT-bP04C04-LTLFireability-00
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-01
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-02
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-03
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-04
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-05
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-06
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-07
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-08
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-09
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-10
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-11
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-12
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-13
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-14
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780261560029

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP04C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-31 21:06:02] [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-31 21:06:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 21:06:03] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2026-05-31 21:06:03] [INFO ] Transformed 233 places.
[2026-05-31 21:06:03] [INFO ] Transformed 507 transitions.
[2026-05-31 21:06:03] [INFO ] Found NUPN structural information;
[2026-05-31 21:06:03] [INFO ] Parsed PT model containing 233 places and 507 transitions and 3455 arcs in 469 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 2 formulas.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 507/507 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 186 transition count 460
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 186 transition count 460
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 117 place count 163 transition count 437
Iterating global reduction 0 with 23 rules applied. Total rules applied 140 place count 163 transition count 437
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 142 place count 161 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 144 place count 161 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 145 place count 160 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 146 place count 160 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 147 place count 159 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 148 place count 159 transition count 425
Applied a total of 148 rules in 160 ms. Remains 159 /233 variables (removed 74) and now considering 425/507 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16060208347306213744.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8095908132896360445.kers'
[2026-05-31 21:06:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16060208347306213744.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8095908132896360445.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 425 rows 159 cols 3255 entries
Finished phase 1 with 142 SingleSign rule and 3 generalized
[2026-05-31 21:06:03] [INFO ] Computed 14 invariants in 5 ms
Computed 14 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8095908132896360445.kers
Total runtime 9 ms.
[2026-05-31 21:06:04] [INFO ] Implicit Places using invariants in 478 ms returned []
[2026-05-31 21:06:04] [INFO ] Invariant cache hit.
[2026-05-31 21:06:04] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2026-05-31 21:06:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (OVERLAPS) 425/584 variables, 159/183 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/584 variables, and 183 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (OVERLAPS) 425/584 variables, 159/186 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 424/610 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/584 variables, and 613 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61451ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 61499ms
Starting structural reductions in LTL mode, iteration 1 : 159/233 places, 425/507 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62830 ms. Remains : 159/233 places, 425/507 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Applied a total of 0 rules in 8 ms. Remains 159 /159 variables (removed 0) and now considering 425/425 (removed 0) transitions.
[2026-05-31 21:07:06] [INFO ] Invariant cache hit.
[2026-05-31 21:07:06] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-31 21:07:06] [INFO ] Invariant cache hit.
[2026-05-31 21:07:06] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 159/159 places, 425/425 transitions.
Support contains 52 out of 159 places after structural reductions.
[2026-05-31 21:07:07] [INFO ] Flatten gal took : 205 ms
[2026-05-31 21:07:07] [INFO ] Flatten gal took : 118 ms
[2026-05-31 21:07:07] [INFO ] Input system was already deterministic with 425 transitions.
Reduction of identical properties reduced properties to check from 37 to 36
RANDOM walk for 40000 steps (8 resets) in 4586 ms. (8 steps per ms) remains 18/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
[2026-05-31 21:07:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 81/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 26/143 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 16/159 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 425/584 variables, 159/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/584 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/584 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 173 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1602 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 81/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 26/143 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 16/159 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 425/584 variables, 159/175 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 18/193 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/584 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/584 variables, and 194 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6697ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 425/425 transitions.
Graph (trivial) has 112 edges and 159 vertex of which 9 / 159 are part of one of the 4 SCC in 21 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 154 transition count 384
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 45 rules applied. Total rules applied 77 place count 123 transition count 370
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 84 place count 117 transition count 369
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 116 transition count 368
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 86 place count 116 transition count 360
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 102 place count 108 transition count 360
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 105 place count 105 transition count 357
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 105 transition count 357
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 108 place count 105 transition count 355
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 112 place count 103 transition count 355
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 152 place count 83 transition count 335
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 153 place count 82 transition count 329
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 82 transition count 329
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 166 place count 76 transition count 353
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 168 place count 76 transition count 351
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 169 place count 75 transition count 347
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 75 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 171 place count 75 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 172 place count 75 transition count 345
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 179 place count 75 transition count 338
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 186 place count 68 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 188 place count 68 transition count 336
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 189 place count 68 transition count 335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 190 place count 67 transition count 335
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 193 place count 67 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 196 place count 67 transition count 332
Applied a total of 196 rules in 373 ms. Remains 67 /159 variables (removed 92) and now considering 332/425 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 67/159 places, 332/425 transitions.
RANDOM walk for 40000 steps (8 resets) in 1978 ms. (20 steps per ms) remains 11/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 404 ms. (98 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 289 ms. (137 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 236 ms. (168 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 259 ms. (153 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 252 ms. (158 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 258 ms. (154 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 241 ms. (165 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2467723762720214101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4623309879792508539.kers'
[2026-05-31 21:07:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2467723762720214101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4623309879792508539.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 332 rows 67 cols 3105 entries
Finished phase 1 with 50 SingleSign rule and 3 generalized
[2026-05-31 21:07:17] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4623309879792508539.kers
Total runtime 3 ms.
[2026-05-31 21:07:17] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 20/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 10/56 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 11/67 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 332/399 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/399 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 101 constraints, problems are : Problem set: 0 solved, 9 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 20/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 10/56 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 11/67 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 332/399 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/399 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 110 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2074 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2635ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 8 properties in 2304 ms.
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 67 transition count 328
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 63 transition count 328
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 8 place count 63 transition count 322
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 57 transition count 322
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 30 place count 47 transition count 221
Ensure Unique test removed 4 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 44 place count 43 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 43 transition count 220
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 49 place count 39 transition count 90
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 39 transition count 90
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 61 place count 35 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 35 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
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 66 place count 33 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 33 transition count 92
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 72 place count 33 transition count 89
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 76 place count 30 transition count 88
Applied a total of 76 rules in 43 ms. Remains 30 /67 variables (removed 37) and now considering 88/332 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 30/67 places, 88/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 1427 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 651 ms. (61 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4673 steps, run visited all 1 properties in 35 ms. (steps per millisecond=133 )
Probabilistic random walk after 4673 steps, saw 1106 distinct states, run finished after 42 ms. (steps per millisecond=111 ) properties seen :1
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 19 stabilizing places and 19 stable 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))&&(X(F(p1)) U (p1 U p2))))'
Support contains 8 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 142 transition count 331
Ensure Unique test removed 3 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 37 place count 139 transition count 331
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 46 place count 130 transition count 196
Iterating global reduction 0 with 9 rules applied. Total rules applied 55 place count 130 transition count 196
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 57 place count 128 transition count 191
Iterating global reduction 0 with 2 rules applied. Total rules applied 59 place count 128 transition count 191
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 60 place count 127 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 127 transition count 190
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 62 place count 126 transition count 189
Iterating global reduction 0 with 1 rules applied. Total rules applied 63 place count 126 transition count 189
Applied a total of 63 rules in 17 ms. Remains 126 /159 variables (removed 33) and now considering 189/425 (removed 236) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8339542368623229090.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-756354306639374991.kers'
[2026-05-31 21:07:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8339542368623229090.kers, --Pflows, --basisKERS=/tmp/petrispot-output-756354306639374991.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 126 cols 704 entries
Finished phase 1 with 114 SingleSign rule and 1 generalized
[2026-05-31 21:07:24] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-756354306639374991.kers
Total runtime 2 ms.
[2026-05-31 21:07:24] [INFO ] Implicit Places using invariants in 104 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/159 places, 189/425 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 125/159 places, 189/425 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))&&(X(F(p1)) U (p1 U p2))))'
Stuttering acceptance computed with spot in 542 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), true]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLFireability-00 finished in 794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p1))||p0)))))'
Support contains 7 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 140 transition count 329
Ensure Unique test removed 3 places
Iterating global reduction 0 with 22 rules applied. Total rules applied 41 place count 137 transition count 329
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 52 place count 126 transition count 192
Iterating global reduction 0 with 11 rules applied. Total rules applied 63 place count 126 transition count 192
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 68 place count 121 transition count 181
Iterating global reduction 0 with 5 rules applied. Total rules applied 73 place count 121 transition count 181
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 74 place count 120 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 75 place count 120 transition count 180
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 76 place count 119 transition count 179
Iterating global reduction 0 with 1 rules applied. Total rules applied 77 place count 119 transition count 179
Applied a total of 77 rules in 16 ms. Remains 119 /159 variables (removed 40) and now considering 179/425 (removed 246) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14041857920101172235.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1029910391282665153.kers'
[2026-05-31 21:07:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14041857920101172235.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1029910391282665153.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 119 cols 684 entries
Finished phase 1 with 107 SingleSign rule and 1 generalized
[2026-05-31 21:07:24] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1029910391282665153.kers
Total runtime 2 ms.
[2026-05-31 21:07:25] [INFO ] Implicit Places using invariants in 109 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/159 places, 179/425 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 118/159 places, 179/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p1))||p0)))))'
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 324 ms.
Product exploration explored 100000 steps with 25000 reset in 214 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 421 ms. (94 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1292448002093597603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-599737701748815834.kers'
[2026-05-31 21:07:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1292448002093597603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-599737701748815834.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 118 cols 651 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-31 21:07:26] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-599737701748815834.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/59 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/118 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 179/297 variables, 118/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/59 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/118 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 179/297 variables, 118/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 448ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 20 ms.
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1006 ms.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2026-05-31 21:07:27] [INFO ] Invariant cache hit.
[2026-05-31 21:07:27] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-31 21:07:27] [INFO ] Invariant cache hit.
[2026-05-31 21:07:27] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2026-05-31 21:07:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/297 variables, 118/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 129 constraints, problems are : Problem set: 0 solved, 178 unsolved in 12639 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 1/1 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/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/297 variables, 118/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 178/307 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/297 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 312 constraints, problems are : Problem set: 0 solved, 178 unsolved in 25702 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38406ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 38408ms
Finished structural reductions in LTL mode , in 1 iterations and 38715 ms. Remains : 118/118 places, 179/179 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
[2026-05-31 21:08:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/59 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/118 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 179/297 variables, 118/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/59 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/118 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 179/297 variables, 118/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 549ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 0 ms.
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1089 ms.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 124 ms.
Product exploration explored 100000 steps with 25000 reset in 124 ms.
Spot run failed in 167 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/ltsmin15898247037715134483
[2026-05-31 21:08:07] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15898247037715134483
Running compilation step : cd /tmp/ltsmin15898247037715134483;'/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 851 ms.
Running link step : cd /tmp/ltsmin15898247037715134483;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin15898247037715134483;'/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/stateBased4340002994807533444.hoa' '--buchi-type=spotba'
LTSmin run took 66 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLFireability-01 finished in 43997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Graph (trivial) has 140 edges and 159 vertex of which 11 / 159 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 153 transition count 383
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 54 rules applied. Total rules applied 90 place count 118 transition count 364
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 100 place count 108 transition count 364
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 100 place count 108 transition count 356
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 116 place count 100 transition count 356
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 129 place count 87 transition count 266
Ensure Unique test removed 4 places
Iterating global reduction 3 with 17 rules applied. Total rules applied 146 place count 83 transition count 266
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 146 place count 83 transition count 264
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 150 place count 81 transition count 264
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 159 place count 72 transition count 100
Iterating global reduction 3 with 9 rules applied. Total rules applied 168 place count 72 transition count 100
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 68 transition count 92
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 68 transition count 92
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 220 place count 46 transition count 70
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 223 place count 43 transition count 63
Iterating global reduction 3 with 3 rules applied. Total rules applied 226 place count 43 transition count 63
Performed 12 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
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 250 place count 31 transition count 81
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 263 place count 31 transition count 68
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 266 place count 28 transition count 62
Iterating global reduction 4 with 3 rules applied. Total rules applied 269 place count 28 transition count 62
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 279 place count 28 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 287 place count 28 transition count 44
Applied a total of 287 rules in 42 ms. Remains 28 /159 variables (removed 131) and now considering 44/425 (removed 381) transitions.
[2026-05-31 21:08:08] [INFO ] Flow matrix only has 34 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9199382670502464992.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6434429410550027913.kers'
[2026-05-31 21:08:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9199382670502464992.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6434429410550027913.kers]
Normalized transition count is 33 out of 34 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 33 rows 28 cols 130 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-31 21:08:08] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6434429410550027913.kers
Total runtime 0 ms.
[2026-05-31 21:08:09] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-31 21:08:09] [INFO ] Flow matrix only has 34 transitions (discarded 10 similar events)
[2026-05-31 21:08:09] [INFO ] Invariant cache hit.
[2026-05-31 21:08:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-31 21:08:09] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2026-05-31 21:08:09] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2026-05-31 21:08:09] [INFO ] Flow matrix only has 34 transitions (discarded 10 similar events)
[2026-05-31 21:08:09] [INFO ] Invariant cache hit.
[2026-05-31 21:08:09] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 33/61 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 50 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1293 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 28/28 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 33/61 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 43/92 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 1/62 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 93 constraints, problems are : Problem set: 0 solved, 43 unsolved in 2135 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 28/28 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3439ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 3440ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/159 places, 44/425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3643 ms. Remains : 28/159 places, 44/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLFireability-02 finished in 3833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Graph (trivial) has 136 edges and 159 vertex of which 9 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 153 transition count 383
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 54 rules applied. Total rules applied 90 place count 118 transition count 364
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 100 place count 108 transition count 364
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 100 place count 108 transition count 355
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 118 place count 99 transition count 355
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 131 place count 86 transition count 265
Ensure Unique test removed 4 places
Iterating global reduction 3 with 17 rules applied. Total rules applied 148 place count 82 transition count 265
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 148 place count 82 transition count 263
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 152 place count 80 transition count 263
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 157 place count 75 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 162 place count 75 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 74 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 74 transition count 127
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 212 place count 50 transition count 103
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 215 place count 47 transition count 96
Iterating global reduction 3 with 3 rules applied. Total rules applied 218 place count 47 transition count 96
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 232 place count 40 transition count 114
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 244 place count 40 transition count 102
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 246 place count 38 transition count 98
Iterating global reduction 4 with 2 rules applied. Total rules applied 248 place count 38 transition count 98
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 258 place count 38 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 260 place count 37 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 271 place count 37 transition count 90
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 274 place count 37 transition count 90
Applied a total of 274 rules in 83 ms. Remains 37 /159 variables (removed 122) and now considering 90/425 (removed 335) transitions.
[2026-05-31 21:08:12] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2785382392122164391.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6580142619874706324.kers'
[2026-05-31 21:08:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2785382392122164391.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6580142619874706324.kers]
Normalized transition count is 80 out of 81 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 80 rows 37 cols 600 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-31 21:08:12] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6580142619874706324.kers
Total runtime 2 ms.
[2026-05-31 21:08:12] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-31 21:08:12] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2026-05-31 21:08:12] [INFO ] Invariant cache hit.
[2026-05-31 21:08:12] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 21:08:13] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2026-05-31 21:08:13] [INFO ] Redundant transitions in 3 ms returned []
Running 82 sub problems to find dead transitions.
[2026-05-31 21:08:13] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2026-05-31 21:08:13] [INFO ] Invariant cache hit.
[2026-05-31 21:08:13] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 80/117 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/118 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 58 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3806 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 37/37 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 80/117 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 82/139 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/118 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 141 constraints, problems are : Problem set: 0 solved, 82 unsolved in 9023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 37/37 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 12888ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 12889ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/159 places, 90/425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13171 ms. Remains : 37/159 places, 90/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 355 ms.
Product exploration explored 100000 steps with 0 reset in 470 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 1600 ms. (24 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 497 ms. (80 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 168899 steps, run visited all 1 properties in 234 ms. (steps per millisecond=721 )
Probabilistic random walk after 168899 steps, saw 31670 distinct states, run finished after 235 ms. (steps per millisecond=718 ) properties seen :1
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 1018 ms.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 90/90 transitions.
Applied a total of 0 rules in 7 ms. Remains 37 /37 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2026-05-31 21:08:28] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2026-05-31 21:08:28] [INFO ] Invariant cache hit.
[2026-05-31 21:08:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-31 21:08:28] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2026-05-31 21:08:28] [INFO ] Invariant cache hit.
[2026-05-31 21:08:28] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 21:08:28] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2026-05-31 21:08:28] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 37/37 places, 90/90 transitions.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 168899 steps, run visited all 1 properties in 329 ms. (steps per millisecond=513 )
Probabilistic random walk after 168899 steps, saw 31670 distinct states, run finished after 329 ms. (steps per millisecond=513 ) properties seen :1
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 661 ms.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 361 ms.
Product exploration explored 100000 steps with 0 reset in 665 ms.
Built C files in :
/tmp/ltsmin6016998592067024418
[2026-05-31 21:08:30] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2026-05-31 21:08:30] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 21:08:30] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2026-05-31 21:08:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 21:08:30] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2026-05-31 21:08:30] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 21:08:30] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6016998592067024418
Running compilation step : cd /tmp/ltsmin6016998592067024418;'/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 379 ms.
Running link step : cd /tmp/ltsmin6016998592067024418;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin6016998592067024418;'/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/stateBased6641436550322347652.hoa' '--buchi-type=spotba'
LTSmin run took 2021 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLFireability-03 finished in 19889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X((p1||X(X(!p2)))))))'
Support contains 12 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 144 transition count 344
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 144 transition count 344
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 136 transition count 283
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 136 transition count 283
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 133 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 133 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 132 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 132 transition count 275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 131 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 131 transition count 274
Applied a total of 56 rules in 10 ms. Remains 131 /159 variables (removed 28) and now considering 274/425 (removed 151) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7632584996673253025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14610764737183812904.kers'
[2026-05-31 21:08:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7632584996673253025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14610764737183812904.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 274 rows 131 cols 1853 entries
Finished phase 1 with 115 SingleSign rule and 2 generalized
[2026-05-31 21:08:32] [INFO ] Computed 14 invariants in 4 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14610764737183812904.kers
Total runtime 5 ms.
[2026-05-31 21:08:32] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-31 21:08:32] [INFO ] Invariant cache hit.
[2026-05-31 21:08:33] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2026-05-31 21:08:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 274/405 variables, 131/146 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 146 constraints, problems are : Problem set: 0 solved, 273 unsolved in 25399 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 274/405 variables, 131/146 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 273/419 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/405 variables, and 424 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55862ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 55863ms
Starting structural reductions in LTL mode, iteration 1 : 131/159 places, 274/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56219 ms. Remains : 131/159 places, 274/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X((X(X(!p1))||p2)))))'
Stuttering acceptance computed with spot in 576 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), p1, p1, true, (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLFireability-04
Product exploration explored 100000 steps with 20000 reset in 127 ms.
Product exploration explored 100000 steps with 20000 reset in 140 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 11 states, 19 edges and 3 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 305 ms. (130 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1277810 steps, run timeout after 3001 ms. (steps per millisecond=425 ) properties seen :0 out of 1
Probabilistic random walk after 1277810 steps, saw 238400 distinct states, run finished after 3007 ms. (steps per millisecond=424 ) properties seen :0
[2026-05-31 21:09:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/127 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/131 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 274/405 variables, 131/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/405 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 131/131 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/127 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/131 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 274/405 variables, 131/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/405 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 826 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1134ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 0 ms.
Knowledge based reduction with 6 factoid took 99 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[p1, p1, p1, p1, true, p1]
Knowledge-based reduction took 4779 ms.
Stuttering acceptance computed with spot in 272 ms :[p1, p1, p1, p1, true, p1]
Support contains 5 out of 131 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 274/274 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2026-05-31 21:09:34] [INFO ] Invariant cache hit.
[2026-05-31 21:09:34] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-31 21:09:34] [INFO ] Invariant cache hit.
[2026-05-31 21:09:35] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 131/131 places, 274/274 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31620 steps (6 resets) in 132 ms. (237 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[p1, p1, p1, p1, true, p1]
Knowledge-based reduction took 546 ms.
Stuttering acceptance computed with spot in 250 ms :[p1, p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 267 ms :[p1, p1, p1, p1, true, p1]
Product exploration explored 100000 steps with 20000 reset in 225 ms.
Product exploration explored 100000 steps with 20000 reset in 272 ms.
Spot run failed in 85 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/ltsmin5352696343676551229
[2026-05-31 21:09:36] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5352696343676551229
Running compilation step : cd /tmp/ltsmin5352696343676551229;'/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 1214 ms.
Running link step : cd /tmp/ltsmin5352696343676551229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5352696343676551229;'/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/stateBased4417577839013080861.hoa' '--buchi-type=spotba'
LTSmin run took 37 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLFireability-04 finished in 65641 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||X((G(p1)||G(p2))))))'
Support contains 7 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 145 transition count 345
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 145 transition count 345
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 134 transition count 208
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 134 transition count 208
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 130 transition count 199
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 130 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 129 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 129 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 128 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 128 transition count 197
Applied a total of 62 rules in 12 ms. Remains 128 /159 variables (removed 31) and now considering 197/425 (removed 228) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13024053120510021256.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-175135171051508791.kers'
[2026-05-31 21:09:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13024053120510021256.kers, --Pflows, --basisKERS=/tmp/petrispot-output-175135171051508791.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 128 cols 939 entries
Finished phase 1 with 112 SingleSign rule and 2 generalized
[2026-05-31 21:09:38] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-175135171051508791.kers
Total runtime 3 ms.
[2026-05-31 21:09:38] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-31 21:09:38] [INFO ] Invariant cache hit.
[2026-05-31 21:09:38] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2026-05-31 21:09:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/325 variables, 128/143 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 143 constraints, problems are : Problem set: 0 solved, 196 unsolved in 17160 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/325 variables, 128/143 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 196/339 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 342 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47246ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 47247ms
Starting structural reductions in LTL mode, iteration 1 : 128/159 places, 197/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47598 ms. Remains : 128/159 places, 197/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p0)||G(p1)))||p2)))'
Stuttering acceptance computed with spot in 291 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 19 ms. Proved property starting from automaton with 6 states, 11 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 30 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLFireability-05 finished in 48224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||(X(F(p2))&&F(p3)))))'
Support contains 9 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 140 transition count 329
Ensure Unique test removed 3 places
Iterating global reduction 0 with 22 rules applied. Total rules applied 41 place count 137 transition count 329
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 52 place count 126 transition count 192
Iterating global reduction 0 with 11 rules applied. Total rules applied 63 place count 126 transition count 192
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 65 place count 124 transition count 187
Iterating global reduction 0 with 2 rules applied. Total rules applied 67 place count 124 transition count 187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 68 place count 123 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 69 place count 123 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 70 place count 122 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 71 place count 122 transition count 185
Applied a total of 71 rules in 14 ms. Remains 122 /159 variables (removed 37) and now considering 185/425 (removed 240) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8369156898332785449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10306258036324705246.kers'
[2026-05-31 21:10:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8369156898332785449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10306258036324705246.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 122 cols 696 entries
Finished phase 1 with 110 SingleSign rule and 1 generalized
[2026-05-31 21:10:26] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10306258036324705246.kers
Total runtime 2 ms.
[2026-05-31 21:10:26] [INFO ] Implicit Places using invariants in 113 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/159 places, 185/425 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 121/159 places, 185/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||p1||(X(F(p2))&&F(p3)))))'
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 14 ms. Proved property starting from automaton with 4 states, 5 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 16 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLFireability-06 finished in 718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G((X(!p0) U ((X(!p0)&&(p1 U (p2||G(p1))))||X(G(!p0)))))||(F(!p3)&&X((X(!p0) U ((X(!p0)&&(p1 U (p2||G(p1))))||X(G(!p0)))))))))))'
Support contains 9 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 141 transition count 330
Ensure Unique test removed 3 places
Iterating global reduction 0 with 21 rules applied. Total rules applied 39 place count 138 transition count 330
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 50 place count 127 transition count 193
Iterating global reduction 0 with 11 rules applied. Total rules applied 61 place count 127 transition count 193
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 65 place count 123 transition count 184
Iterating global reduction 0 with 4 rules applied. Total rules applied 69 place count 123 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 70 place count 122 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 71 place count 122 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 72 place count 121 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 73 place count 121 transition count 182
Applied a total of 73 rules in 14 ms. Remains 121 /159 variables (removed 38) and now considering 182/425 (removed 243) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15935539736950404459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14162882188166945368.kers'
[2026-05-31 21:10:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15935539736950404459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14162882188166945368.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 121 cols 690 entries
Finished phase 1 with 109 SingleSign rule and 1 generalized
[2026-05-31 21:10:27] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14162882188166945368.kers
Total runtime 2 ms.
[2026-05-31 21:10:27] [INFO ] Implicit Places using invariants in 87 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/159 places, 182/425 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 120/159 places, 182/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G((X(!p0) U ((X(!p0)&&(p1 U (p2||G(p1))))||X(G(!p0)))))||(F(p3)&&X((X(!p0) U ((X(!p0)&&(p1 U (p2||G(p1))))||X(G(!p0)))))))))))'
Stuttering acceptance computed with spot in 617 ms :[p0, (AND (NOT p3) p0), p0, (AND (NOT p3) p0), p0, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p3) p0 (NOT p2) (NOT p1)), false, p0, p0]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLFireability-07
Product exploration explored 100000 steps with 4646 reset in 357 ms.
Product exploration explored 100000 steps with 4875 reset in 569 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 10 states, 27 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 342 ms. (116 steps per ms) remains 10/18 properties
BEST_FIRST walk for 40002 steps (8 resets) in 212 ms. (187 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 145 ms. (273 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 240 ms. (165 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 300 ms. (132 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 382 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 287 ms. (138 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 180 ms. (221 steps per ms) remains 9/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14465772515483061619.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18195899723133329033.kers'
[2026-05-31 21:10:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14465772515483061619.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18195899723133329033.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 120 cols 657 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-31 21:10:30] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18195899723133329033.kers
Total runtime 2 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf6 is UNSAT
Problem apf13 is UNSAT
Problem apf15 is UNSAT
At refinement iteration 1 (OVERLAPS) 72/81 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 39/120 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 182/302 variables, 120/130 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/130 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/130 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 130 constraints, problems are : Problem set: 3 solved, 6 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 72/81 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 39/120 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 182/302 variables, 120/130 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 6/136 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 1/137 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/137 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/302 variables, 0/137 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 137 constraints, problems are : Problem set: 3 solved, 6 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1784ms problems are : Problem set: 3 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 337 steps, including 3 resets, run visited all 2 properties in 7 ms. (steps per millisecond=48 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 143 ms.
Found 3 invariant AP formulas.
Knowledge based reduction with 5 factoid took 369 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), p0, p0]
Knowledge-based reduction took 3717 ms.
Stuttering acceptance computed with spot in 331 ms :[p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), p0, p0]
Support contains 3 out of 120 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 182/182 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2026-05-31 21:10:33] [INFO ] Invariant cache hit.
[2026-05-31 21:10:33] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-31 21:10:33] [INFO ] Invariant cache hit.
[2026-05-31 21:10:33] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2026-05-31 21:10:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/302 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 0/302 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 131 constraints, problems are : Problem set: 0 solved, 181 unsolved in 14313 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/302 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 181/312 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/302 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 321 constraints, problems are : Problem set: 0 solved, 181 unsolved in 29285 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43656ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 43657ms
Finished structural reductions in LTL mode , in 1 iterations and 43974 ms. Remains : 120/120 places, 182/182 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/9 properties
BEST_FIRST walk for 11060 steps (3 resets) in 13 ms. (790 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), p0, p0]
Knowledge-based reduction took 659 ms.
Stuttering acceptance computed with spot in 333 ms :[p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), p0, p0]
Stuttering acceptance computed with spot in 328 ms :[p0, p0, p0, (AND p0 (NOT p1) (NOT p2)), p0, p0]
Product exploration explored 100000 steps with 4737 reset in 279 ms.
Product exploration explored 100000 steps with 4804 reset in 300 ms.
Spot run failed in 64 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/ltsmin2913054088351452790
[2026-05-31 21:11:19] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2913054088351452790
Running compilation step : cd /tmp/ltsmin2913054088351452790;'/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 738 ms.
Running link step : cd /tmp/ltsmin2913054088351452790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin2913054088351452790;'/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/stateBased11545032550095497328.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 182/182 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 116 transition count 152
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 116 transition count 152
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 114 transition count 148
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 114 transition count 148
Applied a total of 12 rules in 9 ms. Remains 114 /120 variables (removed 6) and now considering 148/182 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-253782573178032275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12858227907476936.kers'
[2026-05-31 21:11:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-253782573178032275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12858227907476936.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 114 cols 409 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-31 21:11:34] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12858227907476936.kers
Total runtime 1 ms.
[2026-05-31 21:11:34] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-31 21:11:34] [INFO ] Invariant cache hit.
[2026-05-31 21:11:34] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2026-05-31 21:11:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/262 variables, 114/125 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 125 constraints, problems are : Problem set: 0 solved, 147 unsolved in 10262 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/262 variables, 114/125 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 147/272 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (OVERLAPS) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 274 constraints, problems are : Problem set: 0 solved, 147 unsolved in 17139 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27410ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 27411ms
Starting structural reductions in LTL mode, iteration 1 : 114/120 places, 148/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27622 ms. Remains : 114/120 places, 148/182 transitions.
Built C files in :
/tmp/ltsmin14060073284190550734
[2026-05-31 21:12:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14060073284190550734
Running compilation step : cd /tmp/ltsmin14060073284190550734;'/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 551 ms.
Running link step : cd /tmp/ltsmin14060073284190550734;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin14060073284190550734;'/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/stateBased7927862017501883798.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 21:12:16] [INFO ] Flatten gal took : 12 ms
[2026-05-31 21:12:16] [INFO ] Flatten gal took : 11 ms
[2026-05-31 21:12:16] [INFO ] Time to serialize gal into /tmp/LTL3424674577198242600.gal : 4 ms
[2026-05-31 21:12:16] [INFO ] Time to serialize properties into /tmp/LTL11117621019431676951.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3424674577198242600.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10192304357837073817.hoa' '-atoms' '/tmp/LTL11117621019431676951.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11117621019431676951.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10192304357837073817.hoa
Reverse transition relation is NOT exact ! Due to transitions t11, t19, t22, t30, t75, t87, t99, t101, t104, t106, t107, t109, t111, t115, t117, t294, t296...275
176 unique states visited
0 strongly connected components in search stack
230 transitions explored
38 items max in DFS search stack
279 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.8515,93232,1,0,2277,302924,349,869,3671,617888,5330
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLFireability-07 finished in 113106 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 6 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Graph (trivial) has 136 edges and 159 vertex of which 9 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 153 transition count 383
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 54 rules applied. Total rules applied 90 place count 118 transition count 364
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 100 place count 108 transition count 364
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 100 place count 108 transition count 355
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 118 place count 99 transition count 355
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 131 place count 86 transition count 265
Ensure Unique test removed 4 places
Iterating global reduction 3 with 17 rules applied. Total rules applied 148 place count 82 transition count 265
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 148 place count 82 transition count 263
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 152 place count 80 transition count 263
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 157 place count 75 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 162 place count 75 transition count 129
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 212 place count 50 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 215 place count 47 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 218 place count 47 transition count 97
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 230 place count 41 transition count 115
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 242 place count 41 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 244 place count 39 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 246 place count 39 transition count 99
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 256 place count 39 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 258 place count 38 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 270 place count 38 transition count 90
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 274 place count 38 transition count 90
Applied a total of 274 rules in 34 ms. Remains 38 /159 variables (removed 121) and now considering 90/425 (removed 335) transitions.
[2026-05-31 21:12:20] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16881115048161658584.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-460387280207721233.kers'
[2026-05-31 21:12:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16881115048161658584.kers, --Pflows, --basisKERS=/tmp/petrispot-output-460387280207721233.kers]
Normalized transition count is 80 out of 81 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 80 rows 38 cols 594 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-31 21:12:20] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-460387280207721233.kers
Total runtime 1 ms.
[2026-05-31 21:12:20] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-31 21:12:20] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2026-05-31 21:12:20] [INFO ] Invariant cache hit.
[2026-05-31 21:12:20] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 21:12:20] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2026-05-31 21:12:20] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2026-05-31 21:12:20] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2026-05-31 21:12:20] [INFO ] Invariant cache hit.
[2026-05-31 21:12:20] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 80/118 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/119 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 59 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3088 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 38/38 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 80/118 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 82/140 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/119 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 142 constraints, problems are : Problem set: 0 solved, 82 unsolved in 9733 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 38/38 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 12885ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 12886ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/159 places, 90/425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13170 ms. Remains : 38/159 places, 90/425 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 42 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 292 ms.
Product exploration explored 100000 steps with 0 reset in 231 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 95746 steps, run visited all 1 properties in 115 ms. (steps per millisecond=832 )
Probabilistic random walk after 95746 steps, saw 18996 distinct states, run finished after 115 ms. (steps per millisecond=832 ) properties seen :1
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Knowledge-based reduction took 410 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2026-05-31 21:12:34] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2026-05-31 21:12:34] [INFO ] Invariant cache hit.
[2026-05-31 21:12:34] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-31 21:12:34] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2026-05-31 21:12:34] [INFO ] Invariant cache hit.
[2026-05-31 21:12:34] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 21:12:34] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2026-05-31 21:12:34] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 38/38 places, 90/90 transitions.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 95746 steps, run visited all 1 properties in 174 ms. (steps per millisecond=550 )
Probabilistic random walk after 95746 steps, saw 18996 distinct states, run finished after 174 ms. (steps per millisecond=550 ) properties seen :1
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Knowledge-based reduction took 463 ms.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 292 ms.
Product exploration explored 100000 steps with 0 reset in 307 ms.
Built C files in :
/tmp/ltsmin11955178347010895920
[2026-05-31 21:12:36] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2026-05-31 21:12:36] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 21:12:36] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2026-05-31 21:12:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 21:12:36] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2026-05-31 21:12:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 21:12:36] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11955178347010895920
Running compilation step : cd /tmp/ltsmin11955178347010895920;'/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 349 ms.
Running link step : cd /tmp/ltsmin11955178347010895920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin11955178347010895920;'/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/stateBased16532526289973982886.hoa' '--buchi-type=spotba'
LTSmin run took 874 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLFireability-09 finished in 16999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(((p0 U G(p1)) U X(p2))) U p3)))))'
Support contains 10 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 146 transition count 351
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 146 transition count 351
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 137 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 137 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 136 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 136 transition count 214
Applied a total of 46 rules in 9 ms. Remains 136 /159 variables (removed 23) and now considering 214/425 (removed 211) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11501633196315794214.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1319323827678853673.kers'
[2026-05-31 21:12:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11501633196315794214.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1319323827678853673.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 136 cols 1013 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-31 21:12:37] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1319323827678853673.kers
Total runtime 2 ms.
[2026-05-31 21:12:37] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-31 21:12:37] [INFO ] Invariant cache hit.
[2026-05-31 21:12:37] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-31 21:12:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/350 variables, 136/151 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/350 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 151 constraints, problems are : Problem set: 0 solved, 213 unsolved in 20150 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/350 variables, 136/151 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 213/364 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 5/373 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 374 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50226ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 50227ms
Starting structural reductions in LTL mode, iteration 1 : 136/159 places, 214/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50642 ms. Remains : 136/159 places, 214/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(((p0 U G(p1)) U X(p2))) U p3)))))'
Stuttering acceptance computed with spot in 797 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 301 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLFireability-10 finished in 51874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X((p0 U X(p1))))) U ((X(X(X((p0 U X(p1)))))&&G(p2))||X(X(X(G((p0 U X(p1))))))))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 141 transition count 330
Ensure Unique test removed 3 places
Iterating global reduction 0 with 21 rules applied. Total rules applied 39 place count 138 transition count 330
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 54 place count 123 transition count 163
Iterating global reduction 0 with 15 rules applied. Total rules applied 69 place count 123 transition count 163
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 74 place count 118 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 79 place count 118 transition count 151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 80 place count 117 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 81 place count 117 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 82 place count 116 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 83 place count 116 transition count 149
Applied a total of 83 rules in 10 ms. Remains 116 /159 variables (removed 43) and now considering 149/425 (removed 276) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9288694130418087866.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16045599976656804546.kers'
[2026-05-31 21:13:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9288694130418087866.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16045599976656804546.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 116 cols 414 entries
Finished phase 1 with 104 SingleSign rule and 1 generalized
[2026-05-31 21:13:29] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16045599976656804546.kers
Total runtime 2 ms.
[2026-05-31 21:13:29] [INFO ] Implicit Places using invariants in 99 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/159 places, 149/425 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 115/159 places, 149/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X((p0 U X(p1))))) U (X(X(X(G((p0 U X(p1))))))||(X(X(X((p0 U X(p1)))))&&G(p2))))))'
Stuttering acceptance computed with spot in 1561 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLFireability-11
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLFireability-11 finished in 1845 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) U p2))))'
Support contains 7 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 146 transition count 346
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 146 transition count 346
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 137 transition count 211
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 137 transition count 211
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 135 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 135 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 134 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 134 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 133 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 133 transition count 204
Applied a total of 52 rules in 11 ms. Remains 133 /159 variables (removed 26) and now considering 204/425 (removed 221) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7972863039885486109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8945989397443053357.kers'
[2026-05-31 21:13:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7972863039885486109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8945989397443053357.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 133 cols 953 entries
Finished phase 1 with 117 SingleSign rule and 2 generalized
[2026-05-31 21:13:31] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8945989397443053357.kers
Total runtime 3 ms.
[2026-05-31 21:13:31] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-31 21:13:31] [INFO ] Invariant cache hit.
[2026-05-31 21:13:31] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-31 21:13:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/337 variables, 133/151 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 151 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18876 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/337 variables, 133/151 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/354 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 355 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48969ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 48970ms
Starting structural reductions in LTL mode, iteration 1 : 133/159 places, 204/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49374 ms. Remains : 133/159 places, 204/425 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)||p2)))'
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Detected a total of 17/133 stabilizing places and 17/204 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 13 ms. Proved property starting from automaton with 5 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLFireability-12 finished in 49919 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((!p1 U (G(p2)||X(!p3)||G(!p1))))&&p0)))))'
Support contains 11 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 425/425 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 141 transition count 330
Ensure Unique test removed 3 places
Iterating global reduction 0 with 21 rules applied. Total rules applied 39 place count 138 transition count 330
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 46 place count 131 transition count 270
Iterating global reduction 0 with 7 rules applied. Total rules applied 53 place count 131 transition count 270
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 55 place count 129 transition count 265
Iterating global reduction 0 with 2 rules applied. Total rules applied 57 place count 129 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 58 place count 128 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 59 place count 128 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 60 place count 127 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 127 transition count 263
Applied a total of 61 rules in 15 ms. Remains 127 /159 variables (removed 32) and now considering 263/425 (removed 162) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3758999523766868062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16495771293485812265.kers'
[2026-05-31 21:14:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3758999523766868062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16495771293485812265.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 127 cols 1384 entries
Finished phase 1 with 115 SingleSign rule and 1 generalized
[2026-05-31 21:14:21] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16495771293485812265.kers
Total runtime 4 ms.
[2026-05-31 21:14:21] [INFO ] Implicit Places using invariants in 112 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/159 places, 263/425 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 126/159 places, 263/425 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((!p1 U (G(p2)||X(!p3)||G(!p1))))&&p0)))))'
Stuttering acceptance computed with spot in 517 ms :[true, p3, (OR (NOT p0) (AND p1 (NOT p2) p3)), (AND p3 (NOT p2) p1), (AND p3 (NOT p2) p1), (AND (NOT p2) p3), (NOT p2), (OR (NOT p0) (AND p1 (NOT p2) p3)), (OR (NOT p0) (AND p1 (NOT p2) p3)), (OR (NOT p0) (AND p1 (NOT p2) p3))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP04C04-LTLFireability-14
Product exploration explored 100000 steps with 16666 reset in 158 ms.
Product exploration explored 100000 steps with 16666 reset in 176 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 10 states, 17 edges and 4 AP (stutter sensitive) to 10 states, 17 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 11 to 8
RANDOM walk for 40000 steps (8 resets) in 440 ms. (90 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 466 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 222 ms. (179 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5575634039360883635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13206377423023039610.kers'
[2026-05-31 21:14:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5575634039360883635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13206377423023039610.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 126 cols 1275 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-31 21:14:22] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13206377423023039610.kers
Total runtime 3 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 56/67 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 59/126 variables, 4/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 263/389 variables, 126/136 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/389 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 136 constraints, problems are : Problem set: 2 solved, 4 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 56/67 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 59/126 variables, 4/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 263/389 variables, 126/136 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 4/140 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 1/141 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 141 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2134ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 80 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=80 )
Parikh walk visited 4 properties in 21 ms.
Found 3 invariant AP formulas.
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 10 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(AND p1 p3), (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), true, p3]
Knowledge-based reduction took 3501 ms.
Stuttering acceptance computed with spot in 304 ms :[(AND p1 p3), (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), true, p3]
Support contains 11 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 263/263 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2026-05-31 21:14:25] [INFO ] Invariant cache hit.
[2026-05-31 21:14:25] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-31 21:14:25] [INFO ] Invariant cache hit.
[2026-05-31 21:14:26] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2026-05-31 21:14:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/389 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 137 constraints, problems are : Problem set: 0 solved, 262 unsolved in 21222 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/389 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 262/399 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 5/404 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 405 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51527ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 51529ms
Finished structural reductions in LTL mode , in 1 iterations and 51857 ms. Remains : 126/126 places, 263/263 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2026-05-31 21:15:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/126 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 263/389 variables, 126/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/389 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 126/126 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/126 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 263/389 variables, 126/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 689ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 166 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=83 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND p1 p3), p3, (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), true]
Knowledge-based reduction took 1253 ms.
Stuttering acceptance computed with spot in 331 ms :[(AND p1 p3), p3, (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), true]
Stuttering acceptance computed with spot in 319 ms :[(AND p1 p3), p3, (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), (OR (NOT p0) (AND p1 p3)), true]
Product exploration explored 100000 steps with 20000 reset in 123 ms.
Product exploration explored 100000 steps with 20000 reset in 148 ms.
Spot run failed in 61 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/ltsmin9930014095047336202
[2026-05-31 21:15:19] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9930014095047336202
Running compilation step : cd /tmp/ltsmin9930014095047336202;'/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 797 ms.
Running link step : cd /tmp/ltsmin9930014095047336202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9930014095047336202;'/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/stateBased11782343847040674234.hoa' '--buchi-type=spotba'
LTSmin run took 25 ms.
FORMULA ErlangenMainframeV1-PT-bP04C04-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP04C04-LTLFireability-14 finished in 59884 ms.
All properties solved by simple procedures.
Total runtime 558191 ms.

BK_STOP 1780262120922

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ErlangenMainframeV1-PT-bP04C04"
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 ErlangenMainframeV1-PT-bP04C04, 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 r338-smll-178021499100076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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