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.r066-tall-177946967700332.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 CO4-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.1K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 13:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 98K 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 CO4-PT-07-LTLFireability-00
FORMULA_NAME CO4-PT-07-LTLFireability-01
FORMULA_NAME CO4-PT-07-LTLFireability-02
FORMULA_NAME CO4-PT-07-LTLFireability-03
FORMULA_NAME CO4-PT-07-LTLFireability-04
FORMULA_NAME CO4-PT-07-LTLFireability-05
FORMULA_NAME CO4-PT-07-LTLFireability-06
FORMULA_NAME CO4-PT-07-LTLFireability-07
FORMULA_NAME CO4-PT-07-LTLFireability-08
FORMULA_NAME CO4-PT-07-LTLFireability-09
FORMULA_NAME CO4-PT-07-LTLFireability-10
FORMULA_NAME CO4-PT-07-LTLFireability-11
FORMULA_NAME CO4-PT-07-LTLFireability-12
FORMULA_NAME CO4-PT-07-LTLFireability-13
FORMULA_NAME CO4-PT-07-LTLFireability-14
FORMULA_NAME CO4-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779521548060

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 07:32:29] [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-23 07:32:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:32:29] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2026-05-23 07:32:29] [INFO ] Transformed 384 places.
[2026-05-23 07:32:29] [INFO ] Transformed 456 transitions.
[2026-05-23 07:32:29] [INFO ] Found NUPN structural information;
[2026-05-23 07:32:29] [INFO ] Parsed PT model containing 384 places and 456 transitions and 1022 arcs in 168 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.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 336/336 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 274 transition count 335
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 68 place count 217 transition count 277
Iterating global reduction 1 with 57 rules applied. Total rules applied 125 place count 217 transition count 277
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 129 place count 217 transition count 273
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 155 place count 191 transition count 247
Iterating global reduction 2 with 26 rules applied. Total rules applied 181 place count 191 transition count 247
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 184 place count 188 transition count 243
Iterating global reduction 2 with 3 rules applied. Total rules applied 187 place count 188 transition count 243
Applied a total of 187 rules in 65 ms. Remains 188 /284 variables (removed 96) and now considering 243/336 (removed 93) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1050734985239508331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4790896255765852904.kers'
[2026-05-23 07:32:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1050734985239508331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4790896255765852904.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 243 rows 188 cols 553 entries
Finished phase 1 with 184 SingleSign rule and 0 generalized
[2026-05-23 07:32:29] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4790896255765852904.kers
Total runtime 2 ms.
[2026-05-23 07:32:29] [INFO ] Implicit Places using invariants in 225 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 257 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/284 places, 243/336 transitions.
Applied a total of 0 rules in 5 ms. Remains 187 /187 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 342 ms. Remains : 187/284 places, 243/336 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 243/243 transitions.
Applied a total of 0 rules in 4 ms. Remains 187 /187 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1668785647740377815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12324176760385032154.kers'
[2026-05-23 07:32:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1668785647740377815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12324176760385032154.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 243 rows 187 cols 551 entries
Finished phase 1 with 184 SingleSign rule and 0 generalized
[2026-05-23 07:32:29] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12324176760385032154.kers
Total runtime 1 ms.
[2026-05-23 07:32:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-23 07:32:29] [INFO ] Invariant cache hit.
[2026-05-23 07:32:30] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-23 07:32:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 243/430 variables, 187/190 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 0/430 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 192 constraints, problems are : Problem set: 0 solved, 242 unsolved in 17817 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 243/430 variables, 187/192 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 242/434 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 435 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47920ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 47930ms
Finished structural reductions in LTL mode , in 1 iterations and 48216 ms. Remains : 187/187 places, 243/243 transitions.
Support contains 20 out of 187 places after structural reductions.
[2026-05-23 07:33:18] [INFO ] Flatten gal took : 37 ms
[2026-05-23 07:33:18] [INFO ] Flatten gal took : 14 ms
[2026-05-23 07:33:18] [INFO ] Input system was already deterministic with 243 transitions.
RANDOM walk for 40000 steps (60 resets) in 1239 ms. (32 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4000 steps (22 resets) in 49 ms. (80 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (48 resets) in 43 ms. (90 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4001 steps (29 resets) in 80 ms. (49 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (48 resets) in 28 ms. (138 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (37 resets) in 24 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (30 resets) in 20 ms. (190 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4002 steps (33 resets) in 24 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4001 steps (26 resets) in 34 ms. (114 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4001 steps (26 resets) in 22 ms. (173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (42 resets) in 17 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4001 steps (41 resets) in 14 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000 steps (24 resets) in 18 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000 steps (25 resets) in 16 ms. (235 steps per ms) remains 12/12 properties
[2026-05-23 07:33:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 9/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 11/34 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 56/90 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 112/202 variables, 31/68 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 152/354 variables, 74/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 67/421 variables, 42/184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 7/428 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 2/430 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/430 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 190 constraints, problems are : Problem set: 0 solved, 12 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 9/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 11/34 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 56/90 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 112/202 variables, 31/68 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 152/354 variables, 74/154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 67/421 variables, 42/196 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 7/428 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 2/430 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/430 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 202 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1933 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2663ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Finished Parikh walk after 587 steps, including 15 resets, run visited all 1 properties in 2 ms. (steps per millisecond=293 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 439 ms.
FORMULA CO4-PT-07-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 15 stable transitions
Graph (complete) has 311 edges and 187 vertex of which 183 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 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((p0 U X(X(X(p1))))) U (p2&&X((p0 U X(X(X(p1)))))))))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 243/243 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 179 transition count 233
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 179 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 179 transition count 232
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 174 transition count 226
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 174 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 174 transition count 225
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 172 transition count 223
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 172 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 172 transition count 222
Applied a total of 33 rules in 14 ms. Remains 172 /187 variables (removed 15) and now considering 222/243 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13056259771474458448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2433160468471032944.kers'
[2026-05-23 07:33:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13056259771474458448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2433160468471032944.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 172 cols 506 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 07:33:22] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2433160468471032944.kers
Total runtime 2 ms.
[2026-05-23 07:33:22] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-23 07:33:22] [INFO ] Invariant cache hit.
[2026-05-23 07:33:22] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-23 07:33:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/394 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 177 constraints, problems are : Problem set: 0 solved, 221 unsolved in 15016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/394 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 221/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 399 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45047ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 45048ms
Starting structural reductions in LTL mode, iteration 1 : 172/187 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45210 ms. Remains : 172/187 places, 222/243 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((p0 U X(X(X(p1))))) U (p2&&X((p0 U X(X(X(p1)))))))))'
Stuttering acceptance computed with spot in 603 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-07-LTLFireability-00
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA CO4-PT-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLFireability-00 finished in 45911 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(p0)))'
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 243/243 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 178 transition count 233
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 178 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 178 transition count 232
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 173 transition count 226
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 173 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 173 transition count 225
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 171 transition count 223
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 171 transition count 223
Applied a total of 34 rules in 15 ms. Remains 171 /187 variables (removed 16) and now considering 223/243 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16858560120277160439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-677764556303044279.kers'
[2026-05-23 07:34:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16858560120277160439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-677764556303044279.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 171 cols 508 entries
Finished phase 1 with 168 SingleSign rule and 0 generalized
[2026-05-23 07:34:08] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-677764556303044279.kers
Total runtime 1 ms.
[2026-05-23 07:34:08] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-23 07:34:08] [INFO ] Invariant cache hit.
[2026-05-23 07:34:08] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-23 07:34:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 223/394 variables, 171/174 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 176 constraints, problems are : Problem set: 0 solved, 222 unsolved in 14903 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/394 variables, 171/176 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 222/398 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 399 constraints, problems are : Problem set: 0 solved, 222 unsolved in 26593 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41517ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 41518ms
Starting structural reductions in LTL mode, iteration 1 : 171/187 places, 223/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41786 ms. Remains : 171/187 places, 223/243 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(p0)))'
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CO4-PT-07-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CO4-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLFireability-01 finished in 41920 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)))'
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 243/243 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 177 transition count 231
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 177 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 177 transition count 230
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 171 transition count 223
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 171 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 171 transition count 222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 168 transition count 219
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 168 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 168 transition count 218
Applied a total of 41 rules in 15 ms. Remains 168 /187 variables (removed 19) and now considering 218/243 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17596175105791040710.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7887809558836839548.kers'
[2026-05-23 07:34:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17596175105791040710.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7887809558836839548.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 168 cols 498 entries
Finished phase 1 with 165 SingleSign rule and 0 generalized
[2026-05-23 07:34:50] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7887809558836839548.kers
Total runtime 1 ms.
[2026-05-23 07:34:50] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 07:34:50] [INFO ] Invariant cache hit.
[2026-05-23 07:34:50] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-23 07:34:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/386 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 173 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14092 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/386 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 217/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 391 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44129ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 44130ms
Starting structural reductions in LTL mode, iteration 1 : 168/187 places, 218/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44282 ms. Remains : 168/187 places, 218/243 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)))'
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-07-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 285 edges and 168 vertex of which 165 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 14 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA CO4-PT-07-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-07-LTLFireability-02 finished in 44698 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 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 243/243 transitions.
Graph (trivial) has 199 edges and 187 vertex of which 2 / 187 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.
Graph (complete) has 310 edges and 186 vertex of which 182 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 181 transition count 171
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 69 rules applied. Total rules applied 137 place count 115 transition count 168
Reduce places removed 1 places and 0 transitions.
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 2 with 3 rules applied. Total rules applied 140 place count 114 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 113 transition count 166
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 141 place count 113 transition count 147
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 179 place count 94 transition count 147
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 184 place count 89 transition count 140
Iterating global reduction 4 with 5 rules applied. Total rules applied 189 place count 89 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 89 transition count 138
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 191 place count 89 transition count 137
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 193 place count 88 transition count 137
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 195 place count 86 transition count 135
Iterating global reduction 5 with 2 rules applied. Total rules applied 197 place count 86 transition count 135
Performed 28 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 253 place count 58 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 255 place count 58 transition count 97
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 283 place count 44 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 292 place count 44 transition count 89
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 303 place count 33 transition count 67
Iterating global reduction 7 with 11 rules applied. Total rules applied 314 place count 33 transition count 67
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 322 place count 33 transition count 59
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 325 place count 30 transition count 50
Iterating global reduction 8 with 3 rules applied. Total rules applied 328 place count 30 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 330 place count 30 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 332 place count 29 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 339 place count 29 transition count 49
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 341 place count 27 transition count 47
Applied a total of 341 rules in 53 ms. Remains 27 /187 variables (removed 160) and now considering 47/243 (removed 196) transitions.
[2026-05-23 07:35:34] [INFO ] Flow matrix only has 42 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-13698848160047751404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9121600452666984300.kers'
[2026-05-23 07:35:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13698848160047751404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9121600452666984300.kers]
Normalized transition count is 41 out of 42 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 41 rows 27 cols 110 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-23 07:35:34] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9121600452666984300.kers
Total runtime 0 ms.
[2026-05-23 07:35:34] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-23 07:35:34] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
[2026-05-23 07:35:34] [INFO ] Invariant cache hit.
[2026-05-23 07:35:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 07:35:34] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2026-05-23 07:35:34] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2026-05-23 07:35:34] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
[2026-05-23 07:35:34] [INFO ] Invariant cache hit.
[2026-05-23 07:35:34] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 41/68 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 1/69 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 32 constraints, problems are : Problem set: 0 solved, 37 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 41/68 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 37/68 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 1/69 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 69 constraints, problems are : Problem set: 0 solved, 37 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1256ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 1256ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/187 places, 47/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1377 ms. Remains : 27/187 places, 47/243 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 45 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-07-LTLFireability-04
Product exploration explored 100000 steps with 12 reset in 76 ms.
Product exploration explored 100000 steps with 15 reset in 74 ms.
Computed a total of 7 stabilizing places and 12 stable transitions
Computed a total of 7 stabilizing places and 12 stable transitions
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 1031 steps (143 resets) in 21 ms. (46 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 56 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 39 ms :[(NOT p0)]
Knowledge-based reduction took 165 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 47/47 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2026-05-23 07:35:36] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
[2026-05-23 07:35:36] [INFO ] Invariant cache hit.
[2026-05-23 07:35:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-23 07:35:36] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
[2026-05-23 07:35:36] [INFO ] Invariant cache hit.
[2026-05-23 07:35:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 07:35:36] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2026-05-23 07:35:36] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 27/27 places, 47/47 transitions.
Computed a total of 7 stabilizing places and 12 stable transitions
Computed a total of 7 stabilizing places and 12 stable transitions
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 5085 steps (731 resets) in 61 ms. (82 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 59 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 40 ms :[(NOT p0)]
Knowledge-based reduction took 171 ms.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 38 ms.
Product exploration explored 100000 steps with 9 reset in 59 ms.
Built C files in :
/tmp/ltsmin11499859694724996467
[2026-05-23 07:35:37] [INFO ] Computing symmetric may disable matrix : 47 transitions.
[2026-05-23 07:35:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:35:37] [INFO ] Computing symmetric may enable matrix : 47 transitions.
[2026-05-23 07:35:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:35:37] [INFO ] Computing Do-Not-Accords matrix : 47 transitions.
[2026-05-23 07:35:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:35:37] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11499859694724996467
Running compilation step : cd /tmp/ltsmin11499859694724996467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 232 ms.
Running link step : cd /tmp/ltsmin11499859694724996467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11499859694724996467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10697885992153560146.hoa' '--buchi-type=spotba'
LTSmin run took 51 ms.
FORMULA CO4-PT-07-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-07-LTLFireability-04 finished in 2638 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((p0 U (G(p0)||p1)))) U (G(X(X((p0 U (p1||G(p0))))))||(p2&&X(X((p0 U (p1||G(p0)))))))))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 243/243 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 178 transition count 233
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 178 transition count 233
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 172 transition count 226
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 172 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 172 transition count 225
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 169 transition count 222
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 169 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 169 transition count 221
Applied a total of 38 rules in 15 ms. Remains 169 /187 variables (removed 18) and now considering 221/243 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12878921045933750066.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5793300234313740693.kers'
[2026-05-23 07:35:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12878921045933750066.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5793300234313740693.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 169 cols 506 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-23 07:35:37] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5793300234313740693.kers
Total runtime 1 ms.
[2026-05-23 07:35:37] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 07:35:37] [INFO ] Invariant cache hit.
[2026-05-23 07:35:37] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-23 07:35:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/390 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/390 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 174 constraints, problems are : Problem set: 0 solved, 220 unsolved in 14508 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/390 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 220/394 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/390 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 395 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44541ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 44542ms
Starting structural reductions in LTL mode, iteration 1 : 169/187 places, 221/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44698 ms. Remains : 169/187 places, 221/243 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((p0 U (G(p0)||p1)))) U (G(X(X((p0 U (p1||G(p0))))))||(p2&&X(X((p0 U (p1||G(p0)))))))))'
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : CO4-PT-07-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 104 ms.
Product exploration explored 100000 steps with 33333 reset in 100 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 289 edges and 169 vertex of which 166 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Detected a total of 11/169 stabilizing places and 14/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 14 factoid took 17 ms. Proved property starting from automaton with 4 states, 7 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA CO4-PT-07-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-07-LTLFireability-07 finished in 45084 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 (p1||X(F(p2)))))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 243/243 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 180 transition count 234
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 180 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 180 transition count 233
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 175 transition count 227
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 175 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 175 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 172 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 172 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 172 transition count 222
Applied a total of 33 rules in 15 ms. Remains 172 /187 variables (removed 15) and now considering 222/243 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4606763786426409173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12112087409688033141.kers'
[2026-05-23 07:36:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4606763786426409173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12112087409688033141.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 172 cols 507 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 07:36:22] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12112087409688033141.kers
Total runtime 1 ms.
[2026-05-23 07:36:22] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-23 07:36:22] [INFO ] Invariant cache hit.
[2026-05-23 07:36:22] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-23 07:36:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/394 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 177 constraints, problems are : Problem set: 0 solved, 221 unsolved in 14626 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/394 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 221/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 399 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44660ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 44660ms
Starting structural reductions in LTL mode, iteration 1 : 172/187 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44830 ms. Remains : 172/187 places, 222/243 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 (p1||X(F(p2)))))'
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p2) p0), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : CO4-PT-07-LTLFireability-10
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA CO4-PT-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLFireability-10 finished in 45009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 243/243 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 177 transition count 231
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 177 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 177 transition count 230
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 171 transition count 223
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 171 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 171 transition count 222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 168 transition count 219
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 168 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 168 transition count 218
Applied a total of 41 rules in 12 ms. Remains 168 /187 variables (removed 19) and now considering 218/243 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12985431256181053435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5477804788054742115.kers'
[2026-05-23 07:37:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12985431256181053435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5477804788054742115.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 168 cols 498 entries
Finished phase 1 with 165 SingleSign rule and 0 generalized
[2026-05-23 07:37:07] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5477804788054742115.kers
Total runtime 1 ms.
[2026-05-23 07:37:07] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-23 07:37:07] [INFO ] Invariant cache hit.
[2026-05-23 07:37:07] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-23 07:37:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/386 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 173 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13749 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/386 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 217/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 391 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43785ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 43786ms
Starting structural reductions in LTL mode, iteration 1 : 168/187 places, 218/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43943 ms. Remains : 168/187 places, 218/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-07-LTLFireability-12
Product exploration explored 100000 steps with 9763 reset in 81 ms.
Stack based approach found an accepted trace after 19459 steps with 1897 reset with depth 20 and stack size 20 in 19 ms.
FORMULA CO4-PT-07-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-07-LTLFireability-12 finished in 44213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 243/243 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 179 transition count 233
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 179 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 179 transition count 232
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 175 transition count 228
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 175 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 175 transition count 227
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 173 transition count 225
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 173 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 173 transition count 224
Applied a total of 31 rules in 12 ms. Remains 173 /187 variables (removed 14) and now considering 224/243 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17446341644313254708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15566233635033351397.kers'
[2026-05-23 07:37:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17446341644313254708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15566233635033351397.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 173 cols 510 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-23 07:37:51] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15566233635033351397.kers
Total runtime 1 ms.
[2026-05-23 07:37:51] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-23 07:37:51] [INFO ] Invariant cache hit.
[2026-05-23 07:37:51] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-23 07:37:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 224/397 variables, 173/176 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 0/397 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 178 constraints, problems are : Problem set: 0 solved, 223 unsolved in 14256 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 224/397 variables, 173/178 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 223/401 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 0/397 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 402 constraints, problems are : Problem set: 0 solved, 223 unsolved in 28034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42305ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 42305ms
Starting structural reductions in LTL mode, iteration 1 : 173/187 places, 224/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42478 ms. Remains : 173/187 places, 224/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-07-LTLFireability-13
Product exploration explored 100000 steps with 5 reset in 77 ms.
Product exploration explored 100000 steps with 5 reset in 95 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 291 edges and 173 vertex of which 170 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge based reduction with 9 factoid took 47 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (60 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (60 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (30 resets) in 151 ms. (263 steps per ms) remains 2/4 properties
[2026-05-23 07:38:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/29 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 83/112 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/119 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 10/129 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 166/295 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 80/375 variables, 48/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/375 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 16/391 variables, 10/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/391 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 17 (OVERLAPS) 6/397 variables, 3/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/397 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/397 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 176 constraints, problems are : Problem set: 1 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/21 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 70/91 variables, 14/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/98 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/108 variables, 2/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/267 variables, 78/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 106/373 variables, 61/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/391 variables, 11/174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/391 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/397 variables, 3/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/397 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/397 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 177 constraints, problems are : Problem set: 1 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 434ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 54 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 98 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 834 ms.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 224/224 transitions.
Graph (trivial) has 179 edges and 173 vertex of which 2 / 173 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 290 edges and 172 vertex of which 169 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 168 transition count 164
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 113 transition count 163
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 113 place count 113 transition count 142
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 155 place count 92 transition count 142
Performed 28 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 211 place count 64 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 213 place count 64 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 214 place count 63 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 63 transition count 103
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 3 with 2 rules applied. Total rules applied 217 place count 62 transition count 102
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 243 place count 49 transition count 103
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 251 place count 49 transition count 95
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 261 place count 39 transition count 75
Iterating global reduction 4 with 10 rules applied. Total rules applied 271 place count 39 transition count 75
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 278 place count 39 transition count 68
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 281 place count 36 transition count 59
Iterating global reduction 5 with 3 rules applied. Total rules applied 284 place count 36 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 286 place count 36 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 288 place count 35 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 304 place count 35 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 306 place count 33 transition count 49
Applied a total of 306 rules in 32 ms. Remains 33 /173 variables (removed 140) and now considering 49/224 (removed 175) transitions.
[2026-05-23 07:38:35] [INFO ] Flow matrix only has 47 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4207280583810470195.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12644228310107618751.kers'
[2026-05-23 07:38:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4207280583810470195.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12644228310107618751.kers]
Normalized transition count is 46 out of 47 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 46 rows 33 cols 133 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-23 07:38:35] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12644228310107618751.kers
Total runtime 0 ms.
[2026-05-23 07:38:35] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-23 07:38:35] [INFO ] Flow matrix only has 47 transitions (discarded 2 similar events)
[2026-05-23 07:38:35] [INFO ] Invariant cache hit.
[2026-05-23 07:38:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 07:38:35] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2026-05-23 07:38:35] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2026-05-23 07:38:35] [INFO ] Flow matrix only has 47 transitions (discarded 2 similar events)
[2026-05-23 07:38:35] [INFO ] Invariant cache hit.
[2026-05-23 07:38:35] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 46/79 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/80 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 33/33 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 46/79 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 39/76 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 1/80 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 77 constraints, problems are : Problem set: 0 solved, 39 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 33/33 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1424ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1425ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/173 places, 49/224 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1531 ms. Remains : 33/173 places, 49/224 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge based reduction with 9 factoid took 48 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (5688 resets) in 109 ms. (363 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (991 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (989 resets) in 50 ms. (784 steps per ms) remains 1/2 properties
[2026-05-23 07:38:37] [INFO ] Flow matrix only has 47 transitions (discarded 2 similar events)
[2026-05-23 07:38:37] [INFO ] Invariant cache hit.
[2026-05-23 07:38:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 67/80 variables, and 26 constraints, problems are : Problem set: 1 solved, 0 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 25/33 constraints, ReadFeed: 1/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 386 ms.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 137 ms.
Product exploration explored 100000 steps with 6 reset in 155 ms.
Built C files in :
/tmp/ltsmin17013659944880230093
[2026-05-23 07:38:37] [INFO ] Computing symmetric may disable matrix : 49 transitions.
[2026-05-23 07:38:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:38:37] [INFO ] Computing symmetric may enable matrix : 49 transitions.
[2026-05-23 07:38:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:38:37] [INFO ] Computing Do-Not-Accords matrix : 49 transitions.
[2026-05-23 07:38:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:38:37] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17013659944880230093
Running compilation step : cd /tmp/ltsmin17013659944880230093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 122 ms.
Running link step : cd /tmp/ltsmin17013659944880230093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17013659944880230093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1936277185440955776.hoa' '--buchi-type=spotba'
LTSmin run took 21 ms.
FORMULA CO4-PT-07-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-07-LTLFireability-13 finished in 46362 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(p1))||p0)))'
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 243/243 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 177 transition count 231
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 177 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 177 transition count 230
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 171 transition count 223
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 171 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 171 transition count 222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 168 transition count 219
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 168 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 168 transition count 218
Applied a total of 41 rules in 5 ms. Remains 168 /187 variables (removed 19) and now considering 218/243 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17701330726424636427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15160947224773671666.kers'
[2026-05-23 07:38:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17701330726424636427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15160947224773671666.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 168 cols 498 entries
Finished phase 1 with 165 SingleSign rule and 0 generalized
[2026-05-23 07:38:38] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15160947224773671666.kers
Total runtime 1 ms.
[2026-05-23 07:38:38] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 07:38:38] [INFO ] Invariant cache hit.
[2026-05-23 07:38:38] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-23 07:38:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/386 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 173 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14231 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/386 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 217/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 391 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44268ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 44268ms
Starting structural reductions in LTL mode, iteration 1 : 168/187 places, 218/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44398 ms. Remains : 168/187 places, 218/243 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(p1))||p0)))'
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-07-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 285 edges and 168 vertex of which 165 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge based reduction with 3 factoid took 50 ms. Proved property starting from automaton with 3 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 53 ms.
FORMULA CO4-PT-07-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-07-LTLFireability-14 finished in 44743 ms.
All properties solved by simple procedures.
Total runtime 413656 ms.

BK_STOP 1779521962834

--------------------
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="CO4-PT-07"
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 CO4-PT-07, 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 r066-tall-177946967700332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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