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.r130-smll-177955808900164.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 FireWire-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955808900164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.8K Mar 7 05:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 7 05:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 7 05:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:04 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 86K 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 FireWire-PT-03-LTLFireability-00
FORMULA_NAME FireWire-PT-03-LTLFireability-01
FORMULA_NAME FireWire-PT-03-LTLFireability-02
FORMULA_NAME FireWire-PT-03-LTLFireability-03
FORMULA_NAME FireWire-PT-03-LTLFireability-04
FORMULA_NAME FireWire-PT-03-LTLFireability-05
FORMULA_NAME FireWire-PT-03-LTLFireability-06
FORMULA_NAME FireWire-PT-03-LTLFireability-07
FORMULA_NAME FireWire-PT-03-LTLFireability-08
FORMULA_NAME FireWire-PT-03-LTLFireability-09
FORMULA_NAME FireWire-PT-03-LTLFireability-10
FORMULA_NAME FireWire-PT-03-LTLFireability-11
FORMULA_NAME FireWire-PT-03-LTLFireability-12
FORMULA_NAME FireWire-PT-03-LTLFireability-13
FORMULA_NAME FireWire-PT-03-LTLFireability-14
FORMULA_NAME FireWire-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779797228157

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 12:07:10] [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-26 12:07:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 12:07:11] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2026-05-26 12:07:11] [INFO ] Transformed 112 places.
[2026-05-26 12:07:11] [INFO ] Transformed 356 transitions.
[2026-05-26 12:07:11] [INFO ] Found NUPN structural information;
[2026-05-26 12:07:11] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 390 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-03-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 303/303 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 297
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 108 transition count 293
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 108 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 108 transition count 287
Applied a total of 14 rules in 68 ms. Remains 108 /112 variables (removed 4) and now considering 287/303 (removed 16) transitions.
[2026-05-26 12:07:11] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9857393375955388719.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12270509001526706862.kers'
[2026-05-26 12:07:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9857393375955388719.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12270509001526706862.kers]
Normalized transition count is 260 out of 261 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 108 cols 858 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-26 12:07:11] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12270509001526706862.kers
Total runtime 4 ms.
[2026-05-26 12:07:12] [INFO ] Implicit Places using invariants in 500 ms returned []
[2026-05-26 12:07:12] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 12:07:12] [INFO ] Invariant cache hit.
[2026-05-26 12:07:12] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 12:07:12] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2026-05-26 12:07:12] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 12:07:12] [INFO ] Invariant cache hit.
[2026-05-26 12:07:12] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/163 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/369 variables, and 164 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/163 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 286/449 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 450 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60534ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 60569ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 287/303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61922 ms. Remains : 108/112 places, 287/303 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Applied a total of 0 rules in 13 ms. Remains 108 /108 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2026-05-26 12:08:13] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 12:08:13] [INFO ] Invariant cache hit.
[2026-05-26 12:08:13] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-26 12:08:13] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 12:08:13] [INFO ] Invariant cache hit.
[2026-05-26 12:08:13] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 12:08:13] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 108/108 places, 287/287 transitions.
Support contains 37 out of 108 places after structural reductions.
[2026-05-26 12:08:14] [INFO ] Flatten gal took : 138 ms
[2026-05-26 12:08:14] [INFO ] Flatten gal took : 53 ms
[2026-05-26 12:08:14] [INFO ] Input system was already deterministic with 287 transitions.
RANDOM walk for 40000 steps (1956 resets) in 2632 ms. (15 steps per ms) remains 10/33 properties
BEST_FIRST walk for 40003 steps (505 resets) in 381 ms. (104 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (853 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (865 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (509 resets) in 110 ms. (360 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (1190 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (76 resets) in 67 ms. (588 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40002 steps (523 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (77 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
[2026-05-26 12:08:15] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 12:08:15] [INFO ] Invariant cache hit.
[2026-05-26 12:08:15] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 68/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 30/108 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 260/368 variables, 108/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 38/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/369 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/369 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 160 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1259 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 68/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 30/108 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 260/368 variables, 108/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 38/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/369 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/369 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 166 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2398 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3677ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1146 ms.
Support contains 10 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 287/287 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 108 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 108 transition count 283
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 107 transition count 283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 106 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 106 transition count 281
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 1 with 4 rules applied. Total rules applied 11 place count 104 transition count 279
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 101 transition count 286
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 101 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 101 transition count 275
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 101 transition count 277
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 100 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 100 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 99 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 98 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 36 place count 98 transition count 271
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 38 place count 97 transition count 271
Applied a total of 38 rules in 140 ms. Remains 97 /108 variables (removed 11) and now considering 271/287 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 97/108 places, 271/287 transitions.
RANDOM walk for 40000 steps (2410 resets) in 707 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1289 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1273 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (567 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (65 resets) in 68 ms. (579 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (603 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (62 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
[2026-05-26 12:08:21] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12546498930116983940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9545345070825157036.kers'
[2026-05-26 12:08:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12546498930116983940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9545345070825157036.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 243 rows 95 cols 802 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-26 12:08:21] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9545345070825157036.kers
Total runtime 2 ms.
[2026-05-26 12:08:21] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 63/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 217/289 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 26/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 48/337 variables, 23/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/340 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/340 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 143 constraints, problems are : Problem set: 0 solved, 5 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 63/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 217/289 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 26/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 48/337 variables, 23/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3/340 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/340 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/340 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 149 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1464 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2028ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 9 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 271/271 transitions.
Applied a total of 0 rules in 14 ms. Remains 97 /97 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 97/97 places, 271/271 transitions.
RANDOM walk for 40000 steps (2428 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1274 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (622 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (63 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (564 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (61 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 194472 steps, run visited all 5 properties in 1128 ms. (steps per millisecond=172 )
Probabilistic random walk after 194472 steps, saw 40989 distinct states, run finished after 1134 ms. (steps per millisecond=171 ) properties seen :5
FORMULA FireWire-PT-03-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X((p1&&F(p2))))&&p0)))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 285
Applied a total of 2 rules in 11 ms. Remains 107 /108 variables (removed 1) and now considering 285/287 (removed 2) transitions.
[2026-05-26 12:08:25] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8095317082727759001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16190672404082016112.kers'
[2026-05-26 12:08:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8095317082727759001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16190672404082016112.kers]
Normalized transition count is 258 out of 259 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 107 cols 854 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 12:08:25] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16190672404082016112.kers
Total runtime 3 ms.
[2026-05-26 12:08:25] [INFO ] Implicit Places using invariants in 203 ms returned []
[2026-05-26 12:08:25] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:08:25] [INFO ] Invariant cache hit.
[2026-05-26 12:08:25] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 12:08:25] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2026-05-26 12:08:25] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:08:25] [INFO ] Invariant cache hit.
[2026-05-26 12:08:25] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 163 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 284/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 447 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60230ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 285/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60869 ms. Remains : 107/108 places, 285/287 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((X(X((p1&&F(p2))))&&p0)))))'
Stuttering acceptance computed with spot in 804 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : FireWire-PT-03-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-03 finished in 61834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 285
Applied a total of 2 rules in 8 ms. Remains 107 /108 variables (removed 1) and now considering 285/287 (removed 2) transitions.
[2026-05-26 12:09:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:09:27] [INFO ] Invariant cache hit.
[2026-05-26 12:09:27] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-26 12:09:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:09:27] [INFO ] Invariant cache hit.
[2026-05-26 12:09:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 12:09:27] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 285/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 107/108 places, 285/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-04 finished in 800 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((G((F(p0)||X(F(p1)))) U p2))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 285
Applied a total of 2 rules in 5 ms. Remains 107 /108 variables (removed 1) and now considering 285/287 (removed 2) transitions.
[2026-05-26 12:09:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:09:27] [INFO ] Invariant cache hit.
[2026-05-26 12:09:27] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-26 12:09:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:09:27] [INFO ] Invariant cache hit.
[2026-05-26 12:09:28] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 12:09:28] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 285/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 527 ms. Remains : 107/108 places, 285/287 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((G((F(p0)||X(F(p1)))) U p2))))'
Stuttering acceptance computed with spot in 301 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-05 finished in 887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 285
Applied a total of 2 rules in 5 ms. Remains 107 /108 variables (removed 1) and now considering 285/287 (removed 2) transitions.
[2026-05-26 12:09:28] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:09:28] [INFO ] Invariant cache hit.
[2026-05-26 12:09:28] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-26 12:09:28] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:09:28] [INFO ] Invariant cache hit.
[2026-05-26 12:09:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 12:09:29] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 285/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 554 ms. Remains : 107/108 places, 285/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-06 finished in 750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(((G(p2)&&X(p0)&&p1) U p3))))'
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 285
Applied a total of 2 rules in 5 ms. Remains 107 /108 variables (removed 1) and now considering 285/287 (removed 2) transitions.
[2026-05-26 12:09:29] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:09:29] [INFO ] Invariant cache hit.
[2026-05-26 12:09:29] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-26 12:09:29] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:09:29] [INFO ] Invariant cache hit.
[2026-05-26 12:09:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 12:09:30] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 285/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 551 ms. Remains : 107/108 places, 285/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(((G(p2)&&X(p0)&&p1) U p3))))'
Stuttering acceptance computed with spot in 423 ms :[(NOT p3), (NOT p3), (NOT p3), true, (NOT p0), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-07 finished in 1043 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((F(G(p0))&&(F(p2)||p1))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 107 transition count 285
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 105 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 104 transition count 282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 101 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 100 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 99 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 22 place count 99 transition count 279
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 98 transition count 279
Applied a total of 24 rules in 60 ms. Remains 98 /108 variables (removed 10) and now considering 279/287 (removed 8) transitions.
[2026-05-26 12:09:30] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4706489219783790578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12145223142602860107.kers'
[2026-05-26 12:09:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4706489219783790578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12145223142602860107.kers]
Normalized transition count is 246 out of 247 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 246 rows 96 cols 810 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-26 12:09:30] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12145223142602860107.kers
Total runtime 2 ms.
[2026-05-26 12:09:30] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-26 12:09:30] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2026-05-26 12:09:30] [INFO ] Invariant cache hit.
[2026-05-26 12:09:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 12:09:30] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2026-05-26 12:09:30] [INFO ] Redundant transitions in 16 ms returned []
Running 276 sub problems to find dead transitions.
[2026-05-26 12:09:30] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2026-05-26 12:09:30] [INFO ] Invariant cache hit.
[2026-05-26 12:09:30] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/151 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/344 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 151 constraints, problems are : Problem set: 0 solved, 276 unsolved in 23249 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/151 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/427 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 344/345 variables, and 427 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53377ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 53378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/108 places, 279/287 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53846 ms. Remains : 98/108 places, 279/287 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((F(G(p0))&&(F(p2)||p1))))'
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-08 finished in 54078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(F((p0&&F((G(p1)&&p2)))))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 285
Applied a total of 2 rules in 5 ms. Remains 107 /108 variables (removed 1) and now considering 285/287 (removed 2) transitions.
[2026-05-26 12:10:24] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5024864628714747227.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12075239979833199000.kers'
[2026-05-26 12:10:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5024864628714747227.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12075239979833199000.kers]
Normalized transition count is 258 out of 259 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 107 cols 854 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 12:10:24] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12075239979833199000.kers
Total runtime 2 ms.
[2026-05-26 12:10:24] [INFO ] Implicit Places using invariants in 193 ms returned []
[2026-05-26 12:10:24] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:10:24] [INFO ] Invariant cache hit.
[2026-05-26 12:10:24] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 12:10:25] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2026-05-26 12:10:25] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:10:25] [INFO ] Invariant cache hit.
[2026-05-26 12:10:25] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 163 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 284/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 447 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 285/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60743 ms. Remains : 107/108 places, 285/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(F((p0&&F((G(p1)&&p2)))))))'
Stuttering acceptance computed with spot in 356 ms :[(NOT p1), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-09 finished in 61160 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((X((p0||X(X(p1))))&&(p2||X(X(G(p3)))))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2026-05-26 12:11:25] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17230457965614171211.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14263349079406648345.kers'
[2026-05-26 12:11:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17230457965614171211.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14263349079406648345.kers]
Normalized transition count is 260 out of 261 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 108 cols 858 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-26 12:11:25] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14263349079406648345.kers
Total runtime 2 ms.
[2026-05-26 12:11:25] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-26 12:11:25] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 12:11:25] [INFO ] Invariant cache hit.
[2026-05-26 12:11:26] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 12:11:26] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2026-05-26 12:11:26] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 12:11:26] [INFO ] Invariant cache hit.
[2026-05-26 12:11:26] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/163 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/369 variables, and 164 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/163 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 286/449 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 450 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in LTL mode , in 1 iterations and 60759 ms. Remains : 108/108 places, 287/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0||X(X(p1))))&&(p2||X(X(G(p3)))))))'
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (NOT p3), (NOT p1), (NOT p1), true, (NOT p3)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-10 finished in 61153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 107 transition count 285
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 105 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 104 transition count 282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 101 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 100 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 99 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 22 place count 99 transition count 279
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 98 transition count 279
Applied a total of 24 rules in 52 ms. Remains 98 /108 variables (removed 10) and now considering 279/287 (removed 8) transitions.
[2026-05-26 12:12:26] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18263392795677718247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7314294345995863977.kers'
[2026-05-26 12:12:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18263392795677718247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7314294345995863977.kers]
Normalized transition count is 246 out of 247 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 246 rows 96 cols 810 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-26 12:12:26] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7314294345995863977.kers
Total runtime 2 ms.
[2026-05-26 12:12:27] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-05-26 12:12:27] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2026-05-26 12:12:27] [INFO ] Invariant cache hit.
[2026-05-26 12:12:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 12:12:27] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2026-05-26 12:12:27] [INFO ] Redundant transitions in 8 ms returned []
Running 276 sub problems to find dead transitions.
[2026-05-26 12:12:27] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2026-05-26 12:12:27] [INFO ] Invariant cache hit.
[2026-05-26 12:12:27] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/151 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/344 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 151 constraints, problems are : Problem set: 0 solved, 276 unsolved in 22149 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/151 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/427 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 427 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52252ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 52253ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/108 places, 279/287 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52903 ms. Remains : 98/108 places, 279/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-11 finished in 52991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 107 transition count 285
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 105 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 104 transition count 282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 101 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 100 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 99 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 22 place count 99 transition count 279
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 98 transition count 279
Applied a total of 24 rules in 33 ms. Remains 98 /108 variables (removed 10) and now considering 279/287 (removed 8) transitions.
[2026-05-26 12:13:19] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2026-05-26 12:13:19] [INFO ] Invariant cache hit.
[2026-05-26 12:13:19] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-26 12:13:19] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2026-05-26 12:13:19] [INFO ] Invariant cache hit.
[2026-05-26 12:13:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 12:13:20] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2026-05-26 12:13:20] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/108 places, 279/287 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 429 ms. Remains : 98/108 places, 279/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-12 finished in 587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X((!p1&&X((!p1 U (!p2||G(!p1)))))))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 285
Applied a total of 2 rules in 3 ms. Remains 107 /108 variables (removed 1) and now considering 285/287 (removed 2) transitions.
[2026-05-26 12:13:20] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12870327229358427007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15095117487220352529.kers'
[2026-05-26 12:13:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12870327229358427007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15095117487220352529.kers]
Normalized transition count is 258 out of 259 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 107 cols 854 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 12:13:20] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15095117487220352529.kers
Total runtime 1 ms.
[2026-05-26 12:13:20] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-26 12:13:20] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:13:20] [INFO ] Invariant cache hit.
[2026-05-26 12:13:20] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 12:13:20] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2026-05-26 12:13:20] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:13:20] [INFO ] Invariant cache hit.
[2026-05-26 12:13:20] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 163 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 284/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 447 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 285/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60422 ms. Remains : 107/108 places, 285/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X((!p1&&X((!p1 U (!p2||G(!p1)))))))))'
Stuttering acceptance computed with spot in 532 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND p1 p2)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-14
Stuttering criterion allowed to conclude after 8447 steps with 2126 reset in 133 ms.
FORMULA FireWire-PT-03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-14 finished in 61147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((p0||F(p1)||X(X(p2)))))&&(F(p1)||X(F(p3))))))'
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 287/287 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 285
Applied a total of 2 rules in 2 ms. Remains 107 /108 variables (removed 1) and now considering 285/287 (removed 2) transitions.
[2026-05-26 12:14:21] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:14:21] [INFO ] Invariant cache hit.
[2026-05-26 12:14:21] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-26 12:14:21] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 12:14:21] [INFO ] Invariant cache hit.
[2026-05-26 12:14:21] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 12:14:22] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 285/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 107/108 places, 285/287 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((p0||F(p1)||X(X(p2)))))&&(F(p1)||X(F(p3))))))'
Stuttering acceptance computed with spot in 304 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-15 finished in 853 ms.
All properties solved by simple procedures.
Total runtime 431754 ms.

BK_STOP 1779797662487

--------------------
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="FireWire-PT-03"
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 FireWire-PT-03, 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 r130-smll-177955808900164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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