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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 7.7K May 27 09:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 27 09:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 27 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 27 09:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 27 10:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 09:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 27 09:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 27 09:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 27 09:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:43 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 21M 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 ErlangenMainframeV2-PT-bP08C08-LTLFireability-00
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-01
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-02
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-03
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-04
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-05
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-06
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-07
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-08
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-09
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-10
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-11
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-12
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-13
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-14
FORMULA_NAME ErlangenMainframeV2-PT-bP08C08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780391859032

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP08C08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-02 09:17:41] [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-02 09:17:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 09:17:42] [INFO ] Load time of PNML (sax parser for PT used): 1631 ms
[2026-06-02 09:17:42] [INFO ] Transformed 319 places.
[2026-06-02 09:17:43] [INFO ] Transformed 20023 transitions.
[2026-06-02 09:17:43] [INFO ] Found NUPN structural information;
[2026-06-02 09:17:43] [INFO ] Parsed PT model containing 319 places and 20023 transitions and 420806 arcs in 2035 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 20023/20023 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 246 transition count 19950
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 246 transition count 19950
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 191 place count 201 transition count 19905
Iterating global reduction 0 with 45 rules applied. Total rules applied 236 place count 201 transition count 19905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 239 place count 198 transition count 19902
Iterating global reduction 0 with 3 rules applied. Total rules applied 242 place count 198 transition count 19902
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 245 place count 195 transition count 19883
Iterating global reduction 0 with 3 rules applied. Total rules applied 248 place count 195 transition count 19883
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 251 place count 192 transition count 19880
Iterating global reduction 0 with 3 rules applied. Total rules applied 254 place count 192 transition count 19880
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 257 place count 189 transition count 19877
Iterating global reduction 0 with 3 rules applied. Total rules applied 260 place count 189 transition count 19877
Applied a total of 260 rules in 1074 ms. Remains 189 /319 variables (removed 130) and now considering 19877/20023 (removed 146) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1401229353150118918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1637963367445440858.kers'
[2026-06-02 09:17:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1401229353150118918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1637963367445440858.kers]
Culled 0 columns in 122 ms.
// Phase 1: matrix 19877 rows 189 cols 420438 entries
Finished phase 1 with 162 SingleSign rule and 3 generalized
[2026-06-02 09:17:45] [INFO ] Computed 24 invariants in 456 ms
Computed 24 P flows in 459 ms.
Exported basis to /tmp/petrispot-output-1637963367445440858.kers
Total runtime 518 ms.
[2026-06-02 09:17:46] [INFO ] Implicit Places using invariants in 1841 ms returned []
Implicit Place search using SMT only with invariants took 1899 ms to find 0 implicit places.
Running 19876 sub problems to find dead transitions.
[2026-06-02 09:17:47] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 19876 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 188/20066 variables, and 9 constraints, problems are : Problem set: 0 solved, 19876 unsolved in 30795 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 19876/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19876 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 19876 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/20066 variables, and 9 constraints, problems are : Problem set: 0 solved, 19876 unsolved in 30469 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 19719/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 117640ms problems are : Problem set: 0 solved, 19876 unsolved
Search for dead transitions found 0 dead transitions in 117899ms
Starting structural reductions in LTL mode, iteration 1 : 189/319 places, 19877/20023 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121155 ms. Remains : 189/319 places, 19877/20023 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 19877/19877 transitions.
Applied a total of 0 rules in 121 ms. Remains 189 /189 variables (removed 0) and now considering 19877/19877 (removed 0) transitions.
[2026-06-02 09:19:45] [INFO ] Invariant cache hit.
[2026-06-02 09:19:45] [INFO ] Implicit Places using invariants in 564 ms returned []
Implicit Place search using SMT only with invariants took 566 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 189/189 places, 19877/19877 transitions.
Support contains 52 out of 189 places after structural reductions.
[2026-06-02 09:19:50] [INFO ] Flatten gal took : 3769 ms
[2026-06-02 09:19:53] [INFO ] Flatten gal took : 3363 ms
[2026-06-02 09:19:58] [INFO ] Input system was already deterministic with 19877 transitions.
RANDOM walk for 40000 steps (8 resets) in 21617 ms. (1 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 146 ms. (27 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 17/17 properties
[2026-06-02 09:20:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 28/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
SMT process timed out in 5820ms, After SMT, problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 50 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 19877/19877 transitions.
Graph (trivial) has 122 edges and 189 vertex of which 9 / 189 are part of one of the 4 SCC in 15 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 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 184 transition count 19842
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 159 transition count 19833
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 66 place count 153 transition count 19833
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 66 place count 153 transition count 19818
Deduced a syphon composed of 15 places in 21 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 96 place count 138 transition count 19818
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 7 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 154 place count 109 transition count 19789
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 160 place count 109 transition count 19783
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 163 place count 106 transition count 19776
Iterating global reduction 4 with 3 rules applied. Total rules applied 166 place count 106 transition count 19776
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 180 place count 99 transition count 19805
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 192 place count 99 transition count 19793
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 194 place count 97 transition count 19787
Iterating global reduction 5 with 2 rules applied. Total rules applied 196 place count 97 transition count 19787
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 206 place count 97 transition count 19777
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 208 place count 96 transition count 19790
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 209 place count 96 transition count 19789
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 217 place count 96 transition count 19781
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 220 place count 96 transition count 19778
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 223 place count 93 transition count 19778
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 224 place count 93 transition count 19777
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 225 place count 93 transition count 19783
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 8 with 3 rules applied. Total rules applied 228 place count 92 transition count 19781
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 241 place count 92 transition count 19768
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 249 place count 92 transition count 19768
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 257 place count 92 transition count 19760
Applied a total of 257 rules in 119843 ms. Remains 92 /189 variables (removed 97) and now considering 19760/19877 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119847 ms. Remains : 92/189 places, 19760/19877 transitions.
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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((F(p0)&&X((X(X(F(p2)))&&p1)))))'
Support contains 27 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 19877/19877 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 187 transition count 16232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 187 transition count 16232
Applied a total of 4 rules in 538 ms. Remains 187 /189 variables (removed 2) and now considering 16232/19877 (removed 3645) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-70666172802455463.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5602833798266281755.kers'
[2026-06-02 09:22:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-70666172802455463.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5602833798266281755.kers]
Culled 0 columns in 100 ms.
// Phase 1: matrix 16232 rows 187 cols 347538 entries
Finished phase 1 with 160 SingleSign rule and 3 generalized
[2026-06-02 09:22:12] [INFO ] Computed 24 invariants in 357 ms
Computed 24 P flows in 358 ms.
Exported basis to /tmp/petrispot-output-5602833798266281755.kers
Total runtime 449 ms.
[2026-06-02 09:22:19] [INFO ] Implicit Places using invariants in 7009 ms returned []
Implicit Place search using SMT only with invariants took 7014 ms to find 0 implicit places.
Running 16231 sub problems to find dead transitions.
[2026-06-02 09:22:19] [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, 16231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/16419 variables, and 9 constraints, problems are : Problem set: 0 solved, 16231 unsolved in 30416 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/187 constraints, PredecessorRefiner: 16231/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 16231 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/16419 variables, and 9 constraints, problems are : Problem set: 0 solved, 16231 unsolved in 30272 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/187 constraints, PredecessorRefiner: 16074/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 104405ms problems are : Problem set: 0 solved, 16231 unsolved
Search for dead transitions found 0 dead transitions in 104617ms
Starting structural reductions in LTL mode, iteration 1 : 187/189 places, 16232/19877 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112272 ms. Remains : 187/189 places, 16232/19877 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X((X(X(F(p2)))&&p1)))))'
Stuttering acceptance computed with spot in 577 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP08C08-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 9 ms.
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP08C08-LTLFireability-00 finished in 113103 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)&&F(p1)))'
Support contains 27 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 19877/19877 transitions.
Graph (trivial) has 138 edges and 189 vertex of which 9 / 189 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 183 transition count 19847
Reduce places removed 23 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 32 rules applied. Total rules applied 56 place count 160 transition count 19838
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 154 transition count 19838
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 62 place count 154 transition count 19825
Deduced a syphon composed of 13 places in 19 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 88 place count 141 transition count 19825
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 139 transition count 16180
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 139 transition count 16180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 138 transition count 11806
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 138 transition count 11806
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 170 place count 100 transition count 11768
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 100 transition count 11762
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 179 place count 97 transition count 11755
Iterating global reduction 4 with 3 rules applied. Total rules applied 182 place count 97 transition count 11755
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 194 place count 91 transition count 11773
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 91 transition count 11761
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 208 place count 89 transition count 11757
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 89 transition count 11757
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 89 transition count 11747
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 222 place count 88 transition count 11760
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 231 place count 88 transition count 11751
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 239 place count 88 transition count 11751
Applied a total of 239 rules in 20326 ms. Remains 88 /189 variables (removed 101) and now considering 11751/19877 (removed 8126) transitions.
[2026-06-02 09:24:25] [INFO ] Flow matrix only has 11734 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7938219628083295428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7795294267656795174.kers'
[2026-06-02 09:24:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7938219628083295428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7795294267656795174.kers]
Normalized transition count is 11733 out of 11734 initially.
Culled 0 columns in 42 ms.
// Phase 1: matrix 11733 rows 88 cols 251124 entries
Finished phase 1 with 61 SingleSign rule and 3 generalized
[2026-06-02 09:24:25] [INFO ] Computed 24 invariants in 199 ms
Computed 24 P flows in 200 ms.
Exported basis to /tmp/petrispot-output-7795294267656795174.kers
Total runtime 261 ms.
[2026-06-02 09:24:29] [INFO ] Implicit Places using invariants in 4944 ms returned []
Implicit Place search using SMT only with invariants took 4948 ms to find 0 implicit places.
Running 11743 sub problems to find dead transitions.
[2026-06-02 09:24:30] [INFO ] Flow matrix only has 11734 transitions (discarded 17 similar events)
[2026-06-02 09:24:30] [INFO ] Invariant cache hit.
[2026-06-02 09:24:30] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 87/11822 variables, and 9 constraints, problems are : Problem set: 0 solved, 11743 unsolved in 30202 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/88 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 11743/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11743 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 87/11822 variables, and 9 constraints, problems are : Problem set: 0 solved, 11743 unsolved in 30203 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/88 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 11715/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84981ms problems are : Problem set: 0 solved, 11743 unsolved
Search for dead transitions found 0 dead transitions in 85065ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/189 places, 11751/19877 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110394 ms. Remains : 88/189 places, 11751/19877 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)&&F(p1)))'
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP08C08-LTLFireability-01
Product exploration timeout after 36770 steps with 0 reset in 10002 ms.
Product exploration timeout after 35000 steps with 0 reset in 10003 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 83 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 13916 ms. (2 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 11940 ms. (3 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 274257 steps, run timeout after 18001 ms. (steps per millisecond=15 ) properties seen :0 out of 1
Probabilistic random walk after 274257 steps, saw 51158 distinct states, run finished after 18010 ms. (steps per millisecond=15 ) properties seen :0
[2026-06-02 09:26:40] [INFO ] Flow matrix only has 11734 transitions (discarded 17 similar events)
[2026-06-02 09:26:40] [INFO ] Invariant cache hit.
[2026-06-02 09:26:40] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/47 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/88 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11821/11822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4043 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 88/88 constraints, ReadFeed: 0/11 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/47 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/88 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11821/11822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4670 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 88/88 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8859ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 11751/11751 transitions.
Graph (trivial) has 32 edges and 88 vertex of which 2 / 88 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 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 2 rules applied. Total rules applied 3 place count 87 transition count 11743
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 85 transition count 11743
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 5 place count 85 transition count 11735
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 21 place count 77 transition count 11735
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 76 transition count 8819
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 76 transition count 8819
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 74 transition count 8817
Free-agglomeration rule applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 40 place count 74 transition count 8804
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 71 place count 61 transition count 8786
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 76 place count 61 transition count 8781
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 61 transition count 8787
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 80 place count 60 transition count 8785
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 89 place count 60 transition count 8776
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 59 transition count 8775
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 57 transition count 8775
Applied a total of 92 rules in 32006 ms. Remains 57 /88 variables (removed 31) and now considering 8775/11751 (removed 2976) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32007 ms. Remains : 57/88 places, 8775/11751 transitions.
RANDOM walk for 33957 steps (7 resets) in 11512 ms. (2 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 9 factoid took 40 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 69462 ms.
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-01 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP08C08-LTLFireability-01 finished in 200057 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 U p1))||X(p0))) U (X(F(p2))||p3)))'
Support contains 23 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 19877/19877 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 173 transition count 13317
Ensure Unique test removed 8 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 40 place count 165 transition count 13317
Applied a total of 40 rules in 858 ms. Remains 165 /189 variables (removed 24) and now considering 13317/19877 (removed 6560) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9840041178016478089.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3143801182005142635.kers'
[2026-06-02 09:27:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9840041178016478089.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3143801182005142635.kers]
Culled 0 columns in 30 ms.
// Phase 1: matrix 13317 rows 165 cols 184254 entries
Finished phase 1 with 148 SingleSign rule and 1 generalized
[2026-06-02 09:27:25] [INFO ] Computed 16 invariants in 125 ms
Computed 16 P flows in 126 ms.
Exported basis to /tmp/petrispot-output-3143801182005142635.kers
Total runtime 152 ms.
[2026-06-02 09:27:27] [INFO ] Implicit Places using invariants in 1721 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1737 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/189 places, 13317/19877 transitions.
Applied a total of 0 rules in 52 ms. Remains 164 /164 variables (removed 0) and now considering 13317/13317 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2648 ms. Remains : 164/189 places, 13317/19877 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 U p1))||X(p0))) U (X(F(p2))||p3)))'
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP08C08-LTLFireability-02
Product exploration timeout after 24160 steps with 0 reset in 10004 ms.
Product exploration timeout after 24980 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 19 factoid took 79 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 20612 ms. (1 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 13760 ms. (2 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 12672 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 12493 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 13033 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 13983 ms. (2 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 13529 ms. (2 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 11066 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 12382 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 12268 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 13075 ms. (3 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 1811807 steps, run timeout after 126001 ms. (steps per millisecond=14 ) properties seen :0 out of 10
Probabilistic random walk after 1811807 steps, saw 223738 distinct states, run finished after 126001 ms. (steps per millisecond=14 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17414006525173766268.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17891386945319069593.kers'
[2026-06-02 09:30:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17414006525173766268.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17891386945319069593.kers]
Culled 0 columns in 28 ms.
// Phase 1: matrix 13317 rows 164 cols 171131 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-06-02 09:30:36] [INFO ] Computed 15 invariants in 121 ms
Computed 15 P flows in 124 ms.
Exported basis to /tmp/petrispot-output-17891386945319069593.kers
Total runtime 153 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 82/105 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 59/164 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SMT process timed out in 7497ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 13317/13317 transitions.
Graph (trivial) has 127 edges and 164 vertex of which 9 / 164 are part of one of the 4 SCC in 1 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 159 transition count 13281
Reduce places removed 26 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 35 rules applied. Total rules applied 62 place count 133 transition count 13272
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 127 transition count 13272
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 68 place count 127 transition count 13257
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 98 place count 112 transition count 13257
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 5 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 164 place count 79 transition count 13224
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 170 place count 79 transition count 13218
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 173 place count 76 transition count 13211
Iterating global reduction 4 with 3 rules applied. Total rules applied 176 place count 76 transition count 13211
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 190 place count 69 transition count 13242
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 202 place count 69 transition count 13230
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 204 place count 67 transition count 13224
Iterating global reduction 5 with 2 rules applied. Total rules applied 206 place count 67 transition count 13224
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 216 place count 67 transition count 13214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 66 transition count 13227
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 219 place count 66 transition count 13226
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 227 place count 66 transition count 13218
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 231 place count 66 transition count 13214
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 235 place count 62 transition count 13214
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 239 place count 62 transition count 13210
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 240 place count 62 transition count 13216
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 8 with 3 rules applied. Total rules applied 243 place count 61 transition count 13214
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 256 place count 61 transition count 13201
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 263 place count 61 transition count 13201
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 270 place count 61 transition count 13194
Applied a total of 270 rules in 30404 ms. Remains 61 /164 variables (removed 103) and now considering 13194/13317 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30405 ms. Remains : 61/164 places, 13194/13317 transitions.
Knowledge based reduction with 19 factoid took 86 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) p1), (AND p1 (NOT p2))]
[2026-06-02 09:31:14] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:834)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:231)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:248)
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)
[2026-06-02 09:31:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p2) (NOT p3))
Could not prove EG (AND (NOT p2) (NOT p3))
Knowledge-based reduction took 222629 ms.
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) p1), (AND p1 (NOT p2))]
Support contains 23 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 13317/13317 transitions.
Applied a total of 0 rules in 72 ms. Remains 164 /164 variables (removed 0) and now considering 13317/13317 (removed 0) transitions.
[2026-06-02 09:31:30] [INFO ] Invariant cache hit.
[2026-06-02 09:31:32] [INFO ] Implicit Places using invariants in 1390 ms returned []
Implicit Place search using SMT only with invariants took 1391 ms to find 0 implicit places.
Running 13316 sub problems to find dead transitions.
[2026-06-02 09:31:32] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 163/13481 variables, and 0 constraints, problems are : Problem set: 0 solved, 13316 unsolved in 30234 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 13316/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13316 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/13481 variables, and 0 constraints, problems are : Problem set: 0 solved, 13316 unsolved in 30284 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 13148/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 94041ms problems are : Problem set: 0 solved, 13316 unsolved
Search for dead transitions found 0 dead transitions in 94144ms
Finished structural reductions in LTL mode , in 1 iterations and 95668 ms. Remains : 164/164 places, 13317/13317 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 16 factoid took 116 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 18661 ms. (2 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 11432 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 11211 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 14364 ms. (2 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 15220 ms. (2 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 12446 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 12773 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 12418 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 14420 ms. (2 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 12510 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 13686 ms. (2 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 1849148 steps, run timeout after 126001 ms. (steps per millisecond=14 ) properties seen :0 out of 10
Probabilistic random walk after 1849148 steps, saw 228117 distinct states, run finished after 126002 ms. (steps per millisecond=14 ) properties seen :0
[2026-06-02 09:35:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 82/105 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 59/164 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SMT process timed out in 7273ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 13317/13317 transitions.
Graph (trivial) has 127 edges and 164 vertex of which 9 / 164 are part of one of the 4 SCC in 1 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 159 transition count 13281
Reduce places removed 26 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 35 rules applied. Total rules applied 62 place count 133 transition count 13272
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 127 transition count 13272
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 68 place count 127 transition count 13257
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 98 place count 112 transition count 13257
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 5 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 164 place count 79 transition count 13224
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 170 place count 79 transition count 13218
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 173 place count 76 transition count 13211
Iterating global reduction 4 with 3 rules applied. Total rules applied 176 place count 76 transition count 13211
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 190 place count 69 transition count 13242
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 202 place count 69 transition count 13230
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 204 place count 67 transition count 13224
Iterating global reduction 5 with 2 rules applied. Total rules applied 206 place count 67 transition count 13224
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 216 place count 67 transition count 13214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 66 transition count 13227
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 219 place count 66 transition count 13226
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 227 place count 66 transition count 13218
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 231 place count 66 transition count 13214
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 235 place count 62 transition count 13214
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 239 place count 62 transition count 13210
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 240 place count 62 transition count 13216
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 8 with 3 rules applied. Total rules applied 243 place count 61 transition count 13214
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 256 place count 61 transition count 13201
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 263 place count 61 transition count 13201
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 270 place count 61 transition count 13194
Applied a total of 270 rules in 30084 ms. Remains 61 /164 variables (removed 103) and now considering 13194/13317 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30085 ms. Remains : 61/164 places, 13194/13317 transitions.
Knowledge based reduction with 16 factoid took 87 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) p1), (AND p1 (NOT p2))]
[2026-06-02 09:36:33] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p2) (NOT p3))
Knowledge-based reduction took 222006 ms.
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) p1), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 251 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) p1), (AND p1 (NOT p2))]
Product exploration timeout after 23290 steps with 0 reset in 10003 ms.
Product exploration timeout after 24770 steps with 0 reset in 10004 ms.
Spot run failed in 118 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/ltsmin15264427048604638363
[2026-06-02 09:37:09] [INFO ] Built C files in 354ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15264427048604638363
Running compilation step : cd /tmp/ltsmin15264427048604638363;'/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/ltsmin15264427048604638363;'/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/ltsmin15264427048604638363;'/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 23 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 13317/13317 transitions.
Applied a total of 0 rules in 76 ms. Remains 164 /164 variables (removed 0) and now considering 13317/13317 (removed 0) transitions.
[2026-06-02 09:37:12] [INFO ] Invariant cache hit.
[2026-06-02 09:37:13] [INFO ] Implicit Places using invariants in 1430 ms returned []
Implicit Place search using SMT only with invariants took 1441 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1519 ms. Remains : 164/164 places, 13317/13317 transitions.
Built C files in :
/tmp/ltsmin4743695528779614210
[2026-06-02 09:37:14] [INFO ] Built C files in 234ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4743695528779614210
Running compilation step : cd /tmp/ltsmin4743695528779614210;'/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/ltsmin4743695528779614210;'/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/ltsmin4743695528779614210;'/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-02 09:37:20] [INFO ] Flatten gal took : 1160 ms
[2026-06-02 09:37:21] [INFO ] Flatten gal took : 1364 ms
[2026-06-02 09:37:21] [INFO ] Time to serialize gal into /tmp/LTL11332223177589259455.gal : 268 ms
[2026-06-02 09:37:21] [INFO ] Time to serialize properties into /tmp/LTL9527119773966395501.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/LTL11332223177589259455.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16754176970199188563.hoa' '-atoms' '/tmp/LTL9527119773966395501.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2026-06-02 09:37:39] [INFO ] Flatten gal took : 1160 ms
[2026-06-02 09:37:40] [INFO ] Flatten gal took : 1172 ms
[2026-06-02 09:37:40] [INFO ] Time to serialize gal into /tmp/LTL11333802630766670954.gal : 219 ms
[2026-06-02 09:37:40] [INFO ] Time to serialize properties into /tmp/LTL12154606346343259269.ltl : 7 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/LTL11333802630766670954.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12154606346343259269.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Detected timeout of ITS tools.
[2026-06-02 09:37:58] [INFO ] Flatten gal took : 2002 ms
[2026-06-02 09:37:58] [INFO ] Applying decomposition
[2026-06-02 09:37:59] [INFO ] Flatten gal took : 1310 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/graph2860477363167187490.txt' '-o' '/tmp/graph2860477363167187490.bin' '-w' '/tmp/graph2860477363167187490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2860477363167187490.bin' '-l' '-1' '-v' '-w' '/tmp/graph2860477363167187490.weights' '-q' '0' '-e' '0.001'
[2026-06-02 09:38:02] [INFO ] Decomposing Gal with order
[2026-06-02 09:38:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 09:38:10] [INFO ] Removed a total of 37695 redundant transitions.
[2026-06-02 09:38:11] [INFO ] Flatten gal took : 7708 ms
[2026-06-02 09:38:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2868 labels/synchronizations in 835 ms.
[2026-06-02 09:38:12] [INFO ] Time to serialize gal into /tmp/LTL8375114856844258392.gal : 37 ms
[2026-06-02 09:38:12] [INFO ] Time to serialize properties into /tmp/LTL12633365576412727058.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/LTL8375114856844258392.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12633365576412727058.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G((F(!(("(((((u42.p2==1)&&(i2.u24.p25==1))&&((i2.u24.p40==1)&&(i2.u24.p70==1)))&&(((i2.u24.p78==1)&&(i2.u24.p97==1))&&((i2.u43.p12...1078
Formula 0 simplified : F(G("(((((u42.p2==1)&&(i2.u24.p25==1))&&((i2.u24.p40==1)&&(i2.u24.p70==1)))&&(((i2.u24.p78==1)&&(i2.u24.p97==1))&&((i2.u43.p120==1)&...1061
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV2-PT-bP08C08-LTLFireability-02 finished in 663231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||X((F(p1) U X(p2)))))))'
Support contains 27 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 19877/19877 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 181 transition count 13572
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 181 transition count 13572
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 180 transition count 9198
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 180 transition count 9198
Applied a total of 18 rules in 610 ms. Remains 180 /189 variables (removed 9) and now considering 9198/19877 (removed 10679) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5832433569718164930.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14056625415264134004.kers'
[2026-06-02 09:38:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5832433569718164930.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14056625415264134004.kers]
Culled 0 columns in 32 ms.
// Phase 1: matrix 9198 rows 180 cols 198110 entries
Finished phase 1 with 154 SingleSign rule and 2 generalized
[2026-06-02 09:38:28] [INFO ] Computed 24 invariants in 115 ms
Computed 24 P flows in 115 ms.
Exported basis to /tmp/petrispot-output-14056625415264134004.kers
Total runtime 142 ms.
[2026-06-02 09:38:30] [INFO ] Implicit Places using invariants in 2172 ms returned []
[2026-06-02 09:38:30] [INFO ] Invariant cache hit.
[2026-06-02 09:38:39] [INFO ] Implicit Places using invariants and state equation in 8408 ms returned []
Implicit Place search using SMT with State Equation took 10589 ms to find 0 implicit places.
Running 9197 sub problems to find dead transitions.
[2026-06-02 09:38:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/9378 variables, and 9 constraints, problems are : Problem set: 0 solved, 9197 unsolved in 30159 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/180 constraints, PredecessorRefiner: 9197/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9197 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/9378 variables, and 9 constraints, problems are : Problem set: 0 solved, 9197 unsolved in 30264 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/180 constraints, PredecessorRefiner: 9030/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 78066ms problems are : Problem set: 0 solved, 9197 unsolved
Search for dead transitions found 0 dead transitions in 78135ms
Starting structural reductions in LTL mode, iteration 1 : 180/189 places, 9198/19877 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89374 ms. Remains : 180/189 places, 9198/19877 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||X((F(p1) U X(p2)))))))'
Stuttering acceptance computed with spot in 497 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP08C08-LTLFireability-03
Product exploration timeout after 35920 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP08C08-LTLFireability-03 finished in 99970 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 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 19877/19877 transitions.
Graph (trivial) has 149 edges and 189 vertex of which 11 / 189 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
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 182 transition count 19845
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 158 transition count 19836
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 152 transition count 19836
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 64 place count 152 transition count 19824
Deduced a syphon composed of 12 places in 26 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 88 place count 140 transition count 19824
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 96 place count 132 transition count 13519
Iterating global reduction 3 with 8 rules applied. Total rules applied 104 place count 132 transition count 13519
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 112 place count 124 transition count 909
Iterating global reduction 3 with 8 rules applied. Total rules applied 120 place count 124 transition count 909
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 122 transition count 905
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 122 transition count 905
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 212 place count 78 transition count 861
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 218 place count 78 transition count 855
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 221 place count 75 transition count 848
Iterating global reduction 4 with 3 rules applied. Total rules applied 224 place count 75 transition count 848
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 240 place count 67 transition count 866
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 252 place count 67 transition count 854
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 254 place count 65 transition count 850
Iterating global reduction 5 with 2 rules applied. Total rules applied 256 place count 65 transition count 850
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 266 place count 65 transition count 840
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 268 place count 64 transition count 853
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 282 place count 64 transition count 839
Applied a total of 282 rules in 2575 ms. Remains 64 /189 variables (removed 125) and now considering 839/19877 (removed 19038) transitions.
[2026-06-02 09:40:10] [INFO ] Flow matrix only has 821 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5813231414148478760.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14715728759751948352.kers'
[2026-06-02 09:40:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5813231414148478760.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14715728759751948352.kers]
Normalized transition count is 820 out of 821 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 820 rows 63 cols 15878 entries
Finished phase 1 with 38 SingleSign rule and 2 generalized
[2026-06-02 09:40:10] [INFO ] Computed 24 invariants in 15 ms
Computed 24 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-14715728759751948352.kers
Total runtime 19 ms.
[2026-06-02 09:40:11] [INFO ] Implicit Places using invariants in 624 ms returned []
[2026-06-02 09:40:11] [INFO ] Flow matrix only has 821 transitions (discarded 18 similar events)
[2026-06-02 09:40:11] [INFO ] Invariant cache hit.
[2026-06-02 09:40:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-06-02 09:40:12] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2026-06-02 09:40:12] [INFO ] Redundant transitions in 130 ms returned []
Running 831 sub problems to find dead transitions.
[2026-06-02 09:40:12] [INFO ] Flow matrix only has 821 transitions (discarded 18 similar events)
[2026-06-02 09:40:12] [INFO ] Invariant cache hit.
[2026-06-02 09:40:12] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 5 (OVERLAPS) 820/884 variables, 64/89 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 831 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 884/885 variables, and 113 constraints, problems are : Problem set: 0 solved, 831 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 24/25 constraints, PredecessorRefiner: 831/27 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 831 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 5 (OVERLAPS) 820/884 variables, 64/89 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/884 variables, 27/140 constraints. Problems are: Problem set: 0 solved, 831 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 884/885 variables, and 140 constraints, problems are : Problem set: 0 solved, 831 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 24/25 constraints, PredecessorRefiner: 831/27 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61307ms problems are : Problem set: 0 solved, 831 unsolved
Search for dead transitions found 0 dead transitions in 61312ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/189 places, 839/19877 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65949 ms. Remains : 64/189 places, 839/19877 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 50 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP08C08-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP08C08-LTLFireability-04 finished in 66047 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 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 19877/19877 transitions.
Graph (trivial) has 139 edges and 189 vertex of which 9 / 189 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 183 transition count 19847
Reduce places removed 23 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 32 rules applied. Total rules applied 56 place count 160 transition count 19838
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 154 transition count 19838
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 62 place count 154 transition count 19824
Deduced a syphon composed of 14 places in 17 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 91 place count 139 transition count 19824
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 107 place count 123 transition count 13264
Ensure Unique test removed 8 places
Iterating global reduction 3 with 24 rules applied. Total rules applied 131 place count 115 transition count 13264
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 139 place count 107 transition count 654
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 107 transition count 654
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 106 transition count 652
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 106 transition count 652
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 225 place count 68 transition count 614
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 231 place count 68 transition count 608
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 234 place count 65 transition count 601
Iterating global reduction 4 with 3 rules applied. Total rules applied 237 place count 65 transition count 601
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 251 place count 58 transition count 619
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 263 place count 58 transition count 607
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 265 place count 56 transition count 603
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 56 transition count 603
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 277 place count 56 transition count 593
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 279 place count 55 transition count 606
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 294 place count 55 transition count 591
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 301 place count 55 transition count 591
Applied a total of 301 rules in 2665 ms. Remains 55 /189 variables (removed 134) and now considering 591/19877 (removed 19286) transitions.
[2026-06-02 09:41:16] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16295691151863350612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11115955363171663397.kers'
[2026-06-02 09:41:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16295691151863350612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11115955363171663397.kers]
Normalized transition count is 573 out of 574 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 573 rows 55 cols 11566 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-06-02 09:41:16] [INFO ] Computed 15 invariants in 6 ms
Computed 15 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11115955363171663397.kers
Total runtime 9 ms.
[2026-06-02 09:41:16] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-06-02 09:41:16] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:41:16] [INFO ] Invariant cache hit.
[2026-06-02 09:41:17] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 09:41:17] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2026-06-02 09:41:17] [INFO ] Redundant transitions in 35 ms returned []
Running 583 sub problems to find dead transitions.
[2026-06-02 09:41:17] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:41:17] [INFO ] Invariant cache hit.
[2026-06-02 09:41:17] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 573/628 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/629 variables, and 80 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 55/55 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 583/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 573/628 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/628 variables, 27/107 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 628/629 variables, and 109 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 55/55 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 583/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 61028ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 61031ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/189 places, 591/19877 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64456 ms. Remains : 55/189 places, 591/19877 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 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP08C08-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 2376 ms.
Product exploration explored 100000 steps with 0 reset in 2139 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 1251 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1056 ms. (37 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 501788 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 501788 steps, saw 75888 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2026-06-02 09:42:26] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:42:26] [INFO ] Invariant cache hit.
[2026-06-02 09:42:26] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/42 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/55 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 573/628 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/629 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/629 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/42 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/55 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 573/628 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/629 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/629 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 894ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 12 ms.
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 4883 ms.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 11 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 591/591 transitions.
Applied a total of 0 rules in 18 ms. Remains 55 /55 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2026-06-02 09:42:28] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:42:28] [INFO ] Invariant cache hit.
[2026-06-02 09:42:28] [INFO ] Implicit Places using invariants in 250 ms returned []
[2026-06-02 09:42:28] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:42:28] [INFO ] Invariant cache hit.
[2026-06-02 09:42:28] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 09:42:28] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
[2026-06-02 09:42:28] [INFO ] Redundant transitions in 18 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 896 ms. Remains : 55/55 places, 591/591 transitions.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 57 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 1810 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1228 ms. (32 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 506220 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 506220 steps, saw 76479 distinct states, run finished after 3004 ms. (steps per millisecond=168 ) properties seen :0
[2026-06-02 09:42:32] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:42:32] [INFO ] Invariant cache hit.
[2026-06-02 09:42:32] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/42 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/55 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 573/628 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/629 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/629 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/42 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/55 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 573/628 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/629 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/629 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 869ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 3 ms.
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 4957 ms.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2493 ms.
Product exploration explored 100000 steps with 0 reset in 2365 ms.
Built C files in :
/tmp/ltsmin7671668248600769166
[2026-06-02 09:42:38] [INFO ] Computing symmetric may disable matrix : 591 transitions.
[2026-06-02 09:42:39] [INFO ] Computation of Complete disable matrix. took 105 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 09:42:39] [INFO ] Computing symmetric may enable matrix : 591 transitions.
[2026-06-02 09:42:39] [INFO ] Computation of Complete enable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 09:42:39] [INFO ] Computing Do-Not-Accords matrix : 591 transitions.
[2026-06-02 09:42:39] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 09:42:39] [INFO ] Built C files in 367ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7671668248600769166
Running compilation step : cd /tmp/ltsmin7671668248600769166;'/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/ltsmin7671668248600769166;'/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/ltsmin7671668248600769166;'/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 11 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 591/591 transitions.
Applied a total of 0 rules in 19 ms. Remains 55 /55 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2026-06-02 09:42:42] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:42:42] [INFO ] Invariant cache hit.
[2026-06-02 09:42:42] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-06-02 09:42:42] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:42:42] [INFO ] Invariant cache hit.
[2026-06-02 09:42:42] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 09:42:43] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2026-06-02 09:42:43] [INFO ] Redundant transitions in 19 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 786 ms. Remains : 55/55 places, 591/591 transitions.
Built C files in :
/tmp/ltsmin17653480516238336902
[2026-06-02 09:42:43] [INFO ] Computing symmetric may disable matrix : 591 transitions.
[2026-06-02 09:42:43] [INFO ] Computation of Complete disable matrix. took 147 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 09:42:43] [INFO ] Computing symmetric may enable matrix : 591 transitions.
[2026-06-02 09:42:43] [INFO ] Computation of Complete enable matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 09:42:43] [INFO ] Computing Do-Not-Accords matrix : 591 transitions.
[2026-06-02 09:42:43] [INFO ] Computation of Completed DNA matrix. took 105 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 09:42:43] [INFO ] Built C files in 538ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17653480516238336902
Running compilation step : cd /tmp/ltsmin17653480516238336902;'/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/ltsmin17653480516238336902;'/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/ltsmin17653480516238336902;'/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-02 09:42:48] [INFO ] Flatten gal took : 87 ms
[2026-06-02 09:42:48] [INFO ] Flatten gal took : 84 ms
[2026-06-02 09:42:48] [INFO ] Time to serialize gal into /tmp/LTL6504540861613692530.gal : 13 ms
[2026-06-02 09:42:48] [INFO ] Time to serialize properties into /tmp/LTL6845051042433616717.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/LTL6504540861613692530.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6599176460349209374.hoa' '-atoms' '/tmp/LTL6845051042433616717.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...317
Loading property file /tmp/LTL6845051042433616717.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6599176460349209374.hoa
Detected timeout of ITS tools.
[2026-06-02 09:43:05] [INFO ] Flatten gal took : 82 ms
[2026-06-02 09:43:05] [INFO ] Flatten gal took : 81 ms
[2026-06-02 09:43:05] [INFO ] Time to serialize gal into /tmp/LTL1964680312081223435.gal : 21 ms
[2026-06-02 09:43:05] [INFO ] Time to serialize properties into /tmp/LTL6910558247170728211.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/LTL1964680312081223435.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6910558247170728211.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 : !((G(F("(((((p2==0)||(p32==0))||((p51==0)||(p63==0)))||(((p82==0)||(p101==0))||((p127==0)||(p146==0))))||(((p154==0)||(p205==0))||(p31...167
Formula 0 simplified : FG!"(((((p2==0)||(p32==0))||((p51==0)||(p63==0)))||(((p82==0)||(p101==0))||((p127==0)||(p146==0))))||(((p154==0)||(p205==0))||(p312=...161
Detected timeout of ITS tools.
[2026-06-02 09:43:20] [INFO ] Flatten gal took : 76 ms
[2026-06-02 09:43:20] [INFO ] Applying decomposition
[2026-06-02 09:43:20] [INFO ] Flatten gal took : 78 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/graph839596990079023732.txt' '-o' '/tmp/graph839596990079023732.bin' '-w' '/tmp/graph839596990079023732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph839596990079023732.bin' '-l' '-1' '-v' '-w' '/tmp/graph839596990079023732.weights' '-q' '0' '-e' '0.001'
[2026-06-02 09:43:20] [INFO ] Decomposing Gal with order
[2026-06-02 09:43:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 09:43:21] [INFO ] Removed a total of 6814 redundant transitions.
[2026-06-02 09:43:21] [INFO ] Flatten gal took : 173 ms
[2026-06-02 09:43:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 87 ms.
[2026-06-02 09:43:21] [INFO ] Time to serialize gal into /tmp/LTL8040078309310273202.gal : 6 ms
[2026-06-02 09:43:21] [INFO ] Time to serialize properties into /tmp/LTL3619943847755922094.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8040078309310273202.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3619943847755922094.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 : !((G(F("(((((i0.u0.p2==0)||(i0.u2.p32==0))||((i0.u4.p51==0)||(i0.u5.p63==0)))||(((i0.u6.p82==0)||(i0.u7.p101==0))||((i0.u10.p127==0)||...238
Formula 0 simplified : FG!"(((((i0.u0.p2==0)||(i0.u2.p32==0))||((i0.u4.p51==0)||(i0.u5.p63==0)))||(((i0.u6.p82==0)||(i0.u7.p101==0))||((i0.u10.p127==0)||(i...232
Reverse transition relation is NOT exact ! Due to transitions t70_t71_t73_t81_t87_t74_t79, i0.u0.t128, Intersection with reachable at each step enabled. (...202
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
31 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.404153,21404,1,0,8468,161,4225,12857,202,348,12954
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ErlangenMainframeV2-PT-bP08C08-LTLFireability-07 finished in 127649 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 11 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 19877/19877 transitions.
Graph (trivial) has 139 edges and 189 vertex of which 9 / 189 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 183 transition count 19847
Reduce places removed 23 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 32 rules applied. Total rules applied 56 place count 160 transition count 19838
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 154 transition count 19838
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 62 place count 154 transition count 19824
Deduced a syphon composed of 14 places in 23 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 91 place count 139 transition count 19824
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 107 place count 123 transition count 13264
Ensure Unique test removed 8 places
Iterating global reduction 3 with 24 rules applied. Total rules applied 131 place count 115 transition count 13264
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 139 place count 107 transition count 654
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 107 transition count 654
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 104 transition count 648
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 104 transition count 648
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 225 place count 68 transition count 612
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 231 place count 68 transition count 606
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 234 place count 65 transition count 599
Iterating global reduction 4 with 3 rules applied. Total rules applied 237 place count 65 transition count 599
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 255 place count 56 transition count 617
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 267 place count 56 transition count 605
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 269 place count 54 transition count 601
Iterating global reduction 5 with 2 rules applied. Total rules applied 271 place count 54 transition count 601
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 281 place count 54 transition count 591
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 283 place count 53 transition count 604
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 296 place count 53 transition count 591
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 301 place count 53 transition count 591
Applied a total of 301 rules in 2628 ms. Remains 53 /189 variables (removed 136) and now considering 591/19877 (removed 19286) transitions.
[2026-06-02 09:43:24] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13354357708907345600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16470377493977015264.kers'
[2026-06-02 09:43:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13354357708907345600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16470377493977015264.kers]
Normalized transition count is 573 out of 574 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 573 rows 53 cols 11574 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-06-02 09:43:24] [INFO ] Computed 15 invariants in 6 ms
Computed 15 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-16470377493977015264.kers
Total runtime 9 ms.
[2026-06-02 09:43:24] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-06-02 09:43:24] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:43:24] [INFO ] Invariant cache hit.
[2026-06-02 09:43:24] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 09:43:25] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2026-06-02 09:43:25] [INFO ] Redundant transitions in 32 ms returned []
Running 583 sub problems to find dead transitions.
[2026-06-02 09:43:25] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:43:25] [INFO ] Invariant cache hit.
[2026-06-02 09:43:25] [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, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 573/626 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/627 variables, and 78 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 53/53 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 583/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 573/626 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 25/103 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/627 variables, and 104 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 53/53 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 583/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 61162ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 61166ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/189 places, 591/19877 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64594 ms. Remains : 53/189 places, 591/19877 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 75 ms :[true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP08C08-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 2431 ms.
Product exploration explored 100000 steps with 0 reset in 2158 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 48 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 1160 ms. (34 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 955 ms. (41 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 469132 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 1
Probabilistic random walk after 469132 steps, saw 72236 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
[2026-06-02 09:44:34] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:44:34] [INFO ] Invariant cache hit.
[2026-06-02 09:44:34] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/40 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 573/626 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/627 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/627 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/627 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 627/627 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 53/53 constraints, ReadFeed: 11/11 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/40 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 573/626 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/627 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/627 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/627 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 627/627 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 53/53 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 609ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3214 steps, including 120 resets, run visited all 1 properties in 89 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 90 ms.
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 3 factoid took 44 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 4429 ms.
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-12 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP08C08-LTLFireability-12 finished in 73739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0&&F(G(!p0))))'
Support contains 11 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 19877/19877 transitions.
Graph (trivial) has 139 edges and 189 vertex of which 9 / 189 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 183 transition count 19847
Reduce places removed 23 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 32 rules applied. Total rules applied 56 place count 160 transition count 19838
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 154 transition count 19838
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 62 place count 154 transition count 19824
Deduced a syphon composed of 14 places in 18 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 91 place count 139 transition count 19824
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 107 place count 123 transition count 13264
Ensure Unique test removed 8 places
Iterating global reduction 3 with 24 rules applied. Total rules applied 131 place count 115 transition count 13264
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 139 place count 107 transition count 654
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 107 transition count 654
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 105 transition count 650
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 105 transition count 650
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 225 place count 68 transition count 613
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 231 place count 68 transition count 607
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 234 place count 65 transition count 600
Iterating global reduction 4 with 3 rules applied. Total rules applied 237 place count 65 transition count 600
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 253 place count 57 transition count 618
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 265 place count 57 transition count 606
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 267 place count 55 transition count 602
Iterating global reduction 5 with 2 rules applied. Total rules applied 269 place count 55 transition count 602
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 279 place count 55 transition count 592
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 281 place count 54 transition count 605
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 295 place count 54 transition count 591
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 301 place count 54 transition count 591
Applied a total of 301 rules in 2437 ms. Remains 54 /189 variables (removed 135) and now considering 591/19877 (removed 19286) transitions.
[2026-06-02 09:44:37] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4434474776538747231.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13623663774426259502.kers'
[2026-06-02 09:44:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4434474776538747231.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13623663774426259502.kers]
Normalized transition count is 573 out of 574 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 573 rows 54 cols 11576 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-06-02 09:44:37] [INFO ] Computed 15 invariants in 6 ms
Computed 15 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-13623663774426259502.kers
Total runtime 10 ms.
[2026-06-02 09:44:37] [INFO ] Implicit Places using invariants in 179 ms returned []
[2026-06-02 09:44:37] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:44:37] [INFO ] Invariant cache hit.
[2026-06-02 09:44:38] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 09:44:38] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2026-06-02 09:44:38] [INFO ] Redundant transitions in 31 ms returned []
Running 583 sub problems to find dead transitions.
[2026-06-02 09:44:38] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:44:38] [INFO ] Invariant cache hit.
[2026-06-02 09:44:38] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 573/627 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/628 variables, and 79 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 54/54 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 583/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 573/627 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 26/105 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/628 variables, and 105 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 54/54 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 583/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60977ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60980ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/189 places, 591/19877 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64112 ms. Remains : 54/189 places, 591/19877 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))&&p0))'
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP08C08-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 2489 ms.
Product exploration explored 100000 steps with 0 reset in 2129 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 1407 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1011 ms. (39 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 493065 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 1
Probabilistic random walk after 493065 steps, saw 74386 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
[2026-06-02 09:45:48] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:45:48] [INFO ] Invariant cache hit.
[2026-06-02 09:45:48] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/41 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 573/627 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/628 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/628 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 628/628 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 54/54 constraints, ReadFeed: 11/11 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/41 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 573/627 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/628 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/628 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 628/628 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 54/54 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 924ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 3 ms.
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Knowledge-based reduction took 4899 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 591/591 transitions.
Applied a total of 0 rules in 31 ms. Remains 54 /54 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2026-06-02 09:45:49] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:45:49] [INFO ] Invariant cache hit.
[2026-06-02 09:45:49] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-06-02 09:45:49] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:45:49] [INFO ] Invariant cache hit.
[2026-06-02 09:45:49] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 09:45:50] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2026-06-02 09:45:50] [INFO ] Redundant transitions in 18 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 938 ms. Remains : 54/54 places, 591/591 transitions.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 952 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1050 ms. (38 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 516751 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 1
Probabilistic random walk after 516751 steps, saw 77703 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
[2026-06-02 09:45:53] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:45:53] [INFO ] Invariant cache hit.
[2026-06-02 09:45:53] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/41 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 573/627 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/628 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/628 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 628/628 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 54/54 constraints, ReadFeed: 11/11 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/41 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 573/627 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/628 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/628 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 628/628 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 54/54 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 891ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 2 ms.
Knowledge based reduction with 3 factoid took 88 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 52 ms :[(NOT p0)]
Knowledge-based reduction took 4672 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2159 ms.
Product exploration explored 100000 steps with 0 reset in 2114 ms.
Built C files in :
/tmp/ltsmin3848733146577037951
[2026-06-02 09:45:59] [INFO ] Computing symmetric may disable matrix : 591 transitions.
[2026-06-02 09:45:59] [INFO ] Computation of Complete disable matrix. took 84 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 09:45:59] [INFO ] Computing symmetric may enable matrix : 591 transitions.
[2026-06-02 09:45:59] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 09:45:59] [INFO ] Computing Do-Not-Accords matrix : 591 transitions.
[2026-06-02 09:45:59] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 09:45:59] [INFO ] Built C files in 264ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3848733146577037951
Running compilation step : cd /tmp/ltsmin3848733146577037951;'/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/ltsmin3848733146577037951;'/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/ltsmin3848733146577037951;'/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 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 591/591 transitions.
Applied a total of 0 rules in 19 ms. Remains 54 /54 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2026-06-02 09:46:02] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:46:02] [INFO ] Invariant cache hit.
[2026-06-02 09:46:02] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-06-02 09:46:02] [INFO ] Flow matrix only has 574 transitions (discarded 17 similar events)
[2026-06-02 09:46:02] [INFO ] Invariant cache hit.
[2026-06-02 09:46:02] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 09:46:03] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2026-06-02 09:46:03] [INFO ] Redundant transitions in 31 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 693 ms. Remains : 54/54 places, 591/591 transitions.
Built C files in :
/tmp/ltsmin7905600126368582034
[2026-06-02 09:46:03] [INFO ] Computing symmetric may disable matrix : 591 transitions.
[2026-06-02 09:46:03] [INFO ] Computation of Complete disable matrix. took 83 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 09:46:03] [INFO ] Computing symmetric may enable matrix : 591 transitions.
[2026-06-02 09:46:03] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 09:46:03] [INFO ] Computing Do-Not-Accords matrix : 591 transitions.
[2026-06-02 09:46:03] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 09:46:03] [INFO ] Built C files in 261ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7905600126368582034
Running compilation step : cd /tmp/ltsmin7905600126368582034;'/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/ltsmin7905600126368582034;'/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/ltsmin7905600126368582034;'/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-02 09:46:08] [INFO ] Flatten gal took : 73 ms
[2026-06-02 09:46:08] [INFO ] Flatten gal took : 81 ms
[2026-06-02 09:46:08] [INFO ] Time to serialize gal into /tmp/LTL17544744901411445586.gal : 12 ms
[2026-06-02 09:46:08] [INFO ] Time to serialize properties into /tmp/LTL4623111372580988200.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17544744901411445586.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1000565459926240833.hoa' '-atoms' '/tmp/LTL4623111372580988200.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4623111372580988200.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1000565459926240833.hoa
Detected timeout of ITS tools.
[2026-06-02 09:46:24] [INFO ] Flatten gal took : 75 ms
[2026-06-02 09:46:24] [INFO ] Flatten gal took : 93 ms
[2026-06-02 09:46:25] [INFO ] Time to serialize gal into /tmp/LTL12097062398447009958.gal : 12 ms
[2026-06-02 09:46:25] [INFO ] Time to serialize properties into /tmp/LTL2035350255145547077.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12097062398447009958.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2035350255145547077.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((p2!=1)||(p25!=1))||((p51!=1)||(p63!=1)))||(((p82!=1)||(p101!=1))||((p120!=1)||(p135!=1))))||(((p154!=1)||(p205!=1))||(p31...167
Formula 0 simplified : GF!"(((((p2!=1)||(p25!=1))||((p51!=1)||(p63!=1)))||(((p82!=1)||(p101!=1))||((p120!=1)||(p135!=1))))||(((p154!=1)||(p205!=1))||(p312!...161
Detected timeout of ITS tools.
[2026-06-02 09:46:40] [INFO ] Flatten gal took : 123 ms
[2026-06-02 09:46:40] [INFO ] Applying decomposition
[2026-06-02 09:46:40] [INFO ] Flatten gal took : 125 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/graph2878435182030569682.txt' '-o' '/tmp/graph2878435182030569682.bin' '-w' '/tmp/graph2878435182030569682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2878435182030569682.bin' '-l' '-1' '-v' '-w' '/tmp/graph2878435182030569682.weights' '-q' '0' '-e' '0.001'
[2026-06-02 09:46:40] [INFO ] Decomposing Gal with order
[2026-06-02 09:46:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 09:46:40] [INFO ] Removed a total of 7041 redundant transitions.
[2026-06-02 09:46:40] [INFO ] Flatten gal took : 166 ms
[2026-06-02 09:46:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 93 ms.
[2026-06-02 09:46:40] [INFO ] Time to serialize gal into /tmp/LTL13311898221233676635.gal : 6 ms
[2026-06-02 09:46:40] [INFO ] Time to serialize properties into /tmp/LTL4120535967364780700.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/LTL13311898221233676635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4120535967364780700.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 : !((F(G("(((((i2.u1.p2!=1)||(u3.p25!=1))||((i2.u7.p51!=1)||(i2.u6.p63!=1)))||(((i2.u8.p82!=1)||(i2.u10.p101!=1))||((i2.u11.p120!=1)||(i...236
Formula 0 simplified : GF!"(((((i2.u1.p2!=1)||(u3.p25!=1))||((i2.u7.p51!=1)||(i2.u6.p63!=1)))||(((i2.u8.p82!=1)||(i2.u10.p101!=1))||((i2.u11.p120!=1)||(i2....230
Reverse transition relation is NOT exact ! Due to transitions i2.u1.t128, i3.t70_t71_t73_t81_t87_t74_t79, Intersection with reachable at each step enabled...205
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
139 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.49021,56504,1,0,91169,584,6262,168273,463,1597,75376
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ErlangenMainframeV2-PT-bP08C08-LTLFireability-13 finished in 127329 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 U p1))||X(p0))) U (X(F(p2))||p3)))'
Spot run failed in 54 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-02 09:46:46] [INFO ] Flatten gal took : 3659 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15886295220447220779
[2026-06-02 09:46:48] [INFO ] Too many transitions (19877) to apply POR reductions. Disabling POR matrices.
[2026-06-02 09:46:48] [INFO ] Built C files in 614ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15886295220447220779
Running compilation step : cd /tmp/ltsmin15886295220447220779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-06-02 09:46:50] [INFO ] Applying decomposition
[2026-06-02 09:46:53] [INFO ] Flatten gal took : 3166 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/graph1381826118146188316.txt' '-o' '/tmp/graph1381826118146188316.bin' '-w' '/tmp/graph1381826118146188316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1381826118146188316.bin' '-l' '-1' '-v' '-w' '/tmp/graph1381826118146188316.weights' '-q' '0' '-e' '0.001'
[2026-06-02 09:47:00] [INFO ] Decomposing Gal with order
[2026-06-02 09:47:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 09:47:05] [INFO ] Removed a total of 163572 redundant transitions.
[2026-06-02 09:47:06] [INFO ] Flatten gal took : 3886 ms
[2026-06-02 09:47:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 1881 ms.
[2026-06-02 09:47:08] [INFO ] Time to serialize gal into /tmp/LTLFireability6031456187471101459.gal : 140 ms
[2026-06-02 09:47:08] [INFO ] Time to serialize properties into /tmp/LTLFireability8256792244250113579.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/LTLFireability6031456187471101459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8256792244250113579.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G((F(!(("(((((i8.u1.p2==1)&&(i8.u1.p25==1))&&((i8.u1.p40==1)&&(i8.u14.p70==1)))&&(((i8.u1.p78==1)&&(i7.u18.p97==1))&&((i5.u22.p120...1102
Formula 0 simplified : F(G("(((((i8.u1.p2==1)&&(i8.u1.p25==1))&&((i8.u1.p40==1)&&(i8.u14.p70==1)))&&(((i8.u1.p78==1)&&(i7.u18.p97==1))&&((i5.u22.p120==1)&&...1085
Compilation finished in 667329 ms.
Running link step : cd /tmp/ltsmin15886295220447220779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 616 ms.
Running LTSmin : cd /tmp/ltsmin15886295220447220779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([]((<>(!((LTLAPp0==true) U (LTLAPp1==true)))||X((LTLAPp0==true)))) U (X(<>((LTLAPp2==true)))||(LTLAPp3==true)))' '--buchi-type=spotba'
LTSmin run took 1161 ms.
FORMULA ErlangenMainframeV2-PT-bP08C08-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2418912 ms.

BK_STOP 1780394282389

--------------------
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="ErlangenMainframeV2-PT-bP08C08"
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 ErlangenMainframeV2-PT-bP08C08, 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-178021499200268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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