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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.4K Mar 7 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 7 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 7 05:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 7 05:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 17 09:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 17 09:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 17 09:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 17 09:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 7 05:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Mar 7 05:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 17 09:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 17 09:03 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 153K 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-13-LTLFireability-00
FORMULA_NAME FireWire-PT-13-LTLFireability-01
FORMULA_NAME FireWire-PT-13-LTLFireability-02
FORMULA_NAME FireWire-PT-13-LTLFireability-03
FORMULA_NAME FireWire-PT-13-LTLFireability-04
FORMULA_NAME FireWire-PT-13-LTLFireability-05
FORMULA_NAME FireWire-PT-13-LTLFireability-06
FORMULA_NAME FireWire-PT-13-LTLFireability-07
FORMULA_NAME FireWire-PT-13-LTLFireability-08
FORMULA_NAME FireWire-PT-13-LTLFireability-09
FORMULA_NAME FireWire-PT-13-LTLFireability-10
FORMULA_NAME FireWire-PT-13-LTLFireability-11
FORMULA_NAME FireWire-PT-13-LTLFireability-12
FORMULA_NAME FireWire-PT-13-LTLFireability-13
FORMULA_NAME FireWire-PT-13-LTLFireability-14
FORMULA_NAME FireWire-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779822689855

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 19:11:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 19:11:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 19:11:32] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2026-05-26 19:11:32] [INFO ] Transformed 205 places.
[2026-05-26 19:11:32] [INFO ] Transformed 610 transitions.
[2026-05-26 19:11:32] [INFO ] Found NUPN structural information;
[2026-05-26 19:11:32] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
FORMULA FireWire-PT-13-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 542/542 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 201 transition count 534
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 201 transition count 534
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 201 transition count 532
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 199 transition count 526
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 199 transition count 526
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 197 transition count 522
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 197 transition count 522
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 195 transition count 516
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 195 transition count 516
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 193 transition count 512
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 193 transition count 512
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 192 transition count 509
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 192 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 191 transition count 507
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 191 transition count 507
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 190 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 190 transition count 504
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 38 place count 190 transition count 498
Applied a total of 38 rules in 201 ms. Remains 190 /205 variables (removed 15) and now considering 498/542 (removed 44) transitions.
[2026-05-26 19:11:33] [INFO ] Flow matrix only has 466 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12672324402348327197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-624889824970769511.kers'
[2026-05-26 19:11:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12672324402348327197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-624889824970769511.kers]
Normalized transition count is 465 out of 466 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 465 rows 190 cols 1617 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-26 19:11:33] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-624889824970769511.kers
Total runtime 6 ms.
[2026-05-26 19:11:33] [INFO ] Implicit Places using invariants in 670 ms returned []
[2026-05-26 19:11:33] [INFO ] Flow matrix only has 466 transitions (discarded 32 similar events)
[2026-05-26 19:11:33] [INFO ] Invariant cache hit.
[2026-05-26 19:11:34] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-26 19:11:35] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2187 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/205 places, 498/542 transitions.
Applied a total of 0 rules in 9 ms. Remains 189 /189 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2441 ms. Remains : 189/205 places, 498/542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 498/498 transitions.
Applied a total of 0 rules in 7 ms. Remains 189 /189 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2026-05-26 19:11:35] [INFO ] Flow matrix only has 466 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8919541490982487729.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-408403969193491803.kers'
[2026-05-26 19:11:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8919541490982487729.kers, --Pflows, --basisKERS=/tmp/petrispot-output-408403969193491803.kers]
Normalized transition count is 465 out of 466 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 465 rows 189 cols 1607 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-26 19:11:35] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-408403969193491803.kers
Total runtime 4 ms.
[2026-05-26 19:11:35] [INFO ] Implicit Places using invariants in 276 ms returned []
[2026-05-26 19:11:35] [INFO ] Flow matrix only has 466 transitions (discarded 32 similar events)
[2026-05-26 19:11:35] [INFO ] Invariant cache hit.
[2026-05-26 19:11:36] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-26 19:11:36] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
Running 497 sub problems to find dead transitions.
[2026-05-26 19:11:37] [INFO ] Flow matrix only has 466 transitions (discarded 32 similar events)
[2026-05-26 19:11:37] [INFO ] Invariant cache hit.
[2026-05-26 19:11:37] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 4 (OVERLAPS) 465/654 variables, 189/208 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 66/274 constraints. Problems are: Problem set: 0 solved, 497 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/655 variables, and 274 constraints, problems are : Problem set: 0 solved, 497 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 189/189 constraints, ReadFeed: 66/67 constraints, PredecessorRefiner: 497/497 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 497 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 4 (OVERLAPS) 465/654 variables, 189/208 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 66/274 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 497/771 constraints. Problems are: Problem set: 0 solved, 497 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/655 variables, and 771 constraints, problems are : Problem set: 0 solved, 497 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 189/189 constraints, ReadFeed: 66/67 constraints, PredecessorRefiner: 497/497 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60798ms problems are : Problem set: 0 solved, 497 unsolved
Search for dead transitions found 0 dead transitions in 60837ms
Finished structural reductions in LTL mode , in 1 iterations and 62451 ms. Remains : 189/189 places, 498/498 transitions.
Support contains 39 out of 189 places after structural reductions.
[2026-05-26 19:12:38] [INFO ] Flatten gal took : 152 ms
[2026-05-26 19:12:38] [INFO ] Flatten gal took : 85 ms
[2026-05-26 19:12:38] [INFO ] Input system was already deterministic with 498 transitions.
RANDOM walk for 40000 steps (1175 resets) in 3482 ms. (11 steps per ms) remains 10/27 properties
BEST_FIRST walk for 40004 steps (239 resets) in 272 ms. (146 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (313 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (20 resets) in 112 ms. (354 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (234 resets) in 148 ms. (268 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40000 steps (56 resets) in 128 ms. (310 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (249 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
[2026-05-26 19:12:39] [INFO ] Flow matrix only has 466 transitions (discarded 32 similar events)
[2026-05-26 19:12:39] [INFO ] Invariant cache hit.
[2026-05-26 19:12:39] [INFO ] State equation strengthened by 67 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 152/164 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 19/183 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 462/645 variables, 183/196 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 66/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 9/654 variables, 6/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/654 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/655 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/655 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/655 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 269 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1621 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 189/189 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 152/164 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19/183 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 462/645 variables, 183/196 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 66/262 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 4/266 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 9/654 variables, 6/272 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/654 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/655 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/655 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/655 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 273 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2495 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 189/189 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4135ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 0 properties in 2680 ms.
Support contains 8 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 498/498 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 189 transition count 495
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 189 transition count 492
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 9 place count 186 transition count 492
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 184 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 184 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 184 transition count 486
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 183 transition count 484
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 183 transition count 484
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 182 transition count 481
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 182 transition count 481
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 181 transition count 479
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 181 transition count 479
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 180 transition count 476
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 180 transition count 476
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 179 transition count 474
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 179 transition count 474
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 178 transition count 472
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 178 transition count 472
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 177 transition count 470
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 177 transition count 470
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 174 transition count 467
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 2 with 6 rules applied. Total rules applied 40 place count 171 transition count 473
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 46 place count 171 transition count 467
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 49 place count 171 transition count 464
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 171 transition count 468
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 57 place count 169 transition count 464
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 61 place count 169 transition count 460
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 168 transition count 459
Applied a total of 62 rules in 179 ms. Remains 168 /189 variables (removed 21) and now considering 459/498 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 168/189 places, 459/498 transitions.
RANDOM walk for 40000 steps (1271 resets) in 819 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (374 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (248 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (44 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (277 resets) in 321 ms. (124 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 525366 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :1 out of 4
Probabilistic random walk after 525366 steps, saw 130010 distinct states, run finished after 3007 ms. (steps per millisecond=174 ) properties seen :1
[2026-05-26 19:12:50] [INFO ] Flow matrix only has 423 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3108630626719136670.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16049901415582259346.kers'
[2026-05-26 19:12:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3108630626719136670.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16049901415582259346.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 423 rows 168 cols 1466 entries
Finished phase 1 with 159 SingleSign rule and 0 generalized
[2026-05-26 19:12:50] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16049901415582259346.kers
Total runtime 3 ms.
[2026-05-26 19:12:50] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 104/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 372/482 variables, 110/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 42/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 96/578 variables, 49/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 12/590 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/591 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/591 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 239 constraints, problems are : Problem set: 0 solved, 3 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 168/168 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 104/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 372/482 variables, 110/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 42/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 96/578 variables, 49/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/590 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/590 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/591 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/591 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/591 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 591/591 variables, and 243 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1672 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 168/168 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2220ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1100 ms.
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 459/459 transitions.
Applied a total of 0 rules in 15 ms. Remains 168 /168 variables (removed 0) and now considering 459/459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 168/168 places, 459/459 transitions.
RANDOM walk for 40000 steps (1299 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (373 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (268 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (286 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 490053 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 3
Probabilistic random walk after 490053 steps, saw 122691 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2026-05-26 19:12:56] [INFO ] Flow matrix only has 423 transitions (discarded 36 similar events)
[2026-05-26 19:12:56] [INFO ] Invariant cache hit.
[2026-05-26 19:12:56] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 104/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 372/482 variables, 110/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 42/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 96/578 variables, 49/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 12/590 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/591 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/591 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 239 constraints, problems are : Problem set: 0 solved, 3 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 168/168 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 104/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 372/482 variables, 110/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 42/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 96/578 variables, 49/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/590 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/590 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/591 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/591 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/591 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 591/591 variables, and 243 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1682 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 168/168 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2378ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1066 ms.
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 459/459 transitions.
Applied a total of 0 rules in 11 ms. Remains 168 /168 variables (removed 0) and now considering 459/459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 168/168 places, 459/459 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 459/459 transitions.
Applied a total of 0 rules in 11 ms. Remains 168 /168 variables (removed 0) and now considering 459/459 (removed 0) transitions.
[2026-05-26 19:13:00] [INFO ] Flow matrix only has 423 transitions (discarded 36 similar events)
[2026-05-26 19:13:00] [INFO ] Invariant cache hit.
[2026-05-26 19:13:00] [INFO ] Implicit Places using invariants in 231 ms returned []
[2026-05-26 19:13:00] [INFO ] Flow matrix only has 423 transitions (discarded 36 similar events)
[2026-05-26 19:13:00] [INFO ] Invariant cache hit.
[2026-05-26 19:13:00] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-26 19:13:01] [INFO ] Implicit Places using invariants and state equation in 633 ms returned [18, 123]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 868 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 166/168 places, 459/459 transitions.
Applied a total of 0 rules in 10 ms. Remains 166 /166 variables (removed 0) and now considering 459/459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 891 ms. Remains : 166/168 places, 459/459 transitions.
RANDOM walk for 40000 steps (1353 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (386 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (270 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (281 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 538588 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 3
Probabilistic random walk after 538588 steps, saw 133343 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
[2026-05-26 19:13:04] [INFO ] Flow matrix only has 423 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7866301200998503477.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7450141557171836092.kers'
[2026-05-26 19:13:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7866301200998503477.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7450141557171836092.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 423 rows 166 cols 1448 entries
Finished phase 1 with 159 SingleSign rule and 0 generalized
[2026-05-26 19:13:04] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7450141557171836092.kers
Total runtime 4 ms.
[2026-05-26 19:13:04] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 104/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 372/482 variables, 110/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 42/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 95/577 variables, 48/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 11/588 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/589 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/589 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/589 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 235 constraints, problems are : Problem set: 0 solved, 3 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 104/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 372/482 variables, 110/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 42/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 95/577 variables, 48/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 11/588 variables, 7/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/588 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/588 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/588 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/589 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/589 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/589 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/589 variables, and 239 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1564 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2318ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1082 ms.
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 459/459 transitions.
Applied a total of 0 rules in 12 ms. Remains 166 /166 variables (removed 0) and now considering 459/459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 166/166 places, 459/459 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 459/459 transitions.
Applied a total of 0 rules in 10 ms. Remains 166 /166 variables (removed 0) and now considering 459/459 (removed 0) transitions.
[2026-05-26 19:13:07] [INFO ] Flow matrix only has 423 transitions (discarded 36 similar events)
[2026-05-26 19:13:07] [INFO ] Invariant cache hit.
[2026-05-26 19:13:07] [INFO ] Implicit Places using invariants in 176 ms returned []
[2026-05-26 19:13:07] [INFO ] Flow matrix only has 423 transitions (discarded 36 similar events)
[2026-05-26 19:13:07] [INFO ] Invariant cache hit.
[2026-05-26 19:13:08] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-26 19:13:08] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2026-05-26 19:13:08] [INFO ] Redundant transitions in 51 ms returned []
Running 453 sub problems to find dead transitions.
[2026-05-26 19:13:08] [INFO ] Flow matrix only has 423 transitions (discarded 36 similar events)
[2026-05-26 19:13:08] [INFO ] Invariant cache hit.
[2026-05-26 19:13:08] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (OVERLAPS) 423/589 variables, 166/180 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 62/242 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/589 variables, and 247 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (OVERLAPS) 423/589 variables, 166/185 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 62/247 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 453/700 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 701 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60411ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61237 ms. Remains : 166/166 places, 459/459 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 166 vertex of which 31 / 166 are part of one of the 5 SCC in 5 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 147 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 139 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 11 place count 139 transition count 303
Free-agglomeration rule applied 8 times with reduction of 5 identical transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 19 place count 139 transition count 290
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 30 place count 131 transition count 287
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 131 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 131 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 130 transition count 285
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 130 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 130 transition count 284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 129 transition count 283
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 129 transition count 283
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 129 transition count 283
Applied a total of 43 rules in 77 ms. Remains 129 /166 variables (removed 37) and now considering 283/459 (removed 176) transitions.
Running SMT prover for 3 properties.
[2026-05-26 19:14:09] [INFO ] Flow matrix only has 281 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-9916345875230058059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13446311203742458690.kers'
[2026-05-26 19:14:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9916345875230058059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13446311203742458690.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 281 rows 129 cols 1029 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-26 19:14:09] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13446311203742458690.kers
Total runtime 4 ms.
[2026-05-26 19:14:09] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-26 19:14:09] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-26 19:14:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-26 19:14:09] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-26 19:14:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
TRAPS : Iteration 1
[2026-05-26 19:14:10] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-26 19:14:10] [INFO ] After 718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1174 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA FireWire-PT-13-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 47 stabilizing places and 104 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(p0)&&X(F(p1))))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 489
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 185 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 182 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 182 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 179 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 179 transition count 473
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 176 transition count 466
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 176 transition count 466
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 173 transition count 459
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 173 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 171 transition count 454
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 171 transition count 454
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 169 transition count 450
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 169 transition count 450
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 167 transition count 445
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 167 transition count 445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 166 transition count 443
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 166 transition count 443
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 165 transition count 440
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 165 transition count 440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 164 transition count 438
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 164 transition count 438
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 163 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 163 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 162 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 162 transition count 434
Applied a total of 55 rules in 38 ms. Remains 162 /189 variables (removed 27) and now considering 434/498 (removed 64) transitions.
[2026-05-26 19:14:10] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16427616316388305453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17533990564856557746.kers'
[2026-05-26 19:14:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16427616316388305453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17533990564856557746.kers]
Normalized transition count is 401 out of 402 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 162 cols 1372 entries
Finished phase 1 with 153 SingleSign rule and 0 generalized
[2026-05-26 19:14:10] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17533990564856557746.kers
Total runtime 4 ms.
[2026-05-26 19:14:11] [INFO ] Implicit Places using invariants in 276 ms returned []
[2026-05-26 19:14:11] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2026-05-26 19:14:11] [INFO ] Invariant cache hit.
[2026-05-26 19:14:11] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 19:14:11] [INFO ] Implicit Places using invariants and state equation in 690 ms returned [21, 120]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 969 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/189 places, 434/498 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1009 ms. Remains : 160/189 places, 434/498 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-03 finished in 1577 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)&&(G((p1||X(X(X(p2)))))||G(p3))))'
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 498/498 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 491
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 491
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 186 transition count 490
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 184 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 184 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 182 transition count 480
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 182 transition count 480
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 180 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 180 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 178 transition count 470
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 178 transition count 470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 176 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 176 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 174 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 174 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 172 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 172 transition count 456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 171 transition count 454
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 171 transition count 454
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 170 transition count 451
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 170 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 169 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 169 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 168 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 168 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 167 transition count 445
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 167 transition count 445
Applied a total of 45 rules in 38 ms. Remains 167 /189 variables (removed 22) and now considering 445/498 (removed 53) transitions.
[2026-05-26 19:14:12] [INFO ] Flow matrix only has 413 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-369495058625799626.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3888293487865050585.kers'
[2026-05-26 19:14:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-369495058625799626.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3888293487865050585.kers]
Normalized transition count is 412 out of 413 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 412 rows 167 cols 1414 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-26 19:14:12] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3888293487865050585.kers
Total runtime 4 ms.
[2026-05-26 19:14:12] [INFO ] Implicit Places using invariants in 283 ms returned []
[2026-05-26 19:14:12] [INFO ] Flow matrix only has 413 transitions (discarded 32 similar events)
[2026-05-26 19:14:12] [INFO ] Invariant cache hit.
[2026-05-26 19:14:12] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-26 19:14:13] [INFO ] Implicit Places using invariants and state equation in 767 ms returned [21, 120]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1056 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/189 places, 445/498 transitions.
Applied a total of 0 rules in 2 ms. Remains 165 /165 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1098 ms. Remains : 165/189 places, 445/498 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)&&(G((p1||X(X(X(p2)))))||G(p3))))'
Stuttering acceptance computed with spot in 636 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-05 finished in 1811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 498/498 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 188 transition count 494
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 185 transition count 494
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 182 transition count 487
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 182 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 182 transition count 486
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 180 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 180 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 178 transition count 476
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 178 transition count 476
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 176 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 176 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 174 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 174 transition count 467
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 173 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 173 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 172 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 172 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 171 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 171 transition count 461
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 41 place count 168 transition count 458
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 47 place count 165 transition count 464
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 53 place count 165 transition count 458
Applied a total of 53 rules in 147 ms. Remains 165 /189 variables (removed 24) and now considering 458/498 (removed 40) transitions.
[2026-05-26 19:14:14] [INFO ] Flow matrix only has 419 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11807706015520870434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14877893913937030331.kers'
[2026-05-26 19:14:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11807706015520870434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14877893913937030331.kers]
Normalized transition count is 418 out of 419 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 418 rows 165 cols 1440 entries
Finished phase 1 with 156 SingleSign rule and 0 generalized
[2026-05-26 19:14:14] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14877893913937030331.kers
Total runtime 4 ms.
[2026-05-26 19:14:14] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-26 19:14:14] [INFO ] Flow matrix only has 419 transitions (discarded 39 similar events)
[2026-05-26 19:14:14] [INFO ] Invariant cache hit.
[2026-05-26 19:14:14] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-26 19:14:15] [INFO ] Implicit Places using invariants and state equation in 720 ms returned [18, 124]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 975 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/189 places, 458/498 transitions.
Applied a total of 0 rules in 20 ms. Remains 163 /163 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1143 ms. Remains : 163/189 places, 458/498 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-07
Product exploration explored 100000 steps with 2 reset in 375 ms.
Product exploration explored 100000 steps with 2 reset in 241 ms.
Computed a total of 25 stabilizing places and 67 stable transitions
Computed a total of 25 stabilizing places and 67 stable transitions
Detected a total of 25/163 stabilizing places and 67/458 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 6 factoid took 65 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (1287 resets) in 253 ms. (157 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (269 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
[2026-05-26 19:14:16] [INFO ] Flow matrix only has 419 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7152096747760976867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16859427983411805141.kers'
[2026-05-26 19:14:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7152096747760976867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16859427983411805141.kers]
Normalized transition count is 418 out of 419 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 418 rows 163 cols 1422 entries
Finished phase 1 with 156 SingleSign rule and 0 generalized
[2026-05-26 19:14:16] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16859427983411805141.kers
Total runtime 2 ms.
[2026-05-26 19:14:16] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 154/208 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/395 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/396 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 165/561 variables, 81/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 38/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/561 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/561 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/579 variables, 10/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/579 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/581 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/581 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/581 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/582 variables, and 232 constraints, problems are : Problem set: 0 solved, 1 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 154/208 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/395 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 165/561 variables, 81/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/561 variables, 38/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/561 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/561 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/579 variables, 10/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/579 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/579 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/581 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/581 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/581 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/582 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1310ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 458/458 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 452
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 163 transition count 456
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 161 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 161 transition count 448
Applied a total of 18 rules in 38 ms. Remains 161 /163 variables (removed 2) and now considering 448/458 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 161/163 places, 448/458 transitions.
RANDOM walk for 40000 steps (1323 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (276 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 783112 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :0 out of 1
Probabilistic random walk after 783112 steps, saw 190378 distinct states, run finished after 3001 ms. (steps per millisecond=260 ) properties seen :0
[2026-05-26 19:14:20] [INFO ] Flow matrix only has 412 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12293590780330980738.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1601841678422654081.kers'
[2026-05-26 19:14:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12293590780330980738.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1601841678422654081.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 412 rows 161 cols 1406 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-26 19:14:20] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1601841678422654081.kers
Total runtime 5 ms.
[2026-05-26 19:14:20] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 154/208 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 185/393 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/394 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/553 variables, 79/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 38/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/571 variables, 10/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/571 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/573 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/573 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/573 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 154/208 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 185/393 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/394 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/553 variables, 79/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 38/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/571 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/571 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/571 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/573 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/573 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/573 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1223ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 448/448 transitions.
Applied a total of 0 rules in 12 ms. Remains 161 /161 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 161/161 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 448/448 transitions.
Applied a total of 0 rules in 12 ms. Remains 161 /161 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2026-05-26 19:14:22] [INFO ] Flow matrix only has 412 transitions (discarded 36 similar events)
[2026-05-26 19:14:22] [INFO ] Invariant cache hit.
[2026-05-26 19:14:22] [INFO ] Implicit Places using invariants in 275 ms returned []
[2026-05-26 19:14:22] [INFO ] Flow matrix only has 412 transitions (discarded 36 similar events)
[2026-05-26 19:14:22] [INFO ] Invariant cache hit.
[2026-05-26 19:14:22] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-26 19:14:22] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
[2026-05-26 19:14:22] [INFO ] Redundant transitions in 16 ms returned []
Running 442 sub problems to find dead transitions.
[2026-05-26 19:14:23] [INFO ] Flow matrix only has 412 transitions (discarded 36 similar events)
[2026-05-26 19:14:23] [INFO ] Invariant cache hit.
[2026-05-26 19:14:23] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (OVERLAPS) 412/573 variables, 161/176 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 61/237 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 239 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (OVERLAPS) 412/573 variables, 161/178 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 442/681 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/573 variables, and 682 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60363ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61371 ms. Remains : 161/161 places, 448/448 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 143 edges and 161 vertex of which 31 / 161 are part of one of the 5 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 147 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 11 place count 134 transition count 292
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 133 transition count 291
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 14 place count 133 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 132 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 131 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 131 transition count 244
Free-agglomeration rule applied 8 times with reduction of 5 identical transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 26 place count 131 transition count 231
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 37 place count 123 transition count 228
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 123 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 123 transition count 227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 122 transition count 226
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 122 transition count 226
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 122 transition count 226
Applied a total of 46 rules in 67 ms. Remains 122 /161 variables (removed 39) and now considering 226/448 (removed 222) transitions.
Running SMT prover for 1 properties.
[2026-05-26 19:15:23] [INFO ] Flow matrix only has 224 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-15822036001461923545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9844733920802867903.kers'
[2026-05-26 19:15:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15822036001461923545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9844733920802867903.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 122 cols 805 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-26 19:15:23] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9844733920802867903.kers
Total runtime 4 ms.
[2026-05-26 19:15:23] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-26 19:15:23] [INFO ] After 126ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 19:15:23] [INFO ] After 155ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 19:15:23] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 19:15:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-26 19:15:23] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 19:15:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
TRAPS : Iteration 1
[2026-05-26 19:15:23] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 19:15:23] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 595 ms.
Knowledge based reduction with 6 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 68204 ms.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 458/458 transitions.
Applied a total of 0 rules in 13 ms. Remains 163 /163 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2026-05-26 19:15:24] [INFO ] Flow matrix only has 419 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3428154478273544657.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14040468848438074699.kers'
[2026-05-26 19:15:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3428154478273544657.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14040468848438074699.kers]
Normalized transition count is 418 out of 419 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 418 rows 163 cols 1422 entries
Finished phase 1 with 156 SingleSign rule and 0 generalized
[2026-05-26 19:15:24] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14040468848438074699.kers
Total runtime 5 ms.
[2026-05-26 19:15:24] [INFO ] Implicit Places using invariants in 439 ms returned []
[2026-05-26 19:15:24] [INFO ] Flow matrix only has 419 transitions (discarded 39 similar events)
[2026-05-26 19:15:24] [INFO ] Invariant cache hit.
[2026-05-26 19:15:25] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-26 19:15:25] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
[2026-05-26 19:15:25] [INFO ] Redundant transitions in 8 ms returned []
Running 451 sub problems to find dead transitions.
[2026-05-26 19:15:25] [INFO ] Flow matrix only has 419 transitions (discarded 39 similar events)
[2026-05-26 19:15:25] [INFO ] Invariant cache hit.
[2026-05-26 19:15:25] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 5 (OVERLAPS) 418/581 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 61/240 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/582 variables, and 240 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 3 (OVERLAPS) 418/581 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 61/240 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 451/691 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 4/695 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/582 variables, and 695 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60458ms problems are : Problem set: 0 solved, 451 unsolved
Search for dead transitions found 0 dead transitions in 60461ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61675 ms. Remains : 163/163 places, 458/458 transitions.
Computed a total of 25 stabilizing places and 67 stable transitions
Computed a total of 25 stabilizing places and 67 stable transitions
Detected a total of 25/163 stabilizing places and 67/458 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 6 factoid took 83 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (1247 resets) in 188 ms. (211 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (293 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2026-05-26 19:16:26] [INFO ] Flow matrix only has 419 transitions (discarded 39 similar events)
[2026-05-26 19:16:26] [INFO ] Invariant cache hit.
[2026-05-26 19:16:26] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 154/208 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/395 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/396 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 165/561 variables, 81/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 38/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/561 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/561 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/579 variables, 10/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/579 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/579 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/581 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/581 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/581 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/582 variables, and 232 constraints, problems are : Problem set: 0 solved, 1 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 154/208 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/395 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 165/561 variables, 81/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/561 variables, 38/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/561 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/561 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/579 variables, 10/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/579 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/579 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/581 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/581 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/581 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/582 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1222ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 458/458 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 452
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 163 transition count 456
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 161 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 161 transition count 448
Applied a total of 18 rules in 43 ms. Remains 161 /163 variables (removed 2) and now considering 448/458 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 161/163 places, 448/458 transitions.
RANDOM walk for 40000 steps (1325 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (268 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 803984 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :0 out of 1
Probabilistic random walk after 803984 steps, saw 192060 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
[2026-05-26 19:16:30] [INFO ] Flow matrix only has 412 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-510043269076076552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1781010790182244155.kers'
[2026-05-26 19:16:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-510043269076076552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1781010790182244155.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 412 rows 161 cols 1406 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-26 19:16:30] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1781010790182244155.kers
Total runtime 5 ms.
[2026-05-26 19:16:30] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 154/208 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 185/393 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/394 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/553 variables, 79/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 38/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/571 variables, 10/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/571 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/573 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/573 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/573 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 154/208 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 185/393 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/394 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/553 variables, 79/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 38/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/571 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/571 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/571 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/573 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/573 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/573 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1195ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 448/448 transitions.
Applied a total of 0 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 161/161 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 448/448 transitions.
Applied a total of 0 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2026-05-26 19:16:31] [INFO ] Flow matrix only has 412 transitions (discarded 36 similar events)
[2026-05-26 19:16:31] [INFO ] Invariant cache hit.
[2026-05-26 19:16:32] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-26 19:16:32] [INFO ] Flow matrix only has 412 transitions (discarded 36 similar events)
[2026-05-26 19:16:32] [INFO ] Invariant cache hit.
[2026-05-26 19:16:32] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-26 19:16:32] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
[2026-05-26 19:16:32] [INFO ] Redundant transitions in 7 ms returned []
Running 442 sub problems to find dead transitions.
[2026-05-26 19:16:32] [INFO ] Flow matrix only has 412 transitions (discarded 36 similar events)
[2026-05-26 19:16:32] [INFO ] Invariant cache hit.
[2026-05-26 19:16:32] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (OVERLAPS) 412/573 variables, 161/176 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 61/237 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 239 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (OVERLAPS) 412/573 variables, 161/178 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 442/681 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/573 variables, and 682 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60250ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61224 ms. Remains : 161/161 places, 448/448 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 143 edges and 161 vertex of which 31 / 161 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 147 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 134 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 11 place count 134 transition count 292
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 133 transition count 291
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 14 place count 133 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 132 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 131 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 131 transition count 244
Free-agglomeration rule applied 8 times with reduction of 5 identical transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 26 place count 131 transition count 231
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 37 place count 123 transition count 228
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 123 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 123 transition count 227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 122 transition count 226
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 122 transition count 226
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 122 transition count 226
Applied a total of 46 rules in 32 ms. Remains 122 /161 variables (removed 39) and now considering 226/448 (removed 222) transitions.
Running SMT prover for 1 properties.
[2026-05-26 19:17:33] [INFO ] Flow matrix only has 224 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-5052083302196465687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11062782569638979770.kers'
[2026-05-26 19:17:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5052083302196465687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11062782569638979770.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 122 cols 805 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-26 19:17:33] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11062782569638979770.kers
Total runtime 3 ms.
[2026-05-26 19:17:33] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-26 19:17:33] [INFO ] After 131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 19:17:33] [INFO ] After 161ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 19:17:33] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 19:17:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-26 19:17:33] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 19:17:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
TRAPS : Iteration 1
[2026-05-26 19:17:33] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 19:17:33] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 557 ms.
Knowledge based reduction with 6 factoid took 88 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 67779 ms.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 12 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 202 ms.
Built C files in :
/tmp/ltsmin11336076147054244571
[2026-05-26 19:17:34] [INFO ] Computing symmetric may disable matrix : 458 transitions.
[2026-05-26 19:17:34] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 19:17:34] [INFO ] Computing symmetric may enable matrix : 458 transitions.
[2026-05-26 19:17:34] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 19:17:34] [INFO ] Computing Do-Not-Accords matrix : 458 transitions.
[2026-05-26 19:17:34] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 19:17:34] [INFO ] Built C files in 210ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11336076147054244571
Running compilation step : cd /tmp/ltsmin11336076147054244571;'/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 1877 ms.
Running link step : cd /tmp/ltsmin11336076147054244571;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin11336076147054244571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15647689055926783431.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 458/458 transitions.
Applied a total of 0 rules in 7 ms. Remains 163 /163 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2026-05-26 19:17:49] [INFO ] Flow matrix only has 419 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18256786957090727368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16257938310616728012.kers'
[2026-05-26 19:17:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18256786957090727368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16257938310616728012.kers]
Normalized transition count is 418 out of 419 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 418 rows 163 cols 1422 entries
Finished phase 1 with 156 SingleSign rule and 0 generalized
[2026-05-26 19:17:49] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16257938310616728012.kers
Total runtime 2 ms.
[2026-05-26 19:17:49] [INFO ] Implicit Places using invariants in 183 ms returned []
[2026-05-26 19:17:49] [INFO ] Flow matrix only has 419 transitions (discarded 39 similar events)
[2026-05-26 19:17:49] [INFO ] Invariant cache hit.
[2026-05-26 19:17:49] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-26 19:17:50] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2026-05-26 19:17:50] [INFO ] Redundant transitions in 7 ms returned []
Running 451 sub problems to find dead transitions.
[2026-05-26 19:17:50] [INFO ] Flow matrix only has 419 transitions (discarded 39 similar events)
[2026-05-26 19:17:50] [INFO ] Invariant cache hit.
[2026-05-26 19:17:50] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 5 (OVERLAPS) 418/581 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 61/240 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/582 variables, and 240 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 451 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 3 (OVERLAPS) 418/581 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 61/240 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 451/691 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/582 variables, and 692 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60261ms problems are : Problem set: 0 solved, 451 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61061 ms. Remains : 163/163 places, 458/458 transitions.
Built C files in :
/tmp/ltsmin17068077065775031263
[2026-05-26 19:18:50] [INFO ] Computing symmetric may disable matrix : 458 transitions.
[2026-05-26 19:18:50] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 19:18:50] [INFO ] Computing symmetric may enable matrix : 458 transitions.
[2026-05-26 19:18:50] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 19:18:50] [INFO ] Computing Do-Not-Accords matrix : 458 transitions.
[2026-05-26 19:18:50] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 19:18:50] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17068077065775031263
Running compilation step : cd /tmp/ltsmin17068077065775031263;'/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 2065 ms.
Running link step : cd /tmp/ltsmin17068077065775031263;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin17068077065775031263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6002050473763612345.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 19:19:05] [INFO ] Flatten gal took : 35 ms
[2026-05-26 19:19:05] [INFO ] Flatten gal took : 35 ms
[2026-05-26 19:19:05] [INFO ] Time to serialize gal into /tmp/LTL3030172236146004955.gal : 10 ms
[2026-05-26 19:19:05] [INFO ] Time to serialize properties into /tmp/LTL12232542519475184029.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3030172236146004955.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14018435095065407660.hoa' '-atoms' '/tmp/LTL12232542519475184029.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12232542519475184029.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14018435095065407660.hoa
Detected timeout of ITS tools.
[2026-05-26 19:19:20] [INFO ] Flatten gal took : 28 ms
[2026-05-26 19:19:20] [INFO ] Flatten gal took : 27 ms
[2026-05-26 19:19:20] [INFO ] Time to serialize gal into /tmp/LTL5000117523441862981.gal : 7 ms
[2026-05-26 19:19:20] [INFO ] Time to serialize properties into /tmp/LTL11553939913817210538.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5000117523441862981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11553939913817210538.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((p10!=1)||(p128!=1))"))&&(F(G("((p81!=1)||(p88!=1))"))))))
Formula 0 simplified : F(G!"((p10!=1)||(p128!=1))" | GF!"((p81!=1)||(p88!=1))")
Detected timeout of ITS tools.
[2026-05-26 19:19:36] [INFO ] Flatten gal took : 54 ms
[2026-05-26 19:19:36] [INFO ] Applying decomposition
[2026-05-26 19:19:36] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10875755146886495674.txt' '-o' '/tmp/graph10875755146886495674.bin' '-w' '/tmp/graph10875755146886495674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10875755146886495674.bin' '-l' '-1' '-v' '-w' '/tmp/graph10875755146886495674.weights' '-q' '0' '-e' '0.001'
[2026-05-26 19:19:36] [INFO ] Decomposing Gal with order
[2026-05-26 19:19:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 19:19:36] [INFO ] Removed a total of 700 redundant transitions.
[2026-05-26 19:19:36] [INFO ] Flatten gal took : 217 ms
[2026-05-26 19:19:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 32 ms.
[2026-05-26 19:19:36] [INFO ] Time to serialize gal into /tmp/LTL1477891283491726260.gal : 13 ms
[2026-05-26 19:19:36] [INFO ] Time to serialize properties into /tmp/LTL139861455756825022.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1477891283491726260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL139861455756825022.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G((F("((i2.u3.p10!=1)||(i0.u36.p128!=1))"))&&(F(G("((i5.u32.p81!=1)||(i5.u23.p88!=1))"))))))
Formula 0 simplified : F(G!"((i2.u3.p10!=1)||(i0.u36.p128!=1))" | GF!"((i5.u32.p81!=1)||(i5.u23.p88!=1))")
Detected timeout of ITS tools.
Treatment of property FireWire-PT-13-LTLFireability-07 finished in 337665 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 G(!p1)) U X((p2||G(p1)))))'
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 489
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 185 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 182 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 182 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 179 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 179 transition count 473
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 176 transition count 466
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 176 transition count 466
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 173 transition count 459
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 173 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 171 transition count 454
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 171 transition count 454
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 169 transition count 450
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 169 transition count 450
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 167 transition count 445
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 167 transition count 445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 166 transition count 443
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 166 transition count 443
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 165 transition count 440
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 165 transition count 440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 164 transition count 438
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 164 transition count 438
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 163 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 163 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 162 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 162 transition count 434
Applied a total of 55 rules in 24 ms. Remains 162 /189 variables (removed 27) and now considering 434/498 (removed 64) transitions.
[2026-05-26 19:19:51] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16319613527078495064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8453097686432639444.kers'
[2026-05-26 19:19:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16319613527078495064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8453097686432639444.kers]
Normalized transition count is 401 out of 402 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 162 cols 1372 entries
Finished phase 1 with 153 SingleSign rule and 0 generalized
[2026-05-26 19:19:51] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8453097686432639444.kers
Total runtime 4 ms.
[2026-05-26 19:19:52] [INFO ] Implicit Places using invariants in 285 ms returned []
[2026-05-26 19:19:52] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2026-05-26 19:19:52] [INFO ] Invariant cache hit.
[2026-05-26 19:19:52] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 19:19:52] [INFO ] Implicit Places using invariants and state equation in 601 ms returned [21, 120]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 889 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/189 places, 434/498 transitions.
Applied a total of 0 rules in 3 ms. Remains 160 /160 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 916 ms. Remains : 160/189 places, 434/498 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 G(!p1)) U X((G(p1)||p2))))'
Stuttering acceptance computed with spot in 383 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), p1, false, (NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-13-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-08 finished in 1366 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 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 498/498 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 188 transition count 494
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 185 transition count 494
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 181 transition count 485
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 181 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 181 transition count 484
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 178 transition count 476
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 178 transition count 476
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 175 transition count 469
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 175 transition count 469
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 172 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 172 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 169 transition count 455
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 169 transition count 455
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 167 transition count 450
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 167 transition count 450
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 165 transition count 446
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 165 transition count 446
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 163 transition count 441
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 163 transition count 441
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 162 transition count 439
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 162 transition count 439
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 161 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 161 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 160 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 160 transition count 434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 159 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 159 transition count 432
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 158 transition count 430
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 158 transition count 430
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 67 place count 155 transition count 427
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 73 place count 152 transition count 433
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 79 place count 152 transition count 427
Applied a total of 79 rules in 80 ms. Remains 152 /189 variables (removed 37) and now considering 427/498 (removed 71) transitions.
[2026-05-26 19:19:53] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-109069720053098264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17709101587537020693.kers'
[2026-05-26 19:19:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-109069720053098264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17709101587537020693.kers]
Normalized transition count is 387 out of 388 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 387 rows 152 cols 1329 entries
Finished phase 1 with 143 SingleSign rule and 0 generalized
[2026-05-26 19:19:53] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17709101587537020693.kers
Total runtime 3 ms.
[2026-05-26 19:19:53] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-26 19:19:53] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2026-05-26 19:19:53] [INFO ] Invariant cache hit.
[2026-05-26 19:19:53] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-26 19:19:54] [INFO ] Implicit Places using invariants and state equation in 634 ms returned [18, 111]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 862 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/189 places, 427/498 transitions.
Applied a total of 0 rules in 12 ms. Remains 150 /150 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 954 ms. Remains : 150/189 places, 427/498 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 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-09 finished in 1091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0) U (p1 U X((!p2&&F(p2)))))))'
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 498/498 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 492
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 492
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 186 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 184 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 184 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 182 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 182 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 180 transition count 476
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 180 transition count 476
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 178 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 178 transition count 472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 177 transition count 469
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 177 transition count 469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 176 transition count 467
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 176 transition count 467
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 175 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 175 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 174 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 174 transition count 462
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 173 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 173 transition count 459
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 172 transition count 457
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 172 transition count 457
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 171 transition count 455
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 171 transition count 455
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 170 transition count 453
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 170 transition count 453
Applied a total of 39 rules in 35 ms. Remains 170 /189 variables (removed 19) and now considering 453/498 (removed 45) transitions.
[2026-05-26 19:19:54] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12683181184149596267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3817562672564048570.kers'
[2026-05-26 19:19:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12683181184149596267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3817562672564048570.kers]
Normalized transition count is 420 out of 421 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 420 rows 170 cols 1442 entries
Finished phase 1 with 161 SingleSign rule and 0 generalized
[2026-05-26 19:19:54] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3817562672564048570.kers
Total runtime 3 ms.
[2026-05-26 19:19:54] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-26 19:19:54] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
[2026-05-26 19:19:54] [INFO ] Invariant cache hit.
[2026-05-26 19:19:54] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-26 19:19:55] [INFO ] Implicit Places using invariants and state equation in 761 ms returned [21, 128]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1033 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/189 places, 453/498 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1071 ms. Remains : 168/189 places, 453/498 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0) U (p1 U X((!p2&&F(p2)))))))'
Stuttering acceptance computed with spot in 389 ms :[true, true, true, p0, (NOT p2), (AND p0 (NOT p2)), p0]
Running random walk in product with property : FireWire-PT-13-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-10 finished in 1521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((F(p1) U p2))))'
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 489
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 185 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 182 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 182 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 179 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 179 transition count 473
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 176 transition count 466
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 176 transition count 466
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 173 transition count 459
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 173 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 171 transition count 454
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 171 transition count 454
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 169 transition count 450
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 169 transition count 450
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 167 transition count 445
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 167 transition count 445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 166 transition count 443
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 166 transition count 443
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 165 transition count 440
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 165 transition count 440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 164 transition count 438
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 164 transition count 438
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 163 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 163 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 162 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 162 transition count 434
Applied a total of 55 rules in 32 ms. Remains 162 /189 variables (removed 27) and now considering 434/498 (removed 64) transitions.
[2026-05-26 19:19:55] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14115652927873215158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12776228649251996266.kers'
[2026-05-26 19:19:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14115652927873215158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12776228649251996266.kers]
Normalized transition count is 401 out of 402 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 162 cols 1372 entries
Finished phase 1 with 153 SingleSign rule and 0 generalized
[2026-05-26 19:19:55] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12776228649251996266.kers
Total runtime 5 ms.
[2026-05-26 19:19:56] [INFO ] Implicit Places using invariants in 252 ms returned []
[2026-05-26 19:19:56] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2026-05-26 19:19:56] [INFO ] Invariant cache hit.
[2026-05-26 19:19:56] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 19:19:56] [INFO ] Implicit Places using invariants and state equation in 693 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 950 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/189 places, 434/498 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 985 ms. Remains : 161/189 places, 434/498 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((F(p1) U p2))))'
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 429 ms.
Product exploration explored 100000 steps with 50000 reset in 458 ms.
Computed a total of 20 stabilizing places and 43 stable transitions
Computed a total of 20 stabilizing places and 43 stable transitions
Detected a total of 20/161 stabilizing places and 43/434 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 16 factoid took 22 ms. Proved property starting from automaton with 5 states, 11 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 32 ms.
FORMULA FireWire-PT-13-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-13-LTLFireability-11 finished in 2203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 498/498 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 188 transition count 494
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 185 transition count 494
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 182 transition count 487
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 182 transition count 487
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 179 transition count 479
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 179 transition count 479
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 176 transition count 472
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 176 transition count 472
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 173 transition count 465
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 173 transition count 465
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 170 transition count 458
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 170 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 168 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 168 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 166 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 166 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 164 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 164 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 163 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 163 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 162 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 162 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 161 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 161 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 160 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 160 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 159 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 159 transition count 433
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 156 transition count 430
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 0 with 6 rules applied. Total rules applied 70 place count 153 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 153 transition count 430
Applied a total of 76 rules in 60 ms. Remains 153 /189 variables (removed 36) and now considering 430/498 (removed 68) transitions.
[2026-05-26 19:19:57] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15988651171634877301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12403411531832995377.kers'
[2026-05-26 19:19:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15988651171634877301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12403411531832995377.kers]
Normalized transition count is 390 out of 391 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 390 rows 153 cols 1341 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-26 19:19:58] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12403411531832995377.kers
Total runtime 5 ms.
[2026-05-26 19:19:58] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-26 19:19:58] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2026-05-26 19:19:58] [INFO ] Invariant cache hit.
[2026-05-26 19:19:58] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-26 19:19:58] [INFO ] Implicit Places using invariants and state equation in 589 ms returned [18, 112]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 757 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/189 places, 430/498 transitions.
Applied a total of 0 rules in 23 ms. Remains 151 /151 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 840 ms. Remains : 151/189 places, 430/498 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 71 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-12
Product exploration explored 100000 steps with 1 reset in 87 ms.
Product exploration explored 100000 steps with 1 reset in 83 ms.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 35479 steps (1164 resets) in 172 ms. (205 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Knowledge-based reduction took 270 ms.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 430/430 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2026-05-26 19:19:59] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18399037286689112967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8791298958184008774.kers'
[2026-05-26 19:19:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18399037286689112967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8791298958184008774.kers]
Normalized transition count is 390 out of 391 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 390 rows 151 cols 1323 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-26 19:19:59] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8791298958184008774.kers
Total runtime 3 ms.
[2026-05-26 19:19:59] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-26 19:19:59] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2026-05-26 19:19:59] [INFO ] Invariant cache hit.
[2026-05-26 19:19:59] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-26 19:19:59] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2026-05-26 19:20:00] [INFO ] Redundant transitions in 7 ms returned []
Running 423 sub problems to find dead transitions.
[2026-05-26 19:20:00] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2026-05-26 19:20:00] [INFO ] Invariant cache hit.
[2026-05-26 19:20:00] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 390/541 variables, 151/167 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 56/223 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/542 variables, and 225 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 390/541 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 423/648 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/542 variables, and 649 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60272ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60930 ms. Remains : 151/151 places, 430/430 transitions.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (1297 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (683 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2253 steps, run visited all 1 properties in 14 ms. (steps per millisecond=160 )
Probabilistic random walk after 2253 steps, saw 1231 distinct states, run finished after 22 ms. (steps per millisecond=102 ) properties seen :1
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Knowledge-based reduction took 342 ms.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8 reset in 95 ms.
Product exploration explored 100000 steps with 3 reset in 89 ms.
Built C files in :
/tmp/ltsmin10915494947787023537
[2026-05-26 19:21:00] [INFO ] Computing symmetric may disable matrix : 430 transitions.
[2026-05-26 19:21:00] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 19:21:00] [INFO ] Computing symmetric may enable matrix : 430 transitions.
[2026-05-26 19:21:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 19:21:01] [INFO ] Computing Do-Not-Accords matrix : 430 transitions.
[2026-05-26 19:21:01] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 19:21:01] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10915494947787023537
Running compilation step : cd /tmp/ltsmin10915494947787023537;'/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 1943 ms.
Running link step : cd /tmp/ltsmin10915494947787023537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin10915494947787023537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12901201072082223571.hoa' '--buchi-type=spotba'
LTSmin run took 1601 ms.
FORMULA FireWire-PT-13-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-13-LTLFireability-12 finished in 66750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(((p1 U G(p2))||G(p3)))))))'
Support contains 8 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 498/498 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 189 transition count 496
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 187 transition count 496
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 183 transition count 487
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 183 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 183 transition count 486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 180 transition count 478
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 180 transition count 478
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 177 transition count 471
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 177 transition count 471
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 174 transition count 464
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 174 transition count 464
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 171 transition count 457
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 171 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 169 transition count 452
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 169 transition count 452
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 168 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 168 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 167 transition count 448
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 167 transition count 448
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 51 place count 164 transition count 445
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 57 place count 161 transition count 451
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 63 place count 161 transition count 445
Applied a total of 63 rules in 59 ms. Remains 161 /189 variables (removed 28) and now considering 445/498 (removed 53) transitions.
[2026-05-26 19:21:04] [INFO ] Flow matrix only has 406 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7031651114235820740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6485484606988543062.kers'
[2026-05-26 19:21:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7031651114235820740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6485484606988543062.kers]
Normalized transition count is 405 out of 406 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 405 rows 161 cols 1403 entries
Finished phase 1 with 152 SingleSign rule and 0 generalized
[2026-05-26 19:21:04] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6485484606988543062.kers
Total runtime 2 ms.
[2026-05-26 19:21:04] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-26 19:21:04] [INFO ] Flow matrix only has 406 transitions (discarded 39 similar events)
[2026-05-26 19:21:04] [INFO ] Invariant cache hit.
[2026-05-26 19:21:05] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-26 19:21:05] [INFO ] Implicit Places using invariants and state equation in 821 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1040 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/189 places, 445/498 transitions.
Applied a total of 0 rules in 12 ms. Remains 160 /160 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1111 ms. Remains : 160/189 places, 445/498 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((X(((p0 U G(p1))||G(p2)))||p3))))'
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-13
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-13 finished in 1540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0) U ((G(F(!p1))||(F(!p1)&&X(F(!p2)))) U p1))))))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 489
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 185 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 182 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 182 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 179 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 179 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 177 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 177 transition count 468
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 175 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 175 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 173 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 173 transition count 458
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 172 transition count 456
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 172 transition count 456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 171 transition count 453
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 171 transition count 453
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 170 transition count 451
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 170 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 169 transition count 448
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 169 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 168 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 168 transition count 446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 167 transition count 444
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 167 transition count 444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 166 transition count 442
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 166 transition count 442
Applied a total of 47 rules in 29 ms. Remains 166 /189 variables (removed 23) and now considering 442/498 (removed 56) transitions.
[2026-05-26 19:21:06] [INFO ] Flow matrix only has 410 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6969882428583955860.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9358778002637156867.kers'
[2026-05-26 19:21:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6969882428583955860.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9358778002637156867.kers]
Normalized transition count is 409 out of 410 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 409 rows 166 cols 1404 entries
Finished phase 1 with 157 SingleSign rule and 0 generalized
[2026-05-26 19:21:06] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9358778002637156867.kers
Total runtime 3 ms.
[2026-05-26 19:21:06] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-26 19:21:06] [INFO ] Flow matrix only has 410 transitions (discarded 32 similar events)
[2026-05-26 19:21:06] [INFO ] Invariant cache hit.
[2026-05-26 19:21:06] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 19:21:07] [INFO ] Implicit Places using invariants and state equation in 772 ms returned [21, 122]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1046 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/189 places, 442/498 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1077 ms. Remains : 164/189 places, 442/498 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0) U ((G(F(!p1))||(F(!p1)&&X(F(!p2)))) U p1))))))'
Stuttering acceptance computed with spot in 442 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 p1), (AND p2 p1 (NOT p0)), (AND p1 p2)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-14 finished in 1608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Spot run failed in 170 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 19:21:08] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13421084988631760651
[2026-05-26 19:21:08] [INFO ] Computing symmetric may disable matrix : 498 transitions.
[2026-05-26 19:21:08] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 19:21:08] [INFO ] Computing symmetric may enable matrix : 498 transitions.
[2026-05-26 19:21:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 19:21:08] [INFO ] Applying decomposition
[2026-05-26 19:21:08] [INFO ] Flatten gal took : 38 ms
[2026-05-26 19:21:08] [INFO ] Computing Do-Not-Accords matrix : 498 transitions.
[2026-05-26 19:21:08] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 19:21:08] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13421084988631760651
Running compilation step : cd /tmp/ltsmin13421084988631760651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14913661941676553287.txt' '-o' '/tmp/graph14913661941676553287.bin' '-w' '/tmp/graph14913661941676553287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14913661941676553287.bin' '-l' '-1' '-v' '-w' '/tmp/graph14913661941676553287.weights' '-q' '0' '-e' '0.001'
[2026-05-26 19:21:08] [INFO ] Decomposing Gal with order
[2026-05-26 19:21:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 19:21:08] [INFO ] Removed a total of 808 redundant transitions.
[2026-05-26 19:21:08] [INFO ] Flatten gal took : 113 ms
[2026-05-26 19:21:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 199 labels/synchronizations in 39 ms.
[2026-05-26 19:21:08] [INFO ] Time to serialize gal into /tmp/LTLFireability6757835727956462252.gal : 8 ms
[2026-05-26 19:21:08] [INFO ] Time to serialize properties into /tmp/LTLFireability14760305826347732373.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6757835727956462252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14760305826347732373.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("((i1.u3.p10!=1)||(i5.i1.u41.p128!=1))"))&&(F(G("((i4.i0.u23.p81!=1)||(i4.i1.u25.p88!=1))"))))))
Formula 0 simplified : F(G!"((i1.u3.p10!=1)||(i5.i1.u41.p128!=1))" | GF!"((i4.i0.u23.p81!=1)||(i4.i1.u25.p88!=1))")
Compilation finished in 2091 ms.
Running link step : cd /tmp/ltsmin13421084988631760651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13421084988631760651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t54, t56, t62, t64, t69, t74, t80, t82, t92, t96, t97, t98, t99, t102, t104, t145, ...1436
Computing Next relation with stutter on 1.3997e+06 deadlock states
5 unique states visited
4 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
41082 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,410.914,2739696,1,0,2.59031e+06,8805,2288,2.12668e+07,278,54073,471068
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FireWire-PT-13-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 990054 ms.

BK_STOP 1779823682356

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

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