MCC'2026- Execution of r130-smll-177955809000260

About the Execution of ITS-Tools for FireWire-PT-15

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
515.132	650949.00	735264.00	1776.30	TFFFFTTFFFFFTFFF	normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.9K Mar 7 05:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 05:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K Mar 15 10:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 7 05:17 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 90K 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-15-LTLFireability-00
FORMULA_NAME FireWire-PT-15-LTLFireability-01
FORMULA_NAME FireWire-PT-15-LTLFireability-02
FORMULA_NAME FireWire-PT-15-LTLFireability-03
FORMULA_NAME FireWire-PT-15-LTLFireability-04
FORMULA_NAME FireWire-PT-15-LTLFireability-05
FORMULA_NAME FireWire-PT-15-LTLFireability-06
FORMULA_NAME FireWire-PT-15-LTLFireability-07
FORMULA_NAME FireWire-PT-15-LTLFireability-08
FORMULA_NAME FireWire-PT-15-LTLFireability-09
FORMULA_NAME FireWire-PT-15-LTLFireability-10
FORMULA_NAME FireWire-PT-15-LTLFireability-11
FORMULA_NAME FireWire-PT-15-LTLFireability-12
FORMULA_NAME FireWire-PT-15-LTLFireability-13
FORMULA_NAME FireWire-PT-15-LTLFireability-14
FORMULA_NAME FireWire-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779831501231

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 21:38:23] [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 21:38:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 21:38:24] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2026-05-26 21:38:24] [INFO ] Transformed 248 places.
[2026-05-26 21:38:24] [INFO ] Transformed 383 transitions.
[2026-05-26 21:38:24] [INFO ] Found NUPN structural information;
[2026-05-26 21:38:24] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA FireWire-PT-15-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 243 transition count 383
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 56 place count 192 transition count 332
Iterating global reduction 1 with 51 rules applied. Total rules applied 107 place count 192 transition count 332
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 192 transition count 331
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 117 place count 183 transition count 320
Iterating global reduction 2 with 9 rules applied. Total rules applied 126 place count 183 transition count 320
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 181 transition count 317
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 181 transition count 317
Applied a total of 130 rules in 129 ms. Remains 181 /248 variables (removed 67) and now considering 317/383 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9014124076114406956.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9767119542636294390.kers'
[2026-05-26 21:38:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9014124076114406956.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9767119542636294390.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 181 cols 990 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-26 21:38:24] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9767119542636294390.kers
Total runtime 4 ms.
[2026-05-26 21:38:25] [INFO ] Implicit Places using invariants in 591 ms returned []
[2026-05-26 21:38:25] [INFO ] Invariant cache hit.
[2026-05-26 21:38:26] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2026-05-26 21:38:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Problem TDEAD139 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 13/17 constraints. Problems are: Problem set: 18 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 2/19 constraints. Problems are: Problem set: 18 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/19 constraints. Problems are: Problem set: 18 solved, 298 unsolved
At refinement iteration 5 (OVERLAPS) 317/498 variables, 181/200 constraints. Problems are: Problem set: 18 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 1/201 constraints. Problems are: Problem set: 18 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/498 variables, and 201 constraints, problems are : Problem set: 18 solved, 298 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 16/20 constraints. Problems are: Problem set: 18 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 18 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 317/498 variables, 181/201 constraints. Problems are: Problem set: 18 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 298/499 constraints. Problems are: Problem set: 18 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 2/501 constraints. Problems are: Problem set: 18 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 502 constraints, problems are : Problem set: 18 solved, 298 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 298/316 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60366ms problems are : Problem set: 18 solved, 298 unsolved
Search for dead transitions found 18 dead transitions in 60401ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 181/248 places, 299/383 transitions.
Applied a total of 0 rules in 12 ms. Remains 181 /181 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61946 ms. Remains : 181/248 places, 299/383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 299/299 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 299/299 (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-15792879089245394083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10879253202559973822.kers'
[2026-05-26 21:39:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15792879089245394083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10879253202559973822.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 181 cols 918 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-26 21:39:26] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-10879253202559973822.kers
Total runtime 20 ms.
[2026-05-26 21:39:26] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-26 21:39:26] [INFO ] Invariant cache hit.
[2026-05-26 21:39:27] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2026-05-26 21:39:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Problem TDEAD140 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 17/21 constraints. Problems are: Problem set: 29 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/24 constraints. Problems are: Problem set: 29 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/26 constraints. Problems are: Problem set: 29 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/26 constraints. Problems are: Problem set: 29 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 299/480 variables, 181/207 constraints. Problems are: Problem set: 29 solved, 269 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/480 variables, and 209 constraints, problems are : Problem set: 29 solved, 269 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 29 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 4/4 constraints. Problems are: Problem set: 29 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 24/28 constraints. Problems are: Problem set: 29 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/28 constraints. Problems are: Problem set: 29 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 299/480 variables, 181/209 constraints. Problems are: Problem set: 29 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 269/478 constraints. Problems are: Problem set: 29 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 2/480 constraints. Problems are: Problem set: 29 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 480 constraints, problems are : Problem set: 29 solved, 269 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 269/298 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 29 solved, 269 unsolved
Search for dead transitions found 29 dead transitions in 60136ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 181/181 places, 270/299 transitions.
Applied a total of 0 rules in 4 ms. Remains 181 /181 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60848 ms. Remains : 181/181 places, 270/299 transitions.
Support contains 47 out of 181 places after structural reductions.
[2026-05-26 21:40:27] [INFO ] Flatten gal took : 69 ms
[2026-05-26 21:40:27] [INFO ] Flatten gal took : 33 ms
[2026-05-26 21:40:27] [INFO ] Input system was already deterministic with 270 transitions.
Support contains 46 out of 181 places (down from 47) after GAL structural reductions.
RANDOM walk for 40000 steps (14 resets) in 2324 ms. (17 steps per ms) remains 26/33 properties
BEST_FIRST walk for 4001 steps (12 resets) in 310 ms. (12 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (11 resets) in 197 ms. (20 steps per ms) remains 23/26 properties
BEST_FIRST walk for 4000 steps (10 resets) in 175 ms. (22 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 152 ms. (26 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (15 resets) in 224 ms. (17 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (12 resets) in 189 ms. (21 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (13 resets) in 97 ms. (40 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (9 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (11 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (16 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (10 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (11 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (9 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (9 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (9 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (10 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (9 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (9 resets) in 57 ms. (68 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 4001 steps (9 resets) in 28 ms. (137 steps per ms) remains 23/23 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4944149740073619716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10279642727812691176.kers'
[2026-05-26 21:40:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4944149740073619716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10279642727812691176.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 270 rows 181 cols 802 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-26 21:40:29] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10279642727812691176.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 134/169 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 7/11 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 258/427 variables, 169/181 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/181 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 12/439 variables, 6/187 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/187 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 8/447 variables, 3/190 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/190 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 4/451 variables, 3/193 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 1/194 constraints. Problems are: Problem set: 4 solved, 19 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 451/451 variables, and 194 constraints, problems are : Problem set: 4 solved, 19 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 19 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 140/169 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 9/13 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 258/427 variables, 169/182 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 18/200 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/200 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 12/439 variables, 6/206 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/206 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 8/447 variables, 3/209 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 1/210 constraints. Problems are: Problem set: 5 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/451 variables, and 210 constraints, problems are : Problem set: 5 solved, 18 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/181 constraints, PredecessorRefiner: 18/23 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10037ms problems are : Problem set: 5 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 270/270 transitions.
Graph (trivial) has 102 edges and 181 vertex of which 6 / 181 are part of one of the 2 SCC in 11 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 177 transition count 251
Reduce places removed 12 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 14 rules applied. Total rules applied 27 place count 165 transition count 249
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 32 place count 164 transition count 245
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 36 place count 160 transition count 245
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 36 place count 160 transition count 234
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 58 place count 149 transition count 234
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 63 place count 144 transition count 229
Iterating global reduction 4 with 5 rules applied. Total rules applied 68 place count 144 transition count 229
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 70 place count 142 transition count 227
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 142 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 142 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 75 place count 141 transition count 225
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 76 place count 140 transition count 224
Iterating global reduction 6 with 1 rules applied. Total rules applied 77 place count 140 transition count 224
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 78 place count 139 transition count 223
Iterating global reduction 6 with 1 rules applied. Total rules applied 79 place count 139 transition count 223
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 6 with 32 rules applied. Total rules applied 111 place count 123 transition count 207
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 135 place count 111 transition count 281
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 137 place count 111 transition count 279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 139 place count 110 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 147 place count 110 transition count 288
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 154 place count 110 transition count 281
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 161 place count 103 transition count 281
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 163 place count 103 transition count 281
Applied a total of 163 rules in 222 ms. Remains 103 /181 variables (removed 78) and now considering 281/270 (removed -11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 103/181 places, 281/270 transitions.
RANDOM walk for 40000 steps (3941 resets) in 744 ms. (53 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (111 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (137 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (117 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (117 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (115 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (64 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (107 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (118 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (118 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (104 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (122 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (123 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (112 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (121 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (109 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (119 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (120 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (122 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 135967 steps, run visited all 18 properties in 681 ms. (steps per millisecond=199 )
Probabilistic random walk after 135967 steps, saw 35285 distinct states, run finished after 687 ms. (steps per millisecond=197 ) properties seen :18
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA FireWire-PT-15-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 44 stabilizing places and 53 stable transitions
FORMULA FireWire-PT-15-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))'
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 270/270 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 164 transition count 225
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 164 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 164 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 161 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 161 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 161 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 160 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 160 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 159 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 159 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 158 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 158 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 157 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 157 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 156 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 156 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 155 transition count 213
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 155 transition count 213
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 154 transition count 212
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 154 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 153 transition count 211
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 153 transition count 211
Applied a total of 58 rules in 42 ms. Remains 153 /181 variables (removed 28) and now considering 211/270 (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-6005180042900020878.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10107380873739018587.kers'
[2026-05-26 21:40:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6005180042900020878.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10107380873739018587.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 153 cols 598 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-26 21:40:41] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10107380873739018587.kers
Total runtime 2 ms.
[2026-05-26 21:40:41] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-26 21:40:41] [INFO ] Invariant cache hit.
[2026-05-26 21:40:41] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2026-05-26 21:40:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Problem TDEAD125 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 211/364 variables, 153/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/364 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 175 constraints, problems are : Problem set: 1 solved, 209 unsolved in 27189 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 18/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 4/27 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 211/364 variables, 153/181 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 209/390 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 3/393 constraints. Problems are: Problem set: 1 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 393 constraints, problems are : Problem set: 1 solved, 209 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 209/210 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57270ms problems are : Problem set: 1 solved, 209 unsolved
Search for dead transitions found 1 dead transitions in 57272ms
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 : 153/181 places, 210/270 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 151 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 151 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 150 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 150 transition count 207
Applied a total of 6 rules in 20 ms. Remains 150 /153 variables (removed 3) and now considering 207/210 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13848534963110797276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12151561374125183946.kers'
[2026-05-26 21:41:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13848534963110797276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12151561374125183946.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 150 cols 584 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-26 21:41:38] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12151561374125183946.kers
Total runtime 2 ms.
[2026-05-26 21:41:39] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-26 21:41:39] [INFO ] Invariant cache hit.
[2026-05-26 21:41:39] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/181 places, 207/270 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58352 ms. Remains : 150/181 places, 207/270 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))'
Stuttering acceptance computed with spot in 322 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-15-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 348 ms.
Product exploration explored 100000 steps with 50000 reset in 284 ms.
Computed a total of 28 stabilizing places and 36 stable transitions
Computed a total of 28 stabilizing places and 36 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 17 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 31 ms.
FORMULA FireWire-PT-15-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-15-LTLFireability-00 finished in 59458 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(p1))) U (p2 U p3))&&X(F(p1))))'
Support contains 5 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 270/270 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 167 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 167 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 167 transition count 227
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 164 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 164 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 164 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 163 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 163 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 162 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 162 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 161 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 161 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 160 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 160 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 159 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 159 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 158 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 158 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 157 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 157 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 156 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 156 transition count 214
Applied a total of 52 rules in 24 ms. Remains 156 /181 variables (removed 25) and now considering 214/270 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4623282112076201076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9489937398309888728.kers'
[2026-05-26 21:41:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4623282112076201076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9489937398309888728.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 156 cols 604 entries
Finished phase 1 with 152 SingleSign rule and 0 generalized
[2026-05-26 21:41:40] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9489937398309888728.kers
Total runtime 1 ms.
[2026-05-26 21:41:40] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-26 21:41:40] [INFO ] Invariant cache hit.
[2026-05-26 21:41:40] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-26 21:41:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Problem TDEAD128 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 12/16 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 2/18 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 3/21 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 5/26 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 214/370 variables, 156/182 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 1/183 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 1/184 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 2/186 constraints. Problems are: Problem set: 1 solved, 212 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 186 constraints, problems are : Problem set: 1 solved, 212 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 26/30 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 214/370 variables, 156/186 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 212/398 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1/399 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 1/400 constraints. Problems are: Problem set: 1 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 400 constraints, problems are : Problem set: 1 solved, 212 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 212/213 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60052ms problems are : Problem set: 1 solved, 212 unsolved
Search for dead transitions found 1 dead transitions in 60053ms
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 : 156/181 places, 213/270 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 155 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 155 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 154 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 154 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 153 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 153 transition count 210
Applied a total of 6 rules in 7 ms. Remains 153 /156 variables (removed 3) and now considering 210/213 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12577791556103788089.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8869094509771997660.kers'
[2026-05-26 21:42:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12577791556103788089.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8869094509771997660.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 153 cols 590 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-26 21:42:40] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8869094509771997660.kers
Total runtime 2 ms.
[2026-05-26 21:42:41] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-26 21:42:41] [INFO ] Invariant cache hit.
[2026-05-26 21:42:41] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 153/181 places, 210/270 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60917 ms. Remains : 153/181 places, 210/270 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(p1))) U (p2 U p3))&&X(F(p1))))'
Stuttering acceptance computed with spot in 473 ms :[(OR (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-15-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-03 finished in 61466 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((p0||X(G(p0))||((p1||X(p2)) U (G((p1||X(p2)))||(p3&&(p1||X(p2)))))))))'
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 270/270 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 167 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 167 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 167 transition count 227
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 164 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 164 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 164 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 163 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 163 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 162 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 162 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 161 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 161 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 160 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 160 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 159 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 159 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 158 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 158 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 157 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 157 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 156 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 156 transition count 214
Applied a total of 52 rules in 30 ms. Remains 156 /181 variables (removed 25) and now considering 214/270 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-21037697497094783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5625293414182303675.kers'
[2026-05-26 21:42:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-21037697497094783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5625293414182303675.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 156 cols 604 entries
Finished phase 1 with 152 SingleSign rule and 0 generalized
[2026-05-26 21:42:41] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5625293414182303675.kers
Total runtime 2 ms.
[2026-05-26 21:42:42] [INFO ] Implicit Places using invariants in 209 ms returned []
[2026-05-26 21:42:42] [INFO ] Invariant cache hit.
[2026-05-26 21:42:42] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-26 21:42:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Problem TDEAD128 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 11/15 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 7/22 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 214/370 variables, 156/178 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/370 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 178 constraints, problems are : Problem set: 1 solved, 212 unsolved in 25609 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 18/22 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 214/370 variables, 156/178 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 212/390 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1/391 constraints. Problems are: Problem set: 1 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 391 constraints, problems are : Problem set: 1 solved, 212 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 212/213 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55652ms problems are : Problem set: 1 solved, 212 unsolved
Search for dead transitions found 1 dead transitions in 55653ms
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 : 156/181 places, 213/270 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 155 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 155 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 154 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 154 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 153 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 153 transition count 210
Applied a total of 6 rules in 7 ms. Remains 153 /156 variables (removed 3) and now considering 210/213 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8922355217540057712.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15821885661068641833.kers'
[2026-05-26 21:43:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8922355217540057712.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15821885661068641833.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 153 cols 590 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-26 21:43:38] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15821885661068641833.kers
Total runtime 2 ms.
[2026-05-26 21:43:38] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-26 21:43:38] [INFO ] Invariant cache hit.
[2026-05-26 21:43:38] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 153/181 places, 210/270 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56787 ms. Remains : 153/181 places, 210/270 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((p0||X(G(p0))||((p1||X(p2)) U (G((p1||X(p2)))||(p3&&(p1||X(p2)))))))))'
Stuttering acceptance computed with spot in 489 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Product exploration explored 100000 steps with 33333 reset in 170 ms.
Computed a total of 29 stabilizing places and 37 stable transitions
Computed a total of 29 stabilizing places and 37 stable transitions
Detected a total of 29/153 stabilizing places and 37/210 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 36 ms. Proved property starting from automaton with 9 states, 16 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 60 ms.
FORMULA FireWire-PT-15-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-15-LTLFireability-05 finished in 57732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (!p1&&X(X(X(X(p2)))))))'
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 270/270 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 165 transition count 226
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 165 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 165 transition count 225
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 162 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 162 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 162 transition count 220
Applied a total of 40 rules in 8 ms. Remains 162 /181 variables (removed 19) and now considering 220/270 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6053071481957096729.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5948787180766762868.kers'
[2026-05-26 21:43:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6053071481957096729.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5948787180766762868.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 162 cols 632 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-26 21:43:39] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5948787180766762868.kers
Total runtime 3 ms.
[2026-05-26 21:43:39] [INFO ] Implicit Places using invariants in 206 ms returned []
[2026-05-26 21:43:39] [INFO ] Invariant cache hit.
[2026-05-26 21:43:40] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-26 21:43:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Problem TDEAD126 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 8/21 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/24 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 220/382 variables, 162/186 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 218 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 186 constraints, problems are : Problem set: 1 solved, 218 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/24 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 220/382 variables, 162/187 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 218/405 constraints. Problems are: Problem set: 1 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 1/406 constraints. Problems are: Problem set: 1 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/382 variables, and 407 constraints, problems are : Problem set: 1 solved, 218 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 218/219 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60061ms problems are : Problem set: 1 solved, 218 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 : 162/181 places, 219/270 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60642 ms. Remains : 162/181 places, 219/270 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (!p1&&X(X(X(X(p2)))))))'
Stuttering acceptance computed with spot in 1733 ms :[(OR (NOT p2) p1), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-07
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-07 finished in 62469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F(p1)))))))'
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 270/270 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 164 transition count 225
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 164 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 164 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 161 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 161 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 161 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 160 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 160 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 159 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 159 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 158 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 158 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 157 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 157 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 156 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 156 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 155 transition count 213
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 155 transition count 213
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 154 transition count 212
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 154 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 153 transition count 211
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 153 transition count 211
Applied a total of 58 rules in 22 ms. Remains 153 /181 variables (removed 28) and now considering 211/270 (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-853308312669732890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12093065931116998696.kers'
[2026-05-26 21:44:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-853308312669732890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12093065931116998696.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 153 cols 598 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-26 21:44:42] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12093065931116998696.kers
Total runtime 2 ms.
[2026-05-26 21:44:42] [INFO ] Implicit Places using invariants in 210 ms returned []
[2026-05-26 21:44:42] [INFO ] Invariant cache hit.
[2026-05-26 21:44:42] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2026-05-26 21:44:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Problem TDEAD125 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 211/364 variables, 153/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/364 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 175 constraints, problems are : Problem set: 1 solved, 209 unsolved in 26248 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 18/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 4/27 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 211/364 variables, 153/181 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 209/390 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 3/393 constraints. Problems are: Problem set: 1 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 393 constraints, problems are : Problem set: 1 solved, 209 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 209/210 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56282ms problems are : Problem set: 1 solved, 209 unsolved
Search for dead transitions found 1 dead transitions in 56284ms
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 : 153/181 places, 210/270 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 151 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 151 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 150 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 150 transition count 207
Applied a total of 6 rules in 9 ms. Remains 150 /153 variables (removed 3) and now considering 207/210 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14227467491862404252.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2126362892490548537.kers'
[2026-05-26 21:45:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14227467491862404252.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2126362892490548537.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 150 cols 584 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-26 21:45:39] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2126362892490548537.kers
Total runtime 2 ms.
[2026-05-26 21:45:39] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-26 21:45:39] [INFO ] Invariant cache hit.
[2026-05-26 21:45:39] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/181 places, 207/270 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57380 ms. Remains : 150/181 places, 207/270 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p0))||p1)))))'
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 124 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA FireWire-PT-15-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-15-LTLFireability-08 finished in 57763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!(p0 U p1)&&X(p0))) U p2))'
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 270/270 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 165 transition count 235
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 165 transition count 235
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 162 transition count 231
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 162 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 162 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 161 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 161 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 160 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 160 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 159 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 159 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 158 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 158 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 157 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 157 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 156 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 156 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 155 transition count 223
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 155 transition count 223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 154 transition count 222
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 154 transition count 222
Applied a total of 55 rules in 25 ms. Remains 154 /181 variables (removed 27) and now considering 222/270 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5616686007196180958.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15530671273944551669.kers'
[2026-05-26 21:45:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5616686007196180958.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15530671273944551669.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 154 cols 640 entries
Finished phase 1 with 150 SingleSign rule and 0 generalized
[2026-05-26 21:45:39] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15530671273944551669.kers
Total runtime 2 ms.
[2026-05-26 21:45:40] [INFO ] Implicit Places using invariants in 204 ms returned []
[2026-05-26 21:45:40] [INFO ] Invariant cache hit.
[2026-05-26 21:45:40] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-26 21:45:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Problem TDEAD126 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 5/18 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 222/376 variables, 154/172 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 1/174 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 220 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/376 variables, 1/175 constraints. Problems are: Problem set: 1 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/376 variables, and 175 constraints, problems are : Problem set: 1 solved, 220 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 17/21 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 3/24 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 222/376 variables, 154/179 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 220/399 constraints. Problems are: Problem set: 1 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 220 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 399 constraints, problems are : Problem set: 1 solved, 220 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 220/221 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 1 solved, 220 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 : 154/181 places, 221/270 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 152 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 152 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 151 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 151 transition count 218
Applied a total of 6 rules in 8 ms. Remains 151 /154 variables (removed 3) and now considering 218/221 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6248269379680970740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6920009419165270494.kers'
[2026-05-26 21:46:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6248269379680970740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6920009419165270494.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 151 cols 626 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-26 21:46:40] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6920009419165270494.kers
Total runtime 2 ms.
[2026-05-26 21:46:40] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-26 21:46:40] [INFO ] Invariant cache hit.
[2026-05-26 21:46:41] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/181 places, 218/270 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61119 ms. Remains : 151/181 places, 218/270 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!(p0 U p1)&&X(p0))) U p2))'
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : FireWire-PT-15-LTLFireability-10
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-15-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-10 finished in 61378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 270/270 transitions.
Graph (trivial) has 134 edges and 181 vertex of which 12 / 181 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 171 transition count 238
Reduce places removed 21 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 23 rules applied. Total rules applied 45 place count 150 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 149 transition count 236
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 46 place count 149 transition count 222
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 74 place count 135 transition count 222
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 86 place count 123 transition count 182
Iterating global reduction 3 with 12 rules applied. Total rules applied 98 place count 123 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 123 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 100 place count 123 transition count 178
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 104 place count 121 transition count 178
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 107 place count 118 transition count 174
Iterating global reduction 4 with 3 rules applied. Total rules applied 110 place count 118 transition count 174
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 112 place count 118 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 113 place count 117 transition count 172
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 114 place count 116 transition count 171
Iterating global reduction 6 with 1 rules applied. Total rules applied 115 place count 116 transition count 171
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 116 place count 115 transition count 170
Iterating global reduction 6 with 1 rules applied. Total rules applied 117 place count 115 transition count 170
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 118 place count 114 transition count 169
Iterating global reduction 6 with 1 rules applied. Total rules applied 119 place count 114 transition count 169
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 149 place count 99 transition count 154
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
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 181 place count 83 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 197 place count 83 transition count 202
Applied a total of 197 rules in 116 ms. Remains 83 /181 variables (removed 98) and now considering 202/270 (removed 68) transitions.
[2026-05-26 21:46:41] [INFO ] Flow matrix only has 191 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-4903128000660460747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12994763622680516069.kers'
[2026-05-26 21:46:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4903128000660460747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12994763622680516069.kers]
Normalized transition count is 190 out of 191 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 83 cols 674 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-26 21:46:41] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12994763622680516069.kers
Total runtime 2 ms.
[2026-05-26 21:46:41] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-26 21:46:41] [INFO ] Flow matrix only has 191 transitions (discarded 11 similar events)
[2026-05-26 21:46:41] [INFO ] Invariant cache hit.
[2026-05-26 21:46:41] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-26 21:46:41] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2026-05-26 21:46:41] [INFO ] Redundant transitions in 10 ms returned []
Running 199 sub problems to find dead transitions.
[2026-05-26 21:46:41] [INFO ] Flow matrix only has 191 transitions (discarded 11 similar events)
[2026-05-26 21:46:41] [INFO ] Invariant cache hit.
[2026-05-26 21:46:41] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 6/10 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 190/273 variables, 83/93 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 27/120 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/120 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/120 constraints. Problems are: Problem set: 3 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/274 variables, and 120 constraints, problems are : Problem set: 3 solved, 196 unsolved in 10828 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 190/273 variables, 83/93 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 27/120 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 196/316 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/316 constraints. Problems are: Problem set: 3 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/274 variables, and 316 constraints, problems are : Problem set: 3 solved, 196 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 196/199 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40900ms problems are : Problem set: 3 solved, 196 unsolved
Search for dead transitions found 3 dead transitions in 40903ms
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 : 83/181 places, 199/270 transitions.
Applied a total of 0 rules in 7 ms. Remains 83 /83 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2026-05-26 21:47:22] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 41482 ms. Remains : 83/181 places, 199/270 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 38 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-13 finished in 41559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G((F(p1)&&F(G(p2))))))))'
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 270/270 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 166 transition count 227
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 166 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 166 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 163 transition count 222
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 163 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 163 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 162 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 162 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 161 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 161 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 160 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 160 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 159 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 159 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 158 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 158 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 157 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 157 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 156 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 156 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 155 transition count 213
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 155 transition count 213
Applied a total of 54 rules in 23 ms. Remains 155 /181 variables (removed 26) and now considering 213/270 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10992830767228322280.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15018981350925472807.kers'
[2026-05-26 21:47:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10992830767228322280.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15018981350925472807.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 155 cols 602 entries
Finished phase 1 with 151 SingleSign rule and 0 generalized
[2026-05-26 21:47:22] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15018981350925472807.kers
Total runtime 2 ms.
[2026-05-26 21:47:23] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-26 21:47:23] [INFO ] Invariant cache hit.
[2026-05-26 21:47:23] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2026-05-26 21:47:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Problem TDEAD127 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 4/17 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 2/19 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 213/368 variables, 155/174 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 2/176 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 176 constraints, problems are : Problem set: 1 solved, 211 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 17/21 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 213/368 variables, 155/176 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 211/387 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 1/388 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/389 constraints. Problems are: Problem set: 1 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 389 constraints, problems are : Problem set: 1 solved, 211 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 211/212 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60063ms problems are : Problem set: 1 solved, 211 unsolved
Search for dead transitions found 1 dead transitions in 60065ms
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 : 155/181 places, 212/270 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 153 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 153 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 152 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 152 transition count 209
Applied a total of 6 rules in 9 ms. Remains 152 /155 variables (removed 3) and now considering 209/212 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15552735062890740960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13547223460473769801.kers'
[2026-05-26 21:48:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15552735062890740960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13547223460473769801.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 152 cols 588 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-26 21:48:23] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13547223460473769801.kers
Total runtime 1 ms.
[2026-05-26 21:48:23] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-26 21:48:23] [INFO ] Invariant cache hit.
[2026-05-26 21:48:23] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/181 places, 209/270 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61033 ms. Remains : 152/181 places, 209/270 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G((F(p1)&&F(G(p2))))))))'
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-14
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-14 finished in 61382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||G(p2)))&&F(!p2)))'
Support contains 5 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 270/270 transitions.
Graph (trivial) has 129 edges and 181 vertex of which 12 / 181 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 171 transition count 241
Reduce places removed 18 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 20 rules applied. Total rules applied 39 place count 153 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 152 transition count 239
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 40 place count 152 transition count 226
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 66 place count 139 transition count 226
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 76 place count 129 transition count 206
Iterating global reduction 3 with 10 rules applied. Total rules applied 86 place count 129 transition count 206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 86 place count 129 transition count 204
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 90 place count 127 transition count 204
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 124 transition count 200
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 124 transition count 200
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 3 with 2 rules applied. Total rules applied 98 place count 124 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 123 transition count 198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 100 place count 122 transition count 197
Iterating global reduction 5 with 1 rules applied. Total rules applied 101 place count 122 transition count 197
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 102 place count 121 transition count 196
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 121 transition count 196
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 104 place count 120 transition count 195
Iterating global reduction 5 with 1 rules applied. Total rules applied 105 place count 120 transition count 195
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 106 place count 119 transition count 194
Iterating global reduction 5 with 1 rules applied. Total rules applied 107 place count 119 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 108 place count 118 transition count 193
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 118 transition count 193
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 110 place count 117 transition count 192
Iterating global reduction 5 with 1 rules applied. Total rules applied 111 place count 117 transition count 192
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 112 place count 116 transition count 191
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 116 transition count 191
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 114 place count 115 transition count 190
Iterating global reduction 5 with 1 rules applied. Total rules applied 115 place count 115 transition count 190
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 5 with 30 rules applied. Total rules applied 145 place count 100 transition count 175
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 175 place count 85 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 191 place count 85 transition count 256
Applied a total of 191 rules in 77 ms. Remains 85 /181 variables (removed 96) and now considering 256/270 (removed 14) transitions.
[2026-05-26 21:48:24] [INFO ] Flow matrix only has 246 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16460867350315915105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11312349060207988063.kers'
[2026-05-26 21:48:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16460867350315915105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11312349060207988063.kers]
Normalized transition count is 245 out of 246 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 245 rows 85 cols 870 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-26 21:48:24] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11312349060207988063.kers
Total runtime 2 ms.
[2026-05-26 21:48:24] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-26 21:48:24] [INFO ] Flow matrix only has 246 transitions (discarded 10 similar events)
[2026-05-26 21:48:24] [INFO ] Invariant cache hit.
[2026-05-26 21:48:24] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-26 21:48:24] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2026-05-26 21:48:24] [INFO ] Redundant transitions in 7 ms returned []
Running 253 sub problems to find dead transitions.
[2026-05-26 21:48:24] [INFO ] Flow matrix only has 246 transitions (discarded 10 similar events)
[2026-05-26 21:48:24] [INFO ] Invariant cache hit.
[2026-05-26 21:48:24] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Problem TDEAD17 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 245/330 variables, 85/96 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 30/126 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 126 constraints, problems are : Problem set: 1 solved, 252 unsolved in 16568 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 1/85 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 245/330 variables, 85/96 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 30/126 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 252/378 constraints. Problems are: Problem set: 1 solved, 252 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 330/331 variables, and 378 constraints, problems are : Problem set: 1 solved, 252 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 252/253 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46679ms problems are : Problem set: 1 solved, 252 unsolved
Search for dead transitions found 1 dead transitions in 46680ms
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 SI_LTL mode, iteration 1 : 85/181 places, 255/270 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 83 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 83 transition count 253
Applied a total of 4 rules in 18 ms. Remains 83 /85 variables (removed 2) and now considering 253/255 (removed 2) transitions.
[2026-05-26 21:49:11] [INFO ] Flow matrix only has 243 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8387214990480590689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9978830118420193701.kers'
[2026-05-26 21:49:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8387214990480590689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9978830118420193701.kers]
Normalized transition count is 242 out of 243 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 242 rows 83 cols 858 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-26 21:49:11] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9978830118420193701.kers
Total runtime 4 ms.
[2026-05-26 21:49:11] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-26 21:49:11] [INFO ] Flow matrix only has 243 transitions (discarded 10 similar events)
[2026-05-26 21:49:11] [INFO ] Invariant cache hit.
[2026-05-26 21:49:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-26 21:49:11] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/181 places, 253/270 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47648 ms. Remains : 83/181 places, 253/270 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||G(p2)))&&F(!p2)))'
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) p2), true, p2, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-15 finished in 47907 ms.
All properties solved by simple procedures.
Total runtime 648358 ms.

BK_STOP 1779832152180

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

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