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.r114-smll-177955740600444.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 ErlangenMainframeV0-PT-0808, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740600444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 7.3K Mar 7 05:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 7 05:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 7 05:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Mar 7 05:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 7 05:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Mar 7 05:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 05:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 7 05:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 20M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-0808-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779865131020

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0808
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 06:58:53] [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-27 06:58:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 06:58:55] [INFO ] Load time of PNML (sax parser for PT used): 1477 ms
[2026-05-27 06:58:55] [INFO ] Transformed 263 places.
[2026-05-27 06:58:55] [INFO ] Transformed 19957 transitions.
[2026-05-27 06:58:55] [INFO ] Found NUPN structural information;
[2026-05-27 06:58:55] [INFO ] Parsed PT model containing 263 places and 19957 transitions and 381303 arcs in 1917 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Support contains 53 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 19957/19957 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 195 transition count 19889
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 195 transition count 19889
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 172 place count 159 transition count 19853
Iterating global reduction 0 with 36 rules applied. Total rules applied 208 place count 159 transition count 19853
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 211 place count 156 transition count 19850
Iterating global reduction 0 with 3 rules applied. Total rules applied 214 place count 156 transition count 19850
Applied a total of 214 rules in 676 ms. Remains 156 /263 variables (removed 107) and now considering 19850/19957 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1914627718505935069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9347247044966657996.kers'
[2026-05-27 06:58:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1914627718505935069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9347247044966657996.kers]
Culled 0 columns in 100 ms.
// Phase 1: matrix 19850 rows 156 cols 381089 entries
Finished phase 1 with 131 SingleSign rule and 3 generalized
[2026-05-27 06:58:57] [INFO ] Computed 22 invariants in 360 ms
Computed 22 P flows in 396 ms.
Exported basis to /tmp/petrispot-output-9347247044966657996.kers
Total runtime 474 ms.
[2026-05-27 06:58:57] [INFO ] Implicit Places using invariants in 1121 ms returned []
Implicit Place search using SMT only with invariants took 1188 ms to find 0 implicit places.
Running 19849 sub problems to find dead transitions.
[2026-05-27 06:58:58] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 155/20006 variables, and 8 constraints, problems are : Problem set: 0 solved, 19849 unsolved in 30619 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/156 constraints, PredecessorRefiner: 19849/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19849 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 155/20006 variables, and 8 constraints, problems are : Problem set: 0 solved, 19849 unsolved in 30357 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/156 constraints, PredecessorRefiner: 19734/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 107313ms problems are : Problem set: 0 solved, 19849 unsolved
Search for dead transitions found 0 dead transitions in 107777ms
Starting structural reductions in LTL mode, iteration 1 : 156/263 places, 19850/19957 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109891 ms. Remains : 156/263 places, 19850/19957 transitions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Applied a total of 0 rules in 149 ms. Remains 156 /156 variables (removed 0) and now considering 19850/19850 (removed 0) transitions.
[2026-05-27 07:00:46] [INFO ] Invariant cache hit.
[2026-05-27 07:00:46] [INFO ] Implicit Places using invariants in 188 ms returned []
Implicit Place search using SMT only with invariants took 194 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 156/156 places, 19850/19850 transitions.
Support contains 53 out of 156 places after structural reductions.
[2026-05-27 07:00:49] [INFO ] Flatten gal took : 2764 ms
[2026-05-27 07:00:51] [INFO ] Flatten gal took : 2055 ms
[2026-05-27 07:00:55] [INFO ] Input system was already deterministic with 19850 transitions.
RANDOM walk for 40000 steps (8 resets) in 8020 ms. (4 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 39/39 properties
Interrupted probabilistic random walk after 49632 steps, run timeout after 6001 ms. (steps per millisecond=8 ) properties seen :0 out of 39
Probabilistic random walk after 49632 steps, saw 30564 distinct states, run finished after 6014 ms. (steps per millisecond=8 ) properties seen :0
[2026-05-27 07:01:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 2 (OVERLAPS) 67/119 variables, 10/18 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 38 unsolved
SMT process timed out in 5425ms, After SMT, problems are : Problem set: 1 solved, 38 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Graph (trivial) has 79 edges and 156 vertex of which 4 / 156 are part of one of the 2 SCC in 25 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 154 transition count 19833
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 141 transition count 19833
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 27 place count 141 transition count 19817
Deduced a syphon composed of 16 places in 15 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 59 place count 125 transition count 19817
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 122 transition count 19799
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 122 transition count 19799
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 122 transition count 19797
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 8 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 121 place count 95 transition count 19770
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 93 transition count 19790
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 93 transition count 19789
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 131 place count 93 transition count 19784
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 138 place count 88 transition count 19782
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 151 place count 88 transition count 19769
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 88 transition count 19769
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 161 place count 88 transition count 19769
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 169 place count 88 transition count 19761
Applied a total of 169 rules in 113191 ms. Remains 88 /156 variables (removed 68) and now considering 19761/19850 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113192 ms. Remains : 88/156 places, 19761/19850 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Computed a total of 20 stabilizing places and 20 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' '!((G(p0) U X((X((!p1&&F(!p2))) U ((!p0&&X((!p1&&F(!p2))))||X(G((!p1&&F(!p2)))))))))'
Support contains 25 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 154 transition count 17662
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 154 transition count 17662
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 152 transition count 11830
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 152 transition count 11830
Applied a total of 8 rules in 1168 ms. Remains 152 /156 variables (removed 4) and now considering 11830/19850 (removed 8020) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5242331410622429651.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5951735705063537086.kers'
[2026-05-27 07:03:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5242331410622429651.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5951735705063537086.kers]
Culled 0 columns in 39 ms.
// Phase 1: matrix 11830 rows 152 cols 227997 entries
Finished phase 1 with 127 SingleSign rule and 3 generalized
[2026-05-27 07:03:05] [INFO ] Computed 22 invariants in 151 ms
Computed 22 P flows in 152 ms.
Exported basis to /tmp/petrispot-output-5951735705063537086.kers
Total runtime 190 ms.
[2026-05-27 07:03:09] [INFO ] Implicit Places using invariants in 4391 ms returned []
Implicit Place search using SMT only with invariants took 4400 ms to find 0 implicit places.
Running 11829 sub problems to find dead transitions.
[2026-05-27 07:03:09] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11829 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 151/11982 variables, and 8 constraints, problems are : Problem set: 0 solved, 11829 unsolved in 30302 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/152 constraints, PredecessorRefiner: 11829/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11829 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11829 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 151/11982 variables, and 8 constraints, problems are : Problem set: 0 solved, 11829 unsolved in 30310 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/152 constraints, PredecessorRefiner: 11714/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 83326ms problems are : Problem set: 0 solved, 11829 unsolved
Search for dead transitions found 0 dead transitions in 83488ms
Starting structural reductions in LTL mode, iteration 1 : 152/156 places, 11830/19850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89131 ms. Remains : 152/156 places, 11830/19850 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((X((!p1&&F(!p2))) U (X(G((!p1&&F(!p2))))||(!p0&&X((!p1&&F(!p2)))))))))'
Stuttering acceptance computed with spot in 972 ms :[(OR p1 p2), (OR p1 p2), (OR p1 p2), (OR p2 p1), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR p1 p2), (OR p2 p1), true, p2, (AND p2 (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 1323 ms.
Product exploration explored 100000 steps with 33333 reset in 956 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 17 ms. Proved property starting from automaton with 12 states, 32 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 278 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-00 finished in 92874 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 10 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Graph (trivial) has 96 edges and 156 vertex of which 4 / 156 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 153 transition count 19835
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 141 transition count 19835
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 25 place count 141 transition count 19819
Deduced a syphon composed of 16 places in 21 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 57 place count 125 transition count 19819
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 75 place count 107 transition count 13242
Ensure Unique test removed 7 places
Iterating global reduction 2 with 25 rules applied. Total rules applied 100 place count 100 transition count 13242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 100 transition count 13240
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 110 place count 92 transition count 885
Ensure Unique test removed 1 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 119 place count 91 transition count 885
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 88 transition count 625
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 88 transition count 625
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 195 place count 53 transition count 590
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 201 place count 50 transition count 601
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 207 place count 50 transition count 595
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 213 place count 50 transition count 595
Applied a total of 213 rules in 2477 ms. Remains 50 /156 variables (removed 106) and now considering 595/19850 (removed 19255) transitions.
[2026-05-27 07:04:38] [INFO ] Flow matrix only has 574 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10294299847536900571.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3835681299890537041.kers'
[2026-05-27 07:04:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10294299847536900571.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3835681299890537041.kers]
Normalized transition count is 573 out of 574 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 573 rows 50 cols 9998 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-27 07:04:39] [INFO ] Computed 14 invariants in 13 ms
Computed 14 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-3835681299890537041.kers
Total runtime 16 ms.
[2026-05-27 07:04:39] [INFO ] Implicit Places using invariants in 260 ms returned []
[2026-05-27 07:04:39] [INFO ] Flow matrix only has 574 transitions (discarded 21 similar events)
[2026-05-27 07:04:39] [INFO ] Invariant cache hit.
[2026-05-27 07:04:39] [INFO ] State equation strengthened by 267 read => feed constraints.
[2026-05-27 07:04:40] [INFO ] Implicit Places using invariants and state equation in 1474 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
[2026-05-27 07:04:40] [INFO ] Redundant transitions in 75 ms returned []
Running 593 sub problems to find dead transitions.
[2026-05-27 07:04:40] [INFO ] Flow matrix only has 574 transitions (discarded 21 similar events)
[2026-05-27 07:04:40] [INFO ] Invariant cache hit.
[2026-05-27 07:04:40] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 3 (OVERLAPS) 573/623 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 266/330 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/624 variables, and 330 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 50/50 constraints, ReadFeed: 266/267 constraints, PredecessorRefiner: 593/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 3 (OVERLAPS) 573/623 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 266/330 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 35/365 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/624 variables, and 365 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 50/50 constraints, ReadFeed: 266/267 constraints, PredecessorRefiner: 593/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61102ms problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 61106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/156 places, 595/19850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65416 ms. Remains : 50/156 places, 595/19850 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 38 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-01 finished in 65492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&X(X((p1 U X(p2))))))'
Support contains 32 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 153 transition count 16204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 153 transition count 16204
Applied a total of 6 rules in 210 ms. Remains 153 /156 variables (removed 3) and now considering 16204/19850 (removed 3646) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11497550712541767221.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11909333396939890547.kers'
[2026-05-27 07:05:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11497550712541767221.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11909333396939890547.kers]
Culled 0 columns in 52 ms.
// Phase 1: matrix 16204 rows 153 cols 315477 entries
Finished phase 1 with 128 SingleSign rule and 3 generalized
[2026-05-27 07:05:42] [INFO ] Computed 22 invariants in 200 ms
Computed 22 P flows in 201 ms.
Exported basis to /tmp/petrispot-output-11909333396939890547.kers
Total runtime 251 ms.
[2026-05-27 07:05:45] [INFO ] Implicit Places using invariants in 3054 ms returned []
Implicit Place search using SMT only with invariants took 3055 ms to find 0 implicit places.
Running 16203 sub problems to find dead transitions.
[2026-05-27 07:05:45] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 152/16357 variables, and 8 constraints, problems are : Problem set: 0 solved, 16203 unsolved in 30410 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 16203/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 152/16357 variables, and 8 constraints, problems are : Problem set: 0 solved, 16203 unsolved in 30412 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 16088/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 97745ms problems are : Problem set: 0 solved, 16203 unsolved
Search for dead transitions found 0 dead transitions in 97828ms
Starting structural reductions in LTL mode, iteration 1 : 153/156 places, 16204/19850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101142 ms. Remains : 153/156 places, 16204/19850 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&X(X((p1 U X(p2))))))'
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-02 finished in 101633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U ((!p1&&X(p0))||X(G(p0))))&&(X((!p2&&X((!p2 U (!p3||G(!p2)))))) U ((X((!p2&&X((!p2 U (!p3||G(!p2))))))&&G(!p4))||X(G((!p2&&X((!p2 U (!p3||G(!p2)))))))))))'
Support contains 30 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 147 transition count 13544
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 147 transition count 13544
Applied a total of 18 rules in 565 ms. Remains 147 /156 variables (removed 9) and now considering 13544/19850 (removed 6306) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5195105434996812100.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2294400017772974022.kers'
[2026-05-27 07:07:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5195105434996812100.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2294400017772974022.kers]
Culled 0 columns in 46 ms.
// Phase 1: matrix 13544 rows 147 cols 267597 entries
Finished phase 1 with 123 SingleSign rule and 2 generalized
[2026-05-27 07:07:24] [INFO ] Computed 22 invariants in 182 ms
Computed 22 P flows in 183 ms.
Exported basis to /tmp/petrispot-output-2294400017772974022.kers
Total runtime 224 ms.
[2026-05-27 07:07:26] [INFO ] Implicit Places using invariants in 1917 ms returned []
Implicit Place search using SMT only with invariants took 1919 ms to find 0 implicit places.
Running 13543 sub problems to find dead transitions.
[2026-05-27 07:07:26] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 146/13691 variables, and 8 constraints, problems are : Problem set: 0 solved, 13543 unsolved in 30346 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/147 constraints, PredecessorRefiner: 13543/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13543 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 146/13691 variables, and 8 constraints, problems are : Problem set: 0 solved, 13543 unsolved in 30206 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/147 constraints, PredecessorRefiner: 13419/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90964ms problems are : Problem set: 0 solved, 13543 unsolved
Search for dead transitions found 0 dead transitions in 91055ms
Starting structural reductions in LTL mode, iteration 1 : 147/156 places, 13544/19850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93596 ms. Remains : 147/156 places, 13544/19850 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U ((!p1&&X(p0))||X(G(p0))))&&(X((!p2&&X((!p2 U (!p3||G(!p2)))))) U ((X((!p2&&X((!p2 U (!p3||G(!p2))))))&&G(!p4))||X(G((!p2&&X((!p2 U (!p3||G(!p2)))))))))))'
Stuttering acceptance computed with spot in 612 ms :[(OR (NOT p0) p2), (NOT p0), (AND p2 p4), p2, p2, (NOT p0), true, (AND p4 p2 p3), (AND p2 p4), (AND p4 p2 p3), (AND p2 p3), (AND p2 p3), (AND p4 (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-03
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-03 finished in 94348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 25 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 153 transition count 16204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 153 transition count 16204
Applied a total of 6 rules in 226 ms. Remains 153 /156 variables (removed 3) and now considering 16204/19850 (removed 3646) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12888613828239963240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14037263777059195333.kers'
[2026-05-27 07:08:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12888613828239963240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14037263777059195333.kers]
Culled 0 columns in 90 ms.
// Phase 1: matrix 16204 rows 153 cols 315477 entries
Finished phase 1 with 128 SingleSign rule and 3 generalized
[2026-05-27 07:08:58] [INFO ] Computed 22 invariants in 315 ms
Computed 22 P flows in 316 ms.
Exported basis to /tmp/petrispot-output-14037263777059195333.kers
Total runtime 400 ms.
[2026-05-27 07:09:05] [INFO ] Implicit Places using invariants in 7044 ms returned []
Implicit Place search using SMT only with invariants took 7047 ms to find 0 implicit places.
Running 16203 sub problems to find dead transitions.
[2026-05-27 07:09:05] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 152/16357 variables, and 8 constraints, problems are : Problem set: 0 solved, 16203 unsolved in 30412 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 16203/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 152/16357 variables, and 8 constraints, problems are : Problem set: 0 solved, 16203 unsolved in 30245 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 16088/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 97106ms problems are : Problem set: 0 solved, 16203 unsolved
Search for dead transitions found 0 dead transitions in 97189ms
Starting structural reductions in LTL mode, iteration 1 : 153/156 places, 16204/19850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104504 ms. Remains : 153/156 places, 16204/19850 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)&&G(p1))))'
Stuttering acceptance computed with spot in 203 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-04 finished in 104793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 10 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Graph (trivial) has 96 edges and 156 vertex of which 4 / 156 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 153 transition count 19835
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 141 transition count 19835
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 25 place count 141 transition count 19819
Deduced a syphon composed of 16 places in 13 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 57 place count 125 transition count 19819
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 75 place count 107 transition count 13242
Ensure Unique test removed 7 places
Iterating global reduction 2 with 25 rules applied. Total rules applied 100 place count 100 transition count 13242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 100 transition count 13240
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 110 place count 92 transition count 885
Ensure Unique test removed 1 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 119 place count 91 transition count 885
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 88 transition count 625
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 88 transition count 625
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 195 place count 53 transition count 590
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 201 place count 50 transition count 601
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 207 place count 50 transition count 595
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 213 place count 50 transition count 595
Applied a total of 213 rules in 2137 ms. Remains 50 /156 variables (removed 106) and now considering 595/19850 (removed 19255) transitions.
[2026-05-27 07:10:44] [INFO ] Flow matrix only has 574 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-316690924384977414.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18232176308969009323.kers'
[2026-05-27 07:10:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-316690924384977414.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18232176308969009323.kers]
Normalized transition count is 573 out of 574 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 573 rows 50 cols 9998 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-27 07:10:44] [INFO ] Computed 14 invariants in 5 ms
Computed 14 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18232176308969009323.kers
Total runtime 9 ms.
[2026-05-27 07:10:45] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-27 07:10:45] [INFO ] Flow matrix only has 574 transitions (discarded 21 similar events)
[2026-05-27 07:10:45] [INFO ] Invariant cache hit.
[2026-05-27 07:10:45] [INFO ] State equation strengthened by 267 read => feed constraints.
[2026-05-27 07:10:45] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
[2026-05-27 07:10:46] [INFO ] Redundant transitions in 145 ms returned []
Running 593 sub problems to find dead transitions.
[2026-05-27 07:10:46] [INFO ] Flow matrix only has 574 transitions (discarded 21 similar events)
[2026-05-27 07:10:46] [INFO ] Invariant cache hit.
[2026-05-27 07:10:46] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 3 (OVERLAPS) 573/623 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 266/330 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/624 variables, and 330 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 50/50 constraints, ReadFeed: 266/267 constraints, PredecessorRefiner: 593/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 3 (OVERLAPS) 573/623 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 266/330 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 35/365 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/624 variables, and 365 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 50/50 constraints, ReadFeed: 266/267 constraints, PredecessorRefiner: 593/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60715ms problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 60717ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/156 places, 595/19850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64011 ms. Remains : 50/156 places, 595/19850 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 1461 ms.
Product exploration explored 100000 steps with 0 reset in 1143 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 58 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 2111 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 412 ms. (96 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1021728 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :0 out of 1
Probabilistic random walk after 1021728 steps, saw 138754 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
[2026-05-27 07:11:53] [INFO ] Flow matrix only has 574 transitions (discarded 21 similar events)
[2026-05-27 07:11:53] [INFO ] Invariant cache hit.
[2026-05-27 07:11:53] [INFO ] State equation strengthened by 267 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/38 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/50 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 573/623 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 266/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/623 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/624 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/624 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 624/624 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 50/50 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/0 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/38 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/50 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 573/623 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 266/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/623 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/624 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/624 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 624/624 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 50/50 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1150ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 11 ms.
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 3 factoid took 38 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 4975 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-05 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-05 finished in 71697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((p0 U p1) U p2) U (p1||X(p3))))))'
Support contains 32 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 154 transition count 17662
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 154 transition count 17662
Applied a total of 4 rules in 316 ms. Remains 154 /156 variables (removed 2) and now considering 17662/19850 (removed 2188) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9025126815875518689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9251898311049668592.kers'
[2026-05-27 07:11:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9025126815875518689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9251898311049668592.kers]
Culled 0 columns in 98 ms.
// Phase 1: matrix 17662 rows 154 cols 341721 entries
Finished phase 1 with 129 SingleSign rule and 3 generalized
[2026-05-27 07:11:55] [INFO ] Computed 22 invariants in 352 ms
Computed 22 P flows in 354 ms.
Exported basis to /tmp/petrispot-output-9251898311049668592.kers
Total runtime 406 ms.
[2026-05-27 07:11:58] [INFO ] Implicit Places using invariants in 3718 ms returned []
Implicit Place search using SMT only with invariants took 3719 ms to find 0 implicit places.
Running 17661 sub problems to find dead transitions.
[2026-05-27 07:11:58] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 153/17816 variables, and 8 constraints, problems are : Problem set: 0 solved, 17661 unsolved in 30472 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/154 constraints, PredecessorRefiner: 17661/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17661 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 153/17816 variables, and 8 constraints, problems are : Problem set: 0 solved, 17661 unsolved in 30423 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/154 constraints, PredecessorRefiner: 17546/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 102942ms problems are : Problem set: 0 solved, 17661 unsolved
Search for dead transitions found 0 dead transitions in 103030ms
Starting structural reductions in LTL mode, iteration 1 : 154/156 places, 17662/19850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107111 ms. Remains : 154/156 places, 17662/19850 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((p0 U p1) U p2) U (X(p3)||p1)))))'
Stuttering acceptance computed with spot in 441 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-06 finished in 107729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(p1)))'
Support contains 19 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Graph (trivial) has 96 edges and 156 vertex of which 4 / 156 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 153 transition count 19835
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 141 transition count 19835
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 25 place count 141 transition count 19819
Deduced a syphon composed of 16 places in 14 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 57 place count 125 transition count 19819
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 67 place count 115 transition count 13624
Iterating global reduction 2 with 10 rules applied. Total rules applied 77 place count 115 transition count 13624
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 115 transition count 13622
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 113 transition count 9120
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 113 transition count 9120
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 161 place count 74 transition count 9081
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 73 transition count 9092
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 73 transition count 9091
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 169 place count 73 transition count 9091
Applied a total of 169 rules in 9574 ms. Remains 73 /156 variables (removed 83) and now considering 9091/19850 (removed 10759) transitions.
[2026-05-27 07:13:51] [INFO ] Flow matrix only has 9070 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4192828265037173983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1367908502436900377.kers'
[2026-05-27 07:13:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4192828265037173983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1367908502436900377.kers]
Normalized transition count is 9069 out of 9070 initially.
Culled 0 columns in 28 ms.
// Phase 1: matrix 9069 rows 73 cols 171120 entries
Finished phase 1 with 49 SingleSign rule and 2 generalized
[2026-05-27 07:13:51] [INFO ] Computed 22 invariants in 101 ms
Computed 22 P flows in 102 ms.
Exported basis to /tmp/petrispot-output-1367908502436900377.kers
Total runtime 127 ms.
[2026-05-27 07:13:54] [INFO ] Implicit Places using invariants in 2893 ms returned []
[2026-05-27 07:13:54] [INFO ] Flow matrix only has 9070 transitions (discarded 21 similar events)
[2026-05-27 07:13:54] [INFO ] Invariant cache hit.
[2026-05-27 07:13:58] [INFO ] State equation strengthened by 4385 read => feed constraints.
[2026-05-27 07:14:04] [INFO ] Implicit Places using invariants and state equation in 9664 ms returned []
Implicit Place search using SMT with State Equation took 12564 ms to find 0 implicit places.
[2026-05-27 07:14:07] [INFO ] Redundant transitions in 3598 ms returned []
Running 9089 sub problems to find dead transitions.
[2026-05-27 07:14:08] [INFO ] Flow matrix only has 9070 transitions (discarded 21 similar events)
[2026-05-27 07:14:08] [INFO ] Invariant cache hit.
[2026-05-27 07:14:08] [INFO ] State equation strengthened by 4385 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9089 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 72/9143 variables, and 8 constraints, problems are : Problem set: 0 solved, 9089 unsolved in 30169 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/73 constraints, ReadFeed: 0/4385 constraints, PredecessorRefiner: 9089/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9089 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9089 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 72/9143 variables, and 8 constraints, problems are : Problem set: 0 solved, 9089 unsolved in 30217 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/73 constraints, ReadFeed: 0/4385 constraints, PredecessorRefiner: 9047/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76297ms problems are : Problem set: 0 solved, 9089 unsolved
Search for dead transitions found 0 dead transitions in 76327ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/156 places, 9091/19850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102086 ms. Remains : 73/156 places, 9091/19850 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(p1)))'
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-07 finished in 102290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p1)&&F(p2)))))'
Support contains 16 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 141 transition count 13291
Ensure Unique test removed 7 places
Iterating global reduction 0 with 22 rules applied. Total rules applied 37 place count 134 transition count 13291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 39 place count 132 transition count 6001
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 132 transition count 6001
Applied a total of 41 rules in 1041 ms. Remains 132 /156 variables (removed 24) and now considering 6001/19850 (removed 13849) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13865329499515932465.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5534687353842465377.kers'
[2026-05-27 07:15:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13865329499515932465.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5534687353842465377.kers]
Culled 0 columns in 12 ms.
// Phase 1: matrix 6001 rows 132 cols 76389 entries
Finished phase 1 with 115 SingleSign rule and 2 generalized
[2026-05-27 07:15:25] [INFO ] Computed 15 invariants in 48 ms
Computed 15 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-5534687353842465377.kers
Total runtime 59 ms.
[2026-05-27 07:15:26] [INFO ] Implicit Places using invariants in 1334 ms returned [94]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1346 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/156 places, 6001/19850 transitions.
Applied a total of 0 rules in 28 ms. Remains 131 /131 variables (removed 0) and now considering 6001/6001 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2415 ms. Remains : 131/156 places, 6001/19850 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p1)&&F(p2)))))'
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 4362 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 2 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-08 finished in 7082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0 U (G(!p0)||(!p0&&G(!p1))))))))'
Support contains 24 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 152 transition count 15232
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 152 transition count 15232
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 150 transition count 7942
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 150 transition count 7942
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 149 transition count 7940
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 149 transition count 7940
Applied a total of 14 rules in 516 ms. Remains 149 /156 variables (removed 7) and now considering 7940/19850 (removed 11910) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16512507112988050738.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2622683498743810779.kers'
[2026-05-27 07:15:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16512507112988050738.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2622683498743810779.kers]
Culled 0 columns in 24 ms.
// Phase 1: matrix 7940 rows 149 cols 152177 entries
Finished phase 1 with 124 SingleSign rule and 3 generalized
[2026-05-27 07:15:32] [INFO ] Computed 22 invariants in 93 ms
Computed 22 P flows in 94 ms.
Exported basis to /tmp/petrispot-output-2622683498743810779.kers
Total runtime 116 ms.
[2026-05-27 07:15:34] [INFO ] Implicit Places using invariants in 2879 ms returned []
[2026-05-27 07:15:34] [INFO ] Invariant cache hit.
[2026-05-27 07:15:42] [INFO ] Implicit Places using invariants and state equation in 7534 ms returned []
Implicit Place search using SMT with State Equation took 10416 ms to find 0 implicit places.
Running 7939 sub problems to find dead transitions.
[2026-05-27 07:15:42] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 148/8089 variables, and 8 constraints, problems are : Problem set: 0 solved, 7939 unsolved in 30127 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/149 constraints, PredecessorRefiner: 7939/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7939 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 148/8089 variables, and 8 constraints, problems are : Problem set: 0 solved, 7939 unsolved in 30207 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/149 constraints, PredecessorRefiner: 7826/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74358ms problems are : Problem set: 0 solved, 7939 unsolved
Search for dead transitions found 0 dead transitions in 74395ms
Starting structural reductions in LTL mode, iteration 1 : 149/156 places, 7940/19850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85349 ms. Remains : 149/156 places, 7940/19850 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0 U (G(!p0)||(!p0&&G(!p1))))))))'
Stuttering acceptance computed with spot in 217 ms :[p0, p0, p0, (AND p1 p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 5324 ms.
Product exploration explored 100000 steps with 0 reset in 4710 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge based reduction with 5 factoid took 48 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 3534 ms. (11 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 649 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 60905 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 6
Probabilistic random walk after 60905 steps, saw 37181 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2026-05-27 07:17:11] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 81/105 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 37/142 variables, 4/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 7/149 variables, 7/22 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8089/8089 variables, and 171 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 5/0 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/24 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 81/105 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 37/142 variables, 4/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 7/149 variables, 7/22 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8089/8089 variables, and 171 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10092ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 7940/7940 transitions.
Graph (trivial) has 93 edges and 149 vertex of which 4 / 149 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 147 transition count 7923
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 134 transition count 7923
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 27 place count 134 transition count 7906
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 61 place count 117 transition count 7906
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 115 transition count 7889
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 115 transition count 7889
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 115 transition count 7887
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 139 place count 79 transition count 7851
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 77 transition count 7862
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 77 transition count 7861
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 156 place count 77 transition count 7849
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 170 place count 65 transition count 7847
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 195 place count 65 transition count 7822
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 65 transition count 7821
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 203 place count 64 transition count 7815
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 204 place count 64 transition count 7815
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 209 place count 64 transition count 7815
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 214 place count 64 transition count 7810
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 63 transition count 7809
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 218 place count 60 transition count 7809
Applied a total of 218 rules in 31221 ms. Remains 60 /149 variables (removed 89) and now considering 7809/7940 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31221 ms. Remains : 60/149 places, 7809/7940 transitions.
RANDOM walk for 38680 steps (8 resets) in 5482 ms. (7 steps per ms) remains 0/4 properties
Found 2 invariant AP formulas.
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[p1]
Knowledge-based reduction took 47589 ms.
Stuttering acceptance computed with spot in 38 ms :[p1]
Support contains 24 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 7940/7940 transitions.
Graph (trivial) has 93 edges and 149 vertex of which 4 / 149 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 146 transition count 7925
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 134 transition count 7925
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 25 place count 134 transition count 7909
Deduced a syphon composed of 16 places in 6 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 57 place count 118 transition count 7909
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 116 transition count 7892
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 116 transition count 7892
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 116 transition count 7890
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 137 place count 79 transition count 7853
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 77 transition count 7864
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 77 transition count 7863
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 147 place count 77 transition count 7863
Applied a total of 147 rules in 9335 ms. Remains 77 /149 variables (removed 72) and now considering 7863/7940 (removed 77) transitions.
[2026-05-27 07:18:04] [INFO ] Flow matrix only has 7842 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17071003962096360096.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6000207236368295514.kers'
[2026-05-27 07:18:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17071003962096360096.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6000207236368295514.kers]
Normalized transition count is 7841 out of 7842 initially.
Culled 0 columns in 41 ms.
// Phase 1: matrix 7841 rows 77 cols 146100 entries
Finished phase 1 with 52 SingleSign rule and 3 generalized
[2026-05-27 07:18:04] [INFO ] Computed 22 invariants in 135 ms
Computed 22 P flows in 136 ms.
Exported basis to /tmp/petrispot-output-6000207236368295514.kers
Total runtime 162 ms.
[2026-05-27 07:18:07] [INFO ] Implicit Places using invariants in 3067 ms returned []
[2026-05-27 07:18:07] [INFO ] Flow matrix only has 7842 transitions (discarded 21 similar events)
[2026-05-27 07:18:07] [INFO ] Invariant cache hit.
[2026-05-27 07:18:10] [INFO ] State equation strengthened by 2927 read => feed constraints.
[2026-05-27 07:18:15] [INFO ] Implicit Places using invariants and state equation in 7775 ms returned []
Implicit Place search using SMT with State Equation took 10845 ms to find 0 implicit places.
[2026-05-27 07:18:17] [INFO ] Redundant transitions in 2141 ms returned []
Running 7861 sub problems to find dead transitions.
[2026-05-27 07:18:17] [INFO ] Flow matrix only has 7842 transitions (discarded 21 similar events)
[2026-05-27 07:18:17] [INFO ] Invariant cache hit.
[2026-05-27 07:18:17] [INFO ] State equation strengthened by 2927 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7861 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 76/7919 variables, and 8 constraints, problems are : Problem set: 0 solved, 7861 unsolved in 30219 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/77 constraints, ReadFeed: 0/2927 constraints, PredecessorRefiner: 7861/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7861 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 76/7919 variables, and 8 constraints, problems are : Problem set: 0 solved, 7861 unsolved in 30202 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/77 constraints, ReadFeed: 0/2927 constraints, PredecessorRefiner: 7828/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73836ms problems are : Problem set: 0 solved, 7861 unsolved
Search for dead transitions found 0 dead transitions in 73863ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/149 places, 7863/7940 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96205 ms. Remains : 77/149 places, 7863/7940 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
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).
RANDOM walk for 40000 steps (8 resets) in 4692 ms. (8 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 81776 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 1
Probabilistic random walk after 81776 steps, saw 26997 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2026-05-27 07:19:35] [INFO ] Flow matrix only has 7842 transitions (discarded 21 similar events)
[2026-05-27 07:19:35] [INFO ] Invariant cache hit.
[2026-05-27 07:19:35] [INFO ] State equation strengthened by 2927 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/70 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/77 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7918/7919 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2990 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 0/2927 constraints, PredecessorRefiner: 1/0 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/70 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/77 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7918/7919 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3222 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 0/2927 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6281ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 7863/7863 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 77 transition count 7861
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 14 place count 77 transition count 7849
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 65 transition count 7847
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 58 place count 65 transition count 7817
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 65 transition count 7816
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 66 place count 64 transition count 7810
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 64 transition count 7810
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 63 transition count 7809
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 60 transition count 7809
Applied a total of 71 rules in 20338 ms. Remains 60 /77 variables (removed 17) and now considering 7809/7863 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20341 ms. Remains : 60/77 places, 7809/7863 transitions.
RANDOM walk for 40000 steps (8 resets) in 6011 ms. (6 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 549 ms. (72 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 69654 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 69654 steps, saw 12379 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6246601349003980629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18347552973245703405.kers'
[2026-05-27 07:20:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6246601349003980629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18347552973245703405.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 42 ms.
// Phase 1: matrix 7809 rows 59 cols 145894 entries
Finished phase 1 with 38 SingleSign rule and 3 generalized
[2026-05-27 07:20:07] [INFO ] Computed 19 invariants in 143 ms
Computed 19 P flows in 144 ms.
Exported basis to /tmp/petrispot-output-18347552973245703405.kers
Total runtime 167 ms.
[2026-05-27 07:20:07] [INFO ] State equation strengthened by 2916 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/37 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 21/58 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7807/7865 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7865 variables, 2916/2992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7865 variables, 0/2992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/7869 variables, 2/2994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7869 variables, 1/2995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7869 variables, 0/2995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/7869 variables, 0/2995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7869/7869 variables, and 2995 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4096 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 2916/2916 constraints, PredecessorRefiner: 1/0 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/37 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/58 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7807/7865 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7865 variables, 2916/2992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7865 variables, 0/2992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/7869 variables, 2/2994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7869 variables, 1/2995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7869 variables, 0/2995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/7869 variables, 0/2995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7869/7869 variables, and 2995 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5134 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 2916/2916 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9496ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 14 ms.
Knowledge based reduction with 3 factoid took 61 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 36 ms :[p1]
Knowledge-based reduction took 45625 ms.
Stuttering acceptance computed with spot in 33 ms :[p1]
Stuttering acceptance computed with spot in 34 ms :[p1]
Product exploration explored 100000 steps with 0 reset in 7926 ms.
Product exploration explored 100000 steps with 0 reset in 7918 ms.
Built C files in :
/tmp/ltsmin6029946010136731115
[2026-05-27 07:20:32] [INFO ] Too many transitions (7863) to apply POR reductions. Disabling POR matrices.
[2026-05-27 07:20:33] [INFO ] Built C files in 350ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6029946010136731115
Running compilation step : cd /tmp/ltsmin6029946010136731115;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6029946010136731115;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6029946010136731115;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 24 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 7863/7863 transitions.
Applied a total of 0 rules in 2749 ms. Remains 77 /77 variables (removed 0) and now considering 7863/7863 (removed 0) transitions.
[2026-05-27 07:20:38] [INFO ] Flow matrix only has 7842 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8711056011137690752.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7005395155407440518.kers'
[2026-05-27 07:20:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8711056011137690752.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7005395155407440518.kers]
Normalized transition count is 7841 out of 7842 initially.
Culled 0 columns in 25 ms.
// Phase 1: matrix 7841 rows 77 cols 146100 entries
Finished phase 1 with 52 SingleSign rule and 3 generalized
[2026-05-27 07:20:38] [INFO ] Computed 22 invariants in 95 ms
Computed 22 P flows in 95 ms.
Exported basis to /tmp/petrispot-output-7005395155407440518.kers
Total runtime 119 ms.
[2026-05-27 07:20:40] [INFO ] Implicit Places using invariants in 1993 ms returned []
[2026-05-27 07:20:40] [INFO ] Flow matrix only has 7842 transitions (discarded 21 similar events)
[2026-05-27 07:20:40] [INFO ] Invariant cache hit.
[2026-05-27 07:20:43] [INFO ] State equation strengthened by 2927 read => feed constraints.
[2026-05-27 07:20:47] [INFO ] Implicit Places using invariants and state equation in 6416 ms returned []
Implicit Place search using SMT with State Equation took 8413 ms to find 0 implicit places.
[2026-05-27 07:20:49] [INFO ] Redundant transitions in 2022 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13197 ms. Remains : 77/77 places, 7863/7863 transitions.
Built C files in :
/tmp/ltsmin17276028829547089405
[2026-05-27 07:20:49] [INFO ] Too many transitions (7863) to apply POR reductions. Disabling POR matrices.
[2026-05-27 07:20:49] [INFO ] Built C files in 142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17276028829547089405
Running compilation step : cd /tmp/ltsmin17276028829547089405;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17276028829547089405;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17276028829547089405;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 07:20:55] [INFO ] Flatten gal took : 1260 ms
[2026-05-27 07:20:56] [INFO ] Flatten gal took : 849 ms
[2026-05-27 07:20:56] [INFO ] Time to serialize gal into /tmp/LTL3825240494341540378.gal : 188 ms
[2026-05-27 07:20:56] [INFO ] Time to serialize properties into /tmp/LTL11184914428836951882.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/LTL3825240494341540378.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3860013789091983309.hoa' '-atoms' '/tmp/LTL11184914428836951882.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11184914428836951882.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3860013789091983309.hoa
Detected timeout of ITS tools.
[2026-05-27 07:21:13] [INFO ] Flatten gal took : 884 ms
[2026-05-27 07:21:14] [INFO ] Flatten gal took : 881 ms
[2026-05-27 07:21:14] [INFO ] Time to serialize gal into /tmp/LTL17403724546556712849.gal : 149 ms
[2026-05-27 07:21:14] [INFO ] Time to serialize properties into /tmp/LTL10891481381710276441.ltl : 3 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/LTL17403724546556712849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10891481381710276441.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((!("(((((p14==1)&&(p37==1))&&((p62==1)&&(p81==1)))&&(((p100==1)&&(p113==1))&&((p132==1)&&(p151==1))))&&(p196==1))"))U((G(!("(...753
Formula 0 simplified : XXG(F"(((((((p15==1)&&(p34==1))&&((p53==1)&&(p82==1)))&&(((p101==1)&&(p114==1))&&((p133==1)&&(p158==1))))&&((((p198==1)&&(p251==1))&...493
Detected timeout of ITS tools.
[2026-05-27 07:21:30] [INFO ] Flatten gal took : 890 ms
[2026-05-27 07:21:30] [INFO ] Applying decomposition
[2026-05-27 07:21:32] [INFO ] Flatten gal took : 1363 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11140231594266301218.txt' '-o' '/tmp/graph11140231594266301218.bin' '-w' '/tmp/graph11140231594266301218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11140231594266301218.bin' '-l' '-1' '-v' '-w' '/tmp/graph11140231594266301218.weights' '-q' '0' '-e' '0.001'
[2026-05-27 07:21:34] [INFO ] Decomposing Gal with order
[2026-05-27 07:21:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 07:21:37] [INFO ] Removed a total of 83022 redundant transitions.
[2026-05-27 07:21:37] [INFO ] Flatten gal took : 2077 ms
[2026-05-27 07:21:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 1344 ms.
[2026-05-27 07:21:39] [INFO ] Time to serialize gal into /tmp/LTL6847746137529906785.gal : 100 ms
[2026-05-27 07:21:39] [INFO ] Time to serialize properties into /tmp/LTL8573093743178484090.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6847746137529906785.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8573093743178484090.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F((!("(((((i1.i0.u0.p14==1)&&(i1.i2.u3.p37==1))&&((i0.u6.p62==1)&&(i4.i1.u9.p81==1)))&&(((i4.i0.u11.p100==1)&&(i4.i1.u13.p113==...1231
Formula 0 simplified : XXG(F"(((((((i1.i0.u0.p15==1)&&(i0.u2.p34==1))&&((i4.i0.u5.p53==1)&&(i4.i1.u9.p82==1)))&&(((i4.i0.u11.p101==1)&&(i4.i1.u13.p114==1))...811
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-09 finished in 383460 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 9 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Graph (trivial) has 107 edges and 156 vertex of which 6 / 156 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 152 transition count 19834
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 140 transition count 19834
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 25 place count 140 transition count 19817
Deduced a syphon composed of 17 places in 12 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 59 place count 123 transition count 19817
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 70 place count 112 transition count 7057
Iterating global reduction 2 with 11 rules applied. Total rules applied 81 place count 112 transition count 7057
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 84 place count 112 transition count 7054
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 92 place count 104 transition count 749
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 104 transition count 749
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 106 place count 98 transition count 611
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 98 transition count 611
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 180 place count 64 transition count 577
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -7
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 192 place count 58 transition count 584
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 58 transition count 581
Applied a total of 195 rules in 2118 ms. Remains 58 /156 variables (removed 98) and now considering 581/19850 (removed 19269) transitions.
[2026-05-27 07:21:57] [INFO ] Flow matrix only has 561 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5158270940741372185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-386334164077489103.kers'
[2026-05-27 07:21:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5158270940741372185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-386334164077489103.kers]
Normalized transition count is 560 out of 561 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 560 rows 58 cols 9422 entries
Finished phase 1 with 34 SingleSign rule and 2 generalized
[2026-05-27 07:21:57] [INFO ] Computed 22 invariants in 6 ms
Computed 22 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-386334164077489103.kers
Total runtime 8 ms.
[2026-05-27 07:21:57] [INFO ] Implicit Places using invariants in 276 ms returned []
[2026-05-27 07:21:57] [INFO ] Flow matrix only has 561 transitions (discarded 20 similar events)
[2026-05-27 07:21:57] [INFO ] Invariant cache hit.
[2026-05-27 07:21:57] [INFO ] State equation strengthened by 278 read => feed constraints.
[2026-05-27 07:21:58] [INFO ] Implicit Places using invariants and state equation in 1404 ms returned []
Implicit Place search using SMT with State Equation took 1682 ms to find 0 implicit places.
[2026-05-27 07:21:58] [INFO ] Redundant transitions in 14 ms returned []
Running 579 sub problems to find dead transitions.
[2026-05-27 07:21:58] [INFO ] Flow matrix only has 561 transitions (discarded 20 similar events)
[2026-05-27 07:21:58] [INFO ] Invariant cache hit.
[2026-05-27 07:21:58] [INFO ] State equation strengthened by 278 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 560/618 variables, 58/80 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/618 variables, 277/357 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/619 variables, and 357 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 277/278 constraints, PredecessorRefiner: 579/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 560/618 variables, 58/80 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/618 variables, 277/357 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/618 variables, 35/392 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/619 variables, and 392 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 277/278 constraints, PredecessorRefiner: 579/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61050ms problems are : Problem set: 0 solved, 579 unsolved
Search for dead transitions found 0 dead transitions in 61052ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/156 places, 581/19850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64878 ms. Remains : 58/156 places, 581/19850 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 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-10 finished in 64990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((G(X(G(p0))) U X(X(X(p1)))))) U p2))'
Support contains 25 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 147 transition count 13544
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 147 transition count 13544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 146 transition count 9170
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 146 transition count 9170
Applied a total of 20 rules in 495 ms. Remains 146 /156 variables (removed 10) and now considering 9170/19850 (removed 10680) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17083785580483888512.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7600665563886981953.kers'
[2026-05-27 07:23:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17083785580483888512.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7600665563886981953.kers]
Culled 0 columns in 30 ms.
// Phase 1: matrix 9170 rows 146 cols 180117 entries
Finished phase 1 with 122 SingleSign rule and 2 generalized
[2026-05-27 07:23:00] [INFO ] Computed 22 invariants in 109 ms
Computed 22 P flows in 110 ms.
Exported basis to /tmp/petrispot-output-7600665563886981953.kers
Total runtime 135 ms.
[2026-05-27 07:23:02] [INFO ] Implicit Places using invariants in 1720 ms returned []
[2026-05-27 07:23:02] [INFO ] Invariant cache hit.
[2026-05-27 07:23:09] [INFO ] Implicit Places using invariants and state equation in 6939 ms returned []
Implicit Place search using SMT with State Equation took 8661 ms to find 0 implicit places.
Running 9169 sub problems to find dead transitions.
[2026-05-27 07:23:09] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 145/9316 variables, and 8 constraints, problems are : Problem set: 0 solved, 9169 unsolved in 30233 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/146 constraints, PredecessorRefiner: 9169/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9169 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 145/9316 variables, and 8 constraints, problems are : Problem set: 0 solved, 9169 unsolved in 30238 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/146 constraints, PredecessorRefiner: 9045/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77413ms problems are : Problem set: 0 solved, 9169 unsolved
Search for dead transitions found 0 dead transitions in 77443ms
Starting structural reductions in LTL mode, iteration 1 : 146/156 places, 9170/19850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86615 ms. Remains : 146/156 places, 9170/19850 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((G(X(G(p0))) U X(X(X(p1)))))) U p2))'
Stuttering acceptance computed with spot in 459 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-11 finished in 87195 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(!F(p0))||(F(X(!p1)) U p0)||p1) U p2))'
Support contains 21 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Graph (trivial) has 85 edges and 156 vertex of which 4 / 156 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 153 transition count 19835
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 141 transition count 19835
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 25 place count 141 transition count 19820
Deduced a syphon composed of 15 places in 11 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 55 place count 126 transition count 19820
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 73 place count 108 transition count 13243
Ensure Unique test removed 7 places
Iterating global reduction 2 with 25 rules applied. Total rules applied 98 place count 101 transition count 13243
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 101 transition count 13241
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 99 transition count 8866
Ensure Unique test removed 1 places
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 98 transition count 8866
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 3 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 173 place count 64 transition count 8832
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 63 transition count 8843
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 63 transition count 8842
Partial Post-agglomeration rule applied 11 times.
Drop transitions (Partial Post agglomeration) removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 187 place count 63 transition count 8842
Applied a total of 187 rules in 2295 ms. Remains 63 /156 variables (removed 93) and now considering 8842/19850 (removed 11008) transitions.
[2026-05-27 07:24:29] [INFO ] Flow matrix only has 8821 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1755491031631708331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11853505014944955809.kers'
[2026-05-27 07:24:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1755491031631708331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11853505014944955809.kers]
Normalized transition count is 8820 out of 8821 initially.
Culled 0 columns in 32 ms.
// Phase 1: matrix 8820 rows 63 cols 175274 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-27 07:24:29] [INFO ] Computed 14 invariants in 87 ms
Computed 14 P flows in 88 ms.
Exported basis to /tmp/petrispot-output-11853505014944955809.kers
Total runtime 116 ms.
[2026-05-27 07:24:30] [INFO ] Implicit Places using invariants in 1362 ms returned []
[2026-05-27 07:24:30] [INFO ] Flow matrix only has 8821 transitions (discarded 21 similar events)
[2026-05-27 07:24:30] [INFO ] Invariant cache hit.
[2026-05-27 07:24:35] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-27 07:24:36] [INFO ] Implicit Places using invariants and state equation in 5563 ms returned []
Implicit Place search using SMT with State Equation took 6930 ms to find 0 implicit places.
[2026-05-27 07:24:39] [INFO ] Redundant transitions in 2946 ms returned []
Running 8840 sub problems to find dead transitions.
[2026-05-27 07:24:39] [INFO ] Flow matrix only has 8821 transitions (discarded 21 similar events)
[2026-05-27 07:24:39] [INFO ] Invariant cache hit.
[2026-05-27 07:24:39] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 62/8884 variables, and 0 constraints, problems are : Problem set: 0 solved, 8840 unsolved in 30224 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/63 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 8840/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8840 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 62/8884 variables, and 0 constraints, problems are : Problem set: 0 solved, 8840 unsolved in 30234 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/63 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 8809/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77147ms problems are : Problem set: 0 solved, 8840 unsolved
Search for dead transitions found 0 dead transitions in 77176ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/156 places, 8842/19850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89367 ms. Remains : 63/156 places, 8842/19850 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(!F(p0))||(F(X(!p1)) U p0)||p1) U p2))'
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-12
Product exploration timeout after 96160 steps with 0 reset in 10001 ms.
Product exploration timeout after 97250 steps with 0 reset in 10001 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 12 factoid took 60 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 5656 ms. (7 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 580 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 677 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 654 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 573 ms. (69 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 713 ms. (56 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 129136 steps, run timeout after 6001 ms. (steps per millisecond=21 ) properties seen :0 out of 6
Probabilistic random walk after 129136 steps, saw 31463 distinct states, run finished after 6001 ms. (steps per millisecond=21 ) properties seen :0
[2026-05-27 07:26:25] [INFO ] Flow matrix only has 8821 transitions (discarded 21 similar events)
[2026-05-27 07:26:25] [INFO ] Invariant cache hit.
[2026-05-27 07:26:25] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/51 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 12/63 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8883/8884 variables, and 77 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 63/63 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 30/51 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 12/63 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8883/8884 variables, and 77 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 63/63 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10108ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 8842/8842 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 8840
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 10 place count 63 transition count 8832
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 55 transition count 8830
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 49 place count 55 transition count 8801
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 55 transition count 8800
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 57 place count 54 transition count 8794
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 54 transition count 8794
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 53 transition count 8793
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 63 place count 50 transition count 8793
Applied a total of 63 rules in 17881 ms. Remains 50 /63 variables (removed 13) and now considering 8793/8842 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17881 ms. Remains : 50/63 places, 8793/8842 transitions.
RANDOM walk for 40000 steps (8 resets) in 7139 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1965 ms. (20 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1923 ms. (20 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1924 ms. (20 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1915 ms. (20 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2084 ms. (19 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 301612 steps, run timeout after 12001 ms. (steps per millisecond=25 ) properties seen :0 out of 5
Probabilistic random walk after 301612 steps, saw 47147 distinct states, run finished after 12001 ms. (steps per millisecond=25 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14796556062855649255.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13782829031927619613.kers'
[2026-05-27 07:27:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14796556062855649255.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13782829031927619613.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 28 ms.
// Phase 1: matrix 8793 rows 48 cols 157567 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-27 07:27:10] [INFO ] Computed 11 invariants in 99 ms
Computed 11 P flows in 100 ms.
Exported basis to /tmp/petrispot-output-13782829031927619613.kers
Total runtime 130 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 27/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8791/8839 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8839 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/8843 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8843 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8843 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/8843 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8843/8843 variables, and 61 constraints, problems are : Problem set: 0 solved, 5 unsolved in 14733 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 27/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8791/8839 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8839 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/8843 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8843 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8843 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/8843 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8843/8843 variables, and 61 constraints, problems are : Problem set: 0 solved, 5 unsolved in 10955 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25904ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=4 )
Parikh walk visited 5 properties in 804 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 13 factoid took 116 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
[2026-05-27 07:27:36] [INFO ] Flow matrix only has 8821 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10354923985462395115.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7213033657261484583.kers'
[2026-05-27 07:27:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10354923985462395115.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7213033657261484583.kers]
Normalized transition count is 8820 out of 8821 initially.
Culled 0 columns in 29 ms.
// Phase 1: matrix 8820 rows 63 cols 175274 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-27 07:27:37] [INFO ] Computed 14 invariants in 84 ms
Computed 14 P flows in 84 ms.
Exported basis to /tmp/petrispot-output-7213033657261484583.kers
Total runtime 108 ms.
[2026-05-27 07:27:46] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned unsat
Proved EG (NOT p2) asserting that LTL formula F !(NOT p2) is false.
Negative knowledge disproves property using: (F p2)
Knowledge-based reduction took 89802 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-12 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-12 finished in 199439 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(G(p0)))||G(p1)))&&F(p2)))'
Support contains 26 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 148 transition count 13672
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 148 transition count 13672
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 146 transition count 9170
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 146 transition count 9170
Applied a total of 20 rules in 478 ms. Remains 146 /156 variables (removed 10) and now considering 9170/19850 (removed 10680) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1905251613850789372.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1038648526984821570.kers'
[2026-05-27 07:27:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1905251613850789372.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1038648526984821570.kers]
Culled 0 columns in 31 ms.
// Phase 1: matrix 9170 rows 146 cols 180117 entries
Finished phase 1 with 122 SingleSign rule and 2 generalized
[2026-05-27 07:27:47] [INFO ] Computed 22 invariants in 118 ms
Computed 22 P flows in 119 ms.
Exported basis to /tmp/petrispot-output-1038648526984821570.kers
Total runtime 145 ms.
[2026-05-27 07:27:48] [INFO ] Implicit Places using invariants in 1556 ms returned []
[2026-05-27 07:27:48] [INFO ] Invariant cache hit.
[2026-05-27 07:27:55] [INFO ] Implicit Places using invariants and state equation in 6473 ms returned []
Implicit Place search using SMT with State Equation took 8036 ms to find 0 implicit places.
Running 9169 sub problems to find dead transitions.
[2026-05-27 07:27:55] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 145/9316 variables, and 8 constraints, problems are : Problem set: 0 solved, 9169 unsolved in 30140 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/146 constraints, PredecessorRefiner: 9169/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9169 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 145/9316 variables, and 8 constraints, problems are : Problem set: 0 solved, 9169 unsolved in 30139 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/146 constraints, PredecessorRefiner: 9045/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76689ms problems are : Problem set: 0 solved, 9169 unsolved
Search for dead transitions found 0 dead transitions in 76721ms
Starting structural reductions in LTL mode, iteration 1 : 146/156 places, 9170/19850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85253 ms. Remains : 146/156 places, 9170/19850 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(G(p0)))||G(p1)))&&F(p2)))'
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 5997 ms.
Product exploration explored 100000 steps with 0 reset in 6031 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge based reduction with 5 factoid took 65 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 2971 ms. (13 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 240 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 46060 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 7
Probabilistic random walk after 46060 steps, saw 28036 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
[2026-05-27 07:29:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/102 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 37/139 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/146 variables, 7/22 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9316/9316 variables, and 168 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 76/102 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 37/139 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/146 variables, 7/22 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 9316/9316 variables, and 168 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10082ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 9170/9170 transitions.
Graph (trivial) has 88 edges and 146 vertex of which 4 / 146 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 144 transition count 9153
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 131 transition count 9153
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 27 place count 131 transition count 9137
Deduced a syphon composed of 16 places in 5 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 59 place count 115 transition count 9137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 113 transition count 9120
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 113 transition count 9120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 113 transition count 9118
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 3 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 129 place count 81 transition count 9086
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 79 transition count 9108
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 79 transition count 9106
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 145 place count 79 transition count 9096
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 157 place count 69 transition count 9094
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 175 place count 69 transition count 9076
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 69 transition count 9076
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 182 place count 69 transition count 9076
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 187 place count 69 transition count 9071
Applied a total of 187 rules in 6122 ms. Remains 69 /146 variables (removed 77) and now considering 9071/9170 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6123 ms. Remains : 69/146 places, 9071/9170 transitions.
RANDOM walk for 40000 steps (8 resets) in 6386 ms. (6 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1256 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1656 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1642 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 716 ms. (55 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1434 ms. (27 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1155 ms. (34 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 267855 steps, run timeout after 9001 ms. (steps per millisecond=29 ) properties seen :1 out of 6
Probabilistic random walk after 267855 steps, saw 39290 distinct states, run finished after 9004 ms. (steps per millisecond=29 ) properties seen :1
[2026-05-27 07:29:57] [INFO ] Flow matrix only has 9070 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3839586794780086428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9267080353998317335.kers'
[2026-05-27 07:29:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3839586794780086428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9267080353998317335.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 31 ms.
// Phase 1: matrix 9070 rows 68 cols 179808 entries
Finished phase 1 with 45 SingleSign rule and 2 generalized
[2026-05-27 07:29:57] [INFO ] Computed 22 invariants in 113 ms
Computed 22 P flows in 114 ms.
Exported basis to /tmp/petrispot-output-9267080353998317335.kers
Total runtime 142 ms.
[2026-05-27 07:29:57] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 24/41 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/48 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 21/69 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 9070/9139 variables, 69/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9139 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9139 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/9139 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9139/9139 variables, and 126 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6217 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 24/41 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/48 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 21/69 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 9070/9139 variables, 69/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9139 variables, 35/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9139 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/9139 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9139/9139 variables, and 126 constraints, problems are : Problem set: 0 solved, 5 unsolved in 12739 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19195ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 2096 ms.
Support contains 17 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 9071/9071 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 8816
Ensure Unique test removed 8 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 53 transition count 8816
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 52 transition count 8815
Applied a total of 26 rules in 7871 ms. Remains 52 /69 variables (removed 17) and now considering 8815/9071 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7872 ms. Remains : 52/69 places, 8815/9071 transitions.
RANDOM walk for 40000 steps (8 resets) in 5989 ms. (6 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1123 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1116 ms. (35 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 206857 steps, run timeout after 6001 ms. (steps per millisecond=34 ) properties seen :0 out of 2
Probabilistic random walk after 206857 steps, saw 28626 distinct states, run finished after 6001 ms. (steps per millisecond=34 ) properties seen :0
[2026-05-27 07:30:34] [INFO ] Flow matrix only has 8814 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13842074817107424834.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14125606896179133121.kers'
[2026-05-27 07:30:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13842074817107424834.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14125606896179133121.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 44 ms.
// Phase 1: matrix 8814 rows 51 cols 143124 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-27 07:30:35] [INFO ] Computed 14 invariants in 118 ms
Computed 14 P flows in 118 ms.
Exported basis to /tmp/petrispot-output-14125606896179133121.kers
Total runtime 139 ms.
[2026-05-27 07:31:07] [INFO ] State equation strengthened by 7919 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/45 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/52 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8814/8866 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 107358ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 8815/8815 transitions.
Applied a total of 0 rules in 8062 ms. Remains 52 /52 variables (removed 0) and now considering 8815/8815 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8062 ms. Remains : 52/52 places, 8815/8815 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 8815/8815 transitions.
Applied a total of 0 rules in 8044 ms. Remains 52 /52 variables (removed 0) and now considering 8815/8815 (removed 0) transitions.
[2026-05-27 07:32:38] [INFO ] Flow matrix only has 8814 transitions (discarded 1 similar events)
[2026-05-27 07:32:38] [INFO ] Invariant cache hit.
[2026-05-27 07:32:39] [INFO ] Implicit Places using invariants in 1551 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1570 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/52 places, 8815/8815 transitions.
Applied a total of 0 rules in 8233 ms. Remains 51 /51 variables (removed 0) and now considering 8815/8815 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17855 ms. Remains : 51/52 places, 8815/8815 transitions.
Found 1 invariant AP formulas.
Knowledge based reduction with 6 factoid took 102 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), true, (NOT p1)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-955124522526752675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12847047445255384564.kers'
[2026-05-27 07:32:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-955124522526752675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12847047445255384564.kers]
Culled 0 columns in 29 ms.
// Phase 1: matrix 9170 rows 146 cols 180117 entries
Finished phase 1 with 122 SingleSign rule and 2 generalized
[2026-05-27 07:32:48] [INFO ] Computed 22 invariants in 105 ms
Computed 22 P flows in 106 ms.
Exported basis to /tmp/petrispot-output-12847047445255384564.kers
Total runtime 135 ms.
[2026-05-27 07:32:57] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned unsat
Proved EG (NOT p2) asserting that LTL formula F !(NOT p2) is false.
Negative knowledge disproves property using: (F p2)
Knowledge-based reduction took 212768 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-13 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-13 finished in 310401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 10 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Graph (trivial) has 96 edges and 156 vertex of which 4 / 156 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 153 transition count 19835
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 141 transition count 19835
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 25 place count 141 transition count 19819
Deduced a syphon composed of 16 places in 11 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 57 place count 125 transition count 19819
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 75 place count 107 transition count 13242
Ensure Unique test removed 7 places
Iterating global reduction 2 with 25 rules applied. Total rules applied 100 place count 100 transition count 13242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 100 transition count 13240
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 110 place count 92 transition count 885
Ensure Unique test removed 1 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 119 place count 91 transition count 885
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 123 place count 87 transition count 623
Iterating global reduction 3 with 4 rules applied. Total rules applied 127 place count 87 transition count 623
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 195 place count 53 transition count 589
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -11
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 203 place count 49 transition count 600
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 208 place count 49 transition count 595
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 213 place count 49 transition count 595
Applied a total of 213 rules in 2195 ms. Remains 49 /156 variables (removed 107) and now considering 595/19850 (removed 19255) transitions.
[2026-05-27 07:32:59] [INFO ] Flow matrix only has 574 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17118971504669833580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10787875588043898114.kers'
[2026-05-27 07:32:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17118971504669833580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10787875588043898114.kers]
Normalized transition count is 573 out of 574 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 573 rows 49 cols 10002 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-27 07:32:59] [INFO ] Computed 14 invariants in 5 ms
Computed 14 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10787875588043898114.kers
Total runtime 7 ms.
[2026-05-27 07:32:59] [INFO ] Implicit Places using invariants in 250 ms returned []
[2026-05-27 07:32:59] [INFO ] Flow matrix only has 574 transitions (discarded 21 similar events)
[2026-05-27 07:32:59] [INFO ] Invariant cache hit.
[2026-05-27 07:32:59] [INFO ] State equation strengthened by 267 read => feed constraints.
[2026-05-27 07:33:00] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1416 ms to find 0 implicit places.
[2026-05-27 07:33:00] [INFO ] Redundant transitions in 22 ms returned []
Running 593 sub problems to find dead transitions.
[2026-05-27 07:33:00] [INFO ] Flow matrix only has 574 transitions (discarded 21 similar events)
[2026-05-27 07:33:00] [INFO ] Invariant cache hit.
[2026-05-27 07:33:00] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 3 (OVERLAPS) 573/622 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 266/329 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/623 variables, and 329 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 49/49 constraints, ReadFeed: 266/267 constraints, PredecessorRefiner: 593/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 3 (OVERLAPS) 573/622 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 266/329 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/623 variables, and 363 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 49/49 constraints, ReadFeed: 266/267 constraints, PredecessorRefiner: 593/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60967ms problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 60970ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/156 places, 595/19850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64613 ms. Remains : 49/156 places, 595/19850 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-14 finished in 64688 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(p0))&&F(p1))))'
Support contains 19 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 19850/19850 transitions.
Graph (trivial) has 96 edges and 156 vertex of which 4 / 156 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 153 transition count 19835
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 141 transition count 19835
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 25 place count 141 transition count 19819
Deduced a syphon composed of 16 places in 13 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 57 place count 125 transition count 19819
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 67 place count 115 transition count 13624
Iterating global reduction 2 with 10 rules applied. Total rules applied 77 place count 115 transition count 13624
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 115 transition count 13622
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 114 transition count 13494
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 114 transition count 13494
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 157 place count 76 transition count 13456
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 75 transition count 13467
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 165 place count 75 transition count 13467
Applied a total of 165 rules in 12955 ms. Remains 75 /156 variables (removed 81) and now considering 13467/19850 (removed 6383) transitions.
[2026-05-27 07:34:14] [INFO ] Flow matrix only has 13446 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2397253132714111474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16851833585920677227.kers'
[2026-05-27 07:34:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2397253132714111474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16851833585920677227.kers]
Normalized transition count is 13445 out of 13446 initially.
Culled 0 columns in 46 ms.
// Phase 1: matrix 13445 rows 75 cols 254236 entries
Finished phase 1 with 51 SingleSign rule and 2 generalized
[2026-05-27 07:34:14] [INFO ] Computed 22 invariants in 187 ms
Computed 22 P flows in 188 ms.
Exported basis to /tmp/petrispot-output-16851833585920677227.kers
Total runtime 230 ms.
[2026-05-27 07:34:19] [INFO ] Implicit Places using invariants in 5258 ms returned []
Implicit Place search using SMT only with invariants took 5259 ms to find 0 implicit places.
Running 13465 sub problems to find dead transitions.
[2026-05-27 07:34:20] [INFO ] Flow matrix only has 13446 transitions (discarded 21 similar events)
[2026-05-27 07:34:20] [INFO ] Invariant cache hit.
[2026-05-27 07:34:20] [INFO ] State equation strengthened by 6572 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 74/13521 variables, and 8 constraints, problems are : Problem set: 0 solved, 13465 unsolved in 30211 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/75 constraints, ReadFeed: 0/6572 constraints, PredecessorRefiner: 13465/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13465 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 74/13521 variables, and 8 constraints, problems are : Problem set: 0 solved, 13465 unsolved in 30308 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/75 constraints, ReadFeed: 0/6572 constraints, PredecessorRefiner: 13422/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91983ms problems are : Problem set: 0 solved, 13465 unsolved
Search for dead transitions found 0 dead transitions in 92027ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/156 places, 13467/19850 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110264 ms. Remains : 75/156 places, 13467/19850 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(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0808-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0808-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0808-LTLFireability-15 finished in 110503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0 U (G(!p0)||(!p0&&G(!p1))))))))'
Spot run failed in 169 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-27 07:35:54] [INFO ] Flatten gal took : 2127 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10416959966898116196
[2026-05-27 07:35:55] [INFO ] Too many transitions (19850) to apply POR reductions. Disabling POR matrices.
[2026-05-27 07:35:56] [INFO ] Built C files in 366ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10416959966898116196
Running compilation step : cd /tmp/ltsmin10416959966898116196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-27 07:35:57] [INFO ] Applying decomposition
[2026-05-27 07:35:59] [INFO ] Flatten gal took : 1809 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15545056736872708218.txt' '-o' '/tmp/graph15545056736872708218.bin' '-w' '/tmp/graph15545056736872708218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15545056736872708218.bin' '-l' '-1' '-v' '-w' '/tmp/graph15545056736872708218.weights' '-q' '0' '-e' '0.001'
[2026-05-27 07:36:05] [INFO ] Decomposing Gal with order
[2026-05-27 07:36:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 07:36:11] [INFO ] Removed a total of 221012 redundant transitions.
[2026-05-27 07:36:11] [INFO ] Flatten gal took : 3999 ms
[2026-05-27 07:36:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 2300 ms.
[2026-05-27 07:36:14] [INFO ] Time to serialize gal into /tmp/LTLFireability13133209893165515709.gal : 155 ms
[2026-05-27 07:36:14] [INFO ] Time to serialize properties into /tmp/LTLFireability9795516234978828388.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13133209893165515709.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9795516234978828388.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((!("(((((i1.i1.i0.u6.p14==1)&&(i2.u11.p37==1))&&((i4.u16.p62==1)&&(i4.u20.p81==1)))&&(((i4.u24.p100==1)&&(i2.u26.p113==1))&&(...1180
Formula 0 simplified : XXG(F"(((((((i1.i1.i0.u6.p15==1)&&(i1.i0.u10.p34==1))&&((i5.u13.p53==1)&&(i4.u20.p82==1)))&&(((i4.u24.p101==1)&&(i2.u26.p114==1))&&(...784
Compilation finished in 550519 ms.
Running link step : cd /tmp/ltsmin10416959966898116196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 602 ms.
Running LTSmin : cd /tmp/ltsmin10416959966898116196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(<>((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

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