Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 64M
-rw-r--r-- 1 mcc users 7.0K May 27 08:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 27 08:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 27 08:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 27 08:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 27 10:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 27 10:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 8.3K May 27 08:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 27 08:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 27 08:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 27 08:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 64M May 26 18:17 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1780284532636

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP09C09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-01 03:28:54] [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-06-01 03:28:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 03:28:58] [INFO ] Load time of PNML (sax parser for PT used): 3645 ms
[2026-06-01 03:28:58] [INFO ] Transformed 333 places.
[2026-06-01 03:28:59] [INFO ] Transformed 59403 transitions.
[2026-06-01 03:28:59] [INFO ] Found NUPN structural information;
[2026-06-01 03:28:59] [INFO ] Parsed PT model containing 333 places and 59403 transitions and 1260648 arcs in 4321 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 66 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 59403/59403 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 258 transition count 59328
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 258 transition count 59328
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 199 place count 209 transition count 59279
Iterating global reduction 0 with 49 rules applied. Total rules applied 248 place count 209 transition count 59279
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 251 place count 206 transition count 59276
Iterating global reduction 0 with 3 rules applied. Total rules applied 254 place count 206 transition count 59276
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 257 place count 203 transition count 59257
Iterating global reduction 0 with 3 rules applied. Total rules applied 260 place count 203 transition count 59257
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 263 place count 200 transition count 59254
Iterating global reduction 0 with 3 rules applied. Total rules applied 266 place count 200 transition count 59254
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 269 place count 197 transition count 59251
Iterating global reduction 0 with 3 rules applied. Total rules applied 272 place count 197 transition count 59251
Applied a total of 272 rules in 3368 ms. Remains 197 /333 variables (removed 136) and now considering 59251/59403 (removed 152) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11033167947222467550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16549477998417854069.kers'
[2026-06-01 03:29:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11033167947222467550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16549477998417854069.kers]
Culled 0 columns in 218 ms.
// Phase 1: matrix 59251 rows 197 cols 1260268 entries
Finished phase 1 with 170 SingleSign rule and 3 generalized
[2026-06-01 03:29:05] [INFO ] Computed 24 invariants in 1203 ms
Computed 24 P flows in 1204 ms.
Exported basis to /tmp/petrispot-output-16549477998417854069.kers
Total runtime 1466 ms.
[2026-06-01 03:29:08] [INFO ] Implicit Places using invariants in 4803 ms returned []
Implicit Place search using SMT only with invariants took 4857 ms to find 0 implicit places.
Running 59250 sub problems to find dead transitions.
[2026-06-01 03:29:09] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
SMT process timed out in 353479ms, After SMT, problems are : Problem set: 0 solved, 59250 unsolved
Search for dead transitions found 0 dead transitions in 353883ms
Starting structural reductions in LTL mode, iteration 1 : 197/333 places, 59251/59403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362498 ms. Remains : 197/333 places, 59251/59403 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Applied a total of 0 rules in 372 ms. Remains 197 /197 variables (removed 0) and now considering 59251/59251 (removed 0) transitions.
[2026-06-01 03:35:03] [INFO ] Invariant cache hit.
[2026-06-01 03:35:05] [INFO ] Implicit Places using invariants in 2299 ms returned []
Implicit Place search using SMT only with invariants took 2309 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2695 ms. Remains : 197/197 places, 59251/59251 transitions.
Support contains 53 out of 197 places after structural reductions.
[2026-06-01 03:35:15] [INFO ] Flatten gal took : 8551 ms
[2026-06-01 03:35:23] [INFO ] Flatten gal took : 7751 ms
[2026-06-01 03:35:34] [INFO ] Input system was already deterministic with 59251 transitions.
Support contains 52 out of 197 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 76466 ms. (0 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 283 ms. (14 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 316 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 224 ms. (17 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 190 ms. (20 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 192 ms. (20 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 217 ms. (18 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 245 ms. (16 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 180 ms. (22 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 185 ms. (21 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 179 ms. (22 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 193 ms. (20 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 168 ms. (23 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 187 ms. (21 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 190 ms. (20 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 256 ms. (15 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 150 ms. (26 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 210 ms. (18 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 178 ms. (22 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 227 ms. (17 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 758 ms. (5 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 188 ms. (21 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 241 ms. (16 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 201 ms. (19 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 210 ms. (18 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 177 ms. (22 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 158649 steps, run timeout after 66001 ms. (steps per millisecond=2 ) properties seen :0 out of 31
Probabilistic random walk after 158649 steps, saw 37403 distinct states, run finished after 66014 ms. (steps per millisecond=2 ) properties seen :0
[2026-06-01 03:37:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 43/95 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 95/59448 variables, and 11 constraints, problems are : Problem set: 1 solved, 30 unsolved in 5304 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 31/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 43/95 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 95/59448 variables, and 11 constraints, problems are : Problem set: 1 solved, 30 unsolved in 5703 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 30/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11828ms problems are : Problem set: 1 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Graph (trivial) has 126 edges and 197 vertex of which 9 / 197 are part of one of the 4 SCC in 25 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 192 transition count 59214
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 64 place count 165 transition count 59205
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 70 place count 159 transition count 59205
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 70 place count 159 transition count 59191
Deduced a syphon composed of 14 places in 61 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 98 place count 145 transition count 59191
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 27 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 158 place count 115 transition count 59161
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 164 place count 115 transition count 59155
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 167 place count 112 transition count 59148
Iterating global reduction 4 with 3 rules applied. Total rules applied 170 place count 112 transition count 59148
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 25 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 184 place count 105 transition count 59178
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 196 place count 105 transition count 59166
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 198 place count 103 transition count 59160
Iterating global reduction 5 with 2 rules applied. Total rules applied 200 place count 103 transition count 59160
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 210 place count 103 transition count 59150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 32 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 212 place count 102 transition count 59163
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 213 place count 102 transition count 59162
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 216 place count 102 transition count 59159
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 219 place count 99 transition count 59159
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 228 place count 99 transition count 59159
Applied a total of 228 rules in 13301 ms. Remains 99 /197 variables (removed 98) and now considering 59159/59251 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13307 ms. Remains : 99/197 places, 59159/59251 transitions.
Successfully simplified 1 atomic propositions for a total of 14 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' '!(X(G((F(!p0) U (p1 U (p2||X(X(p3))))))))'
Support contains 34 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 188 transition count 40080
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 188 transition count 40080
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 187 transition count 26958
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 187 transition count 26958
Applied a total of 20 rules in 3750 ms. Remains 187 /197 variables (removed 10) and now considering 26958/59251 (removed 32293) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-700527488866121529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10505195375001503771.kers'
[2026-06-01 03:37:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-700527488866121529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10505195375001503771.kers]
Culled 0 columns in 98 ms.
// Phase 1: matrix 26958 rows 187 cols 588164 entries
Finished phase 1 with 161 SingleSign rule and 2 generalized
[2026-06-01 03:37:35] [INFO ] Computed 24 invariants in 454 ms
Computed 24 P flows in 456 ms.
Exported basis to /tmp/petrispot-output-10505195375001503771.kers
Total runtime 537 ms.
[2026-06-01 03:37:39] [INFO ] Implicit Places using invariants in 4361 ms returned []
Implicit Place search using SMT only with invariants took 4363 ms to find 0 implicit places.
Running 26957 sub problems to find dead transitions.
[2026-06-01 03:37:39] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26957 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/27145 variables, and 9 constraints, problems are : Problem set: 0 solved, 26957 unsolved in 30744 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/187 constraints, PredecessorRefiner: 26957/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26957 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26957 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/27145 variables, and 9 constraints, problems are : Problem set: 0 solved, 26957 unsolved in 30804 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/187 constraints, PredecessorRefiner: 26792/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 146300ms problems are : Problem set: 0 solved, 26957 unsolved
Search for dead transitions found 0 dead transitions in 146487ms
Starting structural reductions in LTL mode, iteration 1 : 187/197 places, 26958/59251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154747 ms. Remains : 187/197 places, 26958/59251 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(!p0) U (p1 U (X(X(p2))||p3))))))'
Stuttering acceptance computed with spot in 513 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-00
Product exploration timeout after 14180 steps with 0 reset in 10003 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 6 ms.
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-00 finished in 165558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||G(p1)))||X(F(p2)))))'
Support contains 18 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 179 transition count 39569
Ensure Unique test removed 8 places
Iterating global reduction 0 with 26 rules applied. Total rules applied 44 place count 171 transition count 39569
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 169 transition count 17699
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 169 transition count 17699
Applied a total of 48 rules in 6172 ms. Remains 169 /197 variables (removed 28) and now considering 17699/59251 (removed 41552) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7160705953940533077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3012797597819505745.kers'
[2026-06-01 03:40:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7160705953940533077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3012797597819505745.kers]
Culled 0 columns in 70 ms.
// Phase 1: matrix 17699 rows 169 cols 245512 entries
Finished phase 1 with 152 SingleSign rule and 1 generalized
[2026-06-01 03:40:22] [INFO ] Computed 16 invariants in 256 ms
Computed 16 P flows in 259 ms.
Exported basis to /tmp/petrispot-output-3012797597819505745.kers
Total runtime 297 ms.
[2026-06-01 03:40:27] [INFO ] Implicit Places using invariants in 5345 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5367 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/197 places, 17699/59251 transitions.
Applied a total of 0 rules in 79 ms. Remains 168 /168 variables (removed 0) and now considering 17699/17699 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11620 ms. Remains : 168/197 places, 17699/59251 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||G(p1)))||X(F(p2)))))'
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-02
Product exploration timeout after 18920 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 3 ms.
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-02 finished in 21984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G((p0||X(G(p1))))))))))'
Support contains 19 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 179 transition count 39569
Ensure Unique test removed 8 places
Iterating global reduction 0 with 26 rules applied. Total rules applied 44 place count 171 transition count 39569
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 169 transition count 17699
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 169 transition count 17699
Applied a total of 48 rules in 5961 ms. Remains 169 /197 variables (removed 28) and now considering 17699/59251 (removed 41552) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16779029255359165708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12117219850511833647.kers'
[2026-06-01 03:40:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16779029255359165708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12117219850511833647.kers]
Culled 0 columns in 41 ms.
// Phase 1: matrix 17699 rows 169 cols 245512 entries
Finished phase 1 with 152 SingleSign rule and 1 generalized
[2026-06-01 03:40:44] [INFO ] Computed 16 invariants in 165 ms
Computed 16 P flows in 166 ms.
Exported basis to /tmp/petrispot-output-12117219850511833647.kers
Total runtime 198 ms.
[2026-06-01 03:40:47] [INFO ] Implicit Places using invariants in 3239 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3261 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/197 places, 17699/59251 transitions.
Applied a total of 0 rules in 66 ms. Remains 168 /168 variables (removed 0) and now considering 17699/17699 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9290 ms. Remains : 168/197 places, 17699/59251 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G((X(G(p0))||p1))))))))'
Stuttering acceptance computed with spot in 377 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-03
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-03 finished in 9759 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 11 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Graph (trivial) has 146 edges and 197 vertex of which 9 / 197 are part of one of the 4 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 191 transition count 59220
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 33 rules applied. Total rules applied 58 place count 167 transition count 59211
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 161 transition count 59211
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 64 place count 161 transition count 59197
Deduced a syphon composed of 14 places in 61 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 92 place count 147 transition count 59197
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 110 place count 129 transition count 39515
Ensure Unique test removed 9 places
Iterating global reduction 3 with 27 rules applied. Total rules applied 137 place count 120 transition count 39515
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 146 place count 111 transition count 1173
Iterating global reduction 3 with 9 rules applied. Total rules applied 155 place count 111 transition count 1173
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 237 place count 70 transition count 1132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 243 place count 70 transition count 1126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 246 place count 67 transition count 1119
Iterating global reduction 4 with 3 rules applied. Total rules applied 249 place count 67 transition count 1119
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 261 place count 61 transition count 1137
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 273 place count 61 transition count 1125
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 275 place count 59 transition count 1121
Iterating global reduction 5 with 2 rules applied. Total rules applied 277 place count 59 transition count 1121
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 287 place count 59 transition count 1111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 289 place count 58 transition count 1124
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 306 place count 58 transition count 1107
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 315 place count 58 transition count 1107
Applied a total of 315 rules in 14662 ms. Remains 58 /197 variables (removed 139) and now considering 1107/59251 (removed 58144) transitions.
[2026-06-01 03:41:02] [INFO ] Flow matrix only has 1088 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6900451012568519772.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4860480897612621003.kers'
[2026-06-01 03:41:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6900451012568519772.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4860480897612621003.kers]
Normalized transition count is 1087 out of 1088 initially.
Culled 0 columns in 3 ms.
// Phase 1: matrix 1087 rows 58 cols 22832 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-06-01 03:41:02] [INFO ] Computed 15 invariants in 13 ms
Computed 15 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-4860480897612621003.kers
Total runtime 17 ms.
[2026-06-01 03:41:03] [INFO ] Implicit Places using invariants in 365 ms returned []
[2026-06-01 03:41:03] [INFO ] Flow matrix only has 1088 transitions (discarded 19 similar events)
[2026-06-01 03:41:03] [INFO ] Invariant cache hit.
[2026-06-01 03:41:03] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-01 03:41:03] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2026-06-01 03:41:04] [INFO ] Redundant transitions in 115 ms returned []
Running 1099 sub problems to find dead transitions.
[2026-06-01 03:41:04] [INFO ] Flow matrix only has 1088 transitions (discarded 19 similar events)
[2026-06-01 03:41:04] [INFO ] Invariant cache hit.
[2026-06-01 03:41:04] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1145 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
SMT process timed out in 31539ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 31544ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/197 places, 1107/59251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47464 ms. Remains : 58/197 places, 1107/59251 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 43 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-04 finished in 47569 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(p1) U p2)&&p0) U p3)))'
Support contains 24 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 179 transition count 39569
Ensure Unique test removed 8 places
Iterating global reduction 0 with 26 rules applied. Total rules applied 44 place count 171 transition count 39569
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 170 transition count 26447
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 170 transition count 26447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 169 transition count 26445
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 169 transition count 26445
Applied a total of 48 rules in 5605 ms. Remains 169 /197 variables (removed 28) and now considering 26445/59251 (removed 32806) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9113984594213696746.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1757193975772004504.kers'
[2026-06-01 03:41:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9113984594213696746.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1757193975772004504.kers]
Culled 0 columns in 67 ms.
// Phase 1: matrix 26445 rows 169 cols 367980 entries
Finished phase 1 with 152 SingleSign rule and 1 generalized
[2026-06-01 03:41:41] [INFO ] Computed 16 invariants in 350 ms
Computed 16 P flows in 352 ms.
Exported basis to /tmp/petrispot-output-1757193975772004504.kers
Total runtime 401 ms.
[2026-06-01 03:41:45] [INFO ] Implicit Places using invariants in 3890 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3922 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/197 places, 26445/59251 transitions.
Applied a total of 0 rules in 103 ms. Remains 168 /168 variables (removed 0) and now considering 26445/26445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9632 ms. Remains : 168/197 places, 26445/59251 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(p1) U p2)&&p0) U p3)))'
Stuttering acceptance computed with spot in 182 ms :[(NOT p3), (NOT p3), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-05 finished in 9958 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 21 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Graph (trivial) has 145 edges and 197 vertex of which 9 / 197 are part of one of the 4 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 191 transition count 59220
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 33 rules applied. Total rules applied 58 place count 167 transition count 59211
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 161 transition count 59211
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 64 place count 161 transition count 59198
Deduced a syphon composed of 13 places in 58 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 90 place count 148 transition count 59198
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 99 place count 139 transition count 40027
Iterating global reduction 3 with 9 rules applied. Total rules applied 108 place count 139 transition count 40027
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 138 transition count 26905
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 138 transition count 26905
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 13 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 196 place count 95 transition count 26862
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 202 place count 95 transition count 26856
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 205 place count 92 transition count 26849
Iterating global reduction 4 with 3 rules applied. Total rules applied 208 place count 92 transition count 26849
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 13 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 220 place count 86 transition count 26867
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 232 place count 86 transition count 26855
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 234 place count 84 transition count 26851
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 84 transition count 26851
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 246 place count 84 transition count 26841
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 83 transition count 26854
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 254 place count 83 transition count 26854
Applied a total of 254 rules in 10349 ms. Remains 83 /197 variables (removed 114) and now considering 26854/59251 (removed 32397) transitions.
[2026-06-01 03:41:56] [INFO ] Flow matrix only has 26834 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-9184325194494899277.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6534412475907984530.kers'
[2026-06-01 03:41:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9184325194494899277.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6534412475907984530.kers]
Normalized transition count is 26833 out of 26834 initially.
Culled 0 columns in 120 ms.
// Phase 1: matrix 26833 rows 83 cols 588034 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-06-01 03:41:56] [INFO ] Computed 24 invariants in 479 ms
Computed 24 P flows in 480 ms.
Exported basis to /tmp/petrispot-output-6534412475907984530.kers
Total runtime 568 ms.
[2026-06-01 03:42:07] [INFO ] Implicit Places using invariants in 11492 ms returned []
Implicit Place search using SMT only with invariants took 11493 ms to find 0 implicit places.
Running 26842 sub problems to find dead transitions.
[2026-06-01 03:42:07] [INFO ] Flow matrix only has 26834 transitions (discarded 20 similar events)
[2026-06-01 03:42:07] [INFO ] Invariant cache hit.
[2026-06-01 03:42:07] [INFO ] State equation strengthened by 14 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82/26917 variables, and 9 constraints, problems are : Problem set: 0 solved, 26842 unsolved in 30827 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/83 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 26842/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26842 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26842 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 82/26917 variables, and 9 constraints, problems are : Problem set: 0 solved, 26842 unsolved in 30663 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/83 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 26812/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 144522ms problems are : Problem set: 0 solved, 26842 unsolved
Search for dead transitions found 0 dead transitions in 144643ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/197 places, 26854/59251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166562 ms. Remains : 83/197 places, 26854/59251 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 48 ms :[true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-06
Product exploration timeout after 13670 steps with 0 reset in 10007 ms.
Product exploration timeout after 14120 steps with 0 reset in 10006 ms.
Computed a total of 2 stabilizing places and 13 stable transitions
Computed a total of 2 stabilizing places and 13 stable transitions
Knowledge based reduction with 3 factoid took 91 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 46187 ms. (0 steps per ms) remains 1/1 properties
BEST_FIRST walk for 21011 steps (4 resets) in 20004 ms. (1 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 298030 steps, run timeout after 54001 ms. (steps per millisecond=5 ) properties seen :0 out of 1
Probabilistic random walk after 298030 steps, saw 56173 distinct states, run finished after 54005 ms. (steps per millisecond=5 ) properties seen :0
[2026-06-01 03:46:05] [INFO ] Flow matrix only has 26834 transitions (discarded 20 similar events)
[2026-06-01 03:46:05] [INFO ] Invariant cache hit.
[2026-06-01 03:46:05] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/61 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/74 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/83 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5211ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 26854/26854 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 83 transition count 26847
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 81 transition count 26847
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 20 place count 81 transition count 26836
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 31 place count 70 transition count 26836
Applied a total of 31 rules in 4379 ms. Remains 70 /83 variables (removed 13) and now considering 26836/26854 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4382 ms. Remains : 70/83 places, 26836/26854 transitions.
RANDOM walk for 40000 steps (8 resets) in 31781 ms. (1 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 16176 ms. (2 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 222381 steps, run timeout after 39002 ms. (steps per millisecond=5 ) properties seen :0 out of 1
Probabilistic random walk after 222381 steps, saw 37979 distinct states, run finished after 39002 ms. (steps per millisecond=5 ) properties seen :0
[2026-06-01 03:47:07] [INFO ] Flow matrix only has 26816 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-513700647043575613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7896465980898356276.kers'
[2026-06-01 03:47:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-513700647043575613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7896465980898356276.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 116 ms.
// Phase 1: matrix 26816 rows 69 cols 561687 entries
Finished phase 1 with 44 SingleSign rule and 2 generalized
[2026-06-01 03:47:08] [INFO ] Computed 24 invariants in 423 ms
Computed 24 P flows in 425 ms.
Exported basis to /tmp/petrispot-output-7896465980898356276.kers
Total runtime 544 ms.
[2026-06-01 03:47:08] [INFO ] State equation strengthened by 13151 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/44 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/70 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 26886/26886 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12690 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 70/70 constraints, ReadFeed: 0/13151 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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/38 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/44 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/70 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 26886/26886 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14245 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 70/70 constraints, ReadFeed: 0/13151 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27819ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 36 ms. (steps per millisecond=0 )
Parikh walk visited 1 properties in 68 ms.
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 3 factoid took 52 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 163074 ms.
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-06 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-06 finished in 349813 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||G(!p0)))))'
Support contains 16 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 179 transition count 39569
Ensure Unique test removed 8 places
Iterating global reduction 0 with 26 rules applied. Total rules applied 44 place count 171 transition count 39569
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 167 transition count 7979
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 167 transition count 7979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 166 transition count 7977
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 166 transition count 7977
Applied a total of 54 rules in 7889 ms. Remains 166 /197 variables (removed 31) and now considering 7977/59251 (removed 51274) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1339181956504732375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3985301418865685546.kers'
[2026-06-01 03:47:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1339181956504732375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3985301418865685546.kers]
Culled 0 columns in 17 ms.
// Phase 1: matrix 7977 rows 166 cols 109428 entries
Finished phase 1 with 149 SingleSign rule and 1 generalized
[2026-06-01 03:47:43] [INFO ] Computed 16 invariants in 63 ms
Computed 16 P flows in 64 ms.
Exported basis to /tmp/petrispot-output-3985301418865685546.kers
Total runtime 79 ms.
[2026-06-01 03:47:46] [INFO ] Implicit Places using invariants in 2691 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2706 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/197 places, 7977/59251 transitions.
Applied a total of 0 rules in 50 ms. Remains 165 /165 variables (removed 0) and now considering 7977/7977 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10646 ms. Remains : 165/197 places, 7977/59251 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||G(!p0)))))'
Stuttering acceptance computed with spot in 129 ms :[true, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 846 ms.
Product exploration explored 100000 steps with 50000 reset in 769 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 9 factoid took 12 ms. Proved property starting from automaton with 3 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 90 ms.
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-07 finished in 12574 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(p1)||p0))))'
Support contains 19 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Graph (trivial) has 138 edges and 197 vertex of which 9 / 197 are part of one of the 4 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 191 transition count 59220
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 33 rules applied. Total rules applied 58 place count 167 transition count 59211
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 161 transition count 59211
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 64 place count 161 transition count 59197
Deduced a syphon composed of 14 places in 61 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 92 place count 147 transition count 59197
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 110 place count 129 transition count 39515
Ensure Unique test removed 9 places
Iterating global reduction 3 with 27 rules applied. Total rules applied 137 place count 120 transition count 39515
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 118 transition count 17645
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 118 transition count 17645
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 6 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 219 place count 79 transition count 17606
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 225 place count 79 transition count 17600
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 76 transition count 17593
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 76 transition count 17593
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 243 place count 70 transition count 17611
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 255 place count 70 transition count 17599
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 257 place count 68 transition count 17595
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 68 transition count 17595
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 269 place count 68 transition count 17585
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 271 place count 67 transition count 17598
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 281 place count 67 transition count 17588
Partial Post-agglomeration rule applied 11 times.
Drop transitions (Partial Post agglomeration) removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 292 place count 67 transition count 17588
Applied a total of 292 rules in 11796 ms. Remains 67 /197 variables (removed 130) and now considering 17588/59251 (removed 41663) transitions.
[2026-06-01 03:47:59] [INFO ] Flow matrix only has 17569 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17717841281193468105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6550486284458945151.kers'
[2026-06-01 03:47:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17717841281193468105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6550486284458945151.kers]
Normalized transition count is 17568 out of 17569 initially.
Culled 0 columns in 63 ms.
// Phase 1: matrix 17568 rows 67 cols 385268 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-06-01 03:48:00] [INFO ] Computed 15 invariants in 203 ms
Computed 15 P flows in 204 ms.
Exported basis to /tmp/petrispot-output-6550486284458945151.kers
Total runtime 263 ms.
[2026-06-01 03:48:04] [INFO ] Implicit Places using invariants in 4901 ms returned []
Implicit Place search using SMT only with invariants took 4903 ms to find 0 implicit places.
Running 17580 sub problems to find dead transitions.
[2026-06-01 03:48:04] [INFO ] Flow matrix only has 17569 transitions (discarded 19 similar events)
[2026-06-01 03:48:04] [INFO ] Invariant cache hit.
[2026-06-01 03:48:05] [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 66/17636 variables, and 0 constraints, problems are : Problem set: 0 solved, 17580 unsolved in 30384 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/67 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 17580/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 66/17636 variables, and 0 constraints, problems are : Problem set: 0 solved, 17580 unsolved in 30388 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/67 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 17549/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 104555ms problems are : Problem set: 0 solved, 17580 unsolved
Search for dead transitions found 0 dead transitions in 104619ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/197 places, 17588/59251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121349 ms. Remains : 67/197 places, 17588/59251 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(p1)||p0))))'
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-08
Product exploration timeout after 18960 steps with 0 reset in 10003 ms.
Product exploration timeout after 17650 steps with 0 reset in 10001 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 9 factoid took 53 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 27110 ms. (1 steps per ms) remains 4/4 properties
BEST_FIRST walk for 39110 steps (8 resets) in 18237 ms. (2 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 13903 ms. (2 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 13527 ms. (2 steps per ms) remains 4/4 properties
BEST_FIRST walk for 37852 steps (8 resets) in 16448 ms. (2 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 496877 steps, run timeout after 78001 ms. (steps per millisecond=6 ) properties seen :0 out of 4
Probabilistic random walk after 496877 steps, saw 81792 distinct states, run finished after 78005 ms. (steps per millisecond=6 ) properties seen :0
[2026-06-01 03:51:54] [INFO ] Flow matrix only has 17569 transitions (discarded 19 similar events)
[2026-06-01 03:51:54] [INFO ] Invariant cache hit.
[2026-06-01 03:51:54] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 35/54 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/67 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 5210ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 17588/17588 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 67 transition count 17582
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 65 transition count 17582
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 17 place count 65 transition count 17573
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 26 place count 56 transition count 17573
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 46 place count 56 transition count 17553
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 56 transition count 17559
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 50 place count 55 transition count 17557
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 63 place count 55 transition count 17544
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 54 transition count 17543
Applied a total of 64 rules in 164088 ms. Remains 54 /67 variables (removed 13) and now considering 17543/17588 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164089 ms. Remains : 54/67 places, 17543/17588 transitions.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 59 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 274163 ms.
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-08 finished in 415681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 11 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 179 transition count 39569
Ensure Unique test removed 8 places
Iterating global reduction 0 with 26 rules applied. Total rules applied 44 place count 171 transition count 39569
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 162 transition count 1227
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 162 transition count 1227
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 160 transition count 1223
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 160 transition count 1223
Applied a total of 66 rules in 11703 ms. Remains 160 /197 variables (removed 37) and now considering 1223/59251 (removed 58028) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18162715275128192842.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5418845259015729875.kers'
[2026-06-01 03:54:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18162715275128192842.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5418845259015729875.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1223 rows 160 cols 14896 entries
Finished phase 1 with 143 SingleSign rule and 1 generalized
[2026-06-01 03:54:55] [INFO ] Computed 16 invariants in 11 ms
Computed 16 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-5418845259015729875.kers
Total runtime 16 ms.
[2026-06-01 03:54:55] [INFO ] Implicit Places using invariants in 426 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 430 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/197 places, 1223/59251 transitions.
Applied a total of 0 rules in 9 ms. Remains 159 /159 variables (removed 0) and now considering 1223/1223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12143 ms. Remains : 159/197 places, 1223/59251 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 4538 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-09 finished in 16950 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 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Graph (trivial) has 157 edges and 197 vertex of which 11 / 197 are part of one of the 5 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 190 transition count 59218
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 34 rules applied. Total rules applied 60 place count 165 transition count 59209
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 66 place count 159 transition count 59209
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 66 place count 159 transition count 59197
Deduced a syphon composed of 12 places in 58 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 90 place count 147 transition count 59197
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 99 place count 138 transition count 40026
Iterating global reduction 3 with 9 rules applied. Total rules applied 108 place count 138 transition count 40026
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 117 place count 129 transition count 1684
Iterating global reduction 3 with 9 rules applied. Total rules applied 126 place count 129 transition count 1684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 126 transition count 1678
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 126 transition count 1678
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 220 place count 82 transition count 1634
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 226 place count 82 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 229 place count 79 transition count 1621
Iterating global reduction 4 with 3 rules applied. Total rules applied 232 place count 79 transition count 1621
Performed 9 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 250 place count 70 transition count 1639
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 262 place count 70 transition count 1627
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 264 place count 68 transition count 1623
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 68 transition count 1623
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 276 place count 68 transition count 1613
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 278 place count 67 transition count 1626
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 292 place count 67 transition count 1612
Applied a total of 292 rules in 13551 ms. Remains 67 /197 variables (removed 130) and now considering 1612/59251 (removed 57639) transitions.
[2026-06-01 03:55:14] [INFO ] Flow matrix only has 1592 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-14070336450069810594.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7832750614255068103.kers'
[2026-06-01 03:55:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14070336450069810594.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7832750614255068103.kers]
Normalized transition count is 1591 out of 1592 initially.
Culled 0 columns in 5 ms.
// Phase 1: matrix 1591 rows 67 cols 33048 entries
Finished phase 1 with 41 SingleSign rule and 2 generalized
[2026-06-01 03:55:14] [INFO ] Computed 24 invariants in 20 ms
Computed 24 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-7832750614255068103.kers
Total runtime 25 ms.
[2026-06-01 03:55:14] [INFO ] Implicit Places using invariants in 745 ms returned []
[2026-06-01 03:55:14] [INFO ] Flow matrix only has 1592 transitions (discarded 20 similar events)
[2026-06-01 03:55:14] [INFO ] Invariant cache hit.
[2026-06-01 03:55:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-06-01 03:55:16] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 2674 ms to find 0 implicit places.
[2026-06-01 03:55:17] [INFO ] Redundant transitions in 192 ms returned []
Running 1604 sub problems to find dead transitions.
[2026-06-01 03:55:17] [INFO ] Flow matrix only has 1592 transitions (discarded 20 similar events)
[2026-06-01 03:55:17] [INFO ] Invariant cache hit.
[2026-06-01 03:55:17] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 67/1659 variables, and 24 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/67 constraints, ReadFeed: 0/25 constraints, PredecessorRefiner: 1604/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 67/1659 variables, and 24 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/67 constraints, ReadFeed: 0/25 constraints, PredecessorRefiner: 1585/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62276ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 62283ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/197 places, 1612/59251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78714 ms. Remains : 67/197 places, 1612/59251 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 52 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 248 ms.
Product exploration explored 100000 steps with 0 reset in 275 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 69 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 (764 resets) in 2410 ms. (16 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (107 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 262954 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 262954 steps, saw 54029 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2026-06-01 03:56:23] [INFO ] Flow matrix only has 1592 transitions (discarded 20 similar events)
[2026-06-01 03:56:23] [INFO ] Invariant cache hit.
[2026-06-01 03:56:23] [INFO ] State equation strengthened by 25 read => feed constraints.
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) 14/24 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/42 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/67 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1591/1658 variables, 67/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1658 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1658 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1659 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1659 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1659 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1659/1659 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 25/25 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) 14/24 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/42 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/67 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1591/1658 variables, 67/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1658 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1658 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1659 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1659 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1659 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1659/1659 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1103 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2137ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 28 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 5 ms.
Knowledge based reduction with 3 factoid took 84 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 50 ms :[(NOT p0)]
Knowledge-based reduction took 6146 ms.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 10 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 1612/1612 transitions.
Applied a total of 0 rules in 405 ms. Remains 67 /67 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2026-06-01 03:56:26] [INFO ] Flow matrix only has 1592 transitions (discarded 20 similar events)
[2026-06-01 03:56:26] [INFO ] Invariant cache hit.
[2026-06-01 03:56:27] [INFO ] Implicit Places using invariants in 1126 ms returned []
[2026-06-01 03:56:27] [INFO ] Flow matrix only has 1592 transitions (discarded 20 similar events)
[2026-06-01 03:56:27] [INFO ] Invariant cache hit.
[2026-06-01 03:56:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-06-01 03:56:30] [INFO ] Implicit Places using invariants and state equation in 2549 ms returned []
Implicit Place search using SMT with State Equation took 3677 ms to find 0 implicit places.
[2026-06-01 03:56:30] [INFO ] Redundant transitions in 177 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4268 ms. Remains : 67/67 places, 1612/1612 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (791 resets) in 2519 ms. (15 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (105 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 252454 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 252454 steps, saw 52362 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2026-06-01 03:56:34] [INFO ] Flow matrix only has 1592 transitions (discarded 20 similar events)
[2026-06-01 03:56:34] [INFO ] Invariant cache hit.
[2026-06-01 03:56:34] [INFO ] State equation strengthened by 25 read => feed constraints.
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) 14/24 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/42 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/67 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1591/1658 variables, 67/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1658 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1658 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1659 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1659 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1659 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1659/1659 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 25/25 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) 14/24 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/42 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/67 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1591/1658 variables, 67/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1658 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1658 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1659 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1659 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1659 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1659/1659 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2224ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 28 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 2 ms.
Knowledge based reduction with 3 factoid took 73 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 46 ms :[(NOT p0)]
Knowledge-based reduction took 6233 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 124 ms.
Product exploration explored 100000 steps with 0 reset in 138 ms.
Built C files in :
/tmp/ltsmin17234247557565330343
[2026-06-01 03:56:37] [INFO ] Too many transitions (1612) to apply POR reductions. Disabling POR matrices.
[2026-06-01 03:56:37] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17234247557565330343
Running compilation step : cd /tmp/ltsmin17234247557565330343;'/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/ltsmin17234247557565330343;'/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/ltsmin17234247557565330343;'/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 10 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 1612/1612 transitions.
Applied a total of 0 rules in 407 ms. Remains 67 /67 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2026-06-01 03:56:40] [INFO ] Flow matrix only has 1592 transitions (discarded 20 similar events)
[2026-06-01 03:56:40] [INFO ] Invariant cache hit.
[2026-06-01 03:56:41] [INFO ] Implicit Places using invariants in 750 ms returned []
[2026-06-01 03:56:41] [INFO ] Flow matrix only has 1592 transitions (discarded 20 similar events)
[2026-06-01 03:56:41] [INFO ] Invariant cache hit.
[2026-06-01 03:56:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-06-01 03:56:43] [INFO ] Implicit Places using invariants and state equation in 2450 ms returned []
Implicit Place search using SMT with State Equation took 3204 ms to find 0 implicit places.
[2026-06-01 03:56:44] [INFO ] Redundant transitions in 232 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3856 ms. Remains : 67/67 places, 1612/1612 transitions.
Built C files in :
/tmp/ltsmin8457178761636820391
[2026-06-01 03:56:44] [INFO ] Too many transitions (1612) to apply POR reductions. Disabling POR matrices.
[2026-06-01 03:56:44] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8457178761636820391
Running compilation step : cd /tmp/ltsmin8457178761636820391;'/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/ltsmin8457178761636820391;'/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/ltsmin8457178761636820391;'/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-06-01 03:56:53] [INFO ] Flatten gal took : 230 ms
[2026-06-01 03:56:53] [INFO ] Flatten gal took : 231 ms
[2026-06-01 03:56:53] [INFO ] Time to serialize gal into /tmp/LTL17174672323528866270.gal : 93 ms
[2026-06-01 03:56:53] [INFO ] Time to serialize properties into /tmp/LTL17507035051408890888.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/LTL17174672323528866270.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11965740553621654859.hoa' '-atoms' '/tmp/LTL17507035051408890888.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...320
Loading property file /tmp/LTL17507035051408890888.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11965740553621654859.hoa
Detected timeout of ITS tools.
[2026-06-01 03:57:14] [INFO ] Flatten gal took : 225 ms
[2026-06-01 03:57:14] [INFO ] Flatten gal took : 253 ms
[2026-06-01 03:57:14] [INFO ] Time to serialize gal into /tmp/LTL6392662638636477363.gal : 35 ms
[2026-06-01 03:57:14] [INFO ] Time to serialize properties into /tmp/LTL1895356739720324932.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/LTL6392662638636477363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1895356739720324932.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...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((p15!=1)||(p38!=1))||((p53!=1)||(p83!=1)))||(((p102!=1)||(p114!=1))||((p140!=1)||(p152!=1))))||((p167!=1)||(p225!=1)))")))...156
Formula 0 simplified : GF!"(((((p15!=1)||(p38!=1))||((p53!=1)||(p83!=1)))||(((p102!=1)||(p114!=1))||((p140!=1)||(p152!=1))))||((p167!=1)||(p225!=1)))"
Detected timeout of ITS tools.
[2026-06-01 03:57:29] [INFO ] Flatten gal took : 363 ms
[2026-06-01 03:57:29] [INFO ] Applying decomposition
[2026-06-01 03:57:30] [INFO ] Flatten gal took : 295 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/graph1720293953319477415.txt' '-o' '/tmp/graph1720293953319477415.bin' '-w' '/tmp/graph1720293953319477415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1720293953319477415.bin' '-l' '-1' '-v' '-w' '/tmp/graph1720293953319477415.weights' '-q' '0' '-e' '0.001'
[2026-06-01 03:57:31] [INFO ] Decomposing Gal with order
[2026-06-01 03:57:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-01 03:57:32] [INFO ] Removed a total of 15418 redundant transitions.
[2026-06-01 03:57:32] [INFO ] Flatten gal took : 869 ms
[2026-06-01 03:57:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 341 ms.
[2026-06-01 03:57:32] [INFO ] Time to serialize gal into /tmp/LTL16679144792095104392.gal : 29 ms
[2026-06-01 03:57:32] [INFO ] Time to serialize properties into /tmp/LTL502474551831929830.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/LTL16679144792095104392.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL502474551831929830.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 : !((F(G("(((((i0.u0.p15!=1)||(i2.u2.p38!=1))||((i2.u3.p53!=1)||(i0.u16.p83!=1)))||(((i2.u7.p102!=1)||(i2.u9.p114!=1))||((u11.p140!=1)||...218
Formula 0 simplified : GF!"(((((i0.u0.p15!=1)||(i2.u2.p38!=1))||((i2.u3.p53!=1)||(i0.u16.p83!=1)))||(((i2.u7.p102!=1)||(i2.u9.p114!=1))||((u11.p140!=1)||(i...212
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-11 finished in 167244 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(G(p0))&&(G(F((G(F(p1))||(!p2&&F(p1)))))||(F(!p3)&&X(F((G(F(p1))||(!p2&&F(p1))))))))))'
Support contains 30 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 188 transition count 40080
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 188 transition count 40080
Applied a total of 18 rules in 2436 ms. Remains 188 /197 variables (removed 9) and now considering 40080/59251 (removed 19171) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14676468280754675627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16150383352541075153.kers'
[2026-06-01 03:57:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14676468280754675627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16150383352541075153.kers]
Culled 0 columns in 158 ms.
// Phase 1: matrix 40080 rows 188 cols 876848 entries
Finished phase 1 with 162 SingleSign rule and 2 generalized
[2026-06-01 03:57:51] [INFO ] Computed 24 invariants in 831 ms
Computed 24 P flows in 832 ms.
Exported basis to /tmp/petrispot-output-16150383352541075153.kers
Total runtime 1010 ms.
[2026-06-01 03:58:01] [INFO ] Implicit Places using invariants in 11014 ms returned []
Implicit Place search using SMT only with invariants took 11015 ms to find 0 implicit places.
Running 40079 sub problems to find dead transitions.
[2026-06-01 03:58:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40079 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 187/40268 variables, and 9 constraints, problems are : Problem set: 0 solved, 40079 unsolved in 31218 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/188 constraints, PredecessorRefiner: 40079/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40079 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40079 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 187/40268 variables, and 9 constraints, problems are : Problem set: 0 solved, 40079 unsolved in 30738 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/188 constraints, PredecessorRefiner: 39914/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 238905ms problems are : Problem set: 0 solved, 40079 unsolved
Search for dead transitions found 0 dead transitions in 239071ms
Starting structural reductions in LTL mode, iteration 1 : 188/197 places, 40080/59251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252600 ms. Remains : 188/197 places, 40080/59251 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(G(p0))&&(G(F((G(F(p1))||(p2&&F(p1)))))||(F(p3)&&X(F((G(F(p1))||(p2&&F(p1))))))))))'
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-12
Product exploration timeout after 8630 steps with 0 reset in 10006 ms.
Stack based approach found an accepted trace after 61 steps with 0 reset with depth 62 and stack size 62 in 9 ms.
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-12 finished in 263275 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 11 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Graph (trivial) has 146 edges and 197 vertex of which 9 / 197 are part of one of the 4 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 191 transition count 59220
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 33 rules applied. Total rules applied 58 place count 167 transition count 59211
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 161 transition count 59211
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 64 place count 161 transition count 59197
Deduced a syphon composed of 14 places in 62 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 92 place count 147 transition count 59197
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 110 place count 129 transition count 39515
Ensure Unique test removed 9 places
Iterating global reduction 3 with 27 rules applied. Total rules applied 137 place count 120 transition count 39515
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 146 place count 111 transition count 1173
Iterating global reduction 3 with 9 rules applied. Total rules applied 155 place count 111 transition count 1173
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 109 transition count 1169
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 109 transition count 1169
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 237 place count 70 transition count 1130
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 243 place count 70 transition count 1124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 246 place count 67 transition count 1117
Iterating global reduction 4 with 3 rules applied. Total rules applied 249 place count 67 transition count 1117
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 265 place count 59 transition count 1135
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 277 place count 59 transition count 1123
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 279 place count 57 transition count 1119
Iterating global reduction 5 with 2 rules applied. Total rules applied 281 place count 57 transition count 1119
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 291 place count 57 transition count 1109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 293 place count 56 transition count 1122
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 308 place count 56 transition count 1107
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 315 place count 56 transition count 1107
Applied a total of 315 rules in 15544 ms. Remains 56 /197 variables (removed 141) and now considering 1107/59251 (removed 58144) transitions.
[2026-06-01 04:02:26] [INFO ] Flow matrix only has 1088 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14535818027002026787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1295885179551467483.kers'
[2026-06-01 04:02:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14535818027002026787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1295885179551467483.kers]
Normalized transition count is 1087 out of 1088 initially.
Culled 0 columns in 3 ms.
// Phase 1: matrix 1087 rows 56 cols 22838 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-06-01 04:02:26] [INFO ] Computed 15 invariants in 12 ms
Computed 15 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-1295885179551467483.kers
Total runtime 16 ms.
[2026-06-01 04:02:27] [INFO ] Implicit Places using invariants in 440 ms returned []
[2026-06-01 04:02:27] [INFO ] Flow matrix only has 1088 transitions (discarded 19 similar events)
[2026-06-01 04:02:27] [INFO ] Invariant cache hit.
[2026-06-01 04:02:27] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-01 04:02:28] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
[2026-06-01 04:02:28] [INFO ] Redundant transitions in 397 ms returned []
Running 1099 sub problems to find dead transitions.
[2026-06-01 04:02:28] [INFO ] Flow matrix only has 1088 transitions (discarded 19 similar events)
[2026-06-01 04:02:28] [INFO ] Invariant cache hit.
[2026-06-01 04:02:28] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1143 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
SMT process timed out in 31510ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 31518ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/197 places, 1107/59251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49051 ms. Remains : 56/197 places, 1107/59251 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 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-13
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-13 finished in 49205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X((F(G(p2))||p1))))||p0))))'
Support contains 28 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 188 transition count 40080
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 188 transition count 40080
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 187 transition count 26958
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 187 transition count 26958
Applied a total of 20 rules in 3952 ms. Remains 187 /197 variables (removed 10) and now considering 26958/59251 (removed 32293) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2916764293174168380.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2804619710728169825.kers'
[2026-06-01 04:03:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2916764293174168380.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2804619710728169825.kers]
Culled 0 columns in 172 ms.
// Phase 1: matrix 26958 rows 187 cols 588164 entries
Finished phase 1 with 161 SingleSign rule and 2 generalized
[2026-06-01 04:03:05] [INFO ] Computed 24 invariants in 702 ms
Computed 24 P flows in 702 ms.
Exported basis to /tmp/petrispot-output-2804619710728169825.kers
Total runtime 793 ms.
[2026-06-01 04:03:11] [INFO ] Implicit Places using invariants in 7573 ms returned []
Implicit Place search using SMT only with invariants took 7584 ms to find 0 implicit places.
Running 26957 sub problems to find dead transitions.
[2026-06-01 04:03:12] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26957 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/27145 variables, and 9 constraints, problems are : Problem set: 0 solved, 26957 unsolved in 30800 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/187 constraints, PredecessorRefiner: 26957/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26957 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26957 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/27145 variables, and 9 constraints, problems are : Problem set: 0 solved, 26957 unsolved in 30657 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/187 constraints, PredecessorRefiner: 26792/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 150714ms problems are : Problem set: 0 solved, 26957 unsolved
Search for dead transitions found 0 dead transitions in 150855ms
Starting structural reductions in LTL mode, iteration 1 : 187/197 places, 26958/59251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162445 ms. Remains : 187/197 places, 26958/59251 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X((F(G(p2))||p1))))||p0))))'
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-14
Product exploration timeout after 12330 steps with 0 reset in 10004 ms.
Product exploration timeout after 12470 steps with 0 reset in 10001 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 3 factoid took 63 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 45543 ms. (0 steps per ms) remains 3/3 properties
BEST_FIRST walk for 38395 steps (8 resets) in 19418 ms. (1 steps per ms) remains 3/3 properties
BEST_FIRST walk for 30205 steps (6 resets) in 19431 ms. (1 steps per ms) remains 3/3 properties
BEST_FIRST walk for 35262 steps (8 resets) in 19390 ms. (1 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 640738 steps, run timeout after 90001 ms. (steps per millisecond=7 ) properties seen :0 out of 3
Probabilistic random walk after 640738 steps, saw 96499 distinct states, run finished after 90002 ms. (steps per millisecond=7 ) properties seen :0
[2026-06-01 04:08:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/76 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 61/137 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 50/187 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5201ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 26958/26958 transitions.
Graph (trivial) has 138 edges and 187 vertex of which 9 / 187 are part of one of the 4 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 182 transition count 26921
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 64 place count 155 transition count 26912
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 70 place count 149 transition count 26912
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 70 place count 149 transition count 26898
Deduced a syphon composed of 14 places in 24 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 98 place count 135 transition count 26898
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 11 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 170 place count 99 transition count 26862
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 176 place count 99 transition count 26856
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 179 place count 96 transition count 26849
Iterating global reduction 4 with 3 rules applied. Total rules applied 182 place count 96 transition count 26849
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 9 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 194 place count 90 transition count 26867
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 206 place count 90 transition count 26855
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 208 place count 88 transition count 26851
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 88 transition count 26851
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 220 place count 88 transition count 26841
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 222 place count 87 transition count 26854
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 223 place count 87 transition count 26853
Free-agglomeration rule applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 233 place count 87 transition count 26843
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 243 place count 77 transition count 26843
Partial Post-agglomeration rule applied 12 times.
Drop transitions (Partial Post agglomeration) removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 255 place count 77 transition count 26843
Applied a total of 255 rules in 8105 ms. Remains 77 /187 variables (removed 110) and now considering 26843/26958 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8105 ms. Remains : 77/187 places, 26843/26958 transitions.
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Knowledge-based reduction took 134831 ms.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 28 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 26958/26958 transitions.
Applied a total of 0 rules in 189 ms. Remains 187 /187 variables (removed 0) and now considering 26958/26958 (removed 0) transitions.
[2026-06-01 04:08:18] [INFO ] Invariant cache hit.
[2026-06-01 04:08:26] [INFO ] Implicit Places using invariants in 8018 ms returned []
Implicit Place search using SMT only with invariants took 8020 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 8211 ms. Remains : 187/187 places, 26958/26958 transitions.
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 3 factoid took 54 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 40645 ms. (0 steps per ms) remains 3/3 properties
BEST_FIRST walk for 32724 steps (7 resets) in 19611 ms. (1 steps per ms) remains 3/3 properties
BEST_FIRST walk for 32483 steps (7 resets) in 20004 ms. (1 steps per ms) remains 3/3 properties
BEST_FIRST walk for 32871 steps (7 resets) in 19697 ms. (1 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 590353 steps, run timeout after 81001 ms. (steps per millisecond=7 ) properties seen :0 out of 3
Probabilistic random walk after 590353 steps, saw 91030 distinct states, run finished after 81002 ms. (steps per millisecond=7 ) properties seen :0
[2026-06-01 04:10:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/76 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 61/137 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 50/187 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5213ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 26958/26958 transitions.
Graph (trivial) has 138 edges and 187 vertex of which 9 / 187 are part of one of the 4 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 182 transition count 26921
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 64 place count 155 transition count 26912
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 70 place count 149 transition count 26912
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 70 place count 149 transition count 26898
Deduced a syphon composed of 14 places in 34 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 98 place count 135 transition count 26898
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 11 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 170 place count 99 transition count 26862
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 176 place count 99 transition count 26856
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 179 place count 96 transition count 26849
Iterating global reduction 4 with 3 rules applied. Total rules applied 182 place count 96 transition count 26849
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 10 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 194 place count 90 transition count 26867
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 206 place count 90 transition count 26855
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 208 place count 88 transition count 26851
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 88 transition count 26851
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 220 place count 88 transition count 26841
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 222 place count 87 transition count 26854
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 223 place count 87 transition count 26853
Free-agglomeration rule applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 233 place count 87 transition count 26843
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 243 place count 77 transition count 26843
Partial Post-agglomeration rule applied 12 times.
Drop transitions (Partial Post agglomeration) removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 255 place count 77 transition count 26843
Applied a total of 255 rules in 7689 ms. Remains 77 /187 variables (removed 110) and now considering 26843/26958 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7690 ms. Remains : 77/187 places, 26843/26958 transitions.
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Knowledge-based reduction took 122090 ms.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration timeout after 10440 steps with 0 reset in 10001 ms.
Product exploration timeout after 9570 steps with 0 reset in 10004 ms.
Spot run failed in 125 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin5833989108464220852
[2026-06-01 04:10:50] [INFO ] Built C files in 795ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5833989108464220852
Running compilation step : cd /tmp/ltsmin5833989108464220852;'/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/ltsmin5833989108464220852;'/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/ltsmin5833989108464220852;'/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 28 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 26958/26958 transitions.
Applied a total of 0 rules in 162 ms. Remains 187 /187 variables (removed 0) and now considering 26958/26958 (removed 0) transitions.
[2026-06-01 04:10:53] [INFO ] Invariant cache hit.
[2026-06-01 04:10:59] [INFO ] Implicit Places using invariants in 6405 ms returned []
Implicit Place search using SMT only with invariants took 6418 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 6582 ms. Remains : 187/187 places, 26958/26958 transitions.
Built C files in :
/tmp/ltsmin380718741450126516
[2026-06-01 04:11:00] [INFO ] Built C files in 559ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin380718741450126516
Running compilation step : cd /tmp/ltsmin380718741450126516;'/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/ltsmin380718741450126516;'/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/ltsmin380718741450126516;'/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-06-01 04:11:16] [INFO ] Flatten gal took : 6179 ms
[2026-06-01 04:11:20] [INFO ] Flatten gal took : 4322 ms
[2026-06-01 04:11:21] [INFO ] Time to serialize gal into /tmp/LTL6911849849838949845.gal : 682 ms
[2026-06-01 04:11:21] [INFO ] Time to serialize properties into /tmp/LTL11096462878155475099.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/LTL6911849849838949845.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6891788968300715803.hoa' '-atoms' '/tmp/LTL11096462878155475099.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
Detected timeout of ITS tools.
[2026-06-01 04:11:45] [INFO ] Flatten gal took : 4260 ms
[2026-06-01 04:11:49] [INFO ] Flatten gal took : 4122 ms
[2026-06-01 04:11:50] [INFO ] Time to serialize gal into /tmp/LTL5616878446415575932.gal : 612 ms
[2026-06-01 04:11:50] [INFO ] Time to serialize properties into /tmp/LTL17703930021717482574.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5616878446415575932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17703930021717482574.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2026-06-01 04:12:10] [INFO ] Flatten gal took : 4488 ms
[2026-06-01 04:12:10] [INFO ] Applying decomposition
[2026-06-01 04:12:14] [INFO ] Flatten gal took : 4019 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/graph11540611660069762572.txt' '-o' '/tmp/graph11540611660069762572.bin' '-w' '/tmp/graph11540611660069762572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11540611660069762572.bin' '-l' '-1' '-v' '-w' '/tmp/graph11540611660069762572.weights' '-q' '0' '-e' '0.001'
[2026-06-01 04:12:25] [INFO ] Decomposing Gal with order
[2026-06-01 04:12:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-01 04:12:34] [INFO ] Removed a total of 293879 redundant transitions.
[2026-06-01 04:12:35] [INFO ] Flatten gal took : 6450 ms
[2026-06-01 04:12:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 4929 ms.
[2026-06-01 04:12:40] [INFO ] Time to serialize gal into /tmp/LTL16499067969877896768.gal : 30 ms
[2026-06-01 04:12:40] [INFO ] Time to serialize properties into /tmp/LTL8834698059424136656.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/LTL16499067969877896768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8834698059424136656.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((((i3.u8.p27==0)||(i3.u10.p35==0))||((i1.u13.p54==0)||(i3.u17.p77==0)))||(((i1.u19.p103==0)||(i1.u22.p115==0))||((i3.u25.p14...689
Formula 0 simplified : XF(!"((((i3.u8.p27==0)||(i3.u10.p35==0))||((i1.u13.p54==0)||(i3.u17.p77==0)))||(((i1.u19.p103==0)||(i1.u22.p115==0))||((i3.u25.p141=...667
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-14 finished in 595571 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 11 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 59251/59251 transitions.
Graph (trivial) has 146 edges and 197 vertex of which 9 / 197 are part of one of the 4 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 191 transition count 59220
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 33 rules applied. Total rules applied 58 place count 167 transition count 59211
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 161 transition count 59211
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 64 place count 161 transition count 59197
Deduced a syphon composed of 14 places in 58 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 92 place count 147 transition count 59197
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 110 place count 129 transition count 39515
Ensure Unique test removed 9 places
Iterating global reduction 3 with 27 rules applied. Total rules applied 137 place count 120 transition count 39515
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 146 place count 111 transition count 1173
Iterating global reduction 3 with 9 rules applied. Total rules applied 155 place count 111 transition count 1173
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 160 place count 106 transition count 1163
Iterating global reduction 3 with 5 rules applied. Total rules applied 165 place count 106 transition count 1163
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 237 place count 70 transition count 1127
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 243 place count 70 transition count 1121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 246 place count 67 transition count 1114
Iterating global reduction 4 with 3 rules applied. Total rules applied 249 place count 67 transition count 1114
Performed 11 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 271 place count 56 transition count 1132
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 283 place count 56 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 285 place count 54 transition count 1116
Iterating global reduction 5 with 2 rules applied. Total rules applied 287 place count 54 transition count 1116
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 297 place count 54 transition count 1106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 299 place count 53 transition count 1119
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 311 place count 53 transition count 1107
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 315 place count 53 transition count 1107
Applied a total of 315 rules in 13572 ms. Remains 53 /197 variables (removed 144) and now considering 1107/59251 (removed 58144) transitions.
[2026-06-01 04:13:09] [INFO ] Flow matrix only has 1088 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9453160523838370065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13884932002600608145.kers'
[2026-06-01 04:13:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9453160523838370065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13884932002600608145.kers]
Normalized transition count is 1087 out of 1088 initially.
Culled 0 columns in 3 ms.
// Phase 1: matrix 1087 rows 53 cols 22858 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-06-01 04:13:09] [INFO ] Computed 15 invariants in 12 ms
Computed 15 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-13884932002600608145.kers
Total runtime 20 ms.
[2026-06-01 04:13:10] [INFO ] Implicit Places using invariants in 570 ms returned []
[2026-06-01 04:13:10] [INFO ] Flow matrix only has 1088 transitions (discarded 19 similar events)
[2026-06-01 04:13:10] [INFO ] Invariant cache hit.
[2026-06-01 04:13:10] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-01 04:13:11] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
[2026-06-01 04:13:11] [INFO ] Redundant transitions in 198 ms returned []
Running 1099 sub problems to find dead transitions.
[2026-06-01 04:13:11] [INFO ] Flow matrix only has 1088 transitions (discarded 19 similar events)
[2026-06-01 04:13:11] [INFO ] Invariant cache hit.
[2026-06-01 04:13:11] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1140 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1140 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1140/1141 variables, and 78 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 53/53 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 1099/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1140 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1140 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1140 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1140/1141 variables, and 102 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 53/53 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 1099/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62159ms problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 62186ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/197 places, 1107/59251 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77556 ms. Remains : 53/197 places, 1107/59251 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 56 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP09C09-LTLFireability-15
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 4 ms.
FORMULA ErlangenMainframeV1-PT-bP09C09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP09C09-LTLFireability-15 finished in 77687 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)))'
Spot run failed in 88 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.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X((F(G(p2))||p1))))||p0))))'
Spot run failed in 76 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-06-01 04:14:22] [INFO ] Flatten gal took : 7997 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16676934081910803522
[2026-06-01 04:14:29] [INFO ] Too many transitions (59251) to apply POR reductions. Disabling POR matrices.
[2026-06-01 04:14:31] [INFO ] Built C files in 1948ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16676934081910803522
Running compilation step : cd /tmp/ltsmin16676934081910803522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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-06-01 04:14:39] [INFO ] Applying decomposition
[2026-06-01 04:14:47] [INFO ] Flatten gal took : 8604 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/graph8107688113607794244.txt' '-o' '/tmp/graph8107688113607794244.bin' '-w' '/tmp/graph8107688113607794244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8107688113607794244.bin' '-l' '-1' '-v' '-w' '/tmp/graph8107688113607794244.weights' '-q' '0' '-e' '0.001'
[2026-06-01 04:15:12] [INFO ] Decomposing Gal with order
[2026-06-01 04:15:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-01 04:15:39] [INFO ] Removed a total of 504108 redundant transitions.
[2026-06-01 04:15:41] [INFO ] Flatten gal took : 21816 ms
[2026-06-01 04:15:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 10652 ms.
[2026-06-01 04:15:54] [INFO ] Time to serialize gal into /tmp/LTLFireability1989299931518887637.gal : 366 ms
[2026-06-01 04:15:54] [INFO ] Time to serialize properties into /tmp/LTLFireability5351239401116630271.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1989299931518887637.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5351239401116630271.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F(G("(((((i1.u7.p15!=1)||(i3.u10.p38!=1))||((i0.u13.p53!=1)||(i3.u39.p83!=1)))||(((i3.u39.p102!=1)||(u22.p114!=1))||((i9.u26.p140!=...219
Formula 0 simplified : GF!"(((((i1.u7.p15!=1)||(i3.u10.p38!=1))||((i0.u13.p53!=1)||(i3.u39.p83!=1)))||(((i3.u39.p102!=1)||(u22.p114!=1))||((i9.u26.p140!=1)...213
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/ltsmin16676934081910803522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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 360 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16676934081910803522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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 360 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)

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="ErlangenMainframeV1-PT-bP09C09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV1-PT-bP09C09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499100116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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