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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 7 05:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 7 05:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 7 05:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Mar 7 05:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 05:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 7 05:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:06 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 97K 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-07-LTLFireability-00
FORMULA_NAME FireWire-PT-07-LTLFireability-01
FORMULA_NAME FireWire-PT-07-LTLFireability-02
FORMULA_NAME FireWire-PT-07-LTLFireability-03
FORMULA_NAME FireWire-PT-07-LTLFireability-04
FORMULA_NAME FireWire-PT-07-LTLFireability-05
FORMULA_NAME FireWire-PT-07-LTLFireability-06
FORMULA_NAME FireWire-PT-07-LTLFireability-07
FORMULA_NAME FireWire-PT-07-LTLFireability-08
FORMULA_NAME FireWire-PT-07-LTLFireability-09
FORMULA_NAME FireWire-PT-07-LTLFireability-10
FORMULA_NAME FireWire-PT-07-LTLFireability-11
FORMULA_NAME FireWire-PT-07-LTLFireability-12
FORMULA_NAME FireWire-PT-07-LTLFireability-13
FORMULA_NAME FireWire-PT-07-LTLFireability-14
FORMULA_NAME FireWire-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779803059226

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 13:44:21] [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 13:44:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 13:44:22] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2026-05-26 13:44:22] [INFO ] Transformed 126 places.
[2026-05-26 13:44:22] [INFO ] Transformed 396 transitions.
[2026-05-26 13:44:22] [INFO ] Found NUPN structural information;
[2026-05-26 13:44:22] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 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-07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 343/343 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 338
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 123 transition count 329
Applied a total of 13 rules in 93 ms. Remains 123 /126 variables (removed 3) and now considering 329/343 (removed 14) transitions.
[2026-05-26 13:44:22] [INFO ] Flow matrix only has 303 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-4628385314738103523.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17413033983877056304.kers'
[2026-05-26 13:44:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4628385314738103523.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17413033983877056304.kers]
Normalized transition count is 302 out of 303 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 302 rows 123 cols 1025 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-26 13:44:22] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17413033983877056304.kers
Total runtime 4 ms.
[2026-05-26 13:44:23] [INFO ] Implicit Places using invariants in 516 ms returned []
[2026-05-26 13:44:23] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2026-05-26 13:44:23] [INFO ] Invariant cache hit.
[2026-05-26 13:44:23] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 13:44:24] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2026-05-26 13:44:24] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2026-05-26 13:44:24] [INFO ] Invariant cache hit.
[2026-05-26 13:44:24] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 302/425 variables, 123/139 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 1/426 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (OVERLAPS) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 183 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 302/425 variables, 123/139 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 328/510 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 510 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 43/44 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60477ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60514ms
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 329/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62048 ms. Remains : 123/126 places, 329/343 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Applied a total of 0 rules in 8 ms. Remains 123 /123 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2026-05-26 13:45:24] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2026-05-26 13:45:24] [INFO ] Invariant cache hit.
[2026-05-26 13:45:24] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-26 13:45:24] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2026-05-26 13:45:24] [INFO ] Invariant cache hit.
[2026-05-26 13:45:25] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 13:45:25] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 652 ms. Remains : 123/123 places, 329/329 transitions.
Support contains 37 out of 123 places after structural reductions.
[2026-05-26 13:45:25] [INFO ] Flatten gal took : 112 ms
[2026-05-26 13:45:25] [INFO ] Flatten gal took : 59 ms
[2026-05-26 13:45:26] [INFO ] Input system was already deterministic with 329 transitions.
RANDOM walk for 40000 steps (2217 resets) in 2173 ms. (18 steps per ms) remains 16/32 properties
BEST_FIRST walk for 4002 steps (103 resets) in 71 ms. (55 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (52 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (55 resets) in 44 ms. (88 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (70 resets) in 37 ms. (105 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (18 resets) in 38 ms. (102 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (102 resets) in 28 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (53 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (62 resets) in 17 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (74 resets) in 32 ms. (121 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (63 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (60 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
[2026-05-26 13:45:26] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2026-05-26 13:45:26] [INFO ] Invariant cache hit.
[2026-05-26 13:45:26] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 93/114 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 7/121 variables, 3/10 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 2/12 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 302/423 variables, 121/133 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 43/176 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 2/425 variables, 2/178 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/178 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 1/426 variables, 1/179 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/426 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 179 constraints, problems are : Problem set: 2 solved, 12 unsolved in 1649 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 96/114 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 7/121 variables, 3/10 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 2/12 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 302/423 variables, 121/134 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 43/177 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 12/189 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 1/190 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/191 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/191 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 2/425 variables, 2/193 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 0/193 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 1/426 variables, 1/194 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 0/194 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/426 variables, 0/194 constraints. Problems are: Problem set: 2 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 194 constraints, problems are : Problem set: 2 solved, 12 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 12/14 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6681ms problems are : Problem set: 2 solved, 12 unsolved
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2026 ms.
Support contains 18 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 329/329 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 123 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 122 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 122 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 121 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 121 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 120 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 119 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 119 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 118 transition count 314
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 115 transition count 320
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 25 place count 115 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 115 transition count 311
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 115 transition count 313
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 114 transition count 311
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 114 transition count 309
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 113 transition count 308
Applied a total of 35 rules in 184 ms. Remains 113 /123 variables (removed 10) and now considering 308/329 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 113/123 places, 308/329 transitions.
RANDOM walk for 40000 steps (2292 resets) in 530 ms. (75 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1111 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (559 resets) in 189 ms. (210 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (561 resets) in 145 ms. (273 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1120 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (583 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (52 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (616 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (565 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (69 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (643 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (619 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (61 resets) in 253 ms. (157 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 491490 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :8 out of 11
Probabilistic random walk after 491490 steps, saw 113064 distinct states, run finished after 3010 ms. (steps per millisecond=163 ) properties seen :8
[2026-05-26 13:45:39] [INFO ] Flow matrix only has 279 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16986890985762005835.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-63763889960355769.kers'
[2026-05-26 13:45:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16986890985762005835.kers, --Pflows, --basisKERS=/tmp/petrispot-output-63763889960355769.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 279 rows 111 cols 936 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-26 13:45:39] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-63763889960355769.kers
Total runtime 7 ms.
[2026-05-26 13:45:39] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 57/65 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 230/295 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 21/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 91/386 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 21/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/392 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/392 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 164 constraints, problems are : Problem set: 0 solved, 3 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 57/65 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 230/295 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 21/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 91/386 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 21/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 6/392 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/392 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 167 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1534 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2108ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 785 ms.
Support contains 8 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 308/308 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 301
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 110 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 109 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 109 transition count 297
Applied a total of 10 rules in 30 ms. Remains 109 /113 variables (removed 4) and now considering 297/308 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 109/113 places, 297/308 transitions.
RANDOM walk for 40000 steps (2270 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (503 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (67 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (611 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 621991 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :0 out of 3
Probabilistic random walk after 621991 steps, saw 138438 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
[2026-05-26 13:45:45] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2537418842671199186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1404956892417034015.kers'
[2026-05-26 13:45:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2537418842671199186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1404956892417034015.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 268 rows 107 cols 895 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-26 13:45:45] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1404956892417034015.kers
Total runtime 2 ms.
[2026-05-26 13:45:45] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/64 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 221/285 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 21/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 86/371 variables, 41/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/377 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/377 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/377 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 159 constraints, problems are : Problem set: 0 solved, 3 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/64 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 221/285 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 21/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 86/371 variables, 41/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 6/377 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/377 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/377 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 162 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1681 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2111ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 356 ms.
Support contains 8 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 17 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 109/109 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 13 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2026-05-26 13:45:48] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2026-05-26 13:45:48] [INFO ] Invariant cache hit.
[2026-05-26 13:45:48] [INFO ] Implicit Places using invariants in 179 ms returned []
[2026-05-26 13:45:48] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2026-05-26 13:45:48] [INFO ] Invariant cache hit.
[2026-05-26 13:45:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 13:45:48] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2026-05-26 13:45:48] [INFO ] Redundant transitions in 31 ms returned []
Running 295 sub problems to find dead transitions.
[2026-05-26 13:45:48] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2026-05-26 13:45:48] [INFO ] Invariant cache hit.
[2026-05-26 13:45:48] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 268/376 variables, 108/124 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 41/165 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/377 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 377/377 variables, and 168 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 268/376 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 41/167 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 295/462 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/377 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/377 variables, and 464 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60257ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60922 ms. Remains : 109/109 places, 297/297 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 109 vertex of which 29 / 109 are part of one of the 4 SCC in 4 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
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 3 place count 83 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 83 transition count 167
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 8 place count 82 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 82 transition count 165
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 11 place count 81 transition count 164
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 81 transition count 159
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 78 transition count 158
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 78 transition count 158
Applied a total of 19 rules in 69 ms. Remains 78 /109 variables (removed 31) and now considering 158/297 (removed 139) transitions.
Running SMT prover for 3 properties.
[2026-05-26 13:46:49] [INFO ] Flow matrix only has 156 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13937000825915824948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-555409111718247174.kers'
[2026-05-26 13:46:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13937000825915824948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-555409111718247174.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 156 rows 76 cols 561 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-26 13:46:49] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-555409111718247174.kers
Total runtime 3 ms.
[2026-05-26 13:46:49] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-26 13:46:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-26 13:46:49] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-26 13:46:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
TRAPS : Iteration 1
[2026-05-26 13:46:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
TRAPS : Iteration 2
[2026-05-26 13:46:49] [INFO ] After 511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-26 13:46:50] [INFO ] After 670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 840 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA FireWire-PT-07-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 22 stabilizing places and 47 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 118 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 116 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 105 transition count 286
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 1 with 2 rules applied. Total rules applied 38 place count 104 transition count 285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 101 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 101 transition count 285
Applied a total of 50 rules in 121 ms. Remains 101 /123 variables (removed 22) and now considering 285/329 (removed 44) transitions.
[2026-05-26 13:46:50] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10105842155347952301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16105170717394698715.kers'
[2026-05-26 13:46:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10105842155347952301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16105170717394698715.kers]
Normalized transition count is 251 out of 252 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 251 rows 99 cols 831 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-26 13:46:50] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16105170717394698715.kers
Total runtime 2 ms.
[2026-05-26 13:46:50] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-26 13:46:50] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2026-05-26 13:46:50] [INFO ] Invariant cache hit.
[2026-05-26 13:46:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:46:51] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2026-05-26 13:46:51] [INFO ] Redundant transitions in 5 ms returned []
Running 282 sub problems to find dead transitions.
[2026-05-26 13:46:51] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2026-05-26 13:46:51] [INFO ] Invariant cache hit.
[2026-05-26 13:46:51] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/153 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/353 variables, and 155 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 282/436 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 1/352 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/353 variables, and 438 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/123 places, 285/329 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60769 ms. Remains : 101/123 places, 285/329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 309 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA FireWire-PT-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-00 finished in 61215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(G(p2)))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 120 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 118 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 107 transition count 290
Applied a total of 33 rules in 36 ms. Remains 107 /123 variables (removed 16) and now considering 290/329 (removed 39) transitions.
[2026-05-26 13:47:51] [INFO ] Flow matrix only has 264 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-17152082448468994492.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-26006372885456356.kers'
[2026-05-26 13:47:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17152082448468994492.kers, --Pflows, --basisKERS=/tmp/petrispot-output-26006372885456356.kers]
Normalized transition count is 263 out of 264 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 107 cols 883 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-26 13:47:51] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-26006372885456356.kers
Total runtime 3 ms.
[2026-05-26 13:47:52] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-26 13:47:52] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 13:47:52] [INFO ] Invariant cache hit.
[2026-05-26 13:47:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:47:52] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2026-05-26 13:47:52] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 13:47:52] [INFO ] Invariant cache hit.
[2026-05-26 13:47:52] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/370 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/371 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 160 constraints, problems are : Problem set: 0 solved, 289 unsolved in 23894 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/370 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 289/448 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/371 variables, and 448 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54057ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 54059ms
Starting structural reductions in LTL mode, iteration 1 : 107/123 places, 290/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54681 ms. Remains : 107/123 places, 290/329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(G(p2)))))'
Stuttering acceptance computed with spot in 336 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-07-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-01 finished in 55075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p1)&&p0) U p1))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 118 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 116 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 105 transition count 286
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 1 with 2 rules applied. Total rules applied 38 place count 104 transition count 285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 101 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 101 transition count 285
Applied a total of 50 rules in 82 ms. Remains 101 /123 variables (removed 22) and now considering 285/329 (removed 44) transitions.
[2026-05-26 13:48:46] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-750447080732013459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10020037230862274.kers'
[2026-05-26 13:48:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-750447080732013459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10020037230862274.kers]
Normalized transition count is 251 out of 252 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 251 rows 99 cols 831 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-26 13:48:46] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-10020037230862274.kers
Total runtime 11 ms.
[2026-05-26 13:48:47] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-26 13:48:47] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2026-05-26 13:48:47] [INFO ] Invariant cache hit.
[2026-05-26 13:48:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:48:47] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2026-05-26 13:48:47] [INFO ] Redundant transitions in 7 ms returned []
Running 282 sub problems to find dead transitions.
[2026-05-26 13:48:47] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2026-05-26 13:48:47] [INFO ] Invariant cache hit.
[2026-05-26 13:48:47] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/153 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/353 variables, and 155 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 282/436 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 1/352 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/353 variables, and 438 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/123 places, 285/329 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60800 ms. Remains : 101/123 places, 285/329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p1)&&p0) U p1))))'
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-02 finished in 60966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 118 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 116 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 105 transition count 286
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 1 with 2 rules applied. Total rules applied 38 place count 104 transition count 285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 101 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 101 transition count 285
Applied a total of 50 rules in 82 ms. Remains 101 /123 variables (removed 22) and now considering 285/329 (removed 44) transitions.
[2026-05-26 13:49:47] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2026-05-26 13:49:47] [INFO ] Invariant cache hit.
[2026-05-26 13:49:48] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-26 13:49:48] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2026-05-26 13:49:48] [INFO ] Invariant cache hit.
[2026-05-26 13:49:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:49:48] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2026-05-26 13:49:48] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/123 places, 285/329 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 558 ms. Remains : 101/123 places, 285/329 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 50 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-05 finished in 653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U X((p1 U (X(p2)&&F(p3))))))))'
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 120 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 118 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 107 transition count 290
Applied a total of 33 rules in 25 ms. Remains 107 /123 variables (removed 16) and now considering 290/329 (removed 39) transitions.
[2026-05-26 13:49:48] [INFO ] Flow matrix only has 264 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-4476699216935739292.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13086525297155225442.kers'
[2026-05-26 13:49:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4476699216935739292.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13086525297155225442.kers]
Normalized transition count is 263 out of 264 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 107 cols 883 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-26 13:49:48] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13086525297155225442.kers
Total runtime 3 ms.
[2026-05-26 13:49:48] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-26 13:49:48] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 13:49:48] [INFO ] Invariant cache hit.
[2026-05-26 13:49:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:49:48] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2026-05-26 13:49:48] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 13:49:48] [INFO ] Invariant cache hit.
[2026-05-26 13:49:48] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/370 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/371 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 160 constraints, problems are : Problem set: 0 solved, 289 unsolved in 22560 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/370 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 289/448 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/371 variables, and 448 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52649ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 52650ms
Starting structural reductions in LTL mode, iteration 1 : 107/123 places, 290/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53078 ms. Remains : 107/123 places, 290/329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U X((p1 U (X(p2)&&F(p3))))))))'
Stuttering acceptance computed with spot in 763 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : FireWire-PT-07-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-06 finished in 53977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X((p1&&X(X(F((G(F(!p2))||(!p3&&F(!p2)))))))))||p0))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 120 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 118 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 107 transition count 290
Applied a total of 33 rules in 20 ms. Remains 107 /123 variables (removed 16) and now considering 290/329 (removed 39) transitions.
[2026-05-26 13:50:42] [INFO ] Flow matrix only has 264 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-17451981823701249371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4476515209504257568.kers'
[2026-05-26 13:50:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17451981823701249371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4476515209504257568.kers]
Normalized transition count is 263 out of 264 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 107 cols 883 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-26 13:50:42] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4476515209504257568.kers
Total runtime 3 ms.
[2026-05-26 13:50:42] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-26 13:50:42] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 13:50:42] [INFO ] Invariant cache hit.
[2026-05-26 13:50:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:50:43] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 107/123 places, 290/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 107/123 places, 290/329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X((p1&&X(X(F((G(F(p2))||(p3&&F(p2)))))))))||p0))))'
Stuttering acceptance computed with spot in 429 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-07-LTLFireability-07
Product exploration explored 100000 steps with 1 reset in 383 ms.
Product exploration explored 100000 steps with 3 reset in 229 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 8 states, 11 edges and 4 AP (stutter sensitive) to 8 states, 11 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (2193 resets) in 339 ms. (117 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (550 resets) in 257 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (606 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
[2026-05-26 13:50:44] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 13:50:44] [INFO ] Invariant cache hit.
[2026-05-26 13:50:44] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 263/368 variables, 105/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 37/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/370 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/371 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/371 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 154 constraints, problems are : Problem set: 0 solved, 2 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 263/368 variables, 105/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 37/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/370 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/371 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/371 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 156 constraints, problems are : Problem set: 0 solved, 2 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 958ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 290/290 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 107 transition count 287
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 1 with 2 rules applied. Total rules applied 5 place count 106 transition count 286
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 11 place count 103 transition count 292
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 17 place count 103 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 103 transition count 283
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 103 transition count 285
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 24 place count 102 transition count 283
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 26 place count 102 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 101 transition count 280
Applied a total of 27 rules in 47 ms. Remains 101 /107 variables (removed 6) and now considering 280/290 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 101/107 places, 280/290 transitions.
RANDOM walk for 40000 steps (2314 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (511 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (544 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 318221 steps, run visited all 2 properties in 1558 ms. (steps per millisecond=204 )
Probabilistic random walk after 318221 steps, saw 73809 distinct states, run finished after 1567 ms. (steps per millisecond=203 ) properties seen :2
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 8 states, 11 edges and 4 AP (stutter sensitive) to 8 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2)]
Knowledge-based reduction took 3734 ms.
Stuttering acceptance computed with spot in 420 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 6 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 290/290 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 290/290 (removed 0) transitions.
[2026-05-26 13:50:48] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 13:50:48] [INFO ] Invariant cache hit.
[2026-05-26 13:50:48] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-26 13:50:48] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 13:50:48] [INFO ] Invariant cache hit.
[2026-05-26 13:50:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:50:48] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 107/107 places, 290/290 transitions.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 8 states, 11 edges and 4 AP (stutter sensitive) to 8 states, 11 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (2225 resets) in 305 ms. (130 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (582 resets) in 136 ms. (291 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (603 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
[2026-05-26 13:50:49] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 13:50:49] [INFO ] Invariant cache hit.
[2026-05-26 13:50:49] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 263/368 variables, 105/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 37/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/370 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/371 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/371 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 154 constraints, problems are : Problem set: 0 solved, 2 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 263/368 variables, 105/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 37/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/370 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/371 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/371 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 156 constraints, problems are : Problem set: 0 solved, 2 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1081ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 144 ms.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 290/290 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 107 transition count 287
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 1 with 2 rules applied. Total rules applied 5 place count 106 transition count 286
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 103 transition count 292
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 17 place count 103 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 103 transition count 283
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 103 transition count 285
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 24 place count 102 transition count 283
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 26 place count 102 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 101 transition count 280
Applied a total of 27 rules in 43 ms. Remains 101 /107 variables (removed 6) and now considering 280/290 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 101/107 places, 280/290 transitions.
RANDOM walk for 40000 steps (2358 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (506 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (596 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 318221 steps, run visited all 2 properties in 1615 ms. (steps per millisecond=197 )
Probabilistic random walk after 318221 steps, saw 73809 distinct states, run finished after 1615 ms. (steps per millisecond=197 ) properties seen :2
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 8 states, 11 edges and 4 AP (stutter sensitive) to 8 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2)]
Knowledge-based reduction took 3997 ms.
Stuttering acceptance computed with spot in 398 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 421 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 200 ms.
Product exploration explored 100000 steps with 0 reset in 225 ms.
Spot run failed in 246 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin6361510978698038888
[2026-05-26 13:50:54] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6361510978698038888
Running compilation step : cd /tmp/ltsmin6361510978698038888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1070 ms.
Running link step : cd /tmp/ltsmin6361510978698038888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin6361510978698038888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased15667297713319838414.hoa' '--buchi-type=spotba'
LTSmin run took 1445 ms.
FORMULA FireWire-PT-07-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-07-LTLFireability-07 finished in 14669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!(G(p0) U !p1)&&X(p2)))&&F(p3)))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 320
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 119 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 291
Applied a total of 32 rules in 20 ms. Remains 108 /123 variables (removed 15) and now considering 291/329 (removed 38) transitions.
[2026-05-26 13:50:57] [INFO ] Flow matrix only has 265 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-135230222517457379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17331738147673567190.kers'
[2026-05-26 13:50:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-135230222517457379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17331738147673567190.kers]
Normalized transition count is 264 out of 265 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 264 rows 108 cols 887 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 13:50:57] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17331738147673567190.kers
Total runtime 2 ms.
[2026-05-26 13:50:57] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-26 13:50:57] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2026-05-26 13:50:57] [INFO ] Invariant cache hit.
[2026-05-26 13:50:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:50:57] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2026-05-26 13:50:57] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2026-05-26 13:50:57] [INFO ] Invariant cache hit.
[2026-05-26 13:50:57] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 264/372 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/373 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 161 constraints, problems are : Problem set: 0 solved, 290 unsolved in 19569 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 264/372 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 290/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
SMT process timed out in 49688ms, After SMT, problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 49690ms
Starting structural reductions in LTL mode, iteration 1 : 108/123 places, 291/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50224 ms. Remains : 108/123 places, 291/329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!(G(p0) U !p1)&&X(p2)))&&F(p3)))'
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p1) (NOT p3) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p3), true, (NOT p2), (AND p0 (NOT p1)), p0]
Running random walk in product with property : FireWire-PT-07-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-08 finished in 50653 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((X(X(F(p1)))||p0)))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 320
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 119 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 287
Applied a total of 36 rules in 31 ms. Remains 106 /123 variables (removed 17) and now considering 287/329 (removed 42) transitions.
[2026-05-26 13:51:47] [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-12323172557926348077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6219660502455188425.kers'
[2026-05-26 13:51:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12323172557926348077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6219660502455188425.kers]
Normalized transition count is 260 out of 261 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 106 cols 871 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 13:51:47] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6219660502455188425.kers
Total runtime 4 ms.
[2026-05-26 13:51:48] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-26 13:51:48] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 13:51:48] [INFO ] Invariant cache hit.
[2026-05-26 13:51:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:51:48] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2026-05-26 13:51:48] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 13:51:48] [INFO ] Invariant cache hit.
[2026-05-26 13:51:48] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 158 constraints, problems are : Problem set: 0 solved, 286 unsolved in 23374 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 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/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/367 variables, and 443 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53522ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 53524ms
Starting structural reductions in LTL mode, iteration 1 : 106/123 places, 287/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54078 ms. Remains : 106/123 places, 287/329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(X(F(p1)))||p0)))))'
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-07-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 226 ms.
Product exploration explored 100000 steps with 33333 reset in 372 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge based reduction with 2 factoid took 56 ms. Proved property starting from automaton with 5 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 66 ms.
FORMULA FireWire-PT-07-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-07-LTLFireability-09 finished in 54966 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))) U X(G(p2))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 320
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 119 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 296
Applied a total of 28 rules in 9 ms. Remains 110 /123 variables (removed 13) and now considering 296/329 (removed 33) transitions.
[2026-05-26 13:52:42] [INFO ] Flow matrix only has 270 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-8665471101513112929.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13177114696409669751.kers'
[2026-05-26 13:52:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8665471101513112929.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13177114696409669751.kers]
Normalized transition count is 269 out of 270 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 269 rows 110 cols 905 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-26 13:52:42] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13177114696409669751.kers
Total runtime 2 ms.
[2026-05-26 13:52:42] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-26 13:52:42] [INFO ] Flow matrix only has 270 transitions (discarded 26 similar events)
[2026-05-26 13:52:42] [INFO ] Invariant cache hit.
[2026-05-26 13:52:43] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 13:52:43] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2026-05-26 13:52:43] [INFO ] Flow matrix only has 270 transitions (discarded 26 similar events)
[2026-05-26 13:52:43] [INFO ] Invariant cache hit.
[2026-05-26 13:52:43] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 269/379 variables, 110/125 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 38/163 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/380 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 164 constraints, problems are : Problem set: 0 solved, 295 unsolved in 22447 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (OVERLAPS) 269/379 variables, 110/125 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 38/163 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 295/458 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/380 variables, and 458 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 38/39 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52556ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 52559ms
Starting structural reductions in LTL mode, iteration 1 : 110/123 places, 296/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52992 ms. Remains : 110/123 places, 296/329 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))) U X(G(p2))))'
Stuttering acceptance computed with spot in 419 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : FireWire-PT-07-LTLFireability-10
Stuttering criterion allowed to conclude after 10 steps with 3 reset in 1 ms.
FORMULA FireWire-PT-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-10 finished in 53493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!p0 U X((X(F(!G(p1)))||X(!p2))))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 320
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 119 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 287
Applied a total of 36 rules in 23 ms. Remains 106 /123 variables (removed 17) and now considering 287/329 (removed 42) transitions.
[2026-05-26 13:53:36] [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-14941850267575562674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12872196892791999034.kers'
[2026-05-26 13:53:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14941850267575562674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12872196892791999034.kers]
Normalized transition count is 260 out of 261 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 106 cols 871 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 13:53:36] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12872196892791999034.kers
Total runtime 2 ms.
[2026-05-26 13:53:36] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-26 13:53:36] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 13:53:36] [INFO ] Invariant cache hit.
[2026-05-26 13:53:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:53:36] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2026-05-26 13:53:36] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 13:53:36] [INFO ] Invariant cache hit.
[2026-05-26 13:53:36] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 158 constraints, problems are : Problem set: 0 solved, 286 unsolved in 24147 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 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/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/367 variables, and 443 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54269ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 54271ms
Starting structural reductions in LTL mode, iteration 1 : 106/123 places, 287/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54807 ms. Remains : 106/123 places, 287/329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!p0 U X((X(F(!G(p1)))||X(!p2))))))'
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-13 finished in 55151 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((G(p1)||p0)))))'
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 119 transition count 318
Applied a total of 10 rules in 10 ms. Remains 119 /123 variables (removed 4) and now considering 318/329 (removed 11) transitions.
[2026-05-26 13:54:31] [INFO ] Flow matrix only has 292 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-11734871939390921013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9173690991751938777.kers'
[2026-05-26 13:54:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11734871939390921013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9173690991751938777.kers]
Normalized transition count is 291 out of 292 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 291 rows 119 cols 983 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-26 13:54:31] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9173690991751938777.kers
Total runtime 3 ms.
[2026-05-26 13:54:31] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-26 13:54:31] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
[2026-05-26 13:54:31] [INFO ] Invariant cache hit.
[2026-05-26 13:54:31] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 13:54:31] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 317 sub problems to find dead transitions.
[2026-05-26 13:54:31] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
[2026-05-26 13:54:31] [INFO ] Invariant cache hit.
[2026-05-26 13:54:31] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 291/410 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 1/411 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (OVERLAPS) 0/411 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 177 constraints, problems are : Problem set: 0 solved, 317 unsolved in 25129 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 291/410 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 317/493 constraints. Problems are: Problem set: 0 solved, 317 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 410/411 variables, and 493 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55229ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 55231ms
Starting structural reductions in LTL mode, iteration 1 : 119/123 places, 318/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55649 ms. Remains : 119/123 places, 318/329 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((G(p1)||p0)))))'
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-07-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 254 ms.
Product exploration explored 100000 steps with 2 reset in 381 ms.
Computed a total of 22 stabilizing places and 47 stable transitions
Computed a total of 22 stabilizing places and 47 stable transitions
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (2251 resets) in 197 ms. (202 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
[2026-05-26 13:55:28] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
[2026-05-26 13:55:28] [INFO ] Invariant cache hit.
[2026-05-26 13:55:28] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/117 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 291/408 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 42/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/410 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/411 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/411 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 72/411 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 3/8 constraints, State Equation: 0/119 constraints, ReadFeed: 0/43 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 356ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 873 ms.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 119 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 318/318 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2026-05-26 13:55:28] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
[2026-05-26 13:55:28] [INFO ] Invariant cache hit.
[2026-05-26 13:55:29] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-26 13:55:29] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
[2026-05-26 13:55:29] [INFO ] Invariant cache hit.
[2026-05-26 13:55:29] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 13:55:29] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 502 ms. Remains : 119/119 places, 318/318 transitions.
Computed a total of 22 stabilizing places and 47 stable transitions
Computed a total of 22 stabilizing places and 47 stable transitions
Knowledge based reduction with 2 factoid took 56 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 38489 steps (2128 resets) in 132 ms. (289 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 352 ms.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 81 ms.
Spot run failed in 63 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14109952695785029822
[2026-05-26 13:55:30] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14109952695785029822
Running compilation step : cd /tmp/ltsmin14109952695785029822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 875 ms.
Running link step : cd /tmp/ltsmin14109952695785029822;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14109952695785029822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7977155171489369150.hoa' '--buchi-type=spotba'
LTSmin run took 26 ms.
FORMULA FireWire-PT-07-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-07-LTLFireability-14 finished in 59978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 118 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 116 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 105 transition count 286
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 1 with 2 rules applied. Total rules applied 38 place count 104 transition count 285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 101 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 101 transition count 285
Applied a total of 50 rules in 66 ms. Remains 101 /123 variables (removed 22) and now considering 285/329 (removed 44) transitions.
[2026-05-26 13:55:31] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7864494286899539629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10893109324871613683.kers'
[2026-05-26 13:55:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7864494286899539629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10893109324871613683.kers]
Normalized transition count is 251 out of 252 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 251 rows 99 cols 831 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-26 13:55:31] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10893109324871613683.kers
Total runtime 5 ms.
[2026-05-26 13:55:31] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-26 13:55:31] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2026-05-26 13:55:31] [INFO ] Invariant cache hit.
[2026-05-26 13:55:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:55:31] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2026-05-26 13:55:31] [INFO ] Redundant transitions in 3 ms returned []
Running 282 sub problems to find dead transitions.
[2026-05-26 13:55:31] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2026-05-26 13:55:31] [INFO ] Invariant cache hit.
[2026-05-26 13:55:31] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/153 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/353 variables, and 155 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 251/351 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 282/436 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 1/352 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/353 variables, and 438 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/123 places, 285/329 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60731 ms. Remains : 101/123 places, 285/329 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-15 finished in 60836 ms.
All properties solved by simple procedures.
Total runtime 730409 ms.

BK_STOP 1779803792321

--------------------
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-07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FireWire-PT-07, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955809000196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-07.tgz
mv FireWire-PT-07 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;