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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.6K Mar 6 13:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 6 13:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 6 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 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 138K 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-08-LTLFireability-00
FORMULA_NAME CO4-PT-08-LTLFireability-01
FORMULA_NAME CO4-PT-08-LTLFireability-02
FORMULA_NAME CO4-PT-08-LTLFireability-03
FORMULA_NAME CO4-PT-08-LTLFireability-04
FORMULA_NAME CO4-PT-08-LTLFireability-05
FORMULA_NAME CO4-PT-08-LTLFireability-06
FORMULA_NAME CO4-PT-08-LTLFireability-07
FORMULA_NAME CO4-PT-08-LTLFireability-08
FORMULA_NAME CO4-PT-08-LTLFireability-09
FORMULA_NAME CO4-PT-08-LTLFireability-10
FORMULA_NAME CO4-PT-08-LTLFireability-11
FORMULA_NAME CO4-PT-08-LTLFireability-12
FORMULA_NAME CO4-PT-08-LTLFireability-13
FORMULA_NAME CO4-PT-08-LTLFireability-14
FORMULA_NAME CO4-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779521861232

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 07:37:42] [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:37:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:37:42] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2026-05-23 07:37:42] [INFO ] Transformed 467 places.
[2026-05-23 07:37:42] [INFO ] Transformed 600 transitions.
[2026-05-23 07:37:42] [INFO ] Found NUPN structural information;
[2026-05-23 07:37:42] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 175 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 4 formulas.
Deduced a syphon composed of 108 places in 5 ms
Reduce places removed 108 places and 155 transitions.
FORMULA CO4-PT-08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 445/445 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 443
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 95 place count 266 transition count 361
Iterating global reduction 1 with 80 rules applied. Total rules applied 175 place count 266 transition count 361
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 179 place count 266 transition count 357
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 217 place count 228 transition count 303
Iterating global reduction 2 with 38 rules applied. Total rules applied 255 place count 228 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 228 transition count 302
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 261 place count 223 transition count 294
Iterating global reduction 3 with 5 rules applied. Total rules applied 266 place count 223 transition count 294
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 269 place count 220 transition count 291
Iterating global reduction 3 with 3 rules applied. Total rules applied 272 place count 220 transition count 291
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 274 place count 218 transition count 289
Iterating global reduction 3 with 2 rules applied. Total rules applied 276 place count 218 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 278 place count 218 transition count 287
Applied a total of 278 rules in 105 ms. Remains 218 /359 variables (removed 141) and now considering 287/445 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18294842859522450816.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2980734158397720357.kers'
[2026-05-23 07:37:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18294842859522450816.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2980734158397720357.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 218 cols 704 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-23 07:37:42] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2980734158397720357.kers
Total runtime 3 ms.
[2026-05-23 07:37:43] [INFO ] Implicit Places using invariants in 237 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 266 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 217/359 places, 287/445 transitions.
Applied a total of 0 rules in 4 ms. Remains 217 /217 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 389 ms. Remains : 217/359 places, 287/445 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 287/287 transitions.
Applied a total of 0 rules in 3 ms. Remains 217 /217 variables (removed 0) and now considering 287/287 (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-16797324676412530797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16056552547275881778.kers'
[2026-05-23 07:37:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16797324676412530797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16056552547275881778.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 217 cols 702 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-23 07:37:43] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16056552547275881778.kers
Total runtime 1 ms.
[2026-05-23 07:37:43] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-23 07:37:43] [INFO ] Invariant cache hit.
[2026-05-23 07:37:43] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2026-05-23 07:37:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Problem TDEAD240 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 287/504 variables, 217/226 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 1/227 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 0/504 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 227 constraints, problems are : Problem set: 1 solved, 285 unsolved in 24670 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 287/504 variables, 217/227 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 285/512 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 1/513 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/513 constraints. Problems are: Problem set: 1 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 513 constraints, problems are : Problem set: 1 solved, 285 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 285/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54785ms problems are : Problem set: 1 solved, 285 unsolved
Search for dead transitions found 1 dead transitions in 54797ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 217/217 places, 286/287 transitions.
Applied a total of 0 rules in 3 ms. Remains 217 /217 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55095 ms. Remains : 217/217 places, 286/287 transitions.
Support contains 19 out of 217 places after structural reductions.
[2026-05-23 07:38:38] [INFO ] Flatten gal took : 40 ms
[2026-05-23 07:38:38] [INFO ] Flatten gal took : 21 ms
[2026-05-23 07:38:38] [INFO ] Input system was already deterministic with 286 transitions.
Support contains 18 out of 217 places (down from 19) after GAL structural reductions.
RANDOM walk for 40000 steps (127 resets) in 890 ms. (44 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40002 steps (257 resets) in 299 ms. (133 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40002 steps (308 resets) in 189 ms. (210 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40001 steps (131 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (177 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (92 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (188 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12051652645439260338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3164217694916881737.kers'
[2026-05-23 07:38:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12051652645439260338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3164217694916881737.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 286 rows 217 cols 696 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-23 07:38:39] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3164217694916881737.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 16/34 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 72/106 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 199/305 variables, 68/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 166/471 variables, 92/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 27/498 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 5/503 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/503 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 222 constraints, problems are : Problem set: 0 solved, 6 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 16/34 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 72/106 variables, 34/40 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 1/41 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 199/305 variables, 68/109 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 4/113 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 166/471 variables, 92/205 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/471 variables, 0/205 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 27/498 variables, 20/225 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 5/503 variables, 3/228 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/503 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/503 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 228 constraints, problems are : Problem set: 1 solved, 5 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1181ms problems are : Problem set: 1 solved, 5 unsolved
Finished Parikh walk after 46 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 113 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 14 stabilizing places and 21 stable transitions
Graph (complete) has 409 edges and 217 vertex of which 214 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 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 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 286/286 transitions.
Graph (trivial) has 224 edges and 217 vertex of which 2 / 217 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 408 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 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 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 212 transition count 208
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 79 rules applied. Total rules applied 154 place count 139 transition count 202
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 158 place count 135 transition count 202
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 158 place count 135 transition count 183
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 196 place count 116 transition count 183
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 200 place count 112 transition count 177
Iterating global reduction 3 with 4 rules applied. Total rules applied 204 place count 112 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 4 rules applied. Total rules applied 208 place count 112 transition count 173
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 4 with 3 rules applied. Total rules applied 211 place count 111 transition count 171
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 5 with 3 rules applied. Total rules applied 214 place count 110 transition count 169
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 6 with 3 rules applied. Total rules applied 217 place count 109 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 218 place count 108 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 218 place count 108 transition count 166
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 220 place count 107 transition count 166
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 221 place count 106 transition count 165
Iterating global reduction 8 with 1 rules applied. Total rules applied 222 place count 106 transition count 165
Performed 34 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 290 place count 72 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 294 place count 72 transition count 118
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 296 place count 70 transition count 116
Iterating global reduction 9 with 2 rules applied. Total rules applied 298 place count 70 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 302 place count 68 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 303 place count 68 transition count 113
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 28 rules applied. Total rules applied 331 place count 54 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 340 place count 54 transition count 108
Discarding 11 places :
Symmetric choice reduction at 11 with 11 rule applications. Total rules 351 place count 43 transition count 86
Iterating global reduction 11 with 11 rules applied. Total rules applied 362 place count 43 transition count 86
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 370 place count 43 transition count 78
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 373 place count 40 transition count 69
Iterating global reduction 12 with 3 rules applied. Total rules applied 376 place count 40 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 378 place count 40 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 13 with 8 rules applied. Total rules applied 386 place count 40 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 388 place count 38 transition count 57
Applied a total of 388 rules in 55 ms. Remains 38 /217 variables (removed 179) and now considering 57/286 (removed 229) transitions.
[2026-05-23 07:38:40] [INFO ] Flow matrix only has 54 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-195421975054922847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11544930045417777550.kers'
[2026-05-23 07:38:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-195421975054922847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11544930045417777550.kers]
Normalized transition count is 53 out of 54 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 53 rows 38 cols 164 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-23 07:38:40] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11544930045417777550.kers
Total runtime 0 ms.
[2026-05-23 07:38:40] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-23 07:38:40] [INFO ] Flow matrix only has 54 transitions (discarded 3 similar events)
[2026-05-23 07:38:40] [INFO ] Invariant cache hit.
[2026-05-23 07:38:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:38:40] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2026-05-23 07:38:40] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-23 07:38:40] [INFO ] Flow matrix only has 54 transitions (discarded 3 similar events)
[2026-05-23 07:38:40] [INFO ] Invariant cache hit.
[2026-05-23 07:38:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 53/90 variables, 37/42 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/92 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/92 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 44 constraints, problems are : Problem set: 0 solved, 46 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 53/90 variables, 37/42 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/91 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 41/90 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/92 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 91 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1352 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2275ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2276ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/217 places, 57/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2419 ms. Remains : 38/217 places, 57/286 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 190 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-00
Product exploration explored 100000 steps with 1 reset in 153 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA CO4-PT-08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-08-LTLFireability-00 finished in 2836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&X(F(p0))))))))'
Support contains 1 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 286/286 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 211 transition count 279
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 211 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 211 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 207 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 207 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 204 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 204 transition count 270
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 204 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 203 transition count 268
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 203 transition count 268
Applied a total of 30 rules in 16 ms. Remains 203 /217 variables (removed 14) and now considering 268/286 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6783265295143927768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1904594160463917810.kers'
[2026-05-23 07:38:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6783265295143927768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1904594160463917810.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 203 cols 658 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-23 07:38:43] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1904594160463917810.kers
Total runtime 1 ms.
[2026-05-23 07:38:43] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-23 07:38:43] [INFO ] Invariant cache hit.
[2026-05-23 07:38:43] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-05-23 07:38:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/471 variables, 203/210 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 211 constraints, problems are : Problem set: 0 solved, 267 unsolved in 19825 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/471 variables, 203/211 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 267/478 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 480 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49869ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 49871ms
Starting structural reductions in LTL mode, iteration 1 : 203/217 places, 268/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50092 ms. Remains : 203/217 places, 268/286 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&X(F(p0))))))))'
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-01
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-01 finished in 50312 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 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 286/286 transitions.
Graph (trivial) has 230 edges and 217 vertex of which 2 / 217 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 408 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 212 transition count 204
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 159 place count 135 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 134 transition count 201
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 160 place count 134 transition count 182
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 198 place count 115 transition count 182
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 201 place count 112 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 204 place count 112 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 112 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 206 place count 112 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 111 transition count 174
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 209 place count 110 transition count 173
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 110 transition count 173
Performed 38 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 286 place count 72 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 290 place count 72 transition count 118
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 292 place count 70 transition count 116
Iterating global reduction 5 with 2 rules applied. Total rules applied 294 place count 70 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 298 place count 68 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 299 place count 68 transition count 113
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -4
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 327 place count 54 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 336 place count 54 transition count 108
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 347 place count 43 transition count 86
Iterating global reduction 7 with 11 rules applied. Total rules applied 358 place count 43 transition count 86
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 366 place count 43 transition count 78
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 369 place count 40 transition count 69
Iterating global reduction 8 with 3 rules applied. Total rules applied 372 place count 40 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 374 place count 40 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 382 place count 40 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 383 place count 39 transition count 58
Applied a total of 383 rules in 37 ms. Remains 39 /217 variables (removed 178) and now considering 58/286 (removed 228) transitions.
[2026-05-23 07:39:33] [INFO ] Flow matrix only has 54 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15346952936444075747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15771391580232447768.kers'
[2026-05-23 07:39:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15346952936444075747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15771391580232447768.kers]
Normalized transition count is 53 out of 54 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 53 rows 39 cols 166 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-23 07:39:33] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15771391580232447768.kers
Total runtime 1 ms.
[2026-05-23 07:39:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 07:39:33] [INFO ] Flow matrix only has 54 transitions (discarded 4 similar events)
[2026-05-23 07:39:33] [INFO ] Invariant cache hit.
[2026-05-23 07:39:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-23 07:39:33] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2026-05-23 07:39:33] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2026-05-23 07:39:33] [INFO ] Flow matrix only has 54 transitions (discarded 4 similar events)
[2026-05-23 07:39:33] [INFO ] Invariant cache hit.
[2026-05-23 07:39:33] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 53/92 variables, 39/44 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/93 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 52 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1169 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 53/92 variables, 39/44 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 55/106 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 1/93 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/93 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 107 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1578 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2756ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2756ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/217 places, 58/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2891 ms. Remains : 39/217 places, 58/286 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 44 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-02
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA CO4-PT-08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-02 finished in 2966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||((p1 U (p2||G(p1))) U (p0||G(!p0)))))))'
Support contains 5 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 286/286 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 212 transition count 279
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 212 transition count 279
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 208 transition count 275
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 208 transition count 275
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 205 transition count 272
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 205 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 205 transition count 270
Applied a total of 26 rules in 12 ms. Remains 205 /217 variables (removed 12) and now considering 270/286 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15883269780704325904.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4524622223004531336.kers'
[2026-05-23 07:39:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15883269780704325904.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4524622223004531336.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 270 rows 205 cols 662 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-23 07:39:36] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4524622223004531336.kers
Total runtime 1 ms.
[2026-05-23 07:39:36] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-23 07:39:36] [INFO ] Invariant cache hit.
[2026-05-23 07:39:36] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2026-05-23 07:39:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/475 variables, 205/212 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 0/475 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 213 constraints, problems are : Problem set: 0 solved, 269 unsolved in 20477 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/475 variables, 205/213 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 269/482 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 0/475 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 483 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50526ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 50532ms
Starting structural reductions in LTL mode, iteration 1 : 205/217 places, 270/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50734 ms. Remains : 205/217 places, 270/286 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||((p1 U (p2||G(p1))) U (p0||G(!p0)))))))'
Stuttering acceptance computed with spot in 381 ms :[true, p0, (AND (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), false, false, false, false, false]
Running random walk in product with property : CO4-PT-08-LTLFireability-06
Product exploration explored 100000 steps with 6 reset in 171 ms.
Product exploration explored 100000 steps with 59 reset in 137 ms.
Computed a total of 14 stabilizing places and 21 stable transitions
Graph (complete) has 391 edges and 205 vertex of which 202 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 14 stabilizing places and 21 stable transitions
Knowledge based reduction with 6 factoid took 71 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (264 resets) in 448 ms. (89 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40001 steps (192 resets) in 176 ms. (225 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40002 steps (214 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (227 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (188 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (197 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
[2026-05-23 07:40:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 17/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/31 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 65/96 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 182/278 variables, 63/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 156/434 variables, 85/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
At refinement iteration 11 (OVERLAPS) 32/466 variables, 21/205 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/205 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 9/475 variables, 5/210 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/475 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 210 constraints, problems are : Problem set: 1 solved, 3 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/30 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 63/93 variables, 30/37 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 181/274 variables, 62/99 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 3/102 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 160/434 variables, 87/189 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 32/466 variables, 21/210 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 9/475 variables, 5/215 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/475 variables, 0/215 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/475 variables, 0/215 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 215 constraints, problems are : Problem set: 1 solved, 3 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 886ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 937 steps, including 51 resets, run visited all 3 properties in 4 ms. (steps per millisecond=234 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 7 factoid took 203 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[true, (AND p0 (NOT p2) p1), p0, (AND p0 (NOT p2)), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Knowledge-based reduction took 1862 ms.
Stuttering acceptance computed with spot in 277 ms :[true, (AND p0 (NOT p2) p1), p0, (AND p0 (NOT p2)), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Support contains 5 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 270/270 transitions.
Applied a total of 0 rules in 8 ms. Remains 205 /205 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2026-05-23 07:40:30] [INFO ] Invariant cache hit.
[2026-05-23 07:40:30] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-23 07:40:30] [INFO ] Invariant cache hit.
[2026-05-23 07:40:30] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 205/205 places, 270/270 transitions.
Computed a total of 14 stabilizing places and 21 stable transitions
Graph (complete) has 391 edges and 205 vertex of which 202 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 21 stable transitions
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (258 resets) in 161 ms. (246 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40000 steps (130 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (208 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (125 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (189 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (233 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (228 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
[2026-05-23 07:40:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 17/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/31 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 65/96 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 182/278 variables, 63/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 156/434 variables, 85/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 32/466 variables, 21/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 9/475 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/475 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 210 constraints, problems are : Problem set: 0 solved, 6 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 17/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 9/31 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 65/96 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 182/278 variables, 63/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 156/434 variables, 85/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 32/466 variables, 21/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 9/475 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/475 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/475 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 217 constraints, problems are : Problem set: 0 solved, 6 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1374ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 1892 steps, including 75 resets, run visited all 1 properties in 4 ms. (steps per millisecond=473 )
Parikh walk visited 6 properties in 169 ms.
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[true, (AND p0 (NOT p2) p1), p0, (AND p0 (NOT p2)), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Knowledge-based reduction took 2380 ms.
Stuttering acceptance computed with spot in 271 ms :[true, (AND p0 (NOT p2) p1), p0, (AND p0 (NOT p2)), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 276 ms :[true, (AND p0 (NOT p2) p1), p0, (AND p0 (NOT p2)), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Product exploration explored 100000 steps with 0 reset in 96 ms.
Product exploration explored 100000 steps with 84 reset in 128 ms.
Spot run failed in 72 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin10793599871122100010
[2026-05-23 07:40:33] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10793599871122100010
Running compilation step : cd /tmp/ltsmin10793599871122100010;'/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 500 ms.
Running link step : cd /tmp/ltsmin10793599871122100010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin10793599871122100010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased18144412881697560128.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 270/270 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2026-05-23 07:40:48] [INFO ] Invariant cache hit.
[2026-05-23 07:40:48] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 07:40:48] [INFO ] Invariant cache hit.
[2026-05-23 07:40:49] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 205/205 places, 270/270 transitions.
Built C files in :
/tmp/ltsmin2433388434325060549
[2026-05-23 07:40:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2433388434325060549
Running compilation step : cd /tmp/ltsmin2433388434325060549;'/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 357 ms.
Running link step : cd /tmp/ltsmin2433388434325060549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2433388434325060549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased17825725245775617157.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 07:41:04] [INFO ] Flatten gal took : 13 ms
[2026-05-23 07:41:04] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:41:04] [INFO ] Time to serialize gal into /tmp/LTL15911973259802559992.gal : 4 ms
[2026-05-23 07:41:04] [INFO ] Time to serialize properties into /tmp/LTL5616400896454483409.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15911973259802559992.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8594709915823146731.hoa' '-atoms' '/tmp/LTL5616400896454483409.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5616400896454483409.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8594709915823146731.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t35, t37, t38, t39, t40, t42, t43, t57, t58, t66, ...414
Computing Next relation with stutter on 2399 deadlock states
31 unique states visited
31 strongly connected components in search stack
32 transitions explored
31 items max in DFS search stack
642 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.44785,234012,1,0,819,834505,591,650,6673,1.58804e+06,1391
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-08-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CO4-PT-08-LTLFireability-06 finished in 95210 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(p0))||G(p1))))'
Support contains 4 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 286/286 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 212 transition count 280
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 212 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 212 transition count 279
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 209 transition count 276
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 209 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 207 transition count 273
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 207 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 207 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 206 transition count 271
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 206 transition count 271
Applied a total of 24 rules in 16 ms. Remains 206 /217 variables (removed 11) and now considering 271/286 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5210789831421817066.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11794793481834607188.kers'
[2026-05-23 07:41:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5210789831421817066.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11794793481834607188.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 271 rows 206 cols 666 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-23 07:41:11] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11794793481834607188.kers
Total runtime 1 ms.
[2026-05-23 07:41:12] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 07:41:12] [INFO ] Invariant cache hit.
[2026-05-23 07:41:12] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2026-05-23 07:41:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/477 variables, 206/213 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/477 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 215 constraints, problems are : Problem set: 0 solved, 270 unsolved in 20834 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/477 variables, 206/215 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 270/485 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 486 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50871ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 50872ms
Starting structural reductions in LTL mode, iteration 1 : 206/217 places, 271/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51096 ms. Remains : 206/217 places, 271/286 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(p0))||G(p1))))'
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-08-LTLFireability-08
Product exploration explored 100000 steps with 43 reset in 75 ms.
Stuttering criterion allowed to conclude after 829 steps with 29 reset in 2 ms.
FORMULA CO4-PT-08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-08 finished in 51324 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)||G(p1)))'
Support contains 1 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 286/286 transitions.
Graph (trivial) has 229 edges and 217 vertex of which 2 / 217 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 408 edges and 216 vertex of which 213 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 212 transition count 204
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 135 transition count 202
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 158 place count 135 transition count 183
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 196 place count 116 transition count 183
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 199 place count 113 transition count 178
Iterating global reduction 2 with 3 rules applied. Total rules applied 202 place count 113 transition count 178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 204 place count 113 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 204 place count 113 transition count 175
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 206 place count 112 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 207 place count 111 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 208 place count 111 transition count 174
Performed 38 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 284 place count 73 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 288 place count 73 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 290 place count 71 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 292 place count 71 transition count 119
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 296 place count 69 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 297 place count 69 transition count 116
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 325 place count 55 transition count 120
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 334 place count 55 transition count 111
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 345 place count 44 transition count 89
Iterating global reduction 6 with 11 rules applied. Total rules applied 356 place count 44 transition count 89
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 364 place count 44 transition count 81
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 367 place count 41 transition count 72
Iterating global reduction 7 with 3 rules applied. Total rules applied 370 place count 41 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 372 place count 41 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 381 place count 41 transition count 61
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 382 place count 41 transition count 61
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 384 place count 39 transition count 59
Applied a total of 384 rules in 37 ms. Remains 39 /217 variables (removed 178) and now considering 59/286 (removed 227) transitions.
[2026-05-23 07:42:03] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4450188410512531189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7319395429908297353.kers'
[2026-05-23 07:42:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4450188410512531189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7319395429908297353.kers]
Normalized transition count is 54 out of 55 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 54 rows 39 cols 166 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-23 07:42:03] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7319395429908297353.kers
Total runtime 1 ms.
[2026-05-23 07:42:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-23 07:42:03] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
[2026-05-23 07:42:03] [INFO ] Invariant cache hit.
[2026-05-23 07:42:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:42:03] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2026-05-23 07:42:03] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2026-05-23 07:42:03] [INFO ] Flow matrix only has 55 transitions (discarded 4 similar events)
[2026-05-23 07:42:03] [INFO ] Invariant cache hit.
[2026-05-23 07:42:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 54/93 variables, 39/44 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 1/94 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/94 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 45 constraints, problems are : Problem set: 0 solved, 44 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 54/93 variables, 39/44 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 44/88 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 1/94 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/94 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 89 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1841ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1841ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/217 places, 59/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1988 ms. Remains : 39/217 places, 59/286 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)||G(p1)))'
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-10
Product exploration explored 100000 steps with 3 reset in 34 ms.
Product exploration explored 100000 steps with 20 reset in 37 ms.
Computed a total of 8 stabilizing places and 17 stable transitions
Computed a total of 8 stabilizing places and 17 stable transitions
Knowledge based reduction with 13 factoid took 62 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 826 steps (97 resets) in 25 ms. (31 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 13 factoid took 37 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 120 ms.
FORMULA CO4-PT-08-LTLFireability-10 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property CO4-PT-08-LTLFireability-10 finished in 2341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 286/286 transitions.
Graph (trivial) has 227 edges and 217 vertex of which 2 / 217 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 408 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 214 transition count 207
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 138 transition count 205
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 156 place count 138 transition count 186
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 194 place count 119 transition count 186
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 197 place count 116 transition count 181
Iterating global reduction 2 with 3 rules applied. Total rules applied 200 place count 116 transition count 181
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 202 place count 116 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 202 place count 116 transition count 178
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 204 place count 115 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 205 place count 114 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 114 transition count 177
Performed 39 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 284 place count 75 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 288 place count 75 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 290 place count 73 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 292 place count 73 transition count 119
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 296 place count 71 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 297 place count 71 transition count 116
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 325 place count 57 transition count 120
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 332 place count 57 transition count 113
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 342 place count 47 transition count 93
Iterating global reduction 6 with 10 rules applied. Total rules applied 352 place count 47 transition count 93
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 359 place count 47 transition count 86
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 362 place count 44 transition count 77
Iterating global reduction 7 with 3 rules applied. Total rules applied 365 place count 44 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 367 place count 44 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 375 place count 44 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 377 place count 42 transition count 65
Applied a total of 377 rules in 27 ms. Remains 42 /217 variables (removed 175) and now considering 65/286 (removed 221) transitions.
[2026-05-23 07:42:05] [INFO ] Flow matrix only has 60 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-4827376758557698057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14959142163209637130.kers'
[2026-05-23 07:42:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4827376758557698057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14959142163209637130.kers]
Normalized transition count is 59 out of 60 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 59 rows 42 cols 174 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-23 07:42:05] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14959142163209637130.kers
Total runtime 0 ms.
[2026-05-23 07:42:05] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-23 07:42:05] [INFO ] Flow matrix only has 60 transitions (discarded 5 similar events)
[2026-05-23 07:42:05] [INFO ] Invariant cache hit.
[2026-05-23 07:42:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:42:05] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2026-05-23 07:42:05] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2026-05-23 07:42:05] [INFO ] Flow matrix only has 60 transitions (discarded 5 similar events)
[2026-05-23 07:42:05] [INFO ] Invariant cache hit.
[2026-05-23 07:42:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 59/101 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 48 constraints, problems are : Problem set: 0 solved, 50 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 59/101 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 50/97 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 1/102 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 98 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2302ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2302ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/217 places, 65/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2431 ms. Remains : 42/217 places, 65/286 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-08-LTLFireability-12
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-12 finished in 2532 ms.
All properties solved by simple procedures.
Total runtime 265769 ms.

BK_STOP 1779522128190

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

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