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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.1K Mar 7 04:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 7 04:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 7 04:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 04:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 09:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 09:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 17K Mar 7 04:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Mar 7 04:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 7 04:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 7 04:57 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 1.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-0606-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-0606-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779856958496

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-0606
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 04:42:40] [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 04:42:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 04:42:40] [INFO ] Load time of PNML (sax parser for PT used): 426 ms
[2026-05-27 04:42:41] [INFO ] Transformed 223 places.
[2026-05-27 04:42:41] [INFO ] Transformed 2425 transitions.
[2026-05-27 04:42:41] [INFO ] Found NUPN structural information;
[2026-05-27 04:42:41] [INFO ] Parsed PT model containing 223 places and 2425 transitions and 34205 arcs in 665 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2425/2425 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 166 transition count 2368
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 166 transition count 2368
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 144 place count 136 transition count 2338
Iterating global reduction 0 with 30 rules applied. Total rules applied 174 place count 136 transition count 2338
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 177 place count 133 transition count 2335
Iterating global reduction 0 with 3 rules applied. Total rules applied 180 place count 133 transition count 2335
Applied a total of 180 rules in 152 ms. Remains 133 /223 variables (removed 90) and now considering 2335/2425 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6790064893348031739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18171129777182959176.kers'
[2026-05-27 04:42:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6790064893348031739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18171129777182959176.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 2335 rows 133 cols 34025 entries
Finished phase 1 with 112 SingleSign rule and 3 generalized
[2026-05-27 04:42:41] [INFO ] Computed 18 invariants in 32 ms
Computed 18 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-18171129777182959176.kers
Total runtime 39 ms.
[2026-05-27 04:42:42] [INFO ] Implicit Places using invariants in 400 ms returned []
[2026-05-27 04:42:42] [INFO ] Invariant cache hit.
[2026-05-27 04:42:43] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1712 ms to find 0 implicit places.
Running 2334 sub problems to find dead transitions.
[2026-05-27 04:42:43] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 132/2468 variables, and 6 constraints, problems are : Problem set: 0 solved, 2334 unsolved in 30139 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/133 constraints, PredecessorRefiner: 2334/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
SMT process timed out in 65938ms, After SMT, problems are : Problem set: 0 solved, 2334 unsolved
Search for dead transitions found 0 dead transitions in 66035ms
Starting structural reductions in LTL mode, iteration 1 : 133/223 places, 2335/2425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68000 ms. Remains : 133/223 places, 2335/2425 transitions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Applied a total of 0 rules in 17 ms. Remains 133 /133 variables (removed 0) and now considering 2335/2335 (removed 0) transitions.
[2026-05-27 04:43:49] [INFO ] Invariant cache hit.
[2026-05-27 04:43:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-27 04:43:49] [INFO ] Invariant cache hit.
[2026-05-27 04:43:50] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 914 ms. Remains : 133/133 places, 2335/2335 transitions.
Support contains 45 out of 133 places after structural reductions.
[2026-05-27 04:43:51] [INFO ] Flatten gal took : 609 ms
[2026-05-27 04:43:51] [INFO ] Flatten gal took : 262 ms
[2026-05-27 04:43:52] [INFO ] Input system was already deterministic with 2335 transitions.
RANDOM walk for 40000 steps (8 resets) in 3194 ms. (12 steps per ms) remains 30/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
[2026-05-27 04:43:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 68/108 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 23/131 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 2/133 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 2335/2468 variables, 133/151 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2468/2468 variables, and 151 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 30/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 68/108 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 23/131 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 2/133 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 2335/2468 variables, 133/151 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2468/2468 variables, and 151 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 30/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10227ms problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Graph (trivial) has 69 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 12 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 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 131 transition count 2319
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 119 transition count 2319
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 119 transition count 2306
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 106 transition count 2306
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 104 transition count 2289
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 104 transition count 2289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 104 transition count 2287
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 103 place count 81 transition count 2264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 79 transition count 2276
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 108 place count 79 transition count 2275
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 79 transition count 2270
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 120 place count 74 transition count 2268
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 132 place count 74 transition count 2256
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 134 place count 74 transition count 2256
Partial Post-agglomeration rule applied 12 times.
Drop transitions (Partial Post agglomeration) removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 146 place count 74 transition count 2256
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 152 place count 74 transition count 2250
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 73 transition count 2249
Applied a total of 153 rules in 2676 ms. Remains 73 /133 variables (removed 60) and now considering 2249/2335 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2677 ms. Remains : 73/133 places, 2249/2335 transitions.
RANDOM walk for 40000 steps (8 resets) in 3093 ms. (12 steps per ms) remains 24/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
[2026-05-27 04:44:07] [INFO ] Flow matrix only has 2244 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-11906887149326762662.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3068750520945079353.kers'
[2026-05-27 04:44:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11906887149326762662.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3068750520945079353.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 5 ms.
// Phase 1: matrix 2244 rows 71 cols 33708 entries
Finished phase 1 with 52 SingleSign rule and 3 generalized
[2026-05-27 04:44:07] [INFO ] Computed 18 invariants in 20 ms
Computed 18 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-3068750520945079353.kers
Total runtime 26 ms.
[2026-05-27 04:44:07] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 13/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 16/69 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 2239/2308 variables, 69/85 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2308 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2308 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 9/2317 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2317 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2317 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2317 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 0/2317 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2317/2317 variables, and 105 constraints, problems are : Problem set: 0 solved, 24 unsolved in 21637 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 24/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 13/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 16/69 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 2239/2308 variables, 69/85 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2308 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2308 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 9/2317 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2317 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2317 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2317 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 0/2317 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2317/2317 variables, and 105 constraints, problems are : Problem set: 0 solved, 24 unsolved in 23153 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 24/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44986ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 4 properties in 778 ms.
Support contains 39 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 2249/2249 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 73 transition count 2248
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 2248
Applied a total of 2 rules in 208 ms. Remains 72 /73 variables (removed 1) and now considering 2248/2249 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 72/73 places, 2248/2249 transitions.
RANDOM walk for 40000 steps (8 resets) in 1196 ms. (33 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 223752 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :1 out of 20
Probabilistic random walk after 223752 steps, saw 37109 distinct states, run finished after 3013 ms. (steps per millisecond=74 ) properties seen :1
[2026-05-27 04:44:57] [INFO ] Flow matrix only has 2243 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-6510527035788612774.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11409419383269207964.kers'
[2026-05-27 04:44:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6510527035788612774.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11409419383269207964.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 5 ms.
// Phase 1: matrix 2243 rows 70 cols 33706 entries
Finished phase 1 with 51 SingleSign rule and 3 generalized
[2026-05-27 04:44:57] [INFO ] Computed 18 invariants in 20 ms
Computed 18 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-11409419383269207964.kers
Total runtime 30 ms.
[2026-05-27 04:44:57] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 13/52 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 16/68 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2238/2306 variables, 68/84 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2306 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2306 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 9/2315 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2315 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2315 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2315 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/2315 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2315/2315 variables, and 104 constraints, problems are : Problem set: 0 solved, 19 unsolved in 8618 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 19/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 13/52 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 16/68 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2238/2306 variables, 68/84 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2306 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2306 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 9/2315 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2315 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2315 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2315 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/2315 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2315/2315 variables, and 104 constraints, problems are : Problem set: 0 solved, 19 unsolved in 19177 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 19/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27896ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 975 ms.
Support contains 39 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 2248/2248 transitions.
Applied a total of 0 rules in 232 ms. Remains 72 /72 variables (removed 0) and now considering 2248/2248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 72/72 places, 2248/2248 transitions.
RANDOM walk for 40000 steps (8 resets) in 1205 ms. (33 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 245795 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :1 out of 18
Probabilistic random walk after 245795 steps, saw 40463 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :1
[2026-05-27 04:45:29] [INFO ] Flow matrix only has 2243 transitions (discarded 5 similar events)
[2026-05-27 04:45:29] [INFO ] Invariant cache hit.
[2026-05-27 04:45:29] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 13/52 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/68 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2238/2306 variables, 68/84 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2306 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2306 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 9/2315 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2315 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2315 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2315 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/2315 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2315/2315 variables, and 104 constraints, problems are : Problem set: 0 solved, 17 unsolved in 11819 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 17/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 13/52 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 16/68 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2238/2306 variables, 68/84 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2306 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2306 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 9/2315 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2315 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2315 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2315 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/2315 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2315/2315 variables, and 104 constraints, problems are : Problem set: 0 solved, 17 unsolved in 13290 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 17/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25151ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 586 ms.
Support contains 39 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 2248/2248 transitions.
Applied a total of 0 rules in 234 ms. Remains 72 /72 variables (removed 0) and now considering 2248/2248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 72/72 places, 2248/2248 transitions.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 18 stabilizing places and 18 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' '!(F(G(p0)))'
Support contains 8 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Graph (trivial) has 85 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 2 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 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 130 transition count 2319
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 117 transition count 2319
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 27 place count 117 transition count 2305
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 55 place count 103 transition count 2305
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 88 transition count 1559
Ensure Unique test removed 6 places
Iterating global reduction 2 with 21 rules applied. Total rules applied 91 place count 82 transition count 1559
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 82 transition count 1557
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 99 place count 76 transition count 227
Iterating global reduction 3 with 6 rules applied. Total rules applied 105 place count 76 transition count 227
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 73 transition count 221
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 73 transition count 221
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 167 place count 45 transition count 193
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 175 place count 41 transition count 204
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 178 place count 41 transition count 201
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 181 place count 41 transition count 201
Applied a total of 181 rules in 300 ms. Remains 41 /133 variables (removed 92) and now considering 201/2335 (removed 2134) transitions.
[2026-05-27 04:45:56] [INFO ] Flow matrix only has 184 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6186600314118799788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5519539960214499969.kers'
[2026-05-27 04:45:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6186600314118799788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5519539960214499969.kers]
Normalized transition count is 183 out of 184 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 41 cols 2170 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-27 04:45:56] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5519539960214499969.kers
Total runtime 2 ms.
[2026-05-27 04:45:56] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-27 04:45:56] [INFO ] Flow matrix only has 184 transitions (discarded 17 similar events)
[2026-05-27 04:45:56] [INFO ] Invariant cache hit.
[2026-05-27 04:45:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-27 04:45:56] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2026-05-27 04:45:56] [INFO ] Redundant transitions in 9 ms returned []
Running 199 sub problems to find dead transitions.
[2026-05-27 04:45:56] [INFO ] Flow matrix only has 184 transitions (discarded 17 similar events)
[2026-05-27 04:45:56] [INFO ] Invariant cache hit.
[2026-05-27 04:45:56] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 183/224 variables, 41/53 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 74/127 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 1/225 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 128 constraints, problems are : Problem set: 0 solved, 199 unsolved in 22270 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 41/41 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 183/224 variables, 41/53 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 74/127 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 199/326 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 1/225 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 225/225 variables, and 327 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 41/41 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52630ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 52633ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/133 places, 201/2335 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53204 ms. Remains : 41/133 places, 201/2335 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 316 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0606-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 829 ms.
Product exploration explored 100000 steps with 0 reset in 374 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 679 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 352784 steps, run visited all 1 properties in 677 ms. (steps per millisecond=521 )
Probabilistic random walk after 352784 steps, saw 56602 distinct states, run finished after 683 ms. (steps per millisecond=516 ) properties seen :1
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Knowledge-based reduction took 1163 ms.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 8 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 201/201 transitions.
Applied a total of 0 rules in 7 ms. Remains 41 /41 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2026-05-27 04:46:52] [INFO ] Flow matrix only has 184 transitions (discarded 17 similar events)
[2026-05-27 04:46:52] [INFO ] Invariant cache hit.
[2026-05-27 04:46:52] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-27 04:46:52] [INFO ] Flow matrix only has 184 transitions (discarded 17 similar events)
[2026-05-27 04:46:52] [INFO ] Invariant cache hit.
[2026-05-27 04:46:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-27 04:46:52] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2026-05-27 04:46:52] [INFO ] Redundant transitions in 9 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 41/41 places, 201/201 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 46 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 341 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 352784 steps, run visited all 1 properties in 762 ms. (steps per millisecond=462 )
Probabilistic random walk after 352784 steps, saw 56602 distinct states, run finished after 762 ms. (steps per millisecond=462 ) properties seen :1
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Knowledge-based reduction took 1087 ms.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 465 ms.
Stack based approach found an accepted trace after 50616 steps with 0 reset with depth 50617 and stack size 13815 in 267 ms.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0606-LTLFireability-01 finished in 58260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p1) U p2))||p0)))'
Support contains 20 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 2091
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 2091
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 129 transition count 1604
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 129 transition count 1604
Applied a total of 8 rules in 68 ms. Remains 129 /133 variables (removed 4) and now considering 1604/2335 (removed 731) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5009698393639645966.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2510395479337026395.kers'
[2026-05-27 04:46:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5009698393639645966.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2510395479337026395.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 1604 rows 129 cols 22843 entries
Finished phase 1 with 108 SingleSign rule and 3 generalized
[2026-05-27 04:46:54] [INFO ] Computed 18 invariants in 22 ms
Computed 18 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-2510395479337026395.kers
Total runtime 29 ms.
[2026-05-27 04:46:55] [INFO ] Implicit Places using invariants in 515 ms returned []
[2026-05-27 04:46:55] [INFO ] Invariant cache hit.
[2026-05-27 04:46:56] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
Running 1603 sub problems to find dead transitions.
[2026-05-27 04:46:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
SMT process timed out in 33752ms, After SMT, problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 33764ms
Starting structural reductions in LTL mode, iteration 1 : 129/133 places, 1604/2335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35377 ms. Remains : 129/133 places, 1604/2335 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p1) U p2))||p0)))'
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0606-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 1125 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 1 ms.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0606-LTLFireability-02 finished in 36799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U p1)) U G((p2||G(p1)))))'
Support contains 13 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Graph (trivial) has 79 edges and 133 vertex of which 4 / 133 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 130 transition count 2320
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 118 transition count 2320
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 118 transition count 2307
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 105 transition count 2307
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 65 place count 91 transition count 1562
Ensure Unique test removed 6 places
Iterating global reduction 2 with 20 rules applied. Total rules applied 85 place count 85 transition count 1562
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 85 transition count 1560
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 82 transition count 534
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 82 transition count 534
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 80 transition count 530
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 80 transition count 530
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 153 place count 52 transition count 502
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 159 place count 49 transition count 513
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 160 place count 49 transition count 512
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 165 place count 49 transition count 512
Applied a total of 165 rules in 162 ms. Remains 49 /133 variables (removed 84) and now considering 512/2335 (removed 1823) transitions.
[2026-05-27 04:47:31] [INFO ] Flow matrix only has 495 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11403554771511361573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14585070237062466069.kers'
[2026-05-27 04:47:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11403554771511361573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14585070237062466069.kers]
Normalized transition count is 494 out of 495 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 494 rows 49 cols 7184 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-27 04:47:31] [INFO ] Computed 12 invariants in 7 ms
Computed 12 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14585070237062466069.kers
Total runtime 9 ms.
[2026-05-27 04:47:31] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-27 04:47:31] [INFO ] Flow matrix only has 495 transitions (discarded 17 similar events)
[2026-05-27 04:47:31] [INFO ] Invariant cache hit.
[2026-05-27 04:47:31] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-27 04:47:31] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2026-05-27 04:47:32] [INFO ] Redundant transitions in 31 ms returned []
Running 510 sub problems to find dead transitions.
[2026-05-27 04:47:32] [INFO ] Flow matrix only has 495 transitions (discarded 17 similar events)
[2026-05-27 04:47:32] [INFO ] Invariant cache hit.
[2026-05-27 04:47:32] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (OVERLAPS) 494/543 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 510 unsolved
SMT process timed out in 30822ms, After SMT, problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 30825ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/133 places, 512/2335 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31592 ms. Remains : 49/133 places, 512/2335 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U p1)) U G((G(p1)||p2))))'
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-0606-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0606-LTLFireability-03 finished in 31959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(((p0 U p1)&&(p0 U p2)&&X(p3)))||X(p0))))'
Support contains 19 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 120 transition count 1606
Ensure Unique test removed 6 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 32 place count 114 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 113 transition count 1605
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 113 transition count 1605
Applied a total of 34 rules in 36 ms. Remains 113 /133 variables (removed 20) and now considering 1605/2335 (removed 730) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4248842392762491482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5835775739205271560.kers'
[2026-05-27 04:48:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4248842392762491482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5835775739205271560.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1605 rows 113 cols 15075 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-27 04:48:03] [INFO ] Computed 12 invariants in 17 ms
Computed 12 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-5835775739205271560.kers
Total runtime 23 ms.
[2026-05-27 04:48:03] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-27 04:48:03] [INFO ] Invariant cache hit.
[2026-05-27 04:48:04] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2026-05-27 04:48:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 113/1718 variables, and 14 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/113 constraints, PredecessorRefiner: 1604/110 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 113/1718 variables, and 15 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/113 constraints, PredecessorRefiner: 1494/110 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62722ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 62734ms
Starting structural reductions in LTL mode, iteration 1 : 113/133 places, 1605/2335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63787 ms. Remains : 113/133 places, 1605/2335 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(((p0 U p1)&&(p0 U p2)&&X(p3)))||X(p0))))'
Stuttering acceptance computed with spot in 591 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p1), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-0606-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 1223 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 1 ms.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0606-LTLFireability-04 finished in 65704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((F(p0) U X(p1)) U p0) U (p2&&F(p1)))))'
Support contains 16 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 120 transition count 1606
Ensure Unique test removed 6 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 32 place count 114 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 113 transition count 1605
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 113 transition count 1605
Applied a total of 34 rules in 25 ms. Remains 113 /133 variables (removed 20) and now considering 1605/2335 (removed 730) transitions.
[2026-05-27 04:49:08] [INFO ] Invariant cache hit.
[2026-05-27 04:49:09] [INFO ] Implicit Places using invariants in 266 ms returned []
[2026-05-27 04:49:09] [INFO ] Invariant cache hit.
[2026-05-27 04:49:10] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 113/133 places, 1605/2335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1227 ms. Remains : 113/133 places, 1605/2335 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((F(p0) U X(p1)) U p0) U (F(p1)&&p2))))'
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0606-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 1234 ms.
Stack based approach found an accepted trace after 82 steps with 0 reset with depth 83 and stack size 83 in 1 ms.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0606-LTLFireability-05 finished in 2936 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)) U G(p1)) U X((p2 U !p3))))'
Support contains 24 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 126 transition count 1669
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 126 transition count 1669
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 125 transition count 1668
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 125 transition count 1668
Applied a total of 16 rules in 28 ms. Remains 125 /133 variables (removed 8) and now considering 1668/2335 (removed 667) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6769355871064301647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13640594125116889034.kers'
[2026-05-27 04:49:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6769355871064301647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13640594125116889034.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 1668 rows 125 cols 24711 entries
Finished phase 1 with 105 SingleSign rule and 2 generalized
[2026-05-27 04:49:11] [INFO ] Computed 18 invariants in 25 ms
Computed 18 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-13640594125116889034.kers
Total runtime 31 ms.
[2026-05-27 04:49:12] [INFO ] Implicit Places using invariants in 277 ms returned []
[2026-05-27 04:49:12] [INFO ] Invariant cache hit.
[2026-05-27 04:49:13] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
Running 1667 sub problems to find dead transitions.
[2026-05-27 04:49:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1667 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1667 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1667 unsolved
SMT process timed out in 32899ms, After SMT, problems are : Problem set: 0 solved, 1667 unsolved
Search for dead transitions found 0 dead transitions in 32909ms
Starting structural reductions in LTL mode, iteration 1 : 125/133 places, 1668/2335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34379 ms. Remains : 125/133 places, 1668/2335 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)) U G(p1)) U X((p2 U !p3))))'
Stuttering acceptance computed with spot in 206 ms :[p3, (AND p0 p1 p3), p3, p0, (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0606-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 21 factoid took 20 ms. Proved property starting from automaton with 5 states, 14 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 53 ms.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0606-LTLFireability-06 finished in 35242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 7 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 126 transition count 1669
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 126 transition count 1669
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 119 transition count 338
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 119 transition count 338
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 117 transition count 334
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 117 transition count 334
Applied a total of 32 rules in 32 ms. Remains 117 /133 variables (removed 16) and now considering 334/2335 (removed 2001) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3223357026504106447.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7340303875899569999.kers'
[2026-05-27 04:49:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3223357026504106447.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7340303875899569999.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 334 rows 117 cols 3423 entries
Finished phase 1 with 97 SingleSign rule and 2 generalized
[2026-05-27 04:49:47] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7340303875899569999.kers
Total runtime 4 ms.
[2026-05-27 04:49:47] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-27 04:49:47] [INFO ] Invariant cache hit.
[2026-05-27 04:49:47] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2026-05-27 04:49:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/117 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (OVERLAPS) 334/451 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 333 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 451/451 variables, and 142 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 333/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/117 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (OVERLAPS) 334/451 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 269/411 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 413 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 333/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60590ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60592ms
Starting structural reductions in LTL mode, iteration 1 : 117/133 places, 334/2335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61128 ms. Remains : 117/133 places, 334/2335 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0606-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0606-LTLFireability-07 finished in 61302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Graph (trivial) has 85 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 2 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 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 130 transition count 2319
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 117 transition count 2319
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 27 place count 117 transition count 2305
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 55 place count 103 transition count 2305
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 88 transition count 1559
Ensure Unique test removed 6 places
Iterating global reduction 2 with 21 rules applied. Total rules applied 91 place count 82 transition count 1559
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 82 transition count 1557
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 99 place count 76 transition count 227
Iterating global reduction 3 with 6 rules applied. Total rules applied 105 place count 76 transition count 227
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 75 transition count 225
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 75 transition count 225
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 167 place count 45 transition count 195
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 171 place count 43 transition count 206
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 176 place count 43 transition count 201
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 181 place count 43 transition count 201
Applied a total of 181 rules in 205 ms. Remains 43 /133 variables (removed 90) and now considering 201/2335 (removed 2134) transitions.
[2026-05-27 04:50:48] [INFO ] Flow matrix only has 184 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17850960158066400275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9366535545861305749.kers'
[2026-05-27 04:50:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17850960158066400275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9366535545861305749.kers]
Normalized transition count is 183 out of 184 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 43 cols 2156 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-27 04:50:48] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9366535545861305749.kers
Total runtime 4 ms.
[2026-05-27 04:50:48] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-27 04:50:48] [INFO ] Flow matrix only has 184 transitions (discarded 17 similar events)
[2026-05-27 04:50:48] [INFO ] Invariant cache hit.
[2026-05-27 04:50:48] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-27 04:50:49] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2026-05-27 04:50:49] [INFO ] Redundant transitions in 2 ms returned []
Running 199 sub problems to find dead transitions.
[2026-05-27 04:50:49] [INFO ] Flow matrix only has 184 transitions (discarded 17 similar events)
[2026-05-27 04:50:49] [INFO ] Invariant cache hit.
[2026-05-27 04:50:49] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 183/226 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 74/129 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 1/227 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 130 constraints, problems are : Problem set: 0 solved, 199 unsolved in 23910 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 43/43 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 183/226 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 74/129 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 199/328 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 1/227 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/227 variables, and 329 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 43/43 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54208ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 54208ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/133 places, 201/2335 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54873 ms. Remains : 43/133 places, 201/2335 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0606-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0606-LTLFireability-08 finished in 55030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 15 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 120 transition count 1606
Ensure Unique test removed 6 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 32 place count 114 transition count 1606
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 112 transition count 1119
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 112 transition count 1119
Applied a total of 36 rules in 38 ms. Remains 112 /133 variables (removed 21) and now considering 1119/2335 (removed 1216) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14708520327360361540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15709226524741665733.kers'
[2026-05-27 04:51:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14708520327360361540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15709226524741665733.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1119 rows 112 cols 10215 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-27 04:51:43] [INFO ] Computed 12 invariants in 10 ms
Computed 12 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-15709226524741665733.kers
Total runtime 14 ms.
[2026-05-27 04:51:43] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-27 04:51:43] [INFO ] Invariant cache hit.
[2026-05-27 04:51:44] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
Running 1118 sub problems to find dead transitions.
[2026-05-27 04:51:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 112/1231 variables, and 14 constraints, problems are : Problem set: 0 solved, 1118 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/112 constraints, PredecessorRefiner: 1118/110 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
SMT process timed out in 61846ms, After SMT, problems are : Problem set: 0 solved, 1118 unsolved
Search for dead transitions found 0 dead transitions in 61853ms
Starting structural reductions in LTL mode, iteration 1 : 112/133 places, 1119/2335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62725 ms. Remains : 112/133 places, 1119/2335 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-0606-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0606-LTLFireability-09 finished in 62934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(G(p1)&&F(p0)&&(p2 U (p3||G(p2))))))'
Support contains 12 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 130 transition count 1929
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 130 transition count 1929
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 127 transition count 1118
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 127 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 126 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 126 transition count 1116
Applied a total of 14 rules in 31 ms. Remains 126 /133 variables (removed 7) and now considering 1116/2335 (removed 1219) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3541467894987327876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12815168008620501328.kers'
[2026-05-27 04:52:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3541467894987327876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12815168008620501328.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1116 rows 126 cols 15387 entries
Finished phase 1 with 105 SingleSign rule and 3 generalized
[2026-05-27 04:52:46] [INFO ] Computed 18 invariants in 15 ms
Computed 18 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-12815168008620501328.kers
Total runtime 19 ms.
[2026-05-27 04:52:46] [INFO ] Implicit Places using invariants in 469 ms returned []
[2026-05-27 04:52:46] [INFO ] Invariant cache hit.
[2026-05-27 04:52:47] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2026-05-27 04:52:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/1242 variables, and 20 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/126 constraints, PredecessorRefiner: 1115/106 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/1242 variables, and 21 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/126 constraints, PredecessorRefiner: 1009/106 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61327ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 61331ms
Starting structural reductions in LTL mode, iteration 1 : 126/133 places, 1116/2335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62529 ms. Remains : 126/133 places, 1116/2335 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(G(p1)&&F(p0)&&(p2 U (p3||G(p2))))))'
Stuttering acceptance computed with spot in 361 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p3) (NOT p2) (NOT p0)), (NOT p0), true, (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-0606-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 272 ms.
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Detected a total of 18/126 stabilizing places and 18/1116 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 16 factoid took 14 ms. Proved property starting from automaton with 8 states, 15 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 39 ms.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0606-LTLFireability-10 finished in 63571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((p1 U !p2)))))'
Support contains 18 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 126 transition count 1669
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 126 transition count 1669
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 124 transition count 1182
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 124 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 123 transition count 1180
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 123 transition count 1180
Applied a total of 20 rules in 45 ms. Remains 123 /133 variables (removed 10) and now considering 1180/2335 (removed 1155) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1974493949775579332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12228513140810924820.kers'
[2026-05-27 04:53:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1974493949775579332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12228513140810924820.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1180 rows 123 cols 16931 entries
Finished phase 1 with 103 SingleSign rule and 2 generalized
[2026-05-27 04:53:49] [INFO ] Computed 18 invariants in 11 ms
Computed 18 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-12228513140810924820.kers
Total runtime 14 ms.
[2026-05-27 04:53:50] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-27 04:53:50] [INFO ] Invariant cache hit.
[2026-05-27 04:53:50] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
Running 1179 sub problems to find dead transitions.
[2026-05-27 04:53:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/1303 variables, and 20 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/123 constraints, PredecessorRefiner: 1179/106 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 123/1303 variables, and 21 constraints, problems are : Problem set: 0 solved, 1179 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/123 constraints, PredecessorRefiner: 1073/106 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61632ms problems are : Problem set: 0 solved, 1179 unsolved
Search for dead transitions found 0 dead transitions in 61636ms
Starting structural reductions in LTL mode, iteration 1 : 123/133 places, 1180/2335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62633 ms. Remains : 123/133 places, 1180/2335 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' '!((p0 U X(G((p1 U !p2)))))'
Stuttering acceptance computed with spot in 183 ms :[p2, p2, true, p2, p2]
Running random walk in product with property : ErlangenMainframeV0-PT-0606-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 932 ms.
Product exploration explored 100000 steps with 0 reset in 926 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 23 factoid took 71 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 458 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 347 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 191782 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 4
Probabilistic random walk after 191782 steps, saw 98859 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
[2026-05-27 04:54:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 66/81 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 37/118 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 5/123 variables, 5/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1180/1303 variables, 123/141 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1303 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1303 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1303/1303 variables, and 141 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/81 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 37/118 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 5/123 variables, 5/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1180/1303 variables, 123/142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1303 variables, 2/144 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1303 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1303 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1303/1303 variables, and 144 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2684 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3742ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 72 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Parikh walk visited 3 properties in 61 ms.
Found 1 invariant AP formulas.
Negative knowledge disproves property using: (G (NOT p2))
Knowledge based reduction with 24 factoid took 58 ms. Proved property starting from automaton with 3 states, 6 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 7462 ms.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-13 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0606-LTLFireability-13 finished in 72191 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 (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(F(p2)&&(!p0 U (p1||G(!p0))))))))'
Support contains 15 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Graph (trivial) has 78 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 3 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 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 130 transition count 2319
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 117 transition count 2319
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 27 place count 117 transition count 2305
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 55 place count 103 transition count 2305
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 88 transition count 1559
Ensure Unique test removed 6 places
Iterating global reduction 2 with 21 rules applied. Total rules applied 91 place count 82 transition count 1559
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 82 transition count 1557
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 151 place count 53 transition count 1528
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 52 transition count 1539
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 161 place count 52 transition count 1539
Applied a total of 161 rules in 265 ms. Remains 52 /133 variables (removed 81) and now considering 1539/2335 (removed 796) transitions.
[2026-05-27 04:55:02] [INFO ] Flow matrix only has 1522 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4238725084246260148.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10661881514523984479.kers'
[2026-05-27 04:55:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4238725084246260148.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10661881514523984479.kers]
Normalized transition count is 1521 out of 1522 initially.
Culled 0 columns in 3 ms.
// Phase 1: matrix 1521 rows 52 cols 22148 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-27 04:55:02] [INFO ] Computed 12 invariants in 10 ms
Computed 12 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-10661881514523984479.kers
Total runtime 16 ms.
[2026-05-27 04:55:02] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-27 04:55:02] [INFO ] Flow matrix only has 1522 transitions (discarded 17 similar events)
[2026-05-27 04:55:02] [INFO ] Invariant cache hit.
[2026-05-27 04:55:03] [INFO ] State equation strengthened by 740 read => feed constraints.
[2026-05-27 04:55:03] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
[2026-05-27 04:55:03] [INFO ] Redundant transitions in 60 ms returned []
Running 1537 sub problems to find dead transitions.
[2026-05-27 04:55:03] [INFO ] Flow matrix only has 1522 transitions (discarded 17 similar events)
[2026-05-27 04:55:03] [INFO ] Invariant cache hit.
[2026-05-27 04:55:03] [INFO ] State equation strengthened by 740 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1537 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1537 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1537 unsolved
SMT process timed out in 32337ms, After SMT, problems are : Problem set: 0 solved, 1537 unsolved
Search for dead transitions found 0 dead transitions in 32343ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/133 places, 1539/2335 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33683 ms. Remains : 52/133 places, 1539/2335 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 (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(F(p2)&&(!p0 U (p1||G(!p0))))))))'
Stuttering acceptance computed with spot in 141 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0606-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 1391 ms.
Product exploration explored 100000 steps with 0 reset in 1430 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 15 factoid took 60 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 1015 ms. (39 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 441 ms. (90 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 221 ms. (180 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 220 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 341296 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 9
Probabilistic random walk after 341296 steps, saw 57298 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
[2026-05-27 04:55:42] [INFO ] Flow matrix only has 1522 transitions (discarded 17 similar events)
[2026-05-27 04:55:42] [INFO ] Invariant cache hit.
[2026-05-27 04:55:42] [INFO ] State equation strengthened by 740 read => feed constraints.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem apf4 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/40 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 4/12 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1521/1573 variables, 52/64 constraints. Problems are: Problem set: 3 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1573 variables, 739/803 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1573 variables, 0/803 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1574 variables, 1/804 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1574 variables, 0/804 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1574 variables, 0/804 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1574/1574 variables, and 804 constraints, problems are : Problem set: 3 solved, 6 unsolved in 1191 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 52/52 constraints, ReadFeed: 740/740 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 25/40 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 4/12 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1521/1573 variables, 52/64 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1573 variables, 739/803 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1573 variables, 0/803 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1574 variables, 1/804 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1574 variables, 0/804 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1574 variables, 0/804 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1574/1574 variables, and 804 constraints, problems are : Problem set: 3 solved, 6 unsolved in 1906 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 52/52 constraints, ReadFeed: 740/740 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3129ms problems are : Problem set: 3 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 20 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=6 )
Parikh walk visited 6 properties in 106 ms.
Found 3 invariant AP formulas.
Knowledge based reduction with 18 factoid took 133 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, false]
Knowledge-based reduction took 7691 ms.
Stuttering acceptance computed with spot in 200 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, false]
Support contains 15 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 1539/1539 transitions.
Applied a total of 0 rules in 151 ms. Remains 52 /52 variables (removed 0) and now considering 1539/1539 (removed 0) transitions.
[2026-05-27 04:55:46] [INFO ] Flow matrix only has 1522 transitions (discarded 17 similar events)
[2026-05-27 04:55:46] [INFO ] Invariant cache hit.
[2026-05-27 04:55:47] [INFO ] Implicit Places using invariants in 288 ms returned []
[2026-05-27 04:55:47] [INFO ] Flow matrix only has 1522 transitions (discarded 17 similar events)
[2026-05-27 04:55:47] [INFO ] Invariant cache hit.
[2026-05-27 04:55:47] [INFO ] State equation strengthened by 740 read => feed constraints.
[2026-05-27 04:55:48] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2026-05-27 04:55:48] [INFO ] Redundant transitions in 96 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1427 ms. Remains : 52/52 places, 1539/1539 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 17 factoid took 88 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 1403 ms. (28 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 198 ms. (201 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 295840 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 8
Probabilistic random walk after 295840 steps, saw 51143 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2026-05-27 04:55:52] [INFO ] Flow matrix only has 1522 transitions (discarded 17 similar events)
[2026-05-27 04:55:52] [INFO ] Invariant cache hit.
[2026-05-27 04:55:52] [INFO ] State equation strengthened by 740 read => feed constraints.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/40 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 4/12 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1521/1573 variables, 52/64 constraints. Problems are: Problem set: 2 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1573 variables, 739/803 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1573 variables, 0/803 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1574 variables, 1/804 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1574 variables, 0/804 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1574 variables, 0/804 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1574/1574 variables, and 804 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 52/52 constraints, ReadFeed: 740/740 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 25/40 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 4/12 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1521/1573 variables, 52/64 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1573 variables, 739/803 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1573 variables, 0/803 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1574 variables, 1/804 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1574 variables, 0/804 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1574 variables, 0/804 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1574/1574 variables, and 804 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1946 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 52/52 constraints, ReadFeed: 740/740 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3101ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 6 properties in 87 ms.
Found 2 invariant AP formulas.
Knowledge based reduction with 19 factoid took 135 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, false]
Knowledge-based reduction took 7756 ms.
Stuttering acceptance computed with spot in 237 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 328 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 0 reset in 1524 ms.
Product exploration explored 100000 steps with 0 reset in 1332 ms.
Built C files in :
/tmp/ltsmin9079567488438849659
[2026-05-27 04:55:59] [INFO ] Too many transitions (1539) to apply POR reductions. Disabling POR matrices.
[2026-05-27 04:55:59] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9079567488438849659
Running compilation step : cd /tmp/ltsmin9079567488438849659;'/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/ltsmin9079567488438849659;'/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/ltsmin9079567488438849659;'/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 15 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 1539/1539 transitions.
Applied a total of 0 rules in 76 ms. Remains 52 /52 variables (removed 0) and now considering 1539/1539 (removed 0) transitions.
[2026-05-27 04:56:02] [INFO ] Flow matrix only has 1522 transitions (discarded 17 similar events)
[2026-05-27 04:56:02] [INFO ] Invariant cache hit.
[2026-05-27 04:56:02] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-27 04:56:02] [INFO ] Flow matrix only has 1522 transitions (discarded 17 similar events)
[2026-05-27 04:56:02] [INFO ] Invariant cache hit.
[2026-05-27 04:56:03] [INFO ] State equation strengthened by 740 read => feed constraints.
[2026-05-27 04:56:03] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
[2026-05-27 04:56:04] [INFO ] Redundant transitions in 93 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1424 ms. Remains : 52/52 places, 1539/1539 transitions.
Built C files in :
/tmp/ltsmin7243766505606145837
[2026-05-27 04:56:04] [INFO ] Too many transitions (1539) to apply POR reductions. Disabling POR matrices.
[2026-05-27 04:56:04] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7243766505606145837
Running compilation step : cd /tmp/ltsmin7243766505606145837;'/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/ltsmin7243766505606145837;'/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/ltsmin7243766505606145837;'/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 04:56:08] [INFO ] Flatten gal took : 291 ms
[2026-05-27 04:56:08] [INFO ] Flatten gal took : 227 ms
[2026-05-27 04:56:08] [INFO ] Time to serialize gal into /tmp/LTL16880354933960376934.gal : 75 ms
[2026-05-27 04:56:08] [INFO ] Time to serialize properties into /tmp/LTL14481886925373351612.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/LTL16880354933960376934.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7074588231935580118.hoa' '-atoms' '/tmp/LTL14481886925373351612.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/LTL14481886925373351612.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7074588231935580118.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-27 04:56:23] [INFO ] Flatten gal took : 151 ms
[2026-05-27 04:56:23] [INFO ] Flatten gal took : 145 ms
[2026-05-27 04:56:23] [INFO ] Time to serialize gal into /tmp/LTL10680428097903999443.gal : 31 ms
[2026-05-27 04:56:23] [INFO ] Time to serialize properties into /tmp/LTL4281782067669572520.ltl : 5 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/LTL10680428097903999443.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4281782067669572520.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((!("((((p13==1)&&(p42==1))&&((p51==1)&&(p80==1)))&&(((p89==1)&&(p118==1))&&((p158==1)&&(p211==1))))"))U((G(!("((((p13==1)&&(p42=...1397
Formula 0 simplified : G(F(!"((!((((p17==1)&&(p42==1))&&((p55==1)&&(p70==1)))&&(((p89==1)&&(p112==1))&&((p158==1)&&(p211==1)))))&&(!((((p13==1)&&(p42==1))&...744
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-27 04:56:39] [INFO ] Flatten gal took : 243 ms
[2026-05-27 04:56:39] [INFO ] Applying decomposition
[2026-05-27 04:56:39] [INFO ] Flatten gal took : 242 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/graph4207609282907497423.txt' '-o' '/tmp/graph4207609282907497423.bin' '-w' '/tmp/graph4207609282907497423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4207609282907497423.bin' '-l' '-1' '-v' '-w' '/tmp/graph4207609282907497423.weights' '-q' '0' '-e' '0.001'
[2026-05-27 04:56:40] [INFO ] Decomposing Gal with order
[2026-05-27 04:56:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 04:56:40] [INFO ] Removed a total of 10774 redundant transitions.
[2026-05-27 04:56:40] [INFO ] Flatten gal took : 705 ms
[2026-05-27 04:56:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 121 ms.
[2026-05-27 04:56:41] [INFO ] Time to serialize gal into /tmp/LTL1415136011889762751.gal : 8 ms
[2026-05-27 04:56:41] [INFO ] Time to serialize properties into /tmp/LTL12046903519634042734.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/LTL1415136011889762751.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12046903519634042734.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(((!("((((i2.u10.p13==1)&&(i0.u0.p42==1))&&((i0.u1.p51==1)&&(i0.u1.p80==1)))&&(((i0.u3.p89==1)&&(i0.u4.p118==1))&&((i2.u8.p158==1)...2044
Formula 0 simplified : G(F(!"((!((((i0.u3.p17==1)&&(i0.u0.p42==1))&&((i0.u4.p55==1)&&(i0.u2.p70==1)))&&(((i0.u3.p89==1)&&(i0.u7.p112==1))&&((i2.u8.p158==1)...1092
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
238 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.44183,72948,1,0,107376,4244,4176,209673,454,28083,108862
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ErlangenMainframeV0-PT-0606-LTLFireability-14 finished in 101879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p1)&&X(X(p2))))))'
Support contains 14 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2335/2335 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 2091
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 2091
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 129 transition count 1604
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 129 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 128 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 128 transition count 1602
Applied a total of 10 rules in 34 ms. Remains 128 /133 variables (removed 5) and now considering 1602/2335 (removed 733) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8818058207852683540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12846733516083484520.kers'
[2026-05-27 04:56:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8818058207852683540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12846733516083484520.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 1602 rows 128 cols 22839 entries
Finished phase 1 with 107 SingleSign rule and 3 generalized
[2026-05-27 04:56:44] [INFO ] Computed 18 invariants in 23 ms
Computed 18 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-12846733516083484520.kers
Total runtime 29 ms.
[2026-05-27 04:56:44] [INFO ] Implicit Places using invariants in 637 ms returned []
[2026-05-27 04:56:44] [INFO ] Invariant cache hit.
[2026-05-27 04:56:46] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 2071 ms to find 0 implicit places.
Running 1601 sub problems to find dead transitions.
[2026-05-27 04:56:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 128/1730 variables, and 20 constraints, problems are : Problem set: 0 solved, 1601 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/128 constraints, PredecessorRefiner: 1601/99 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/1730 variables, and 21 constraints, problems are : Problem set: 0 solved, 1601 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/128 constraints, PredecessorRefiner: 1502/99 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62486ms problems are : Problem set: 0 solved, 1601 unsolved
Search for dead transitions found 0 dead transitions in 62491ms
Starting structural reductions in LTL mode, iteration 1 : 128/133 places, 1602/2335 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64603 ms. Remains : 128/133 places, 1602/2335 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p1)&&X(X(p2))))))'
Stuttering acceptance computed with spot in 518 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0606-LTLFireability-15
Entered a terminal (fully accepting) state of product in 10983 steps with 0 reset in 125 ms.
FORMULA ErlangenMainframeV0-PT-0606-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0606-LTLFireability-15 finished in 65327 ms.
All properties solved by simple procedures.
Total runtime 908951 ms.

BK_STOP 1779857869396

--------------------
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-0606"
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-0606, 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-177955740600428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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