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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 8.6K Mar 7 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 7 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 7 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 7 05:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Mar 7 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Mar 7 05:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:08 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 84K 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-16-LTLFireability-00
FORMULA_NAME FireWire-PT-16-LTLFireability-01
FORMULA_NAME FireWire-PT-16-LTLFireability-02
FORMULA_NAME FireWire-PT-16-LTLFireability-03
FORMULA_NAME FireWire-PT-16-LTLFireability-04
FORMULA_NAME FireWire-PT-16-LTLFireability-05
FORMULA_NAME FireWire-PT-16-LTLFireability-06
FORMULA_NAME FireWire-PT-16-LTLFireability-07
FORMULA_NAME FireWire-PT-16-LTLFireability-08
FORMULA_NAME FireWire-PT-16-LTLFireability-09
FORMULA_NAME FireWire-PT-16-LTLFireability-10
FORMULA_NAME FireWire-PT-16-LTLFireability-11
FORMULA_NAME FireWire-PT-16-LTLFireability-12
FORMULA_NAME FireWire-PT-16-LTLFireability-13
FORMULA_NAME FireWire-PT-16-LTLFireability-14
FORMULA_NAME FireWire-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779833375957

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 22:09:38] [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 22:09:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 22:09:38] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2026-05-26 22:09:38] [INFO ] Transformed 254 places.
[2026-05-26 22:09:38] [INFO ] Transformed 368 transitions.
[2026-05-26 22:09:38] [INFO ] Found NUPN structural information;
[2026-05-26 22:09:38] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA FireWire-PT-16-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 368/368 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 251 transition count 368
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 49 place count 205 transition count 322
Iterating global reduction 1 with 46 rules applied. Total rules applied 95 place count 205 transition count 322
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 106 place count 194 transition count 310
Iterating global reduction 1 with 11 rules applied. Total rules applied 117 place count 194 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 193 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 193 transition count 309
Applied a total of 119 rules in 80 ms. Remains 193 /254 variables (removed 61) and now considering 309/368 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16178265702764165597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15616173858157574377.kers'
[2026-05-26 22:09:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16178265702764165597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15616173858157574377.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 193 cols 908 entries
Finished phase 1 with 189 SingleSign rule and 0 generalized
[2026-05-26 22:09:39] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15616173858157574377.kers
Total runtime 3 ms.
[2026-05-26 22:09:39] [INFO ] Implicit Places using invariants in 605 ms returned []
[2026-05-26 22:09:39] [INFO ] Invariant cache hit.
[2026-05-26 22:09:40] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2026-05-26 22:09:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Problem TDEAD166 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD291 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 8/12 constraints. Problems are: Problem set: 11 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/13 constraints. Problems are: Problem set: 11 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/13 constraints. Problems are: Problem set: 11 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 309/502 variables, 193/206 constraints. Problems are: Problem set: 11 solved, 297 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 5/211 constraints. Problems are: Problem set: 11 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/502 variables, and 211 constraints, problems are : Problem set: 11 solved, 297 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 14/18 constraints. Problems are: Problem set: 11 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/19 constraints. Problems are: Problem set: 11 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/19 constraints. Problems are: Problem set: 11 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 309/502 variables, 193/212 constraints. Problems are: Problem set: 11 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 297/509 constraints. Problems are: Problem set: 11 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 1/510 constraints. Problems are: Problem set: 11 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/502 variables, and 510 constraints, problems are : Problem set: 11 solved, 297 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 297/308 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60312ms problems are : Problem set: 11 solved, 297 unsolved
Search for dead transitions found 11 dead transitions in 60345ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 193/254 places, 298/368 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62033 ms. Remains : 193/254 places, 298/368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 298/298 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5456052576037340965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3198371442422971734.kers'
[2026-05-26 22:10:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5456052576037340965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3198371442422971734.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 298 rows 193 cols 864 entries
Finished phase 1 with 189 SingleSign rule and 0 generalized
[2026-05-26 22:10:41] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3198371442422971734.kers
Total runtime 2 ms.
[2026-05-26 22:10:41] [INFO ] Implicit Places using invariants in 206 ms returned []
[2026-05-26 22:10:41] [INFO ] Invariant cache hit.
[2026-05-26 22:10:41] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2026-05-26 22:10:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD279 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 7/11 constraints. Problems are: Problem set: 19 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 2/13 constraints. Problems are: Problem set: 19 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 3/16 constraints. Problems are: Problem set: 19 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/16 constraints. Problems are: Problem set: 19 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 298/491 variables, 193/209 constraints. Problems are: Problem set: 19 solved, 278 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 491/491 variables, and 213 constraints, problems are : Problem set: 19 solved, 278 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 4/4 constraints. Problems are: Problem set: 19 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 16/20 constraints. Problems are: Problem set: 19 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/20 constraints. Problems are: Problem set: 19 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 298/491 variables, 193/213 constraints. Problems are: Problem set: 19 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 278/491 constraints. Problems are: Problem set: 19 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 1/492 constraints. Problems are: Problem set: 19 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/491 variables, and 493 constraints, problems are : Problem set: 19 solved, 278 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 278/297 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60151ms problems are : Problem set: 19 solved, 278 unsolved
Search for dead transitions found 19 dead transitions in 60156ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 193/193 places, 279/298 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60832 ms. Remains : 193/193 places, 279/298 transitions.
Support contains 41 out of 193 places after structural reductions.
[2026-05-26 22:11:42] [INFO ] Flatten gal took : 104 ms
[2026-05-26 22:11:42] [INFO ] Flatten gal took : 52 ms
[2026-05-26 22:11:42] [INFO ] Input system was already deterministic with 279 transitions.
Support contains 37 out of 193 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (9 resets) in 2222 ms. (17 steps per ms) remains 21/30 properties
BEST_FIRST walk for 4001 steps (10 resets) in 96 ms. (41 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4002 steps (11 resets) in 54 ms. (72 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4001 steps (10 resets) in 53 ms. (74 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (10 resets) in 89 ms. (44 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (10 resets) in 56 ms. (70 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (9 resets) in 98 ms. (40 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (10 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (10 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (9 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (11 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (11 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (10 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (9 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (9 resets) in 28 ms. (137 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (9 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (10 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10871501669300773475.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13305457130807500390.kers'
[2026-05-26 22:11:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10871501669300773475.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13305457130807500390.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 193 cols 788 entries
Finished phase 1 with 189 SingleSign rule and 0 generalized
[2026-05-26 22:11:43] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13305457130807500390.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 132/159 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 4/7 constraints. Problems are: Problem set: 2 solved, 17 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 13/172 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 257/429 variables, 172/182 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 0/182 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 10/439 variables, 4/186 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/186 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 12/451 variables, 6/192 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/192 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 8/459 variables, 4/196 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 0/196 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 9/468 variables, 4/200 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/468 variables, 0/200 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 4/472 variables, 3/203 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 0/203 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 0/472 variables, 0/203 constraints. Problems are: Problem set: 4 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 203 constraints, problems are : Problem set: 4 solved, 15 unsolved in 4849 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 139/159 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 6/9 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 13/172 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 257/429 variables, 172/182 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 15/197 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/197 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 10/439 variables, 4/201 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/201 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 12/451 variables, 6/207 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/207 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 8/459 variables, 4/211 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 0/211 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 9/468 variables, 4/215 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 0/215 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 4/472 variables, 3/218 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 218 constraints, problems are : Problem set: 4 solved, 15 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 15/19 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9879ms problems are : Problem set: 4 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 279/279 transitions.
Graph (trivial) has 131 edges and 193 vertex of which 14 / 193 are part of one of the 2 SCC in 11 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 181 transition count 229
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 72 place count 147 transition count 226
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 79 place count 146 transition count 220
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 85 place count 140 transition count 220
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 85 place count 140 transition count 211
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 103 place count 131 transition count 211
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 107 place count 127 transition count 198
Iterating global reduction 4 with 4 rules applied. Total rules applied 111 place count 127 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 112 place count 127 transition count 197
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 112 place count 127 transition count 194
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 118 place count 124 transition count 194
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 150 place count 108 transition count 178
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 170 place count 98 transition count 204
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 171 place count 98 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 176 place count 98 transition count 198
Free-agglomeration rule applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 188 place count 98 transition count 186
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 213 place count 86 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 216 place count 86 transition count 170
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 219 place count 86 transition count 170
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 220 place count 86 transition count 170
Applied a total of 220 rules in 180 ms. Remains 86 /193 variables (removed 107) and now considering 170/279 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 86/193 places, 170/279 transitions.
RANDOM walk for 40000 steps (25 resets) in 1073 ms. (37 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (76 resets) in 54 ms. (72 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (19 resets) in 67 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (72 resets) in 66 ms. (59 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (17 resets) in 71 ms. (55 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (25 resets) in 67 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (19 resets) in 70 ms. (56 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (19 resets) in 104 ms. (38 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (24 resets) in 66 ms. (59 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (43 resets) in 67 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (43 resets) in 51 ms. (76 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (43 resets) in 50 ms. (78 steps per ms) remains 12/15 properties
BEST_FIRST walk for 4000 steps (21 resets) in 55 ms. (71 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4001 steps (30 resets) in 51 ms. (76 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000 steps (37 resets) in 50 ms. (78 steps per ms) remains 12/12 properties
[2026-05-26 22:11:54] [INFO ] Flow matrix only has 169 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17727590496993819647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5035196766933866856.kers'
[2026-05-26 22:11:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17727590496993819647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5035196766933866856.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 86 cols 556 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-26 22:11:54] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5035196766933866856.kers
Total runtime 2 ms.
[2026-05-26 22:11:54] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 63/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 4/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 169/253 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 21/112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 2/255 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 114 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1267 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 86/86 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 63/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 4/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 169/253 variables, 84/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 21/112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 2/255 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/255 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 126 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1932 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 86/86 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3218ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 4772 ms.
Support contains 17 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 170/170 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 85 transition count 169
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 2 with 2 rules applied. Total rules applied 4 place count 84 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 83 transition count 173
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 83 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 12 place count 83 transition count 167
Applied a total of 12 rules in 29 ms. Remains 83 /86 variables (removed 3) and now considering 167/170 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 83/86 places, 167/170 transitions.
RANDOM walk for 40000 steps (17 resets) in 268 ms. (148 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (804 resets) in 121 ms. (327 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40000 steps (30 resets) in 213 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (22 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (26 resets) in 193 ms. (206 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (53 resets) in 190 ms. (209 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (33 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (32 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (16 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (32 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (45 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
[2026-05-26 22:12:02] [INFO ] Flow matrix only has 163 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14297220224575520932.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7750013880860454422.kers'
[2026-05-26 22:12:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14297220224575520932.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7750013880860454422.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 163 rows 83 cols 546 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-26 22:12:02] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7750013880860454422.kers
Total runtime 1 ms.
[2026-05-26 22:12:02] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 63/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 4/81 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 163/244 variables, 81/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 19/106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2/246 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/246 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 108 constraints, problems are : Problem set: 0 solved, 10 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 63/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 4/81 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 163/244 variables, 81/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 19/106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 2/246 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/246 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 119 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1658 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2569ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 4 properties in 2401 ms.
Support contains 9 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 167/167 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 166
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 82 transition count 165
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 81 transition count 165
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 2 with 6 rules applied. Total rules applied 10 place count 78 transition count 162
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 78 transition count 161
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 76 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 76 transition count 166
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 76 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 74 transition count 164
Applied a total of 25 rules in 30 ms. Remains 74 /83 variables (removed 9) and now considering 164/167 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 74/83 places, 164/167 transitions.
RANDOM walk for 40000 steps (55 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (917 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (37 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (24 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (44 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (19 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (14 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 8165 steps, run visited all 6 properties in 66 ms. (steps per millisecond=123 )
Probabilistic random walk after 8165 steps, saw 2562 distinct states, run finished after 72 ms. (steps per millisecond=113 ) properties seen :6
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA FireWire-PT-16-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 26 stabilizing places and 28 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))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 279/279 transitions.
Graph (trivial) has 158 edges and 193 vertex of which 18 / 193 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 177 transition count 223
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 82 place count 138 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 137 transition count 220
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 83 place count 137 transition count 208
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 107 place count 125 transition count 208
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 115 place count 117 transition count 191
Iterating global reduction 3 with 8 rules applied. Total rules applied 123 place count 117 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 117 transition count 190
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 124 place count 117 transition count 185
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 134 place count 112 transition count 185
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 136 place count 110 transition count 183
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 110 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 140 place count 110 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 141 place count 109 transition count 181
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 169 place count 95 transition count 167
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 170 place count 94 transition count 157
Iterating global reduction 6 with 1 rules applied. Total rules applied 171 place count 94 transition count 157
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 203 place count 78 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 224 place count 78 transition count 179
Applied a total of 224 rules in 68 ms. Remains 78 /193 variables (removed 115) and now considering 179/279 (removed 100) transitions.
[2026-05-26 22:12:09] [INFO ] Flow matrix only has 170 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7133159203447647267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7271971014110089391.kers'
[2026-05-26 22:12:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7133159203447647267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7271971014110089391.kers]
Normalized transition count is 169 out of 170 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 78 cols 584 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-26 22:12:09] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7271971014110089391.kers
Total runtime 1 ms.
[2026-05-26 22:12:09] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-26 22:12:09] [INFO ] Flow matrix only has 170 transitions (discarded 9 similar events)
[2026-05-26 22:12:09] [INFO ] Invariant cache hit.
[2026-05-26 22:12:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-26 22:12:09] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2026-05-26 22:12:09] [INFO ] Redundant transitions in 12 ms returned []
Running 175 sub problems to find dead transitions.
[2026-05-26 22:12:09] [INFO ] Flow matrix only has 170 transitions (discarded 9 similar events)
[2026-05-26 22:12:09] [INFO ] Invariant cache hit.
[2026-05-26 22:12:09] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 169/247 variables, 78/87 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 25/112 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/247 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/248 variables, and 112 constraints, problems are : Problem set: 2 solved, 173 unsolved in 9354 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 5/6 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 3/9 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 169/247 variables, 78/87 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 25/112 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 173/285 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/285 constraints. Problems are: Problem set: 2 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 0/247 variables, 0/285 constraints. Problems are: Problem set: 2 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/248 variables, and 285 constraints, problems are : Problem set: 2 solved, 173 unsolved in 20890 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 173/175 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30353ms problems are : Problem set: 2 solved, 173 unsolved
Search for dead transitions found 2 dead transitions in 30355ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/193 places, 177/279 transitions.
Applied a total of 0 rules in 12 ms. Remains 78 /78 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2026-05-26 22:12:39] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 30890 ms. Remains : 78/193 places, 177/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 230 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA FireWire-PT-16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-02 finished in 31265 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&&F(p1))) U X(X((p2&&F(!p1))))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 279/279 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 185 transition count 271
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 185 transition count 271
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 181 transition count 258
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 181 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 181 transition count 257
Applied a total of 25 rules in 17 ms. Remains 181 /193 variables (removed 12) and now considering 257/279 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4632103229290403329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7517578297430014965.kers'
[2026-05-26 22:12:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4632103229290403329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7517578297430014965.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 257 rows 181 cols 724 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-26 22:12:40] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7517578297430014965.kers
Total runtime 2 ms.
[2026-05-26 22:12:40] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-26 22:12:40] [INFO ] Invariant cache hit.
[2026-05-26 22:12:40] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-26 22:12:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Problem TDEAD237 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 257/438 variables, 181/188 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 2/190 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 255 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 190 constraints, problems are : Problem set: 1 solved, 255 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 257/438 variables, 181/197 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 255/452 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 1/453 constraints. Problems are: Problem set: 1 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 454 constraints, problems are : Problem set: 1 solved, 255 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 255/256 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60090ms problems are : Problem set: 1 solved, 255 unsolved
Search for dead transitions found 1 dead transitions in 60093ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 181/193 places, 256/279 transitions.
Applied a total of 0 rules in 5 ms. Remains 181 /181 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60766 ms. Remains : 181/193 places, 256/279 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&&F(p1))) U X(X((p2&&F(!p1))))))'
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (OR (NOT p2) p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 369 ms.
Product exploration explored 100000 steps with 33333 reset in 226 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Computed a total of 25 stabilizing places and 27 stable transitions
Detected a total of 25/181 stabilizing places and 27/256 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 10 factoid took 16 ms. Proved property starting from automaton with 9 states, 18 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 36 ms.
FORMULA FireWire-PT-16-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-16-LTLFireability-03 finished in 61883 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(G((p0&&F(p1)))))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 279/279 transitions.
Graph (trivial) has 157 edges and 193 vertex of which 18 / 193 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 177 transition count 224
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 139 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 138 transition count 221
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 81 place count 138 transition count 209
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 105 place count 126 transition count 209
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 112 place count 119 transition count 193
Iterating global reduction 3 with 7 rules applied. Total rules applied 119 place count 119 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 119 transition count 192
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 120 place count 119 transition count 187
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 130 place count 114 transition count 187
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 132 place count 112 transition count 185
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 112 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 136 place count 112 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 137 place count 111 transition count 183
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 165 place count 97 transition count 169
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 199 place count 80 transition count 257
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 6 with 38 rules applied. Total rules applied 237 place count 80 transition count 219
Applied a total of 237 rules in 51 ms. Remains 80 /193 variables (removed 113) and now considering 219/279 (removed 60) transitions.
[2026-05-26 22:13:42] [INFO ] Flow matrix only has 190 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-19557639449487315.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5477630387554368134.kers'
[2026-05-26 22:13:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-19557639449487315.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5477630387554368134.kers]
Normalized transition count is 189 out of 190 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 80 cols 656 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-26 22:13:42] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5477630387554368134.kers
Total runtime 1 ms.
[2026-05-26 22:13:42] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-26 22:13:42] [INFO ] Flow matrix only has 190 transitions (discarded 29 similar events)
[2026-05-26 22:13:42] [INFO ] Invariant cache hit.
[2026-05-26 22:13:42] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-26 22:13:42] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2026-05-26 22:13:42] [INFO ] Redundant transitions in 4 ms returned []
Running 215 sub problems to find dead transitions.
[2026-05-26 22:13:42] [INFO ] Flow matrix only has 190 transitions (discarded 29 similar events)
[2026-05-26 22:13:42] [INFO ] Invariant cache hit.
[2026-05-26 22:13:42] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 6/10 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 189/269 variables, 80/90 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 28/118 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/270 variables, and 118 constraints, problems are : Problem set: 3 solved, 212 unsolved in 14333 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/10 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 189/269 variables, 80/90 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 28/118 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 212/330 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/330 constraints. Problems are: Problem set: 3 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 0/269 variables, 0/330 constraints. Problems are: Problem set: 3 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/270 variables, and 330 constraints, problems are : Problem set: 3 solved, 212 unsolved in 26053 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 212/215 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40460ms problems are : Problem set: 3 solved, 212 unsolved
Search for dead transitions found 3 dead transitions in 40462ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 80/193 places, 216/279 transitions.
Applied a total of 0 rules in 11 ms. Remains 80 /80 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2026-05-26 22:14:22] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 40910 ms. Remains : 80/193 places, 216/279 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)&&X(G((p0&&F(p1)))))))'
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 232 ms.
Product exploration explored 100000 steps with 3 reset in 198 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge based reduction with 7 factoid took 96 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (5334 resets) in 537 ms. (74 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (1712 resets) in 180 ms. (221 steps per ms) remains 1/1 properties
[2026-05-26 22:14:23] [INFO ] Flow matrix only has 187 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-749021179708375858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3208888651303232994.kers'
[2026-05-26 22:14:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-749021179708375858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3208888651303232994.kers]
Normalized transition count is 186 out of 187 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 80 cols 644 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-26 22:14:23] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3208888651303232994.kers
Total runtime 2 ms.
[2026-05-26 22:14:23] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 134/154 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/240 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/244 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/254 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/266 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/266 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/267 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 134/154 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/240 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/244 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/254 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/266 variables, 11/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/266 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/266 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/267 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 532ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 216/216 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 78 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 77 transition count 213
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 23 place count 77 transition count 202
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 49 place count 66 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 57 place count 66 transition count 179
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 66 transition count 179
Applied a total of 59 rules in 32 ms. Remains 66 /80 variables (removed 14) and now considering 179/216 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 66/80 places, 179/216 transitions.
RANDOM walk for 40000 steps (4698 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1478 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 82 steps, run visited all 1 properties in 5 ms. (steps per millisecond=16 )
Probabilistic random walk after 82 steps, saw 61 distinct states, run finished after 5 ms. (steps per millisecond=16 ) properties seen :1
Knowledge based reduction with 7 factoid took 126 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Knowledge-based reduction took 1306 ms.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 80 /80 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2026-05-26 22:14:25] [INFO ] Flow matrix only has 187 transitions (discarded 29 similar events)
[2026-05-26 22:14:25] [INFO ] Invariant cache hit.
[2026-05-26 22:14:25] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-26 22:14:25] [INFO ] Flow matrix only has 187 transitions (discarded 29 similar events)
[2026-05-26 22:14:25] [INFO ] Invariant cache hit.
[2026-05-26 22:14:25] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-26 22:14:25] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2026-05-26 22:14:25] [INFO ] Redundant transitions in 2 ms returned []
Running 212 sub problems to find dead transitions.
[2026-05-26 22:14:25] [INFO ] Flow matrix only has 187 transitions (discarded 29 similar events)
[2026-05-26 22:14:25] [INFO ] Invariant cache hit.
[2026-05-26 22:14:25] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 186/266 variables, 80/90 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 28/118 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 0/266 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/267 variables, and 118 constraints, problems are : Problem set: 0 solved, 212 unsolved in 17690 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 186/266 variables, 80/90 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 28/118 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 212/330 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 0/266 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/267 variables, and 330 constraints, problems are : Problem set: 0 solved, 212 unsolved in 21399 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39170ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 39171ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39651 ms. Remains : 80/80 places, 216/216 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge based reduction with 7 factoid took 66 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (5253 resets) in 57 ms. (689 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (1738 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
[2026-05-26 22:15:04] [INFO ] Flow matrix only has 187 transitions (discarded 29 similar events)
[2026-05-26 22:15:04] [INFO ] Invariant cache hit.
[2026-05-26 22:15:04] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 134/154 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/240 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/244 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/254 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/266 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/266 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/267 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 134/154 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/240 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/244 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/254 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/266 variables, 11/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/266 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/266 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/267 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 507ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 216/216 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 78 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 77 transition count 213
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 23 place count 77 transition count 202
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 49 place count 66 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 57 place count 66 transition count 179
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 66 transition count 179
Applied a total of 59 rules in 37 ms. Remains 66 /80 variables (removed 14) and now considering 179/216 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 66/80 places, 179/216 transitions.
RANDOM walk for 40000 steps (4746 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1446 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 82 steps, run visited all 1 properties in 7 ms. (steps per millisecond=11 )
Probabilistic random walk after 82 steps, saw 61 distinct states, run finished after 7 ms. (steps per millisecond=11 ) properties seen :1
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Knowledge-based reduction took 1035 ms.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 106 ms.
Product exploration explored 100000 steps with 0 reset in 495 ms.
Built C files in :
/tmp/ltsmin16092163859183959924
[2026-05-26 22:15:06] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2026-05-26 22:15:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 22:15:06] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2026-05-26 22:15:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 22:15:06] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2026-05-26 22:15:06] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 22:15:07] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16092163859183959924
Running compilation step : cd /tmp/ltsmin16092163859183959924;'/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 1302 ms.
Running link step : cd /tmp/ltsmin16092163859183959924;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin16092163859183959924;'/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/stateBased11931317455816196583.hoa' '--buchi-type=spotba'
LTSmin run took 282 ms.
FORMULA FireWire-PT-16-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-16-LTLFireability-04 finished in 86615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&((X(p2)&&F(p3))||X(G(p2)))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 279/279 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 183 transition count 269
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 183 transition count 269
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 177 transition count 263
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 177 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 177 transition count 261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 176 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 176 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 175 transition count 259
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 175 transition count 259
Applied a total of 38 rules in 12 ms. Remains 175 /193 variables (removed 18) and now considering 259/279 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1393178086300008502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4251763693755354686.kers'
[2026-05-26 22:15:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1393178086300008502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4251763693755354686.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 259 rows 175 cols 744 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-26 22:15:08] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4251763693755354686.kers
Total runtime 3 ms.
[2026-05-26 22:15:08] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-26 22:15:08] [INFO ] Invariant cache hit.
[2026-05-26 22:15:09] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-26 22:15:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Problem TDEAD240 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 259/434 variables, 175/188 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 2/190 constraints. Problems are: Problem set: 1 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/434 variables, and 190 constraints, problems are : Problem set: 1 solved, 257 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 11/15 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 259/434 variables, 175/190 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 257/447 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 1/448 constraints. Problems are: Problem set: 1 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 448 constraints, problems are : Problem set: 1 solved, 257 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 257/258 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60089ms problems are : Problem set: 1 solved, 257 unsolved
Search for dead transitions found 1 dead transitions in 60090ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/193 places, 258/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 175 /175 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60666 ms. Remains : 175/193 places, 258/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&(X(G(p2))||(X(p2)&&F(p3)))))'
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p3) (NOT p2)), (NOT p1), true, (NOT p3)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-06 finished in 61095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||(p0&&(p1 U (p2||G(p1)))))) U (G(p0)||((p0 U (G(p0)||(p0&&(p1 U (p2||G(p1))))))&&X(X(X(X(G(p3)))))))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 279/279 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 183 transition count 269
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 183 transition count 269
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 176 transition count 253
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 176 transition count 253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 176 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 175 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 175 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 174 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 174 transition count 249
Applied a total of 40 rules in 13 ms. Remains 174 /193 variables (removed 19) and now considering 249/279 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3103897421283552887.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3713356300562822682.kers'
[2026-05-26 22:16:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3103897421283552887.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3713356300562822682.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 249 rows 174 cols 704 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-26 22:16:09] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3713356300562822682.kers
Total runtime 3 ms.
[2026-05-26 22:16:10] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-26 22:16:10] [INFO ] Invariant cache hit.
[2026-05-26 22:16:10] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2026-05-26 22:16:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Problem TDEAD230 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 249/423 variables, 174/184 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 2/186 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/423 variables, and 186 constraints, problems are : Problem set: 1 solved, 247 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 3/17 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 249/423 variables, 174/191 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 247/438 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 1/439 constraints. Problems are: Problem set: 1 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/439 constraints. Problems are: Problem set: 1 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 439 constraints, problems are : Problem set: 1 solved, 247 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 247/248 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 1 solved, 247 unsolved
Search for dead transitions found 1 dead transitions in 60068ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/193 places, 248/279 transitions.
Applied a total of 0 rules in 3 ms. Remains 174 /174 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60697 ms. Remains : 174/193 places, 248/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||(p0&&(p1 U (p2||G(p1)))))) U (G(p0)||((p0 U (G(p0)||(p0&&(p1 U (p2||G(p1))))))&&X(X(X(X(G(p3)))))))))'
Stuttering acceptance computed with spot in 956 ms :[(NOT p0), true, (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 307 ms.
Product exploration explored 100000 steps with 1 reset in 281 ms.
Computed a total of 21 stabilizing places and 23 stable transitions
Computed a total of 21 stabilizing places and 23 stable transitions
Knowledge based reduction with 17 factoid took 247 ms. Reduced automaton from 17 states, 49 edges and 4 AP (stutter sensitive) to 17 states, 46 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (11 resets) in 875 ms. (45 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (10 resets) in 28 ms. (137 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (12 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (9 resets) in 48 ms. (81 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (10 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (10 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (10 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (9 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (9 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (9 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (9 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (10 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (10 resets) in 55 ms. (71 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (9 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (9 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 326770 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :1 out of 23
Probabilistic random walk after 326770 steps, saw 68368 distinct states, run finished after 3006 ms. (steps per millisecond=108 ) properties seen :1
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5564263032486269787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8266306982639692892.kers'
[2026-05-26 22:17:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5564263032486269787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8266306982639692892.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 174 cols 700 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-26 22:17:16] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8266306982639692892.kers
Total runtime 2 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf13 is UNSAT
Problem apf14 is UNSAT
Problem apf15 is UNSAT
Problem apf18 is UNSAT
Problem apf19 is UNSAT
At refinement iteration 1 (OVERLAPS) 127/132 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 11 unsolved
Problem apf6 is UNSAT
Problem apf12 is UNSAT
Problem apf16 is UNSAT
Problem apf21 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/3 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 25/157 variables, 2/5 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/5 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 230/387 variables, 157/162 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/162 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 9/396 variables, 4/166 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/166 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 10/406 variables, 5/171 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 0/171 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 6/412 variables, 3/174 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 0/174 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 7/419 variables, 3/177 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 0/177 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 3/422 variables, 2/179 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 0/179 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/422 variables, 0/179 constraints. Problems are: Problem set: 15 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 179 constraints, problems are : Problem set: 15 solved, 7 unsolved in 2544 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 127/132 variables, 2/2 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/3 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 25/157 variables, 2/5 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/5 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 230/387 variables, 157/162 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 7/169 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/169 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 9/396 variables, 4/173 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/173 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 10/406 variables, 5/178 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/178 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 6/412 variables, 3/181 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 7/419 variables, 3/184 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/184 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 3/422 variables, 2/186 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/422 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 186 constraints, problems are : Problem set: 15 solved, 7 unsolved in 2133 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 7/22 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4692ms problems are : Problem set: 15 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 462 ms.
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 248/248 transitions.
Graph (trivial) has 134 edges and 174 vertex of which 18 / 174 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 159 transition count 199
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 130 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 129 transition count 197
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 62 place count 129 transition count 182
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 92 place count 114 transition count 182
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 113 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 113 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 113 transition count 171
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 127 place count 97 transition count 155
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 157 place count 82 transition count 218
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 161 place count 82 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 185 place count 82 transition count 190
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 197 place count 82 transition count 178
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 209 place count 70 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 228 place count 70 transition count 159
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 70 transition count 159
Applied a total of 230 rules in 42 ms. Remains 70 /174 variables (removed 104) and now considering 159/248 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 70/174 places, 159/248 transitions.
RANDOM walk for 40000 steps (4069 resets) in 241 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1394 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1414 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1381 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1383 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1413 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1392 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1403 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 1150 steps, run visited all 7 properties in 18 ms. (steps per millisecond=63 )
Probabilistic random walk after 1150 steps, saw 444 distinct states, run finished after 18 ms. (steps per millisecond=63 ) properties seen :7
Found 15 invariant AP formulas.
Knowledge based reduction with 32 factoid took 440 ms. Reduced automaton from 17 states, 46 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[true, (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3)]
Knowledge-based reduction took 10216 ms.
Stuttering acceptance computed with spot in 314 ms :[true, (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3)]
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 248/248 transitions.
Applied a total of 0 rules in 2 ms. Remains 174 /174 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2026-05-26 22:17:22] [INFO ] Invariant cache hit.
[2026-05-26 22:17:22] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-26 22:17:22] [INFO ] Invariant cache hit.
[2026-05-26 22:17:23] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2026-05-26 22:17:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 248/422 variables, 174/184 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/422 variables, and 188 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 248/422 variables, 174/190 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 247/437 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 439 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Finished structural reductions in LTL mode , in 1 iterations and 60660 ms. Remains : 174/174 places, 248/248 transitions.
Computed a total of 21 stabilizing places and 23 stable transitions
Computed a total of 21 stabilizing places and 23 stable transitions
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (10 resets) in 176 ms. (225 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (11 resets) in 196 ms. (203 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (11 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (10 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (12 resets) in 112 ms. (353 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (11 resets) in 112 ms. (353 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 540466 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :1 out of 5
Probabilistic random walk after 540466 steps, saw 108221 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :1
[2026-05-26 22:18:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 128/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 25/157 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 230/387 variables, 157/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/396 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 10/406 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/412 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/419 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/422 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/422 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 178 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 128/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 25/157 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 230/387 variables, 157/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/396 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 10/406 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/412 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/419 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/422 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/422 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 183 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1751 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2856ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 202 ms.
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 248/248 transitions.
Graph (trivial) has 136 edges and 174 vertex of which 18 / 174 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 159 transition count 198
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 129 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 128 transition count 196
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 64 place count 128 transition count 181
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 94 place count 113 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 112 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 112 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 112 transition count 170
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 131 place count 95 transition count 153
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 161 place count 80 transition count 216
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 165 place count 80 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 189 place count 80 transition count 188
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 200 place count 80 transition count 177
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 211 place count 69 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 230 place count 69 transition count 158
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 232 place count 69 transition count 158
Applied a total of 232 rules in 37 ms. Remains 69 /174 variables (removed 105) and now considering 158/248 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 69/174 places, 158/248 transitions.
RANDOM walk for 40000 steps (4102 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1418 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1384 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1413 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1411 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 1046 steps, run visited all 4 properties in 20 ms. (steps per millisecond=52 )
Probabilistic random walk after 1046 steps, saw 422 distinct states, run finished after 20 ms. (steps per millisecond=52 ) properties seen :4
Knowledge based reduction with 9 factoid took 170 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[true, (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Knowledge-based reduction took 7465 ms.
Stuttering acceptance computed with spot in 385 ms :[true, (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 390 ms :[true, (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 176 ms.
Product exploration explored 100000 steps with 2 reset in 189 ms.
Spot run failed in 145 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2633882083600251203
[2026-05-26 22:18:32] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2633882083600251203
Running compilation step : cd /tmp/ltsmin2633882083600251203;'/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 756 ms.
Running link step : cd /tmp/ltsmin2633882083600251203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2633882083600251203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11143868060681145999.hoa' '--buchi-type=spotba'
LTSmin run took 10066 ms.
FORMULA FireWire-PT-16-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-16-LTLFireability-08 finished in 153237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(G(p0))&&(!p1 U (p2||G(!p1))))))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 279/279 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 182 transition count 268
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 182 transition count 268
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 175 transition count 252
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 175 transition count 252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 175 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 174 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 174 transition count 249
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 173 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 173 transition count 248
Applied a total of 42 rules in 8 ms. Remains 173 /193 variables (removed 20) and now considering 248/279 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13643090657787669839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7810936565848202721.kers'
[2026-05-26 22:18:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13643090657787669839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7810936565848202721.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 173 cols 702 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-26 22:18:43] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7810936565848202721.kers
Total runtime 3 ms.
[2026-05-26 22:18:43] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-26 22:18:43] [INFO ] Invariant cache hit.
[2026-05-26 22:18:43] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2026-05-26 22:18:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Problem TDEAD229 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 248/421 variables, 173/183 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 2/185 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 246 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/421 variables, and 185 constraints, problems are : Problem set: 1 solved, 246 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 248/421 variables, 173/185 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 246/431 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 3/434 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 1/435 constraints. Problems are: Problem set: 1 solved, 246 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 435 constraints, problems are : Problem set: 1 solved, 246 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 246/247 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60062ms problems are : Problem set: 1 solved, 246 unsolved
Search for dead transitions found 1 dead transitions in 60063ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/193 places, 247/279 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60592 ms. Remains : 173/193 places, 247/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(G(p0))&&(!p1 U (p2||G(!p1))))))))'
Stuttering acceptance computed with spot in 248 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 178 ms.
Product exploration explored 100000 steps with 0 reset in 209 ms.
Computed a total of 21 stabilizing places and 23 stable transitions
Computed a total of 21 stabilizing places and 23 stable transitions
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (12 resets) in 132 ms. (300 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40000 steps (12 resets) in 249 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (9 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (9 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5119160320643878135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14487487607248921737.kers'
[2026-05-26 22:19:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5119160320643878135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14487487607248921737.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 173 cols 698 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-26 22:19:44] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14487487607248921737.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 140/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/156 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 229/385 variables, 156/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/394 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 10/404 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/410 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/417 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/420 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/420 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 177 constraints, problems are : Problem set: 0 solved, 4 unsolved in 608 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 140/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/156 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 229/385 variables, 156/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/394 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 10/404 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/410 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/417 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/420 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/420 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1578 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2201ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 291 ms.
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 247/247 transitions.
Graph (trivial) has 134 edges and 173 vertex of which 14 / 173 are part of one of the 2 SCC in 1 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 161 transition count 203
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 133 transition count 201
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 132 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 130 transition count 199
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 64 place count 130 transition count 182
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 98 place count 113 transition count 182
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 112 transition count 172
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 112 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 112 transition count 171
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 135 place count 95 transition count 154
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 167 place count 79 transition count 217
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 173 place count 79 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 6 with 30 rules applied. Total rules applied 203 place count 79 transition count 181
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 213 place count 79 transition count 171
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 223 place count 69 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 241 place count 69 transition count 153
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 243 place count 69 transition count 153
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 69 transition count 153
Applied a total of 244 rules in 43 ms. Remains 69 /173 variables (removed 104) and now considering 153/247 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 69/173 places, 153/247 transitions.
RANDOM walk for 40000 steps (36 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (21 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (42 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 402 steps, run visited all 4 properties in 10 ms. (steps per millisecond=40 )
Probabilistic random walk after 402 steps, saw 219 distinct states, run finished after 10 ms. (steps per millisecond=40 ) properties seen :4
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Knowledge-based reduction took 3756 ms.
Stuttering acceptance computed with spot in 231 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 247/247 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 247/247 (removed 0) transitions.
[2026-05-26 22:19:48] [INFO ] Invariant cache hit.
[2026-05-26 22:19:48] [INFO ] Implicit Places using invariants in 203 ms returned []
[2026-05-26 22:19:48] [INFO ] Invariant cache hit.
[2026-05-26 22:19:48] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2026-05-26 22:19:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 247/420 variables, 173/186 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/420 variables, and 189 constraints, problems are : Problem set: 0 solved, 246 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 247/420 variables, 173/189 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 246/435 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 437 constraints, problems are : Problem set: 0 solved, 246 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Finished structural reductions in LTL mode , in 1 iterations and 60678 ms. Remains : 173/173 places, 247/247 transitions.
Computed a total of 21 stabilizing places and 23 stable transitions
Computed a total of 21 stabilizing places and 23 stable transitions
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9 resets) in 112 ms. (353 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40000 steps (9 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 256 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (15 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
[2026-05-26 22:20:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 140/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/156 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 229/385 variables, 156/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/394 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 10/404 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/410 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/417 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/420 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/420 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 177 constraints, problems are : Problem set: 0 solved, 4 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 140/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/156 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 229/385 variables, 156/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/394 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 10/404 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/410 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/417 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/420 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/420 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1623 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2226ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 218 ms.
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 247/247 transitions.
Graph (trivial) has 134 edges and 173 vertex of which 14 / 173 are part of one of the 2 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 161 transition count 203
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 133 transition count 201
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 132 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 130 transition count 199
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 64 place count 130 transition count 182
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 98 place count 113 transition count 182
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 112 transition count 172
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 112 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 112 transition count 171
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 135 place count 95 transition count 154
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 167 place count 79 transition count 217
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 173 place count 79 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 6 with 30 rules applied. Total rules applied 203 place count 79 transition count 181
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 213 place count 79 transition count 171
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 223 place count 69 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 241 place count 69 transition count 153
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 243 place count 69 transition count 153
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 69 transition count 153
Applied a total of 244 rules in 38 ms. Remains 69 /173 variables (removed 104) and now considering 153/247 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 69/173 places, 153/247 transitions.
RANDOM walk for 40000 steps (19 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (24 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 289 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (9 resets) in 465 ms. (85 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 402 steps, run visited all 4 properties in 8 ms. (steps per millisecond=50 )
Probabilistic random walk after 402 steps, saw 219 distinct states, run finished after 9 ms. (steps per millisecond=44 ) properties seen :4
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Knowledge-based reduction took 4109 ms.
Stuttering acceptance computed with spot in 220 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 237 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 1 reset in 146 ms.
Product exploration explored 100000 steps with 0 reset in 167 ms.
Spot run failed in 85 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin928650521741998110
[2026-05-26 22:20:53] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin928650521741998110
Running compilation step : cd /tmp/ltsmin928650521741998110;'/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 807 ms.
Running link step : cd /tmp/ltsmin928650521741998110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin928650521741998110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3599588727439103255.hoa' '--buchi-type=spotba'
LTSmin run took 12531 ms.
FORMULA FireWire-PT-16-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-16-LTLFireability-09 finished in 144363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 279/279 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 182 transition count 268
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 182 transition count 268
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 175 transition count 252
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 175 transition count 252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 175 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 174 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 174 transition count 249
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 173 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 173 transition count 248
Applied a total of 42 rules in 7 ms. Remains 173 /193 variables (removed 20) and now considering 248/279 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12178842287943996587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4473597979019384573.kers'
[2026-05-26 22:21:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12178842287943996587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4473597979019384573.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 173 cols 702 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-26 22:21:07] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4473597979019384573.kers
Total runtime 2 ms.
[2026-05-26 22:21:07] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-26 22:21:07] [INFO ] Invariant cache hit.
[2026-05-26 22:21:07] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2026-05-26 22:21:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Problem TDEAD229 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 248/421 variables, 173/183 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 2/185 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 246 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/421 variables, and 185 constraints, problems are : Problem set: 1 solved, 246 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 248/421 variables, 173/185 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 246/431 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 3/434 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 1/435 constraints. Problems are: Problem set: 1 solved, 246 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 435 constraints, problems are : Problem set: 1 solved, 246 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 246/247 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60063ms problems are : Problem set: 1 solved, 246 unsolved
Search for dead transitions found 1 dead transitions in 60066ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/193 places, 247/279 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60537 ms. Remains : 173/193 places, 247/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 336 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 1 ms.
FORMULA FireWire-PT-16-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-16-LTLFireability-10 finished in 61127 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((X(p1)&&G(p2))))||G(p3))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 279/279 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 183 transition count 269
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 183 transition count 269
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 177 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 177 transition count 254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 177 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 176 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 176 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 175 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 175 transition count 250
Applied a total of 38 rules in 13 ms. Remains 175 /193 variables (removed 18) and now considering 250/279 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10954437849406436285.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18070142328495838012.kers'
[2026-05-26 22:22:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10954437849406436285.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18070142328495838012.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 175 cols 706 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-26 22:22:08] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18070142328495838012.kers
Total runtime 4 ms.
[2026-05-26 22:22:08] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-26 22:22:08] [INFO ] Invariant cache hit.
[2026-05-26 22:22:09] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2026-05-26 22:22:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Problem TDEAD231 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 250/425 variables, 175/188 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 2/190 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 248 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/425 variables, and 190 constraints, problems are : Problem set: 1 solved, 248 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 11/15 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 250/425 variables, 175/192 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 248/440 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 1/441 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/441 constraints. Problems are: Problem set: 1 solved, 248 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 441 constraints, problems are : Problem set: 1 solved, 248 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 248/249 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60067ms problems are : Problem set: 1 solved, 248 unsolved
Search for dead transitions found 1 dead transitions in 60068ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/193 places, 249/279 transitions.
Applied a total of 0 rules in 2 ms. Remains 175 /175 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60668 ms. Remains : 175/193 places, 249/279 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((X(p1)&&G(p2))))||G(p3))))'
Stuttering acceptance computed with spot in 386 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1), (NOT p2), (AND p2 (NOT p1) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-11
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-11 finished in 61126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||X(((G(p1)&&F(G(p2))) U (!p0&&G(p1)&&F(G(p2))))))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 279/279 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 184 transition count 270
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 184 transition count 270
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 177 transition count 254
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 177 transition count 254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 177 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 176 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 176 transition count 251
Applied a total of 36 rules in 9 ms. Remains 176 /193 variables (removed 17) and now considering 251/279 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3205753614546740836.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5599894136557437306.kers'
[2026-05-26 22:23:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3205753614546740836.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5599894136557437306.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 251 rows 176 cols 708 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-26 22:23:09] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5599894136557437306.kers
Total runtime 4 ms.
[2026-05-26 22:23:09] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-26 22:23:09] [INFO ] Invariant cache hit.
[2026-05-26 22:23:10] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2026-05-26 22:23:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Problem TDEAD232 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 251/427 variables, 176/187 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 2/189 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/427 variables, and 189 constraints, problems are : Problem set: 1 solved, 249 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 4/17 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 251/427 variables, 176/195 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 249/444 constraints. Problems are: Problem set: 1 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 1/445 constraints. Problems are: Problem set: 1 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 445 constraints, problems are : Problem set: 1 solved, 249 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 249/250 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60056ms problems are : Problem set: 1 solved, 249 unsolved
Search for dead transitions found 1 dead transitions in 60057ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 176/193 places, 250/279 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60667 ms. Remains : 176/193 places, 250/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(((G(p1)&&F(G(p2))) U (p0&&G(p1)&&F(G(p2))))))))'
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 82 ms.
Product exploration explored 100000 steps with 0 reset in 71 ms.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Detected a total of 22/176 stabilizing places and 24/250 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 7 factoid took 64 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40000 steps (12 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (11 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7096456922782799941.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13002004331012603484.kers'
[2026-05-26 22:24:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7096456922782799941.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13002004331012603484.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 176 cols 704 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-26 22:24:10] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13002004331012603484.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 131/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/158 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 231/389 variables, 158/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/398 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 10/408 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/414 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/422 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/426 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/426 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 180 constraints, problems are : Problem set: 0 solved, 2 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 131/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/158 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 231/389 variables, 158/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/398 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/408 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/414 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/422 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/426 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/426 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 182 constraints, problems are : Problem set: 0 solved, 2 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1317ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 203 ms.
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 250/250 transitions.
Graph (trivial) has 142 edges and 176 vertex of which 18 / 176 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 161 transition count 200
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 131 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 130 transition count 198
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 64 place count 130 transition count 182
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 96 place count 114 transition count 182
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 113 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 113 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 113 transition count 171
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 137 place count 94 transition count 152
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 171 place count 77 transition count 226
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 177 place count 77 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 5 with 34 rules applied. Total rules applied 211 place count 77 transition count 186
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 221 place count 77 transition count 176
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 231 place count 67 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 253 place count 67 transition count 154
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 254 place count 67 transition count 154
Applied a total of 254 rules in 44 ms. Remains 67 /176 variables (removed 109) and now considering 154/250 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 67/176 places, 154/250 transitions.
RANDOM walk for 40000 steps (4139 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1415 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1382 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1227 steps, run visited all 2 properties in 11 ms. (steps per millisecond=111 )
Probabilistic random walk after 1227 steps, saw 532 distinct states, run finished after 11 ms. (steps per millisecond=111 ) properties seen :2
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1)]
[2026-05-26 22:24:13] [INFO ] Invariant cache hit.
[2026-05-26 22:24:13] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2026-05-26 22:24:13] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2026-05-26 22:24:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 22:24:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2026-05-26 22:24:14] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2026-05-26 22:24:14] [INFO ] Computed and/alt/rep : 225/481/225 causal constraints (skipped 24 transitions) in 44 ms.
[2026-05-26 22:24:16] [INFO ] Added : 207 causal constraints over 42 iterations in 1866 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 5297 ms.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1)]
Support contains 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 250/250 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2026-05-26 22:24:16] [INFO ] Invariant cache hit.
[2026-05-26 22:24:16] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-26 22:24:16] [INFO ] Invariant cache hit.
[2026-05-26 22:24:17] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2026-05-26 22:24:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 250/426 variables, 176/193 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 193 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (OVERLAPS) 250/426 variables, 176/196 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 249/445 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/426 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 446 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Finished structural reductions in LTL mode , in 1 iterations and 60610 ms. Remains : 176/176 places, 250/250 transitions.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Detected a total of 22/176 stabilizing places and 24/250 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9 resets) in 146 ms. (272 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40000 steps (9 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (10 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
[2026-05-26 22:25:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 131/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/158 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 231/389 variables, 158/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/398 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 10/408 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/414 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/422 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/426 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/426 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 180 constraints, problems are : Problem set: 0 solved, 2 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 131/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/158 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 231/389 variables, 158/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/398 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/408 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/414 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/422 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/426 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/426 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 182 constraints, problems are : Problem set: 0 solved, 2 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1311ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 204 ms.
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 250/250 transitions.
Graph (trivial) has 142 edges and 176 vertex of which 18 / 176 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 161 transition count 200
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 131 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 130 transition count 198
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 64 place count 130 transition count 182
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 96 place count 114 transition count 182
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 113 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 113 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 113 transition count 171
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 137 place count 94 transition count 152
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 171 place count 77 transition count 226
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 177 place count 77 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 5 with 34 rules applied. Total rules applied 211 place count 77 transition count 186
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 221 place count 77 transition count 176
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 231 place count 67 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 253 place count 67 transition count 154
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 254 place count 67 transition count 154
Applied a total of 254 rules in 35 ms. Remains 67 /176 variables (removed 109) and now considering 154/250 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 67/176 places, 154/250 transitions.
RANDOM walk for 40000 steps (4128 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1423 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1404 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1227 steps, run visited all 2 properties in 12 ms. (steps per millisecond=102 )
Probabilistic random walk after 1227 steps, saw 532 distinct states, run finished after 13 ms. (steps per millisecond=94 ) properties seen :2
Knowledge based reduction with 6 factoid took 200 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1)]
[2026-05-26 22:25:19] [INFO ] Invariant cache hit.
[2026-05-26 22:25:19] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2026-05-26 22:25:20] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2026-05-26 22:25:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 22:25:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2026-05-26 22:25:20] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2026-05-26 22:25:20] [INFO ] Computed and/alt/rep : 225/481/225 causal constraints (skipped 24 transitions) in 31 ms.
[2026-05-26 22:25:22] [INFO ] Added : 207 causal constraints over 42 iterations in 1913 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 5807 ms.
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1)]
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-12 finished in 133971 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 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 279/279 transitions.
Graph (trivial) has 158 edges and 193 vertex of which 18 / 193 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 177 transition count 224
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 139 transition count 221
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 138 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 85 place count 136 transition count 219
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 85 place count 136 transition count 207
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 109 place count 124 transition count 207
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 117 place count 116 transition count 190
Iterating global reduction 4 with 8 rules applied. Total rules applied 125 place count 116 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 116 transition count 189
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 126 place count 116 transition count 184
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 136 place count 111 transition count 184
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 138 place count 109 transition count 182
Iterating global reduction 5 with 2 rules applied. Total rules applied 140 place count 109 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 142 place count 109 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 143 place count 108 transition count 180
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 171 place count 94 transition count 166
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 172 place count 93 transition count 156
Iterating global reduction 7 with 1 rules applied. Total rules applied 173 place count 93 transition count 156
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -71
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 205 place count 77 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 7 with 38 rules applied. Total rules applied 243 place count 77 transition count 189
Applied a total of 243 rules in 37 ms. Remains 77 /193 variables (removed 116) and now considering 189/279 (removed 90) transitions.
[2026-05-26 22:25:23] [INFO ] Flow matrix only has 162 transitions (discarded 27 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1813713682931471972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13124941354745163128.kers'
[2026-05-26 22:25:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1813713682931471972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13124941354745163128.kers]
Normalized transition count is 161 out of 162 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 161 rows 77 cols 550 entries
Finished phase 1 with 73 SingleSign rule and 0 generalized
[2026-05-26 22:25:23] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13124941354745163128.kers
Total runtime 3 ms.
[2026-05-26 22:25:23] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-26 22:25:23] [INFO ] Flow matrix only has 162 transitions (discarded 27 similar events)
[2026-05-26 22:25:23] [INFO ] Invariant cache hit.
[2026-05-26 22:25:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-26 22:25:24] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2026-05-26 22:25:24] [INFO ] Redundant transitions in 2 ms returned []
Running 185 sub problems to find dead transitions.
[2026-05-26 22:25:24] [INFO ] Flow matrix only has 162 transitions (discarded 27 similar events)
[2026-05-26 22:25:24] [INFO ] Invariant cache hit.
[2026-05-26 22:25:24] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 6/10 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 161/238 variables, 77/87 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 25/112 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/112 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/238 variables, 0/112 constraints. Problems are: Problem set: 3 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/239 variables, and 112 constraints, problems are : Problem set: 3 solved, 182 unsolved in 10569 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 1/12 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 161/238 variables, 77/89 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 25/114 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 182/296 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/296 constraints. Problems are: Problem set: 3 solved, 182 unsolved
At refinement iteration 12 (OVERLAPS) 0/238 variables, 0/296 constraints. Problems are: Problem set: 3 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/239 variables, and 296 constraints, problems are : Problem set: 3 solved, 182 unsolved in 20464 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 182/185 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31100ms problems are : Problem set: 3 solved, 182 unsolved
Search for dead transitions found 3 dead transitions in 31101ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 77/193 places, 186/279 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-26 22:25:55] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 31589 ms. Remains : 77/193 places, 186/279 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 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-13
Product exploration explored 100000 steps with 2 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 80 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5512 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1756 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1197 steps, run visited all 1 properties in 9 ms. (steps per millisecond=133 )
Probabilistic random walk after 1197 steps, saw 545 distinct states, run finished after 9 ms. (steps per millisecond=133 ) properties seen :1
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 271 ms.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-26 22:25:55] [INFO ] Flow matrix only has 159 transitions (discarded 27 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2565577487735681783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16917532849951554780.kers'
[2026-05-26 22:25:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2565577487735681783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16917532849951554780.kers]
Normalized transition count is 158 out of 159 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 77 cols 538 entries
Finished phase 1 with 73 SingleSign rule and 0 generalized
[2026-05-26 22:25:55] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16917532849951554780.kers
Total runtime 2 ms.
[2026-05-26 22:25:55] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-26 22:25:55] [INFO ] Flow matrix only has 159 transitions (discarded 27 similar events)
[2026-05-26 22:25:55] [INFO ] Invariant cache hit.
[2026-05-26 22:25:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-26 22:25:56] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2026-05-26 22:25:56] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2026-05-26 22:25:56] [INFO ] Flow matrix only has 159 transitions (discarded 27 similar events)
[2026-05-26 22:25:56] [INFO ] Invariant cache hit.
[2026-05-26 22:25:56] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 158/235 variables, 77/88 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 25/113 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/235 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/236 variables, and 113 constraints, problems are : Problem set: 0 solved, 182 unsolved in 12037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 158/235 variables, 77/88 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 25/113 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 182/295 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 0/235 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/236 variables, and 295 constraints, problems are : Problem set: 0 solved, 182 unsolved in 23483 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35567ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 35568ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36008 ms. Remains : 77/77 places, 186/186 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5514 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1744 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1197 steps, run visited all 1 properties in 8 ms. (steps per millisecond=149 )
Probabilistic random walk after 1197 steps, saw 545 distinct states, run finished after 8 ms. (steps per millisecond=149 ) properties seen :1
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 239 ms.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 46 ms.
Product exploration explored 100000 steps with 0 reset in 49 ms.
Built C files in :
/tmp/ltsmin1282295108713484470
[2026-05-26 22:26:32] [INFO ] Computing symmetric may disable matrix : 186 transitions.
[2026-05-26 22:26:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 22:26:32] [INFO ] Computing symmetric may enable matrix : 186 transitions.
[2026-05-26 22:26:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 22:26:32] [INFO ] Computing Do-Not-Accords matrix : 186 transitions.
[2026-05-26 22:26:32] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 22:26:32] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1282295108713484470
Running compilation step : cd /tmp/ltsmin1282295108713484470;'/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 572 ms.
Running link step : cd /tmp/ltsmin1282295108713484470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1282295108713484470;'/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/stateBased1759933426703786719.hoa' '--buchi-type=spotba'
LTSmin run took 111 ms.
FORMULA FireWire-PT-16-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-16-LTLFireability-13 finished in 69523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 279/279 transitions.
Graph (trivial) has 155 edges and 193 vertex of which 15 / 193 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 180 transition count 227
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 82 place count 141 transition count 224
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 140 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 139 transition count 223
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 85 place count 139 transition count 211
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 109 place count 127 transition count 211
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 116 place count 120 transition count 204
Iterating global reduction 4 with 7 rules applied. Total rules applied 123 place count 120 transition count 204
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 123 place count 120 transition count 199
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 133 place count 115 transition count 199
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 136 place count 112 transition count 187
Iterating global reduction 4 with 3 rules applied. Total rules applied 139 place count 112 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 141 place count 112 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 142 place count 111 transition count 185
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 172 place count 96 transition count 170
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 173 place count 95 transition count 160
Iterating global reduction 6 with 1 rules applied. Total rules applied 174 place count 95 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 175 place count 95 transition count 159
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 209 place count 78 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 7 with 20 rules applied. Total rules applied 229 place count 78 transition count 211
Applied a total of 229 rules in 22 ms. Remains 78 /193 variables (removed 115) and now considering 211/279 (removed 68) transitions.
[2026-05-26 22:26:33] [INFO ] Flow matrix only has 200 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4501885772930243486.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18262417985809902327.kers'
[2026-05-26 22:26:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4501885772930243486.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18262417985809902327.kers]
Normalized transition count is 199 out of 200 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 78 cols 700 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-26 22:26:33] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18262417985809902327.kers
Total runtime 2 ms.
[2026-05-26 22:26:33] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-26 22:26:33] [INFO ] Flow matrix only has 200 transitions (discarded 11 similar events)
[2026-05-26 22:26:33] [INFO ] Invariant cache hit.
[2026-05-26 22:26:33] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-26 22:26:33] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2026-05-26 22:26:33] [INFO ] Redundant transitions in 1 ms returned []
Running 207 sub problems to find dead transitions.
[2026-05-26 22:26:33] [INFO ] Flow matrix only has 200 transitions (discarded 11 similar events)
[2026-05-26 22:26:33] [INFO ] Invariant cache hit.
[2026-05-26 22:26:33] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 5/9 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/10 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 199/277 variables, 78/88 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 26/114 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 1/115 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/278 variables, and 115 constraints, problems are : Problem set: 3 solved, 204 unsolved in 14469 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 4/11 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 199/277 variables, 78/89 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 26/115 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 204/319 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/319 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 0/319 constraints. Problems are: Problem set: 3 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/278 variables, and 319 constraints, problems are : Problem set: 3 solved, 204 unsolved in 26474 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 204/207 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40989ms problems are : Problem set: 3 solved, 204 unsolved
Search for dead transitions found 3 dead transitions in 40989ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/193 places, 208/279 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2026-05-26 22:27:14] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 41369 ms. Remains : 78/193 places, 208/279 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 54 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-14 finished in 41462 ms.
All properties solved by simple procedures.
Total runtime 1056277 ms.

BK_STOP 1779834434641

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

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