Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 5.7K Mar 7 05:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 7 05:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 05:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 05:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 05:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 7 05:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 05:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 7 05:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 5.7M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779859447031

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0707
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 05:24:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 05:24:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 05:24:09] [INFO ] Load time of PNML (sax parser for PT used): 834 ms
[2026-05-27 05:24:10] [INFO ] Transformed 243 places.
[2026-05-27 05:24:10] [INFO ] Transformed 6817 transitions.
[2026-05-27 05:24:10] [INFO ] Found NUPN structural information;
[2026-05-27 05:24:10] [INFO ] Parsed PT model containing 243 places and 6817 transitions and 114442 arcs in 1087 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV0-PT-0707-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 6817/6817 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 180 transition count 6754
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 180 transition count 6754
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 160 place count 146 transition count 6720
Iterating global reduction 0 with 34 rules applied. Total rules applied 194 place count 146 transition count 6720
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 197 place count 143 transition count 6717
Iterating global reduction 0 with 3 rules applied. Total rules applied 200 place count 143 transition count 6717
Applied a total of 200 rules in 235 ms. Remains 143 /243 variables (removed 100) and now considering 6717/6817 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16523461154009618279.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8485475931443090520.kers'
[2026-05-27 05:24:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16523461154009618279.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8485475931443090520.kers]
Culled 0 columns in 32 ms.
// Phase 1: matrix 6717 rows 143 cols 114242 entries
Finished phase 1 with 120 SingleSign rule and 3 generalized
[2026-05-27 05:24:11] [INFO ] Computed 20 invariants in 114 ms
Computed 20 P flows in 116 ms.
Exported basis to /tmp/petrispot-output-8485475931443090520.kers
Total runtime 139 ms.
[2026-05-27 05:24:11] [INFO ] Implicit Places using invariants in 511 ms returned []
[2026-05-27 05:24:11] [INFO ] Invariant cache hit.
[2026-05-27 05:24:14] [INFO ] Implicit Places using invariants and state equation in 3141 ms returned []
Implicit Place search using SMT with State Equation took 3714 ms to find 0 implicit places.
Running 6716 sub problems to find dead transitions.
[2026-05-27 05:24:14] [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/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6716 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 142/6860 variables, and 7 constraints, problems are : Problem set: 0 solved, 6716 unsolved in 30387 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/143 constraints, PredecessorRefiner: 6716/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6716 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6716 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 142/6860 variables, and 7 constraints, problems are : Problem set: 0 solved, 6716 unsolved in 30226 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/143 constraints, PredecessorRefiner: 6608/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72383ms problems are : Problem set: 0 solved, 6716 unsolved
Search for dead transitions found 0 dead transitions in 72496ms
Starting structural reductions in LTL mode, iteration 1 : 143/243 places, 6717/6817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76550 ms. Remains : 143/243 places, 6717/6817 transitions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Applied a total of 0 rules in 56 ms. Remains 143 /143 variables (removed 0) and now considering 6717/6717 (removed 0) transitions.
[2026-05-27 05:25:27] [INFO ] Invariant cache hit.
[2026-05-27 05:25:27] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-27 05:25:27] [INFO ] Invariant cache hit.
[2026-05-27 05:25:30] [INFO ] Implicit Places using invariants and state equation in 2903 ms returned []
Implicit Place search using SMT with State Equation took 3046 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3106 ms. Remains : 143/143 places, 6717/6717 transitions.
Support contains 48 out of 143 places after structural reductions.
[2026-05-27 05:25:32] [INFO ] Flatten gal took : 1392 ms
[2026-05-27 05:25:32] [INFO ] Flatten gal took : 720 ms
[2026-05-27 05:25:34] [INFO ] Input system was already deterministic with 6717 transitions.
Reduction of identical properties reduced properties to check from 44 to 43
RANDOM walk for 40000 steps (8 resets) in 4675 ms. (8 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 42/42 properties
Interrupted probabilistic random walk after 66422 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 42
Probabilistic random walk after 66422 steps, saw 39417 distinct states, run finished after 3008 ms. (steps per millisecond=22 ) properties seen :0
[2026-05-27 05:25:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/72 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 39/111 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 41 unsolved
SMT process timed out in 5772ms, After SMT, problems are : Problem set: 1 solved, 41 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Graph (trivial) has 74 edges and 143 vertex of which 4 / 143 are part of one of the 2 SCC in 11 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 141 transition count 6700
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 128 transition count 6700
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 27 place count 128 transition count 6685
Deduced a syphon composed of 15 places in 5 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 57 place count 113 transition count 6685
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 111 transition count 6668
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 111 transition count 6668
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 111 transition count 6666
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 113 place count 86 transition count 6641
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 117 place count 84 transition count 6660
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 84 transition count 6659
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 84 transition count 6654
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 130 place count 79 transition count 6652
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 143 place count 79 transition count 6639
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 145 place count 79 transition count 6639
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 152 place count 79 transition count 6639
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 159 place count 79 transition count 6632
Applied a total of 159 rules in 12133 ms. Remains 79 /143 variables (removed 64) and now considering 6632/6717 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12134 ms. Remains : 79/143 places, 6632/6717 transitions.
RANDOM walk for 40000 steps (8 resets) in 3024 ms. (13 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 40/40 properties
Interrupted probabilistic random walk after 136803 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 40
Probabilistic random walk after 136803 steps, saw 22788 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) 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-2286554855691064978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6808903212392536794.kers'
[2026-05-27 05:26:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2286554855691064978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6808903212392536794.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 33 ms.
// Phase 1: matrix 6632 rows 78 cols 113964 entries
Finished phase 1 with 56 SingleSign rule and 3 generalized
[2026-05-27 05:26:01] [INFO ] Computed 20 invariants in 116 ms
Computed 20 P flows in 117 ms.
Exported basis to /tmp/petrispot-output-6808903212392536794.kers
Total runtime 135 ms.
[2026-05-27 05:26:01] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 7/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 7/60 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 19/79 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 6632/6711 variables, 79/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6711 variables, 32/131 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
No progress, stopping.
After SMT solving in domain Real declared 6711/6711 variables, and 131 constraints, problems are : Problem set: 0 solved, 40 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 40/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 7/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 7/60 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 19/79 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 6632/6711 variables, 79/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6711 variables, 32/131 constraints. Problems are: Problem set: 0 solved, 40 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 Int declared 6711/6711 variables, and 131 constraints, problems are : Problem set: 0 solved, 40 unsolved in 45024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 40/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90359ms problems are : Problem set: 0 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 6632/6632 transitions.
Applied a total of 0 rules in 1680 ms. Remains 79 /79 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1681 ms. Remains : 79/79 places, 6632/6632 transitions.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 19 stabilizing places and 19 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(G((G(p2)||p1)))&&(G(p4)||p3))))'
Support contains 23 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 5988
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 5988
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 141 transition count 4530
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 141 transition count 4530
Applied a total of 4 rules in 124 ms. Remains 141 /143 variables (removed 2) and now considering 4530/6717 (removed 2187) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10000966985187023931.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9492074272272086193.kers'
[2026-05-27 05:27:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10000966985187023931.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9492074272272086193.kers]
Culled 0 columns in 12 ms.
// Phase 1: matrix 4530 rows 141 cols 76334 entries
Finished phase 1 with 118 SingleSign rule and 3 generalized
[2026-05-27 05:27:33] [INFO ] Computed 20 invariants in 48 ms
Computed 20 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-9492074272272086193.kers
Total runtime 60 ms.
[2026-05-27 05:27:35] [INFO ] Implicit Places using invariants in 1500 ms returned []
[2026-05-27 05:27:35] [INFO ] Invariant cache hit.
[2026-05-27 05:27:39] [INFO ] Implicit Places using invariants and state equation in 4021 ms returned []
Implicit Place search using SMT with State Equation took 5533 ms to find 0 implicit places.
Running 4529 sub problems to find dead transitions.
[2026-05-27 05:27:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4529 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 140/4671 variables, and 7 constraints, problems are : Problem set: 0 solved, 4529 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 4529/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4529 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4529 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 140/4671 variables, and 7 constraints, problems are : Problem set: 0 solved, 4529 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 4421/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67714ms problems are : Problem set: 0 solved, 4529 unsolved
Search for dead transitions found 0 dead transitions in 67750ms
Starting structural reductions in LTL mode, iteration 1 : 141/143 places, 4530/6717 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73469 ms. Remains : 141/143 places, 4530/6717 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((X(G((G(p1)||p0)))&&p2&&(G(p4)||p3))))'
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (NOT p4), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 2092 ms.
Product exploration explored 100000 steps with 0 reset in 2247 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 21 factoid took 112 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter sensitive) to 4 states, 9 edges and 5 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (8 resets) in 2395 ms. (16 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 387 ms. (103 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2014 ms. (19 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 103701 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 8
Probabilistic random walk after 103701 steps, saw 58910 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2026-05-27 05:28:56] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 36/59 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 39/98 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 43/141 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 4530/4671 variables, 141/161 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4671 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/4671 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4671/4671 variables, and 161 constraints, problems are : Problem set: 1 solved, 7 unsolved in 4396 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 36/59 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 39/98 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem apf6 is UNSAT
At refinement iteration 5 (OVERLAPS) 43/141 variables, 7/20 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4530/4671 variables, 141/161 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4671 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 6 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 Int declared 4671/4671 variables, and 161 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9489ms problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 4530/4530 transitions.
Graph (trivial) has 89 edges and 141 vertex of which 4 / 141 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 139 transition count 4513
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 126 transition count 4513
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 27 place count 126 transition count 4497
Deduced a syphon composed of 16 places in 9 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 59 place count 110 transition count 4497
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 108 transition count 4480
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 108 transition count 4480
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 108 transition count 4478
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 129 place count 76 transition count 4446
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 74 transition count 4469
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 74 transition count 4466
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 148 place count 74 transition count 4454
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 162 place count 62 transition count 4452
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 182 place count 62 transition count 4432
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 183 place count 62 transition count 4432
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 187 place count 62 transition count 4432
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 191 place count 62 transition count 4428
Applied a total of 191 rules in 8605 ms. Remains 62 /141 variables (removed 79) and now considering 4428/4530 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8605 ms. Remains : 62/141 places, 4428/4530 transitions.
RANDOM walk for 40000 steps (8 resets) in 2935 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 327 ms. (121 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 365 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 180344 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 6
Probabilistic random walk after 180344 steps, saw 29360 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2026-05-27 05:29:19] [INFO ] Flow matrix only has 4425 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1685188339167535231.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8640579533595799308.kers'
[2026-05-27 05:29:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1685188339167535231.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8640579533595799308.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 11 ms.
// Phase 1: matrix 4425 rows 61 cols 73096 entries
Finished phase 1 with 39 SingleSign rule and 3 generalized
[2026-05-27 05:29:19] [INFO ] Computed 20 invariants in 43 ms
Computed 20 P flows in 43 ms.
Exported basis to /tmp/petrispot-output-8640579533595799308.kers
Total runtime 53 ms.
[2026-05-27 05:29:19] [INFO ] State equation strengthened by 1489 read => feed constraints.
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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 7/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 18/62 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4425/4487 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4487 variables, 1489/1571 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4487 variables, 0/1571 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/4487 variables, 0/1571 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4487/4487 variables, and 1571 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3321 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 62/62 constraints, ReadFeed: 1489/1489 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 7/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 18/62 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4425/4487 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4487 variables, 1489/1571 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4487 variables, 0/1571 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/4487 variables, 0/1571 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4487/4487 variables, and 1571 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7333 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 62/62 constraints, ReadFeed: 1489/1489 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10768ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 4 properties in 1906 ms.
Support contains 14 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 4428/4428 transitions.
Graph (trivial) has 16 edges and 62 vertex of which 2 / 62 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 61 transition count 4422
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 57 transition count 4422
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 56 transition count 4421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 55 transition count 2959
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 55 transition count 2959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 55 transition count 2958
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 52 transition count 2958
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 52 transition count 2955
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 52 transition count 2954
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 51 transition count 2953
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 50 transition count 2953
Applied a total of 26 rules in 2701 ms. Remains 50 /62 variables (removed 12) and now considering 2953/4428 (removed 1475) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2702 ms. Remains : 50/62 places, 2953/4428 transitions.
RANDOM walk for 40000 steps (8 resets) in 2497 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 214205 steps, run visited all 2 properties in 2883 ms. (steps per millisecond=74 )
Probabilistic random walk after 214205 steps, saw 35534 distinct states, run finished after 2888 ms. (steps per millisecond=74 ) properties seen :2
Found 2 invariant AP formulas.
Negative knowledge disproves property using: (G p2)
Knowledge based reduction with 23 factoid took 59 ms. Proved property starting from automaton with 4 states, 9 edges and 5 AP (stutter insensitive
Knowledge-based reduction took 46574 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLFireability-00 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-00 finished in 124949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (F(p1)&&(p2||X(X(p3))))))'
Support contains 19 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 129 transition count 4531
Ensure Unique test removed 7 places
Iterating global reduction 0 with 21 rules applied. Total rules applied 35 place count 122 transition count 4531
Applied a total of 35 rules in 139 ms. Remains 122 /143 variables (removed 21) and now considering 4531/6717 (removed 2186) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5203985015801480098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5606764598979736052.kers'
[2026-05-27 05:29:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5203985015801480098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5606764598979736052.kers]
Culled 0 columns in 13 ms.
// Phase 1: matrix 4531 rows 122 cols 48641 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-27 05:29:38] [INFO ] Computed 13 invariants in 54 ms
Computed 13 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-5606764598979736052.kers
Total runtime 64 ms.
[2026-05-27 05:29:39] [INFO ] Implicit Places using invariants in 656 ms returned []
[2026-05-27 05:29:39] [INFO ] Invariant cache hit.
[2026-05-27 05:29:41] [INFO ] Implicit Places using invariants and state equation in 2000 ms returned []
Implicit Place search using SMT with State Equation took 2658 ms to find 0 implicit places.
Running 4530 sub problems to find dead transitions.
[2026-05-27 05:29:41] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/4653 variables, and 0 constraints, problems are : Problem set: 0 solved, 4530 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/122 constraints, PredecessorRefiner: 4530/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4530 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/4653 variables, and 0 constraints, problems are : Problem set: 0 solved, 4530 unsolved in 30131 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/122 constraints, PredecessorRefiner: 4414/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68853ms problems are : Problem set: 0 solved, 4530 unsolved
Search for dead transitions found 0 dead transitions in 68880ms
Starting structural reductions in LTL mode, iteration 1 : 122/143 places, 4531/6717 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71692 ms. Remains : 122/143 places, 4531/6717 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (F(p1)&&(X(X(p2))||p3))))'
Stuttering acceptance computed with spot in 515 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 2737 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 1 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-02 finished in 75029 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||G(p1)))))'
Support contains 17 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Graph (trivial) has 89 edges and 143 vertex of which 4 / 143 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 140 transition count 6702
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 128 transition count 6702
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 25 place count 128 transition count 6687
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 55 place count 113 transition count 6687
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 64 place count 104 transition count 4611
Iterating global reduction 2 with 9 rules applied. Total rules applied 73 place count 104 transition count 4611
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 104 transition count 4609
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 78 place count 101 transition count 1531
Iterating global reduction 3 with 3 rules applied. Total rules applied 81 place count 101 transition count 1531
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 100 transition count 1529
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 100 transition count 1529
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 149 place count 67 transition count 1496
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 153 place count 65 transition count 1507
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 65 transition count 1505
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 160 place count 65 transition count 1505
Applied a total of 160 rules in 1349 ms. Remains 65 /143 variables (removed 78) and now considering 1505/6717 (removed 5212) transitions.
[2026-05-27 05:30:55] [INFO ] Flow matrix only has 1486 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12793159648653297931.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11050825499745628944.kers'
[2026-05-27 05:30:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12793159648653297931.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11050825499745628944.kers]
Normalized transition count is 1485 out of 1486 initially.
Culled 0 columns in 4 ms.
// Phase 1: matrix 1485 rows 65 cols 24354 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-05-27 05:30:55] [INFO ] Computed 20 invariants in 15 ms
Computed 20 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-11050825499745628944.kers
Total runtime 19 ms.
[2026-05-27 05:30:55] [INFO ] Implicit Places using invariants in 352 ms returned []
[2026-05-27 05:30:55] [INFO ] Flow matrix only has 1486 transitions (discarded 19 similar events)
[2026-05-27 05:30:55] [INFO ] Invariant cache hit.
[2026-05-27 05:30:55] [INFO ] State equation strengthened by 659 read => feed constraints.
[2026-05-27 05:30:56] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
[2026-05-27 05:30:56] [INFO ] Redundant transitions in 208 ms returned []
Running 1503 sub problems to find dead transitions.
[2026-05-27 05:30:56] [INFO ] Flow matrix only has 1486 transitions (discarded 19 similar events)
[2026-05-27 05:30:56] [INFO ] Invariant cache hit.
[2026-05-27 05:30:56] [INFO ] State equation strengthened by 659 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1503 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 65/1551 variables, and 20 constraints, problems are : Problem set: 0 solved, 1503 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/65 constraints, ReadFeed: 0/659 constraints, PredecessorRefiner: 1503/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1503 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1503 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 65/1551 variables, and 20 constraints, problems are : Problem set: 0 solved, 1503 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/65 constraints, ReadFeed: 0/659 constraints, PredecessorRefiner: 1462/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62468ms problems are : Problem set: 0 solved, 1503 unsolved
Search for dead transitions found 0 dead transitions in 62476ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/143 places, 1505/6717 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65607 ms. Remains : 65/143 places, 1505/6717 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||p1))))'
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 1607 ms.
Product exploration explored 100000 steps with 0 reset in 1413 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 9 factoid took 55 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 1658 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 136 ms. (291 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 365499 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 4
Probabilistic random walk after 365499 steps, saw 65858 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2026-05-27 05:32:06] [INFO ] Flow matrix only has 1486 transitions (discarded 19 similar events)
[2026-05-27 05:32:06] [INFO ] Invariant cache hit.
[2026-05-27 05:32:06] [INFO ] State equation strengthened by 659 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 15/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/65 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1485/1550 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1550 variables, 658/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1550 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/1551 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1551 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1551 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1551/1551 variables, and 744 constraints, problems are : Problem set: 0 solved, 4 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 65/65 constraints, ReadFeed: 659/659 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 15/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/65 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1485/1550 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1550 variables, 658/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1550 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/1551 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1551 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1551 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1551/1551 variables, and 744 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1531 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 65/65 constraints, ReadFeed: 659/659 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2527ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=9 )
Parikh walk visited 4 properties in 61 ms.
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 6589 ms.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 17 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 1505/1505 transitions.
Applied a total of 0 rules in 127 ms. Remains 65 /65 variables (removed 0) and now considering 1505/1505 (removed 0) transitions.
[2026-05-27 05:32:09] [INFO ] Flow matrix only has 1486 transitions (discarded 19 similar events)
[2026-05-27 05:32:09] [INFO ] Invariant cache hit.
[2026-05-27 05:32:09] [INFO ] Implicit Places using invariants in 349 ms returned []
[2026-05-27 05:32:09] [INFO ] Flow matrix only has 1486 transitions (discarded 19 similar events)
[2026-05-27 05:32:09] [INFO ] Invariant cache hit.
[2026-05-27 05:32:10] [INFO ] State equation strengthened by 659 read => feed constraints.
[2026-05-27 05:32:10] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
[2026-05-27 05:32:10] [INFO ] Redundant transitions in 58 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1591 ms. Remains : 65/65 places, 1505/1505 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 9 factoid took 52 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 820 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 321782 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 4
Probabilistic random walk after 321782 steps, saw 61074 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2026-05-27 05:32:14] [INFO ] Flow matrix only has 1486 transitions (discarded 19 similar events)
[2026-05-27 05:32:14] [INFO ] Invariant cache hit.
[2026-05-27 05:32:14] [INFO ] State equation strengthened by 659 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 15/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/65 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1485/1550 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1550 variables, 658/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1550 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/1551 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1551 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1551 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1551/1551 variables, and 744 constraints, problems are : Problem set: 0 solved, 4 unsolved in 987 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 65/65 constraints, ReadFeed: 659/659 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 15/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/65 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1485/1550 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1550 variables, 658/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1550 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/1551 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1551 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1551 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1551/1551 variables, and 744 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1842 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 65/65 constraints, ReadFeed: 659/659 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2848ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 4 properties in 92 ms.
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 6662 ms.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1541 ms.
Product exploration explored 100000 steps with 0 reset in 1209 ms.
Built C files in :
/tmp/ltsmin4396911542276929593
[2026-05-27 05:32:20] [INFO ] Too many transitions (1505) to apply POR reductions. Disabling POR matrices.
[2026-05-27 05:32:20] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4396911542276929593
Running compilation step : cd /tmp/ltsmin4396911542276929593;'/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/ltsmin4396911542276929593;'/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/ltsmin4396911542276929593;'/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 17 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 1505/1505 transitions.
Applied a total of 0 rules in 159 ms. Remains 65 /65 variables (removed 0) and now considering 1505/1505 (removed 0) transitions.
[2026-05-27 05:32:23] [INFO ] Flow matrix only has 1486 transitions (discarded 19 similar events)
[2026-05-27 05:32:23] [INFO ] Invariant cache hit.
[2026-05-27 05:32:24] [INFO ] Implicit Places using invariants in 446 ms returned []
[2026-05-27 05:32:24] [INFO ] Flow matrix only has 1486 transitions (discarded 19 similar events)
[2026-05-27 05:32:24] [INFO ] Invariant cache hit.
[2026-05-27 05:32:24] [INFO ] State equation strengthened by 659 read => feed constraints.
[2026-05-27 05:32:25] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
[2026-05-27 05:32:25] [INFO ] Redundant transitions in 66 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1672 ms. Remains : 65/65 places, 1505/1505 transitions.
Built C files in :
/tmp/ltsmin16828533842372844023
[2026-05-27 05:32:25] [INFO ] Too many transitions (1505) to apply POR reductions. Disabling POR matrices.
[2026-05-27 05:32:25] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16828533842372844023
Running compilation step : cd /tmp/ltsmin16828533842372844023;'/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/ltsmin16828533842372844023;'/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/ltsmin16828533842372844023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 05:32:29] [INFO ] Flatten gal took : 261 ms
[2026-05-27 05:32:29] [INFO ] Flatten gal took : 163 ms
[2026-05-27 05:32:29] [INFO ] Time to serialize gal into /tmp/LTL17853592849168991838.gal : 69 ms
[2026-05-27 05:32:29] [INFO ] Time to serialize properties into /tmp/LTL17080479097392319809.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/LTL17853592849168991838.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16321270819501217079.hoa' '-atoms' '/tmp/LTL17080479097392319809.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17080479097392319809.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16321270819501217079.hoa
Detected timeout of ITS tools.
[2026-05-27 05:32:45] [INFO ] Flatten gal took : 171 ms
[2026-05-27 05:32:45] [INFO ] Flatten gal took : 174 ms
[2026-05-27 05:32:45] [INFO ] Time to serialize gal into /tmp/LTL11236255481014975414.gal : 39 ms
[2026-05-27 05:32:45] [INFO ] Time to serialize properties into /tmp/LTL7431711406167211350.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/LTL11236255481014975414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7431711406167211350.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 : !((G(F((G("((((((p24==0)||(p43==0))||((p52==0)||(p81==0)))||(((p100==0)||(p109==0))||((p138==0)||(p178==0))))||(p237==0))&&((((p23==0)...362
Formula 0 simplified : G(F!"((((((p24==0)||(p43==0))||((p52==0)||(p81==0)))||(((p100==0)||(p109==0))||((p138==0)||(p178==0))))||(p237==0))&&((((p23==0)||(p...355
Detected timeout of ITS tools.
[2026-05-27 05:33:00] [INFO ] Flatten gal took : 160 ms
[2026-05-27 05:33:00] [INFO ] Applying decomposition
[2026-05-27 05:33:00] [INFO ] Flatten gal took : 171 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/graph9857496459081853924.txt' '-o' '/tmp/graph9857496459081853924.bin' '-w' '/tmp/graph9857496459081853924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9857496459081853924.bin' '-l' '-1' '-v' '-w' '/tmp/graph9857496459081853924.weights' '-q' '0' '-e' '0.001'
[2026-05-27 05:33:01] [INFO ] Decomposing Gal with order
[2026-05-27 05:33:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 05:33:01] [INFO ] Removed a total of 12985 redundant transitions.
[2026-05-27 05:33:02] [INFO ] Flatten gal took : 737 ms
[2026-05-27 05:33:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 155 ms.
[2026-05-27 05:33:02] [INFO ] Time to serialize gal into /tmp/LTL11722114832337151719.gal : 14 ms
[2026-05-27 05:33:02] [INFO ] Time to serialize properties into /tmp/LTL13244956222124113724.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/LTL11722114832337151719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13244956222124113724.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...256
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((((((i3.u1.p24==0)||(i0.u2.p43==0))||((i3.u4.p52==0)||(i3.u6.p81==0)))||(((i3.u9.p100==0)||(i3.u17.p109==0))||((i3.u11.p13...529
Formula 0 simplified : G(F!"((((((i3.u1.p24==0)||(i0.u2.p43==0))||((i3.u4.p52==0)||(i3.u6.p81==0)))||(((i3.u9.p100==0)||(i3.u17.p109==0))||((i3.u11.p138==0...522
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-03 finished in 143714 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((F(((p1 U p2)&&p0)) U X(p1)))))'
Support contains 24 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Graph (trivial) has 89 edges and 143 vertex of which 4 / 143 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 140 transition count 6702
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 128 transition count 6702
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 25 place count 128 transition count 6687
Deduced a syphon composed of 15 places in 6 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 55 place count 113 transition count 6687
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 111 transition count 6670
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 111 transition count 6670
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 111 transition count 6668
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 129 place count 77 transition count 6634
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 76 transition count 6645
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 76 transition count 6645
Applied a total of 137 rules in 4936 ms. Remains 76 /143 variables (removed 67) and now considering 6645/6717 (removed 72) transitions.
[2026-05-27 05:33:22] [INFO ] Flow matrix only has 6626 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13696041797664101951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1084038249895568496.kers'
[2026-05-27 05:33:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13696041797664101951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1084038249895568496.kers]
Normalized transition count is 6625 out of 6626 initially.
Culled 0 columns in 18 ms.
// Phase 1: matrix 6625 rows 76 cols 109642 entries
Finished phase 1 with 53 SingleSign rule and 3 generalized
[2026-05-27 05:33:22] [INFO ] Computed 20 invariants in 69 ms
Computed 20 P flows in 69 ms.
Exported basis to /tmp/petrispot-output-1084038249895568496.kers
Total runtime 85 ms.
[2026-05-27 05:33:24] [INFO ] Implicit Places using invariants in 1968 ms returned []
[2026-05-27 05:33:24] [INFO ] Flow matrix only has 6626 transitions (discarded 19 similar events)
[2026-05-27 05:33:24] [INFO ] Invariant cache hit.
[2026-05-27 05:33:26] [INFO ] State equation strengthened by 2198 read => feed constraints.
[2026-05-27 05:33:29] [INFO ] Implicit Places using invariants and state equation in 5262 ms returned []
Implicit Place search using SMT with State Equation took 7243 ms to find 0 implicit places.
[2026-05-27 05:33:30] [INFO ] Redundant transitions in 1279 ms returned []
Running 6643 sub problems to find dead transitions.
[2026-05-27 05:33:30] [INFO ] Flow matrix only has 6626 transitions (discarded 19 similar events)
[2026-05-27 05:33:30] [INFO ] Invariant cache hit.
[2026-05-27 05:33:30] [INFO ] State equation strengthened by 2198 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 75/6702 variables, and 7 constraints, problems are : Problem set: 0 solved, 6643 unsolved in 30189 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/76 constraints, ReadFeed: 0/2198 constraints, PredecessorRefiner: 6643/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 75/6702 variables, and 7 constraints, problems are : Problem set: 0 solved, 6643 unsolved in 30192 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/76 constraints, ReadFeed: 0/2198 constraints, PredecessorRefiner: 6609/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72045ms problems are : Problem set: 0 solved, 6643 unsolved
Search for dead transitions found 0 dead transitions in 72070ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/143 places, 6645/6717 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85556 ms. Remains : 76/143 places, 6645/6717 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((F(((p1 U p2)&&p0)) U X(p1)))))'
Stuttering acceptance computed with spot in 353 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-04 finished in 86001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 17 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Graph (trivial) has 89 edges and 143 vertex of which 4 / 143 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 140 transition count 6702
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 128 transition count 6702
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 25 place count 128 transition count 6687
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 55 place count 113 transition count 6687
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 64 place count 104 transition count 4611
Iterating global reduction 2 with 9 rules applied. Total rules applied 73 place count 104 transition count 4611
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 104 transition count 4609
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 102 transition count 2179
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 102 transition count 2179
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 101 transition count 2177
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 101 transition count 2177
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 147 place count 68 transition count 2144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 66 transition count 2155
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 66 transition count 2154
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 157 place count 66 transition count 2154
Applied a total of 157 rules in 1177 ms. Remains 66 /143 variables (removed 77) and now considering 2154/6717 (removed 4563) transitions.
[2026-05-27 05:34:44] [INFO ] Flow matrix only has 2135 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1885145383466632025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4044058563118169110.kers'
[2026-05-27 05:34:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1885145383466632025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4044058563118169110.kers]
Normalized transition count is 2134 out of 2135 initially.
Culled 0 columns in 5 ms.
// Phase 1: matrix 2134 rows 66 cols 35378 entries
Finished phase 1 with 44 SingleSign rule and 2 generalized
[2026-05-27 05:34:44] [INFO ] Computed 20 invariants in 20 ms
Computed 20 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-4044058563118169110.kers
Total runtime 26 ms.
[2026-05-27 05:34:45] [INFO ] Implicit Places using invariants in 508 ms returned []
[2026-05-27 05:34:45] [INFO ] Flow matrix only has 2135 transitions (discarded 19 similar events)
[2026-05-27 05:34:45] [INFO ] Invariant cache hit.
[2026-05-27 05:34:45] [INFO ] State equation strengthened by 983 read => feed constraints.
[2026-05-27 05:34:47] [INFO ] Implicit Places using invariants and state equation in 2030 ms returned []
Implicit Place search using SMT with State Equation took 2547 ms to find 0 implicit places.
[2026-05-27 05:34:47] [INFO ] Redundant transitions in 190 ms returned []
Running 2152 sub problems to find dead transitions.
[2026-05-27 05:34:47] [INFO ] Flow matrix only has 2135 transitions (discarded 19 similar events)
[2026-05-27 05:34:47] [INFO ] Invariant cache hit.
[2026-05-27 05:34:47] [INFO ] State equation strengthened by 983 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2152 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 66/2201 variables, and 20 constraints, problems are : Problem set: 0 solved, 2152 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/66 constraints, ReadFeed: 0/983 constraints, PredecessorRefiner: 2152/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2152 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2152 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 66/2201 variables, and 20 constraints, problems are : Problem set: 0 solved, 2152 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/66 constraints, ReadFeed: 0/983 constraints, PredecessorRefiner: 2111/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63613ms problems are : Problem set: 0 solved, 2152 unsolved
Search for dead transitions found 0 dead transitions in 63625ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/143 places, 2154/6717 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67567 ms. Remains : 66/143 places, 2154/6717 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-05 finished in 67654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(X(G(p1)))&&(p1||X(p2))))))'
Support contains 22 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 129 transition count 4531
Ensure Unique test removed 7 places
Iterating global reduction 0 with 21 rules applied. Total rules applied 35 place count 122 transition count 4531
Applied a total of 35 rules in 87 ms. Remains 122 /143 variables (removed 21) and now considering 4531/6717 (removed 2186) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9959361009963040790.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2851262628898128161.kers'
[2026-05-27 05:35:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9959361009963040790.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2851262628898128161.kers]
Culled 0 columns in 13 ms.
// Phase 1: matrix 4531 rows 122 cols 48641 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-27 05:35:51] [INFO ] Computed 13 invariants in 59 ms
Computed 13 P flows in 61 ms.
Exported basis to /tmp/petrispot-output-2851262628898128161.kers
Total runtime 73 ms.
[2026-05-27 05:35:51] [INFO ] Implicit Places using invariants in 358 ms returned []
[2026-05-27 05:35:51] [INFO ] Invariant cache hit.
[2026-05-27 05:35:53] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
Running 4530 sub problems to find dead transitions.
[2026-05-27 05:35:53] [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 121/4653 variables, and 0 constraints, problems are : Problem set: 0 solved, 4530 unsolved in 30131 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/122 constraints, PredecessorRefiner: 4530/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4530 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/4653 variables, and 0 constraints, problems are : Problem set: 0 solved, 4530 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/122 constraints, PredecessorRefiner: 4414/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68252ms problems are : Problem set: 0 solved, 4530 unsolved
Search for dead transitions found 0 dead transitions in 68273ms
Starting structural reductions in LTL mode, iteration 1 : 122/143 places, 4531/6717 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70419 ms. Remains : 122/143 places, 4531/6717 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(X(G(p1)))&&(p1||X(p2))))))'
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-06 finished in 70837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p0)))))'
Support contains 8 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 4658
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 4658
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 129 transition count 540
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 129 transition count 540
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 126 transition count 534
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 126 transition count 534
Applied a total of 34 rules in 382 ms. Remains 126 /143 variables (removed 17) and now considering 534/6717 (removed 6183) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11094836772065646570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10984068490226578145.kers'
[2026-05-27 05:37:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11094836772065646570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10984068490226578145.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 534 rows 126 cols 7162 entries
Finished phase 1 with 104 SingleSign rule and 2 generalized
[2026-05-27 05:37:02] [INFO ] Computed 20 invariants in 8 ms
Computed 20 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10984068490226578145.kers
Total runtime 10 ms.
[2026-05-27 05:37:02] [INFO ] Implicit Places using invariants in 285 ms returned []
[2026-05-27 05:37:02] [INFO ] Invariant cache hit.
[2026-05-27 05:37:03] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2026-05-27 05:37:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 534/660 variables, 126/148 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/660 variables, and 150 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 533/131 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 534/660 variables, 126/151 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 131/282 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/660 variables, and 282 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 533/131 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60571ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60573ms
Starting structural reductions in LTL mode, iteration 1 : 126/143 places, 534/6717 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61738 ms. Remains : 126/143 places, 534/6717 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((X(X(p0))||p0)))'
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-07 finished in 61898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(F(p1))&&p0))||X(p2))))'
Support contains 24 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 4658
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 4658
Applied a total of 14 rules in 64 ms. Remains 136 /143 variables (removed 7) and now considering 4658/6717 (removed 2059) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16948099402748334449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8064791011644308956.kers'
[2026-05-27 05:38:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16948099402748334449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8064791011644308956.kers]
Culled 0 columns in 14 ms.
// Phase 1: matrix 4658 rows 136 cols 81298 entries
Finished phase 1 with 114 SingleSign rule and 2 generalized
[2026-05-27 05:38:03] [INFO ] Computed 20 invariants in 50 ms
Computed 20 P flows in 51 ms.
Exported basis to /tmp/petrispot-output-8064791011644308956.kers
Total runtime 63 ms.
[2026-05-27 05:38:04] [INFO ] Implicit Places using invariants in 673 ms returned []
[2026-05-27 05:38:04] [INFO ] Invariant cache hit.
[2026-05-27 05:38:07] [INFO ] Implicit Places using invariants and state equation in 2843 ms returned []
Implicit Place search using SMT with State Equation took 3517 ms to find 0 implicit places.
Running 4657 sub problems to find dead transitions.
[2026-05-27 05:38:07] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4657 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/4794 variables, and 7 constraints, problems are : Problem set: 0 solved, 4657 unsolved in 30136 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/136 constraints, PredecessorRefiner: 4657/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4657 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4657 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/4794 variables, and 7 constraints, problems are : Problem set: 0 solved, 4657 unsolved in 30138 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/136 constraints, PredecessorRefiner: 4541/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67131ms problems are : Problem set: 0 solved, 4657 unsolved
Search for dead transitions found 0 dead transitions in 67149ms
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 4658/6717 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70743 ms. Remains : 136/143 places, 4658/6717 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((X(F(p1))&&p0))||X(p2))))'
Stuttering acceptance computed with spot in 333 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 2603 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 1 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-08 finished in 73741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1&&G(p2)&&F(p3)))&&p0)))'
Support contains 21 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 4658
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 4658
Applied a total of 14 rules in 62 ms. Remains 136 /143 variables (removed 7) and now considering 4658/6717 (removed 2059) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10939618626196009381.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10038590220917300829.kers'
[2026-05-27 05:39:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10939618626196009381.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10038590220917300829.kers]
Culled 0 columns in 14 ms.
// Phase 1: matrix 4658 rows 136 cols 81298 entries
Finished phase 1 with 114 SingleSign rule and 2 generalized
[2026-05-27 05:39:17] [INFO ] Computed 20 invariants in 48 ms
Computed 20 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-10038590220917300829.kers
Total runtime 61 ms.
[2026-05-27 05:39:18] [INFO ] Implicit Places using invariants in 1134 ms returned []
[2026-05-27 05:39:18] [INFO ] Invariant cache hit.
[2026-05-27 05:39:21] [INFO ] Implicit Places using invariants and state equation in 3056 ms returned []
Implicit Place search using SMT with State Equation took 4193 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 4658/6717 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4255 ms. Remains : 136/143 places, 4658/6717 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1&&G(p2)&&F(p3)))&&p0)))'
Stuttering acceptance computed with spot in 309 ms :[(NOT p2), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (OR (NOT p2) (NOT p3) (NOT p1) (NOT p0)), true]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-09 finished in 4623 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&&(G(p1)||(!p2 U (p3||G(!p2))))))))'
Support contains 22 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Graph (trivial) has 84 edges and 143 vertex of which 4 / 143 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 140 transition count 6702
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 128 transition count 6702
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 25 place count 128 transition count 6688
Deduced a syphon composed of 14 places in 6 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 53 place count 114 transition count 6688
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 105 transition count 4612
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 105 transition count 4612
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 105 transition count 4610
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 137 place count 73 transition count 4578
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 72 transition count 4589
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 72 transition count 4589
Applied a total of 147 rules in 967 ms. Remains 72 /143 variables (removed 71) and now considering 4589/6717 (removed 2128) transitions.
[2026-05-27 05:39:23] [INFO ] Flow matrix only has 4570 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12203065445773555183.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-624940657635046332.kers'
[2026-05-27 05:39:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12203065445773555183.kers, --Pflows, --basisKERS=/tmp/petrispot-output-624940657635046332.kers]
Normalized transition count is 4569 out of 4570 initially.
Culled 0 columns in 13 ms.
// Phase 1: matrix 4569 rows 72 cols 81078 entries
Finished phase 1 with 50 SingleSign rule and 2 generalized
[2026-05-27 05:39:23] [INFO ] Computed 20 invariants in 43 ms
Computed 20 P flows in 43 ms.
Exported basis to /tmp/petrispot-output-624940657635046332.kers
Total runtime 64 ms.
[2026-05-27 05:39:24] [INFO ] Implicit Places using invariants in 972 ms returned []
[2026-05-27 05:39:24] [INFO ] Flow matrix only has 4570 transitions (discarded 19 similar events)
[2026-05-27 05:39:24] [INFO ] Invariant cache hit.
[2026-05-27 05:39:25] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-27 05:39:27] [INFO ] Implicit Places using invariants and state equation in 3244 ms returned []
Implicit Place search using SMT with State Equation took 4218 ms to find 0 implicit places.
[2026-05-27 05:39:28] [INFO ] Redundant transitions in 767 ms returned []
Running 4587 sub problems to find dead transitions.
[2026-05-27 05:39:28] [INFO ] Flow matrix only has 4570 transitions (discarded 19 similar events)
[2026-05-27 05:39:28] [INFO ] Invariant cache hit.
[2026-05-27 05:39:28] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4587 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 71/4642 variables, and 7 constraints, problems are : Problem set: 0 solved, 4587 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/72 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 4587/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4587 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4587 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 71/4642 variables, and 7 constraints, problems are : Problem set: 0 solved, 4587 unsolved in 30135 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/72 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 4551/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67502ms problems are : Problem set: 0 solved, 4587 unsolved
Search for dead transitions found 0 dead transitions in 67521ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/143 places, 4589/6717 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73497 ms. Remains : 72/143 places, 4589/6717 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&&(G(p1)||(!p2 U (p3||G(!p2))))))))'
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 3717 ms.
Product exploration explored 100000 steps with 0 reset in 3346 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 25 factoid took 63 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter insensitive) to 3 states, 11 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 2096 ms. (19 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 388 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 278 ms. (143 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 417 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 347 ms. (114 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 412 ms. (96 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 291 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 118857 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 12
Probabilistic random walk after 118857 steps, saw 34450 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2026-05-27 05:40:47] [INFO ] Flow matrix only has 4570 transitions (discarded 19 similar events)
[2026-05-27 05:40:47] [INFO ] Invariant cache hit.
[2026-05-27 05:40:47] [INFO ] State equation strengthened by 11 read => feed constraints.
Problem apf4 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/54 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 12/66 variables, 4/14 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 6/72 variables, 6/20 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 4569/4641 variables, 72/92 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4641 variables, 10/102 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4641 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/4642 variables, 1/103 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4642 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/4642 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4642/4642 variables, and 103 constraints, problems are : Problem set: 2 solved, 10 unsolved in 4138 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 32/54 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 12/66 variables, 4/14 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 6/72 variables, 6/20 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 4569/4641 variables, 72/92 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4641 variables, 10/102 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4641/4642 variables, and 102 constraints, problems are : Problem set: 2 solved, 10 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9202ms problems are : Problem set: 2 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 4589/4589 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 4587
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 13 place count 72 transition count 4576
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 61 transition count 4574
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 53 place count 61 transition count 4547
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 61 transition count 4546
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 61 place count 60 transition count 4540
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 60 transition count 4540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 59 transition count 4539
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 67 place count 56 transition count 4539
Applied a total of 67 rules in 1635 ms. Remains 56 /72 variables (removed 16) and now considering 4539/4589 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1636 ms. Remains : 56/72 places, 4539/4589 transitions.
RANDOM walk for 40000 steps (8 resets) in 2632 ms. (15 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 767 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 438 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 420 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 572 ms. (69 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14054287187473441690.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1367264454397555996.kers'
[2026-05-27 05:41:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14054287187473441690.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1367264454397555996.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 13 ms.
// Phase 1: matrix 4539 rows 55 cols 80882 entries
Finished phase 1 with 37 SingleSign rule and 2 generalized
[2026-05-27 05:41:00] [INFO ] Computed 17 invariants in 49 ms
Computed 17 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-1367264454397555996.kers
Total runtime 63 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/35 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19/54 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4537/4591 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4591 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/4595 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4595 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4595 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/4595 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4595/4595 variables, and 73 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3619 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/35 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19/54 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4537/4591 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4591 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/4595 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4595 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4595 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/4595 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4595/4595 variables, and 73 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6228 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9970ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 290 steps, including 15 resets, run visited all 1 properties in 35 ms. (steps per millisecond=8 )
Parikh walk visited 4 properties in 256 ms.
Found 2 invariant AP formulas.
Knowledge based reduction with 27 factoid took 274 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) (AND p2 (NOT p3)))]
Knowledge-based reduction took 27789 ms.
Stuttering acceptance computed with spot in 55 ms :[(OR (NOT p0) (AND p2 (NOT p3)))]
Support contains 22 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 4589/4589 transitions.
Applied a total of 0 rules in 299 ms. Remains 72 /72 variables (removed 0) and now considering 4589/4589 (removed 0) transitions.
[2026-05-27 05:41:11] [INFO ] Flow matrix only has 4570 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13707715586675552351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10085892602832726300.kers'
[2026-05-27 05:41:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13707715586675552351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10085892602832726300.kers]
Normalized transition count is 4569 out of 4570 initially.
Culled 0 columns in 22 ms.
// Phase 1: matrix 4569 rows 72 cols 81078 entries
Finished phase 1 with 50 SingleSign rule and 2 generalized
[2026-05-27 05:41:11] [INFO ] Computed 20 invariants in 73 ms
Computed 20 P flows in 74 ms.
Exported basis to /tmp/petrispot-output-10085892602832726300.kers
Total runtime 93 ms.
[2026-05-27 05:41:12] [INFO ] Implicit Places using invariants in 1211 ms returned []
[2026-05-27 05:41:12] [INFO ] Flow matrix only has 4570 transitions (discarded 19 similar events)
[2026-05-27 05:41:12] [INFO ] Invariant cache hit.
[2026-05-27 05:41:14] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-27 05:41:15] [INFO ] Implicit Places using invariants and state equation in 3562 ms returned []
Implicit Place search using SMT with State Equation took 4776 ms to find 0 implicit places.
[2026-05-27 05:41:16] [INFO ] Redundant transitions in 734 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5818 ms. Remains : 72/72 places, 4589/4589 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 11 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 2547 ms. (15 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 308 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 248 ms. (160 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 136787 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 5
Probabilistic random walk after 136787 steps, saw 38301 distinct states, run finished after 3003 ms. (steps per millisecond=45 ) properties seen :0
[2026-05-27 05:41:20] [INFO ] Flow matrix only has 4570 transitions (discarded 19 similar events)
[2026-05-27 05:41:20] [INFO ] Invariant cache hit.
[2026-05-27 05:41:20] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 32/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 12/66 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/72 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 4569/4641 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4641 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4641 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/4642 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4642 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/4642 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4642/4642 variables, and 103 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3392 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 32/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 12/66 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/72 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 4569/4641 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4641 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4641 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/4642 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4642 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4642/4642 variables, and 103 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8441ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 4589/4589 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 4587
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 13 place count 72 transition count 4576
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 61 transition count 4574
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 53 place count 61 transition count 4547
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 61 transition count 4546
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 61 place count 60 transition count 4540
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 60 transition count 4540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 59 transition count 4539
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 67 place count 56 transition count 4539
Applied a total of 67 rules in 1866 ms. Remains 56 /72 variables (removed 16) and now considering 4539/4589 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1867 ms. Remains : 56/72 places, 4539/4589 transitions.
RANDOM walk for 40000 steps (8 resets) in 3023 ms. (13 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 500 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14196832577967022815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2168029646161696393.kers'
[2026-05-27 05:41:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14196832577967022815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2168029646161696393.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 13 ms.
// Phase 1: matrix 4539 rows 55 cols 80882 entries
Finished phase 1 with 37 SingleSign rule and 2 generalized
[2026-05-27 05:41:32] [INFO ] Computed 17 invariants in 46 ms
Computed 17 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-2168029646161696393.kers
Total runtime 61 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/54 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4537/4591 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4591 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/4595 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4595 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4595 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/4595 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4595/4595 variables, and 73 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3369 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/54 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4537/4591 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4591 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/4595 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4595 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4595 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/4595 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4595/4595 variables, and 73 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3816 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7289ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=2 )
Parikh walk visited 2 properties in 9 ms.
Knowledge based reduction with 11 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p0) (AND p2 (NOT p3)))]
Knowledge-based reduction took 23304 ms.
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) (AND p2 (NOT p3)))]
Stuttering acceptance computed with spot in 55 ms :[(OR (NOT p0) (AND p2 (NOT p3)))]
Product exploration explored 100000 steps with 0 reset in 3581 ms.
Product exploration explored 100000 steps with 0 reset in 3330 ms.
Built C files in :
/tmp/ltsmin3359094101411829649
[2026-05-27 05:41:47] [INFO ] Too many transitions (4589) to apply POR reductions. Disabling POR matrices.
[2026-05-27 05:41:47] [INFO ] Built C files in 171ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3359094101411829649
Running compilation step : cd /tmp/ltsmin3359094101411829649;'/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/ltsmin3359094101411829649;'/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/ltsmin3359094101411829649;'/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 22 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 4589/4589 transitions.
Applied a total of 0 rules in 175 ms. Remains 72 /72 variables (removed 0) and now considering 4589/4589 (removed 0) transitions.
[2026-05-27 05:41:50] [INFO ] Flow matrix only has 4570 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11033231457323455560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2191454135021312181.kers'
[2026-05-27 05:41:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11033231457323455560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2191454135021312181.kers]
Normalized transition count is 4569 out of 4570 initially.
Culled 0 columns in 14 ms.
// Phase 1: matrix 4569 rows 72 cols 81078 entries
Finished phase 1 with 50 SingleSign rule and 2 generalized
[2026-05-27 05:41:50] [INFO ] Computed 20 invariants in 47 ms
Computed 20 P flows in 48 ms.
Exported basis to /tmp/petrispot-output-2191454135021312181.kers
Total runtime 61 ms.
[2026-05-27 05:41:51] [INFO ] Implicit Places using invariants in 974 ms returned []
[2026-05-27 05:41:51] [INFO ] Flow matrix only has 4570 transitions (discarded 19 similar events)
[2026-05-27 05:41:51] [INFO ] Invariant cache hit.
[2026-05-27 05:41:53] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-27 05:41:54] [INFO ] Implicit Places using invariants and state equation in 2916 ms returned []
Implicit Place search using SMT with State Equation took 3893 ms to find 0 implicit places.
[2026-05-27 05:41:55] [INFO ] Redundant transitions in 717 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4791 ms. Remains : 72/72 places, 4589/4589 transitions.
Built C files in :
/tmp/ltsmin10288168348276357951
[2026-05-27 05:41:55] [INFO ] Too many transitions (4589) to apply POR reductions. Disabling POR matrices.
[2026-05-27 05:41:55] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10288168348276357951
Running compilation step : cd /tmp/ltsmin10288168348276357951;'/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/ltsmin10288168348276357951;'/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/ltsmin10288168348276357951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 05:41:59] [INFO ] Flatten gal took : 533 ms
[2026-05-27 05:41:59] [INFO ] Flatten gal took : 551 ms
[2026-05-27 05:41:59] [INFO ] Time to serialize gal into /tmp/LTL14281198836740226347.gal : 87 ms
[2026-05-27 05:41:59] [INFO ] Time to serialize properties into /tmp/LTL6482912586399585509.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/LTL14281198836740226347.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4602510538369004653.hoa' '-atoms' '/tmp/LTL6482912586399585509.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/LTL6482912586399585509.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4602510538369004653.hoa
Detected timeout of ITS tools.
[2026-05-27 05:42:15] [INFO ] Flatten gal took : 680 ms
[2026-05-27 05:42:16] [INFO ] Flatten gal took : 527 ms
[2026-05-27 05:42:16] [INFO ] Time to serialize gal into /tmp/LTL13221992581905721829.gal : 127 ms
[2026-05-27 05:42:16] [INFO ] Time to serialize properties into /tmp/LTL12952643064453778636.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/LTL13221992581905721829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12952643064453778636.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((((p24==0)||(p37==0))||((p56==0)||(p71==0)))||(((p90==0)||(p119==0))||((p128==0)||(p178==0))))||(p237==0))")&&((G("(((((p18...726
Formula 0 simplified : GF(!"(((((p24==0)||(p37==0))||((p56==0)||(p71==0)))||(((p90==0)||(p119==0))||((p128==0)||(p178==0))))||(p237==0))" | (F!"(((((p18==0...592
Detected timeout of ITS tools.
[2026-05-27 05:42:32] [INFO ] Flatten gal took : 609 ms
[2026-05-27 05:42:32] [INFO ] Applying decomposition
[2026-05-27 05:42:32] [INFO ] Flatten gal took : 484 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/graph15425870937281355778.txt' '-o' '/tmp/graph15425870937281355778.bin' '-w' '/tmp/graph15425870937281355778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15425870937281355778.bin' '-l' '-1' '-v' '-w' '/tmp/graph15425870937281355778.weights' '-q' '0' '-e' '0.001'
[2026-05-27 05:42:33] [INFO ] Decomposing Gal with order
[2026-05-27 05:42:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 05:42:34] [INFO ] Removed a total of 40908 redundant transitions.
[2026-05-27 05:42:34] [INFO ] Flatten gal took : 812 ms
[2026-05-27 05:42:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 245 ms.
[2026-05-27 05:42:35] [INFO ] Time to serialize gal into /tmp/LTL7452965235894995267.gal : 6 ms
[2026-05-27 05:42:35] [INFO ] Time to serialize properties into /tmp/LTL153219054282791105.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/LTL7452965235894995267.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL153219054282791105.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...253
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((((i0.u1.p24==0)||(i1.u16.p37==0))||((i1.u3.p56==0)||(i0.u5.p71==0)))||(((i0.u7.p90==0)||(i1.u10.p119==0))||((i1.u11.p128==...1055
Formula 0 simplified : GF(!"(((((i0.u1.p24==0)||(i1.u16.p37==0))||((i1.u3.p56==0)||(i0.u5.p71==0)))||(((i0.u7.p90==0)||(i1.u10.p119==0))||((i1.u11.p128==0)...866
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-10 finished in 208290 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((G((!p0&&X(X(p1)))) U X(X(p2)))))'
Support contains 19 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 129 transition count 4531
Ensure Unique test removed 7 places
Iterating global reduction 0 with 21 rules applied. Total rules applied 35 place count 122 transition count 4531
Applied a total of 35 rules in 128 ms. Remains 122 /143 variables (removed 21) and now considering 4531/6717 (removed 2186) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9132745815619566971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14818142751934304587.kers'
[2026-05-27 05:42:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9132745815619566971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14818142751934304587.kers]
Culled 0 columns in 8 ms.
// Phase 1: matrix 4531 rows 122 cols 48641 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-27 05:42:50] [INFO ] Computed 13 invariants in 34 ms
Computed 13 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-14818142751934304587.kers
Total runtime 47 ms.
[2026-05-27 05:42:51] [INFO ] Implicit Places using invariants in 475 ms returned []
[2026-05-27 05:42:51] [INFO ] Invariant cache hit.
[2026-05-27 05:42:53] [INFO ] Implicit Places using invariants and state equation in 1985 ms returned []
Implicit Place search using SMT with State Equation took 2474 ms to find 0 implicit places.
Running 4530 sub problems to find dead transitions.
[2026-05-27 05:42:53] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/4653 variables, and 0 constraints, problems are : Problem set: 0 solved, 4530 unsolved in 30140 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/122 constraints, PredecessorRefiner: 4530/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4530 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/4653 variables, and 0 constraints, problems are : Problem set: 0 solved, 4530 unsolved in 30133 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/122 constraints, PredecessorRefiner: 4414/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69379ms problems are : Problem set: 0 solved, 4530 unsolved
Search for dead transitions found 0 dead transitions in 69405ms
Starting structural reductions in LTL mode, iteration 1 : 122/143 places, 4531/6717 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72028 ms. Remains : 122/143 places, 4531/6717 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((G((!p0&&X(X(p1)))) U X(X(p2)))))'
Stuttering acceptance computed with spot in 449 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-11 finished in 72555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(p0))) U (p0||G(p1))))'
Support contains 11 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Graph (trivial) has 96 edges and 143 vertex of which 6 / 143 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 139 transition count 6701
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 127 transition count 6701
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 25 place count 127 transition count 6687
Deduced a syphon composed of 14 places in 6 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 53 place count 113 transition count 6687
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 105 transition count 4618
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 105 transition count 4618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 105 transition count 4617
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 77 place count 98 transition count 499
Iterating global reduction 3 with 7 rules applied. Total rules applied 84 place count 98 transition count 499
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 96 transition count 495
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 96 transition count 495
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 160 place count 60 transition count 459
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 164 place count 58 transition count 459
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 169 place count 58 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 57 transition count 453
Applied a total of 170 rules in 787 ms. Remains 57 /143 variables (removed 86) and now considering 453/6717 (removed 6264) transitions.
[2026-05-27 05:44:03] [INFO ] Flow matrix only has 439 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5167704629273952992.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1098943392564114857.kers'
[2026-05-27 05:44:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5167704629273952992.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1098943392564114857.kers]
Normalized transition count is 438 out of 439 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 438 rows 56 cols 6226 entries
Finished phase 1 with 35 SingleSign rule and 2 generalized
[2026-05-27 05:44:03] [INFO ] Computed 20 invariants in 6 ms
Computed 20 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1098943392564114857.kers
Total runtime 8 ms.
[2026-05-27 05:44:04] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-27 05:44:04] [INFO ] Flow matrix only has 439 transitions (discarded 14 similar events)
[2026-05-27 05:44:04] [INFO ] Invariant cache hit.
[2026-05-27 05:44:04] [INFO ] State equation strengthened by 130 read => feed constraints.
[2026-05-27 05:44:04] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
[2026-05-27 05:44:04] [INFO ] Redundant transitions in 8 ms returned []
Running 430 sub problems to find dead transitions.
[2026-05-27 05:44:04] [INFO ] Flow matrix only has 439 transitions (discarded 14 similar events)
[2026-05-27 05:44:04] [INFO ] Invariant cache hit.
[2026-05-27 05:44:04] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 5/57 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (OVERLAPS) 438/495 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 130/207 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 430 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 495/496 variables, and 207 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 57/57 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 430/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 5/57 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (OVERLAPS) 438/495 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 130/207 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/496 variables, and 227 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 57/57 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 430/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60903ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60905ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/143 places, 453/6717 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62596 ms. Remains : 57/143 places, 453/6717 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((X(p0)||p0)) U (G(p1)||p0)))'
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-12 finished in 62750 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(!((X(X(!(X(G(p0)) U p1)))||G(p2)) U p0)))'
Support contains 22 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 141 transition count 5502
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 141 transition count 5502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 140 transition count 4044
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 140 transition count 4044
Applied a total of 6 rules in 146 ms. Remains 140 /143 variables (removed 3) and now considering 4044/6717 (removed 2673) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8400025826430106480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15794831990419735363.kers'
[2026-05-27 05:45:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8400025826430106480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15794831990419735363.kers]
Culled 0 columns in 19 ms.
// Phase 1: matrix 4044 rows 140 cols 68558 entries
Finished phase 1 with 117 SingleSign rule and 3 generalized
[2026-05-27 05:45:06] [INFO ] Computed 20 invariants in 66 ms
Computed 20 P flows in 67 ms.
Exported basis to /tmp/petrispot-output-15794831990419735363.kers
Total runtime 83 ms.
[2026-05-27 05:45:07] [INFO ] Implicit Places using invariants in 1349 ms returned []
[2026-05-27 05:45:07] [INFO ] Invariant cache hit.
[2026-05-27 05:45:10] [INFO ] Implicit Places using invariants and state equation in 2970 ms returned []
Implicit Place search using SMT with State Equation took 4323 ms to find 0 implicit places.
Running 4043 sub problems to find dead transitions.
[2026-05-27 05:45:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4043 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 139/4184 variables, and 7 constraints, problems are : Problem set: 0 solved, 4043 unsolved in 30130 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 4043/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4043 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4043 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 139/4184 variables, and 7 constraints, problems are : Problem set: 0 solved, 4043 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 3935/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66374ms problems are : Problem set: 0 solved, 4043 unsolved
Search for dead transitions found 0 dead transitions in 66398ms
Starting structural reductions in LTL mode, iteration 1 : 140/143 places, 4044/6717 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70884 ms. Remains : 140/143 places, 4044/6717 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(!((X(X(!(X(G(p0)) U p1)))||G(p2)) U p0)))'
Stuttering acceptance computed with spot in 674 ms :[p0, (AND p0 (NOT p1)), (AND p0 p2), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), false, false, false]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 1885 ms.
Product exploration explored 100000 steps with 0 reset in 1849 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 14 factoid took 109 ms. Reduced automaton from 12 states, 34 edges and 3 AP (stutter sensitive) to 12 states, 32 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1375 ms. (29 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 145 ms. (273 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 101729 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 12
Probabilistic random walk after 101729 steps, saw 57730 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2026-05-27 05:46:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem apf2 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
At refinement iteration 1 (OVERLAPS) 36/58 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 39/97 variables, 4/13 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 43/140 variables, 7/20 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 4044/4184 variables, 140/160 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4184 variables, 0/160 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/4184 variables, 0/160 constraints. Problems are: Problem set: 4 solved, 8 unsolved
No progress, stopping.
Error getting values : (error "Timeout of Z3 solver reached")
After SMT solving in domain Real declared 4184/4184 variables, and 160 constraints, problems are : Problem set: 4 solved, 8 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 36/58 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 39/97 variables, 4/14 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 43/140 variables, 7/21 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 4044/4184 variables, 140/161 constraints. Problems are: Problem set: 4 solved, 8 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 Int declared 4184/4184 variables, and 161 constraints, problems are : Problem set: 4 solved, 8 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10065ms problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 4044/4044 transitions.
Graph (trivial) has 89 edges and 140 vertex of which 4 / 140 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 138 transition count 4027
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 125 transition count 4027
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 27 place count 125 transition count 4011
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 59 place count 109 transition count 4011
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 107 transition count 3994
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 107 transition count 3994
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 107 transition count 3992
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 137 place count 71 transition count 3956
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 69 transition count 3981
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 69 transition count 3978
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 69 transition count 3970
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 162 place count 61 transition count 3968
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 186 place count 61 transition count 3944
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 187 place count 61 transition count 3944
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 61 transition count 3944
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 191 place count 61 transition count 3942
Applied a total of 191 rules in 5279 ms. Remains 61 /140 variables (removed 79) and now considering 3942/4044 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5279 ms. Remains : 61/140 places, 3942/4044 transitions.
RANDOM walk for 40000 steps (8 resets) in 1850 ms. (21 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 173 ms. (229 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
[2026-05-27 05:46:41] [INFO ] Flow matrix only has 3937 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5388831582157486376.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14457876909938062091.kers'
[2026-05-27 05:46:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5388831582157486376.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14457876909938062091.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 11 ms.
// Phase 1: matrix 3937 rows 60 cols 65316 entries
Finished phase 1 with 38 SingleSign rule and 3 generalized
[2026-05-27 05:46:41] [INFO ] Computed 20 invariants in 37 ms
Computed 20 P flows in 38 ms.
Exported basis to /tmp/petrispot-output-14457876909938062091.kers
Total runtime 47 ms.
[2026-05-27 05:46:41] [INFO ] State equation strengthened by 1489 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 18/61 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3937/3998 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3998 variables, 1489/1570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3998 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/3998 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3998/3998 variables, and 1570 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2942 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 61/61 constraints, ReadFeed: 1489/1489 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 18/61 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3937/3998 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3998 variables, 1489/1570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3998 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/3998 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3998/3998 variables, and 1570 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5085 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 61/61 constraints, ReadFeed: 1489/1489 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8120ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 485 ms.
Support contains 22 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 3942/3942 transitions.
Applied a total of 0 rules in 763 ms. Remains 61 /61 variables (removed 0) and now considering 3942/3942 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 763 ms. Remains : 61/61 places, 3942/3942 transitions.
RANDOM walk for 40000 steps (8 resets) in 1984 ms. (20 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 191 ms. (208 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 181665 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 5
Probabilistic random walk after 181665 steps, saw 29770 distinct states, run finished after 3004 ms. (steps per millisecond=60 ) properties seen :0
[2026-05-27 05:46:54] [INFO ] Flow matrix only has 3937 transitions (discarded 5 similar events)
[2026-05-27 05:46:54] [INFO ] Invariant cache hit.
[2026-05-27 05:46:54] [INFO ] State equation strengthened by 1489 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 18/61 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3937/3998 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3998 variables, 1489/1570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3998 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/3998 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3998/3998 variables, and 1570 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2936 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 61/61 constraints, ReadFeed: 1489/1489 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 18/61 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3937/3998 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3998 variables, 1489/1570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3998 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/3998 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3998/3998 variables, and 1570 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4135 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 61/61 constraints, ReadFeed: 1489/1489 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7123ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 726 ms.
Support contains 22 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 3942/3942 transitions.
Applied a total of 0 rules in 1101 ms. Remains 61 /61 variables (removed 0) and now considering 3942/3942 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1105 ms. Remains : 61/61 places, 3942/3942 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 3942/3942 transitions.
Applied a total of 0 rules in 995 ms. Remains 61 /61 variables (removed 0) and now considering 3942/3942 (removed 0) transitions.
[2026-05-27 05:47:04] [INFO ] Flow matrix only has 3937 transitions (discarded 5 similar events)
[2026-05-27 05:47:04] [INFO ] Invariant cache hit.
[2026-05-27 05:47:05] [INFO ] Implicit Places using invariants in 764 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 771 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 3942/3942 transitions.
Applied a total of 0 rules in 951 ms. Remains 60 /60 variables (removed 0) and now considering 3942/3942 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2718 ms. Remains : 60/61 places, 3942/3942 transitions.
RANDOM walk for 40000 steps (8 resets) in 1603 ms. (24 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 173 ms. (229 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 198188 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 5
Probabilistic random walk after 198188 steps, saw 31990 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2026-05-27 05:47:10] [INFO ] Flow matrix only has 3937 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9440106056135843733.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2557793889877097612.kers'
[2026-05-27 05:47:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9440106056135843733.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2557793889877097612.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 3937 rows 60 cols 65316 entries
Finished phase 1 with 38 SingleSign rule and 3 generalized
[2026-05-27 05:47:10] [INFO ] Computed 19 invariants in 37 ms
Computed 19 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-2557793889877097612.kers
Total runtime 47 ms.
[2026-05-27 05:47:10] [INFO ] State equation strengthened by 1476 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 18/60 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3937/3997 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3997 variables, 1476/1555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3997 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/3997 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3997/3997 variables, and 1555 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2298 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 60/60 constraints, ReadFeed: 1476/1476 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 18/60 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3937/3997 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3997 variables, 1476/1555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3997 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/3997 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3997/3997 variables, and 1555 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5089 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 60/60 constraints, ReadFeed: 1476/1476 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7486ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 685 ms.
Support contains 22 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 3942/3942 transitions.
Applied a total of 0 rules in 768 ms. Remains 60 /60 variables (removed 0) and now considering 3942/3942 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 768 ms. Remains : 60/60 places, 3942/3942 transitions.
RANDOM walk for 40000 steps (8 resets) in 1605 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 195278 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 4
Probabilistic random walk after 195278 steps, saw 31636 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2026-05-27 05:47:22] [INFO ] Flow matrix only has 3937 transitions (discarded 5 similar events)
[2026-05-27 05:47:22] [INFO ] Invariant cache hit.
[2026-05-27 05:47:22] [INFO ] State equation strengthened by 1476 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 18/60 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3937/3997 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3997 variables, 1476/1555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3997 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/3997 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3997/3997 variables, and 1555 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2056 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 60/60 constraints, ReadFeed: 1476/1476 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 18/60 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3937/3997 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3997 variables, 1476/1555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3997 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/3997 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3997/3997 variables, and 1555 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3332 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 60/60 constraints, ReadFeed: 1476/1476 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5418ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 128 ms.
Support contains 22 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 3942/3942 transitions.
Applied a total of 0 rules in 952 ms. Remains 60 /60 variables (removed 0) and now considering 3942/3942 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 955 ms. Remains : 60/60 places, 3942/3942 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 3942/3942 transitions.
Applied a total of 0 rules in 746 ms. Remains 60 /60 variables (removed 0) and now considering 3942/3942 (removed 0) transitions.
[2026-05-27 05:47:30] [INFO ] Flow matrix only has 3937 transitions (discarded 5 similar events)
[2026-05-27 05:47:30] [INFO ] Invariant cache hit.
[2026-05-27 05:47:30] [INFO ] Implicit Places using invariants in 825 ms returned []
[2026-05-27 05:47:30] [INFO ] Flow matrix only has 3937 transitions (discarded 5 similar events)
[2026-05-27 05:47:30] [INFO ] Invariant cache hit.
[2026-05-27 05:47:32] [INFO ] State equation strengthened by 1476 read => feed constraints.
[2026-05-27 05:47:33] [INFO ] Implicit Places using invariants and state equation in 3018 ms returned []
Implicit Place search using SMT with State Equation took 3846 ms to find 0 implicit places.
[2026-05-27 05:47:34] [INFO ] Redundant transitions in 536 ms returned []
Running 3940 sub problems to find dead transitions.
[2026-05-27 05:47:34] [INFO ] Flow matrix only has 3937 transitions (discarded 5 similar events)
[2026-05-27 05:47:34] [INFO ] Invariant cache hit.
[2026-05-27 05:47:34] [INFO ] State equation strengthened by 1476 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3940 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 59/3997 variables, and 7 constraints, problems are : Problem set: 0 solved, 3940 unsolved in 30113 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/60 constraints, ReadFeed: 0/1476 constraints, PredecessorRefiner: 3940/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3940 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3940 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 59/3997 variables, and 7 constraints, problems are : Problem set: 0 solved, 3940 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/60 constraints, ReadFeed: 0/1476 constraints, PredecessorRefiner: 3925/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65820ms problems are : Problem set: 0 solved, 3940 unsolved
Search for dead transitions found 0 dead transitions in 65839ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70985 ms. Remains : 60/60 places, 3942/3942 transitions.
Found 4 invariant AP formulas.
Knowledge based reduction with 18 factoid took 208 ms. Reduced automaton from 12 states, 32 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[p0, p0, p0, p0, p0]
Knowledge-based reduction took 139636 ms.
Stuttering acceptance computed with spot in 255 ms :[p0, p0, p0, p0, p0]
Support contains 17 out of 140 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 4044/4044 transitions.
Applied a total of 0 rules in 27 ms. Remains 140 /140 variables (removed 0) and now considering 4044/4044 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13022365214323250403.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4284477048118676367.kers'
[2026-05-27 05:48:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13022365214323250403.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4284477048118676367.kers]
Culled 0 columns in 19 ms.
// Phase 1: matrix 4044 rows 140 cols 68558 entries
Finished phase 1 with 117 SingleSign rule and 3 generalized
[2026-05-27 05:48:41] [INFO ] Computed 20 invariants in 65 ms
Computed 20 P flows in 66 ms.
Exported basis to /tmp/petrispot-output-4284477048118676367.kers
Total runtime 82 ms.
[2026-05-27 05:48:42] [INFO ] Implicit Places using invariants in 1362 ms returned []
[2026-05-27 05:48:42] [INFO ] Invariant cache hit.
[2026-05-27 05:48:45] [INFO ] Implicit Places using invariants and state equation in 2843 ms returned []
Implicit Place search using SMT with State Equation took 4208 ms to find 0 implicit places.
Running 4043 sub problems to find dead transitions.
[2026-05-27 05:48:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4043 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 139/4184 variables, and 7 constraints, problems are : Problem set: 0 solved, 4043 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 4043/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4043 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4043 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 139/4184 variables, and 7 constraints, problems are : Problem set: 0 solved, 4043 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 3935/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65992ms problems are : Problem set: 0 solved, 4043 unsolved
Search for dead transitions found 0 dead transitions in 66007ms
Finished structural reductions in LTL mode , in 1 iterations and 70249 ms. Remains : 140/140 places, 4044/4044 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1488 ms. (26 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 134139 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 3
Probabilistic random walk after 134139 steps, saw 74511 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2026-05-27 05:49:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 39/97 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 43/140 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5030ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 17 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 4044/4044 transitions.
Graph (trivial) has 89 edges and 140 vertex of which 4 / 140 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 138 transition count 4027
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 125 transition count 4027
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 27 place count 125 transition count 4011
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 59 place count 109 transition count 4011
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 66 place count 102 transition count 3150
Iterating global reduction 2 with 7 rules applied. Total rules applied 73 place count 102 transition count 3150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 102 transition count 3148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 101 transition count 2176
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 101 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 100 transition count 2174
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 100 transition count 2174
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 147 place count 66 transition count 2140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 63 transition count 2165
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 63 transition count 2162
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 164 place count 63 transition count 2154
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 174 place count 55 transition count 2152
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 199 place count 55 transition count 2127
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 55 transition count 2127
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 202 place count 55 transition count 2127
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 204 place count 55 transition count 2125
Applied a total of 204 rules in 1668 ms. Remains 55 /140 variables (removed 85) and now considering 2125/4044 (removed 1919) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1669 ms. Remains : 55/140 places, 2125/4044 transitions.
RANDOM walk for 40000 steps (8 resets) in 1217 ms. (32 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
[2026-05-27 05:50:02] [INFO ] Flow matrix only has 2120 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2401821603682240418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13186306058827177680.kers'
[2026-05-27 05:50:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2401821603682240418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13186306058827177680.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 6 ms.
// Phase 1: matrix 2120 rows 54 cols 35284 entries
Finished phase 1 with 33 SingleSign rule and 2 generalized
[2026-05-27 05:50:02] [INFO ] Computed 20 invariants in 23 ms
Computed 20 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-13186306058827177680.kers
Total runtime 32 ms.
[2026-05-27 05:50:02] [INFO ] State equation strengthened by 1002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/31 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/55 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2120/2175 variables, 55/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2175 variables, 1002/1077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2175 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2175 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2175/2175 variables, and 1077 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1077 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 55/55 constraints, ReadFeed: 1002/1002 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/31 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/55 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2120/2175 variables, 55/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2175 variables, 1002/1077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2175 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2175 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2175/2175 variables, and 1077 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1272 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 55/55 constraints, ReadFeed: 1002/1002 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2414ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 28 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 2 ms.
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[p0, p0, p0, p0, p0]
Knowledge-based reduction took 13580 ms.
Stuttering acceptance computed with spot in 188 ms :[p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 195 ms :[p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 0 reset in 1594 ms.
Product exploration explored 100000 steps with 0 reset in 1651 ms.
Spot run failed in 115 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/ltsmin11799868164278088029
[2026-05-27 05:50:08] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11799868164278088029
Running compilation step : cd /tmp/ltsmin11799868164278088029;'/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/ltsmin11799868164278088029;'/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/ltsmin11799868164278088029;'/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 17 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 4044/4044 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 135 transition count 3200
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 135 transition count 3200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 134 transition count 2228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 134 transition count 2228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 133 transition count 2226
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 133 transition count 2226
Applied a total of 14 rules in 58 ms. Remains 133 /140 variables (removed 7) and now considering 2226/4044 (removed 1818) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11466821603853374377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-193358577677508575.kers'
[2026-05-27 05:50:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11466821603853374377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-193358577677508575.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 2226 rows 133 cols 37554 entries
Finished phase 1 with 111 SingleSign rule and 2 generalized
[2026-05-27 05:50:11] [INFO ] Computed 20 invariants in 37 ms
Computed 20 P flows in 38 ms.
Exported basis to /tmp/petrispot-output-193358577677508575.kers
Total runtime 43 ms.
[2026-05-27 05:50:12] [INFO ] Implicit Places using invariants in 816 ms returned []
[2026-05-27 05:50:12] [INFO ] Invariant cache hit.
[2026-05-27 05:50:13] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 2140 ms to find 0 implicit places.
Running 2225 sub problems to find dead transitions.
[2026-05-27 05:50:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
SMT process timed out in 34535ms, After SMT, problems are : Problem set: 0 solved, 2225 unsolved
Search for dead transitions found 0 dead transitions in 34544ms
Starting structural reductions in LTL mode, iteration 1 : 133/140 places, 2226/4044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36745 ms. Remains : 133/140 places, 2226/4044 transitions.
Built C files in :
/tmp/ltsmin4809355121432778641
[2026-05-27 05:50:48] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4809355121432778641
Running compilation step : cd /tmp/ltsmin4809355121432778641;'/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/ltsmin4809355121432778641;'/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/ltsmin4809355121432778641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 05:50:52] [INFO ] Flatten gal took : 291 ms
[2026-05-27 05:50:52] [INFO ] Flatten gal took : 201 ms
[2026-05-27 05:50:52] [INFO ] Time to serialize gal into /tmp/LTL5734364669956772964.gal : 62 ms
[2026-05-27 05:50:52] [INFO ] Time to serialize properties into /tmp/LTL1823456356671809735.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/LTL5734364669956772964.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5786939682522454401.hoa' '-atoms' '/tmp/LTL1823456356671809735.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/LTL1823456356671809735.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5786939682522454401.hoa
Detected timeout of ITS tools.
[2026-05-27 05:51:08] [INFO ] Flatten gal took : 388 ms
[2026-05-27 05:51:08] [INFO ] Flatten gal took : 308 ms
[2026-05-27 05:51:08] [INFO ] Time to serialize gal into /tmp/LTL18311748084074428009.gal : 64 ms
[2026-05-27 05:51:08] [INFO ] Time to serialize properties into /tmp/LTL227025824087046067.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/LTL18311748084074428009.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL227025824087046067.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(!(((X(X(!((X(G("(((((p24==1)&&(p33==1))&&((p52==1)&&(p81==1)))&&(((p94==1)&&(p109==1))&&((p128==1)&&(p178==1))))&&(p231==1))")))U...480
Formula 0 simplified : G((G"((((p23==1)&&(p36==1))&&((p51==1)&&(p80==1)))&&(((p93==1)&&(p108==1))&&((p131==1)&&(p176==1))))" | XX(!"((((p17==1)&&(p32==1))&...563
Detected timeout of ITS tools.
[2026-05-27 05:51:24] [INFO ] Flatten gal took : 313 ms
[2026-05-27 05:51:24] [INFO ] Applying decomposition
[2026-05-27 05:51:24] [INFO ] Flatten gal took : 321 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/graph9912878505893487329.txt' '-o' '/tmp/graph9912878505893487329.bin' '-w' '/tmp/graph9912878505893487329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9912878505893487329.bin' '-l' '-1' '-v' '-w' '/tmp/graph9912878505893487329.weights' '-q' '0' '-e' '0.001'
[2026-05-27 05:51:25] [INFO ] Decomposing Gal with order
[2026-05-27 05:51:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 05:51:26] [INFO ] Removed a total of 37710 redundant transitions.
[2026-05-27 05:51:26] [INFO ] Flatten gal took : 737 ms
[2026-05-27 05:51:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 277 ms.
[2026-05-27 05:51:27] [INFO ] Time to serialize gal into /tmp/LTL10732708082598013507.gal : 38 ms
[2026-05-27 05:51:27] [INFO ] Time to serialize properties into /tmp/LTL6498973924788355381.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/LTL10732708082598013507.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6498973924788355381.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(!(((X(X(!((X(G("(((((i2.u7.p24==1)&&(i1.u9.p33==1))&&((i1.u13.p52==1)&&(i2.u18.p81==1)))&&(((i4.u21.p94==1)&&(i4.u24.p109==1))&&(...711
Formula 0 simplified : G((G"((((i2.u7.p23==1)&&(i2.u10.p36==1))&&((i1.u13.p51==1)&&(i2.u18.p80==1)))&&(((i4.u21.p93==1)&&(i4.u24.p108==1))&&((i2.u27.p131==...848
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-13 finished in 396386 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(p1)||p0))))'
Support contains 18 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 129 transition count 4531
Ensure Unique test removed 7 places
Iterating global reduction 0 with 21 rules applied. Total rules applied 35 place count 122 transition count 4531
Applied a total of 35 rules in 78 ms. Remains 122 /143 variables (removed 21) and now considering 4531/6717 (removed 2186) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-318681962317829522.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13645111373444671284.kers'
[2026-05-27 05:51:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-318681962317829522.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13645111373444671284.kers]
Culled 0 columns in 8 ms.
// Phase 1: matrix 4531 rows 122 cols 48641 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-27 05:51:42] [INFO ] Computed 13 invariants in 32 ms
Computed 13 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-13645111373444671284.kers
Total runtime 40 ms.
[2026-05-27 05:51:42] [INFO ] Implicit Places using invariants in 597 ms returned []
[2026-05-27 05:51:42] [INFO ] Invariant cache hit.
[2026-05-27 05:51:44] [INFO ] Implicit Places using invariants and state equation in 1942 ms returned []
Implicit Place search using SMT with State Equation took 2549 ms to find 0 implicit places.
Running 4530 sub problems to find dead transitions.
[2026-05-27 05:51:44] [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 121/4653 variables, and 0 constraints, problems are : Problem set: 0 solved, 4530 unsolved in 30146 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/122 constraints, PredecessorRefiner: 4530/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4530 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/4653 variables, and 0 constraints, problems are : Problem set: 0 solved, 4530 unsolved in 30090 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/122 constraints, PredecessorRefiner: 4414/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68587ms problems are : Problem set: 0 solved, 4530 unsolved
Search for dead transitions found 0 dead transitions in 68604ms
Starting structural reductions in LTL mode, iteration 1 : 122/143 places, 4531/6717 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71238 ms. Remains : 122/143 places, 4531/6717 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(p1)||p0))))'
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 2086 ms.
Product exploration explored 100000 steps with 0 reset in 2526 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 9 factoid took 51 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1014 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 161571 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 1
Probabilistic random walk after 161571 steps, saw 87789 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2026-05-27 05:53:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 76/85 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/122 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4531/4653 variables, 122/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4653 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4653 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4653/4653 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1498 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 76/85 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/122 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4531/4653 variables, 122/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4653 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4653 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4653/4653 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1945 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3467ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 291 steps, including 3 resets, run visited all 1 properties in 6 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 6 ms.
Knowledge based reduction with 9 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 7063 ms.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 9 out of 122 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 4531/4531 transitions.
Applied a total of 0 rules in 13 ms. Remains 122 /122 variables (removed 0) and now considering 4531/4531 (removed 0) transitions.
[2026-05-27 05:53:05] [INFO ] Invariant cache hit.
[2026-05-27 05:53:06] [INFO ] Implicit Places using invariants in 641 ms returned []
[2026-05-27 05:53:06] [INFO ] Invariant cache hit.
[2026-05-27 05:53:07] [INFO ] Implicit Places using invariants and state equation in 1805 ms returned []
Implicit Place search using SMT with State Equation took 2451 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2464 ms. Remains : 122/122 places, 4531/4531 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1194 ms. (33 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 156551 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 1
Probabilistic random walk after 156551 steps, saw 85269 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2026-05-27 05:53:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 76/85 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/122 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4531/4653 variables, 122/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4653 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4653 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4653/4653 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1500 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 76/85 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/122 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4531/4653 variables, 122/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4653 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4653 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4653/4653 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3535ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 5 ms.
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 7334 ms.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2460 ms.
Product exploration explored 100000 steps with 0 reset in 2145 ms.
Spot run failed in 56 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/ltsmin6328967421337650036
[2026-05-27 05:53:20] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6328967421337650036
Running compilation step : cd /tmp/ltsmin6328967421337650036;'/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/ltsmin6328967421337650036;'/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/ltsmin6328967421337650036;'/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 9 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 4531/4531 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 115 transition count 413
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 115 transition count 413
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 112 transition count 407
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 112 transition count 407
Applied a total of 20 rules in 158 ms. Remains 112 /122 variables (removed 10) and now considering 407/4531 (removed 4124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7184735027190230433.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2327442364081923609.kers'
[2026-05-27 05:53:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7184735027190230433.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2327442364081923609.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 407 rows 112 cols 3331 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-27 05:53:23] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2327442364081923609.kers
Total runtime 3 ms.
[2026-05-27 05:53:23] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-27 05:53:23] [INFO ] Invariant cache hit.
[2026-05-27 05:53:23] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 406 sub problems to find dead transitions.
[2026-05-27 05:53:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 407/519 variables, 112/127 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 0/519 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 127 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 406/150 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (OVERLAPS) 407/519 variables, 112/128 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 150/278 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 5/283 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 283 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 406/150 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60542ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60544ms
Starting structural reductions in LTL mode, iteration 1 : 112/122 places, 407/4531 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61158 ms. Remains : 112/122 places, 407/4531 transitions.
Built C files in :
/tmp/ltsmin71675748794689031
[2026-05-27 05:54:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin71675748794689031
Running compilation step : cd /tmp/ltsmin71675748794689031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1513 ms.
Running link step : cd /tmp/ltsmin71675748794689031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin71675748794689031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased5899097492905367944.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 05:54:39] [INFO ] Flatten gal took : 26 ms
[2026-05-27 05:54:39] [INFO ] Flatten gal took : 24 ms
[2026-05-27 05:54:39] [INFO ] Time to serialize gal into /tmp/LTL17853750858416753960.gal : 7 ms
[2026-05-27 05:54:39] [INFO ] Time to serialize properties into /tmp/LTL12049945143305944683.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/LTL17853750858416753960.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2290034325713247438.hoa' '-atoms' '/tmp/LTL12049945143305944683.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12049945143305944683.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2290034325713247438.hoa
Detected timeout of ITS tools.
[2026-05-27 05:54:55] [INFO ] Flatten gal took : 208 ms
[2026-05-27 05:54:55] [INFO ] Flatten gal took : 210 ms
[2026-05-27 05:54:55] [INFO ] Time to serialize gal into /tmp/LTL13031438602498467815.gal : 60 ms
[2026-05-27 05:54:55] [INFO ] Time to serialize properties into /tmp/LTL3161789712756020871.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/LTL13031438602498467815.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3161789712756020871.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 : !((X(G(((G("(((((p14==0)||(p33==0))||((p52==0)||(p75==0)))||(((p100==0)||(p119==0))||((p132==0)||(p178==0))))||(p237==0))"))||("(((((p...378
Formula 0 simplified : XF(!"(((((p14==1)&&(p37==1))&&((p56==1)&&(p75==1)))&&(((p90==1)&&(p109==1))&&((p138==1)&&(p178==1))))&&(p231==1))" & !"(((((p24==1)&...368
Detected timeout of ITS tools.
[2026-05-27 05:55:11] [INFO ] Flatten gal took : 252 ms
[2026-05-27 05:55:11] [INFO ] Applying decomposition
[2026-05-27 05:55:11] [INFO ] Flatten gal took : 345 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/graph16941117451066488840.txt' '-o' '/tmp/graph16941117451066488840.bin' '-w' '/tmp/graph16941117451066488840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16941117451066488840.bin' '-l' '-1' '-v' '-w' '/tmp/graph16941117451066488840.weights' '-q' '0' '-e' '0.001'
[2026-05-27 05:55:11] [INFO ] Decomposing Gal with order
[2026-05-27 05:55:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 05:55:13] [INFO ] Removed a total of 12133 redundant transitions.
[2026-05-27 05:55:13] [INFO ] Flatten gal took : 1273 ms
[2026-05-27 05:55:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1408 labels/synchronizations in 158 ms.
[2026-05-27 05:55:13] [INFO ] Time to serialize gal into /tmp/LTL7496029881087020116.gal : 10 ms
[2026-05-27 05:55:13] [INFO ] Time to serialize properties into /tmp/LTL3325934880021009426.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/LTL7496029881087020116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3325934880021009426.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(((G("(((((i2.u15.p14==0)||(i2.u27.p33==0))||((u26.p52==0)||(i2.u27.p75==0)))||(((u26.p100==0)||(i2.u15.p119==0))||((i2.u27.p132...549
Formula 0 simplified : XF(!"(((((i2.u15.p14==1)&&(i2.u15.p37==1))&&((i2.u15.p56==1)&&(i2.u27.p75==1)))&&(((u26.p90==1)&&(i2.u27.p109==1))&&((i2.u27.p138==1...539
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-14 finished in 226634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0) U G(p1)))))'
Support contains 13 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 6717/6717 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 129 transition count 4531
Ensure Unique test removed 7 places
Iterating global reduction 0 with 21 rules applied. Total rules applied 35 place count 122 transition count 4531
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 38 place count 119 transition count 1453
Iterating global reduction 0 with 3 rules applied. Total rules applied 41 place count 119 transition count 1453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 42 place count 118 transition count 1451
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 118 transition count 1451
Applied a total of 43 rules in 121 ms. Remains 118 /143 variables (removed 25) and now considering 1451/6717 (removed 5266) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2685121237098276807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14353715932775790005.kers'
[2026-05-27 05:55:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2685121237098276807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14353715932775790005.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1451 rows 118 cols 14779 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-27 05:55:28] [INFO ] Computed 13 invariants in 10 ms
Computed 13 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-14353715932775790005.kers
Total runtime 13 ms.
[2026-05-27 05:55:29] [INFO ] Implicit Places using invariants in 255 ms returned []
[2026-05-27 05:55:29] [INFO ] Invariant cache hit.
[2026-05-27 05:55:29] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
Running 1450 sub problems to find dead transitions.
[2026-05-27 05:55:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1450 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 118/1569 variables, and 15 constraints, problems are : Problem set: 0 solved, 1450 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/118 constraints, PredecessorRefiner: 1450/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1450 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1450 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 118/1569 variables, and 16 constraints, problems are : Problem set: 0 solved, 1450 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/118 constraints, PredecessorRefiner: 1334/116 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62542ms problems are : Problem set: 0 solved, 1450 unsolved
Search for dead transitions found 0 dead transitions in 62547ms
Starting structural reductions in LTL mode, iteration 1 : 118/143 places, 1451/6717 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63554 ms. Remains : 118/143 places, 1451/6717 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0) U G(p1)))))'
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0707-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0707-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0707-LTLFireability-15 finished in 63829 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||G(p1)))))'
Spot run failed in 57 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(G(p1)||(!p2 U (p3||G(!p2))))))))'
Spot run failed in 50 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!((X(X(!(X(G(p0)) U p1)))||G(p2)) U p0)))'
Spot run failed in 48 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Spot run failed in 48 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-27 05:56:33] [INFO ] Flatten gal took : 755 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15369056934072444937
[2026-05-27 05:56:34] [INFO ] Too many transitions (6717) to apply POR reductions. Disabling POR matrices.
[2026-05-27 05:56:34] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15369056934072444937
Running compilation step : cd /tmp/ltsmin15369056934072444937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-27 05:56:34] [INFO ] Applying decomposition
[2026-05-27 05:56:35] [INFO ] Flatten gal took : 555 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/graph14511702261662570648.txt' '-o' '/tmp/graph14511702261662570648.bin' '-w' '/tmp/graph14511702261662570648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14511702261662570648.bin' '-l' '-1' '-v' '-w' '/tmp/graph14511702261662570648.weights' '-q' '0' '-e' '0.001'
[2026-05-27 05:56:37] [INFO ] Decomposing Gal with order
[2026-05-27 05:56:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 05:56:38] [INFO ] Removed a total of 66486 redundant transitions.
[2026-05-27 05:56:38] [INFO ] Flatten gal took : 1056 ms
[2026-05-27 05:56:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 465 ms.
[2026-05-27 05:56:39] [INFO ] Time to serialize gal into /tmp/LTLFireability9758780221317187147.gal : 67 ms
[2026-05-27 05:56:39] [INFO ] Time to serialize properties into /tmp/LTLFireability13162414186323363532.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/LTLFireability9758780221317187147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13162414186323363532.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((G(F(("(((((i4.u8.p24==1)&&(i4.u12.p43==1))&&((i4.u13.p52==1)&&(i5.u20.p81==1)))&&(((i5.u24.p100==1)&&(i4.u25.p109==1))&&((i4.u32.p1...547
Formula 0 simplified : G(F!"((((((i4.u8.p24==0)||(i4.u12.p43==0))||((i4.u13.p52==0)||(i5.u20.p81==0)))||(((i5.u24.p100==0)||(i4.u25.p109==0))||((i4.u32.p13...540
Compilation finished in 74542 ms.
Running link step : cd /tmp/ltsmin15369056934072444937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 172 ms.
Running LTSmin : cd /tmp/ltsmin15369056934072444937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t60, t66, t72, t78, t84, t89, t4503, t4504, t4505, t4506, t4507, t4508, t4509, t4510,...15843
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15369056934072444937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15369056934072444937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp2==true)&&([]((LTLAPp3==true))||(!(LTLAPp4==true) U ((LTLAPp5==true)||[](!(LTLAPp4==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15369056934072444937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp2==true)&&([]((LTLAPp3==true))||(!(LTLAPp4==true) U ((LTLAPp5==true)||[](!(LTLAPp4==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15369056934072444937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>(!((X(X(!(X([]((LTLAPp6==true))) U (LTLAPp7==true))))||[]((LTLAPp8==true))) U (LTLAPp6==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15369056934072444937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>(!((X(X(!(X([]((LTLAPp6==true))) U (LTLAPp7==true))))||[]((LTLAPp8==true))) U (LTLAPp6==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15369056934072444937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([](([]((LTLAPp10==true))||(LTLAPp9==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin15369056934072444937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([](([]((LTLAPp10==true))||(LTLAPp9==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin15369056934072444937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ErlangenMainframeV0-PT-0707"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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