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.r146-tall-177961074100252.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 GPPP-PT-C0001N0000000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 8.4K Mar 7 11:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 7 11:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 7 11:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 11:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 10:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 11:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 11:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1 Mar 3 18:30 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000010-LTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779708571138

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000000010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 11:29:32] [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-25 11:29:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:29:32] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2026-05-25 11:29:32] [INFO ] Transformed 33 places.
[2026-05-25 11:29:32] [INFO ] Transformed 22 transitions.
[2026-05-25 11:29:32] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2401212164593199712.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12241212773539996418.kers'
[2026-05-25 11:29:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2401212164593199712.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12241212773539996418.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 11:29:32] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12241212773539996418.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1801ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1816ms
[2026-05-25 11:29:34] [INFO ] Invariant cache hit.
[2026-05-25 11:29:34] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 11:29:34] [INFO ] Invariant cache hit.
[2026-05-25 11:29:34] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1960 ms. Remains : 33/33 places, 22/22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:29:34] [INFO ] Invariant cache hit.
[2026-05-25 11:29:34] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 11:29:34] [INFO ] Invariant cache hit.
[2026-05-25 11:29:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 32 out of 33 places after structural reductions.
[2026-05-25 11:29:34] [INFO ] Flatten gal took : 15 ms
[2026-05-25 11:29:34] [INFO ] Flatten gal took : 9 ms
[2026-05-25 11:29:34] [INFO ] Input system was already deterministic with 22 transitions.
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40005 steps (8 resets) in 538 ms. (74 steps per ms) remains 2/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
[2026-05-25 11:29:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/26 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/28 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/29 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/49 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/49 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/52 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/52 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/52 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/55 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/55 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/26 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/28 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Int declared 29/55 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 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' '!(((p0 U G(p1))||X(F(p2))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:29:35] [INFO ] Invariant cache hit.
[2026-05-25 11:29:35] [INFO ] Implicit Places using invariants in 40 ms returned [0, 2, 19]
[2026-05-25 11:29:35] [INFO ] Actually due to overlaps returned [19, 0]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 31/33 places, 22/22 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 G(p1))||X(F(p2))))'
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-00
Product exploration explored 100000 steps with 1003 reset in 284 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 1 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-00 finished in 646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
Applied a total of 11 rules in 19 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
Running 16 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17250787096113612593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3368631130702905802.kers'
[2026-05-25 11:29:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17250787096113612593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3368631130702905802.kers]
Normalized transition count is 16 out of 17 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 16 rows 22 cols 58 entries
Finished phase 1 with 8 SingleSign rule and 7 generalized
[2026-05-25 11:29:36] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3368631130702905802.kers
Total runtime 0 ms.
[2026-05-25 11:29:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 16/42 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 38 constraints, problems are : Problem set: 0 solved, 16 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 16/42 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/43 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 54 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1327ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 1327ms
[2026-05-25 11:29:37] [INFO ] Invariant cache hit.
[2026-05-25 11:29:37] [INFO ] Implicit Places using invariants in 47 ms returned [0, 2, 3, 14]
[2026-05-25 11:29:37] [INFO ] Actually due to overlaps returned [14, 0, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/33 places, 17/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 22 transition count 16
Applied a total of 2 rules in 3 ms. Remains 22 /23 variables (removed 1) and now considering 16/17 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11737536551732702490.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4409210480345037968.kers'
[2026-05-25 11:29:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11737536551732702490.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4409210480345037968.kers]
Normalized transition count is 15 out of 16 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 15 rows 19 cols 49 entries
Finished phase 1 with 10 SingleSign rule and 4 generalized
[2026-05-25 11:29:37] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4409210480345037968.kers
Total runtime 0 ms.
[2026-05-25 11:29:37] [INFO ] Implicit Places using invariants in 28 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/33 places, 16/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1430 ms. Remains : 21/33 places, 16/22 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 31 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-03
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-03 finished in 1481 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)||X(X(G(!p2)))) U p3)))'
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4962462678555789165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3318512443945754756.kers'
[2026-05-25 11:29:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4962462678555789165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3318512443945754756.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 11:29:37] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3318512443945754756.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 984 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1206ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1207ms
[2026-05-25 11:29:38] [INFO ] Invariant cache hit.
[2026-05-25 11:29:38] [INFO ] Implicit Places using invariants in 30 ms returned [0, 2, 3, 19]
[2026-05-25 11:29:38] [INFO ] Actually due to overlaps returned [19, 0, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1240 ms. Remains : 30/33 places, 22/22 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)||X(X(G(!p1)))||p2) U p3)))'
Stuttering acceptance computed with spot in 293 ms :[(NOT p3), (NOT p3), p1, (AND (NOT p0) p1), p1, true, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-04 finished in 1570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(!p1))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:29:39] [INFO ] Invariant cache hit.
[2026-05-25 11:29:39] [INFO ] Implicit Places using invariants in 30 ms returned [0, 2, 3]
[2026-05-25 11:29:39] [INFO ] Actually due to overlaps returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 31/33 places, 22/22 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((X(p0)&&p1)))))'
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-05
Product exploration explored 100000 steps with 8250 reset in 156 ms.
Stack based approach found an accepted trace after 54 steps with 6 reset with depth 7 and stack size 7 in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-05 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F((p0 U (G(p0)||(p0&&G(!p1))))))||(!p1&&F((p0 U (G(p0)||(p0&&G(!p1)))))&&X(!p2))))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:29:39] [INFO ] Invariant cache hit.
[2026-05-25 11:29:39] [INFO ] Implicit Places using invariants in 36 ms returned [0, 1, 2, 3, 19]
[2026-05-25 11:29:39] [INFO ] Actually due to overlaps returned [1, 19, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 37 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 29/33 places, 22/22 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F((p0 U (G(p0)||(p0&&G(!p1))))))||(F((p0 U (G(p0)||(p0&&G(!p1)))))&&X(p2)&&!p1)))))'
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 127 ms.
Stack based approach found an accepted trace after 177 steps with 0 reset with depth 178 and stack size 175 in 1 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-06 finished in 401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(X(p0)) U p1) U p2)))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:29:40] [INFO ] Invariant cache hit.
[2026-05-25 11:29:40] [INFO ] Implicit Places using invariants in 38 ms returned [0, 1, 2, 3, 19]
[2026-05-25 11:29:40] [INFO ] Actually due to overlaps returned [1, 19, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 39 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 29/33 places, 22/22 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(X(p0)) U p1) U p2)))'
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p2), true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-07
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-07 finished in 228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(X(!p1))) U (X(X(p3))&&p2))))'
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:29:40] [INFO ] Invariant cache hit.
[2026-05-25 11:29:40] [INFO ] Implicit Places using invariants in 39 ms returned [1, 3, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 30/33 places, 22/22 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(X(!p1))) U (X(X(p3))&&p2))))'
Stuttering acceptance computed with spot in 699 ms :[(OR (NOT p2) (NOT p3)), p1, (OR (NOT p2) (NOT p3)), p1, (AND p1 (NOT p3)), (NOT p3), (AND p1 (NOT p3)), p1, true, p1, p1, (AND p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p3), (AND p1 (NOT p3)), (AND (NOT p3) p1), (NOT p3), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-08
Product exploration explored 100000 steps with 22346 reset in 101 ms.
Stack based approach found an accepted trace after 10828 steps with 2394 reset with depth 8 and stack size 8 in 13 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-08 finished in 914 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 U (p2||G(p1)))))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:29:41] [INFO ] Invariant cache hit.
[2026-05-25 11:29:41] [INFO ] Implicit Places using invariants in 51 ms returned [0, 1, 2, 3, 19]
[2026-05-25 11:29:41] [INFO ] Actually due to overlaps returned [1, 19, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 52 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 29/33 places, 22/22 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 U (p2||G(p1)))))))'
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 64 ms.
Product exploration explored 100000 steps with 33333 reset in 69 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 16 ms. Proved property starting from automaton with 3 states, 5 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-09 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p1 U X(X(X(p1)))))||p0)))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:29:41] [INFO ] Invariant cache hit.
[2026-05-25 11:29:41] [INFO ] Implicit Places using invariants in 31 ms returned [0, 1, 2, 3, 19]
[2026-05-25 11:29:41] [INFO ] Actually due to overlaps returned [1, 19, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 33 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 29/33 places, 22/22 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p1 U X(X(X(p1)))))||p0)))'
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-11
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-11 finished in 278 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)))&&(p0 U X(p0))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:29:41] [INFO ] Invariant cache hit.
[2026-05-25 11:29:41] [INFO ] Implicit Places using invariants in 30 ms returned [0, 1, 2, 3]
[2026-05-25 11:29:41] [INFO ] Actually due to overlaps returned [1, 0, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32 ms. Remains : 30/33 places, 22/22 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)))&&(!p0 U X(!p0))))'
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), true, (OR (NOT p1) p0), true]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-12
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-12 finished in 203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 5 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
Running 15 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4182862053801201021.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3719688213121776356.kers'
[2026-05-25 11:29:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4182862053801201021.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3719688213121776356.kers]
Normalized transition count is 15 out of 16 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 15 rows 21 cols 56 entries
Finished phase 1 with 7 SingleSign rule and 7 generalized
[2026-05-25 11:29:42] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3719688213121776356.kers
Total runtime 0 ms.
[2026-05-25 11:29:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 15/40 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/41 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/41 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 37 constraints, problems are : Problem set: 0 solved, 15 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 15/40 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/41 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 52 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1188 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1451ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 1451ms
[2026-05-25 11:29:43] [INFO ] Invariant cache hit.
[2026-05-25 11:29:43] [INFO ] Implicit Places using invariants in 28 ms returned [0, 1, 2, 3]
[2026-05-25 11:29:43] [INFO ] Actually due to overlaps returned [1, 0, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 16/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 15
Applied a total of 2 rules in 4 ms. Remains 21 /22 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8658933924257220207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1830733232231226457.kers'
[2026-05-25 11:29:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8658933924257220207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1830733232231226457.kers]
Normalized transition count is 14 out of 15 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 14 rows 18 cols 47 entries
Finished phase 1 with 9 SingleSign rule and 4 generalized
[2026-05-25 11:29:43] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1830733232231226457.kers
Total runtime 0 ms.
[2026-05-25 11:29:43] [INFO ] Implicit Places using invariants in 64 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/33 places, 15/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1559 ms. Remains : 20/33 places, 15/22 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-13
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-13 finished in 1610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(X(G(p1))))&&p0)) U p2))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10421420508122478425.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13178773499989211654.kers'
[2026-05-25 11:29:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10421420508122478425.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13178773499989211654.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 11:29:43] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13178773499989211654.kers
Total runtime 2 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1005 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1206ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1206ms
[2026-05-25 11:29:44] [INFO ] Invariant cache hit.
[2026-05-25 11:29:44] [INFO ] Implicit Places using invariants in 33 ms returned [0, 1, 2, 3, 19]
[2026-05-25 11:29:44] [INFO ] Actually due to overlaps returned [1, 19, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1242 ms. Remains : 29/33 places, 22/22 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(X(G(p1))))&&p0)) U p2))'
Stuttering acceptance computed with spot in 341 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 111 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 44 in 1 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLFireability-14 finished in 1724 ms.
All properties solved by simple procedures.
Total runtime 13146 ms.

BK_STOP 1779708585438

--------------------
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="GPPP-PT-C0001N0000000010"
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 GPPP-PT-C0001N0000000010, 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 r146-tall-177961074100252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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