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.r082-smll-177946993600156.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 DBSingleClientW-PT-d1m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.4K Mar 6 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 6 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 6 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 6 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Mar 6 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 432K 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 DBSingleClientW-PT-d1m06-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779567483334

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 20:18:05] [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-23 20:18:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 20:18:05] [INFO ] Load time of PNML (sax parser for PT used): 324 ms
[2026-05-23 20:18:05] [INFO ] Transformed 1440 places.
[2026-05-23 20:18:05] [INFO ] Transformed 672 transitions.
[2026-05-23 20:18:05] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 507 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1093 places in 12 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 181 place count 246 transition count 428
Iterating global reduction 1 with 80 rules applied. Total rules applied 261 place count 246 transition count 428
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 285 place count 246 transition count 404
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 343 place count 188 transition count 346
Iterating global reduction 2 with 58 rules applied. Total rules applied 401 place count 188 transition count 346
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 404 place count 188 transition count 343
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 427 place count 165 transition count 311
Iterating global reduction 3 with 23 rules applied. Total rules applied 450 place count 165 transition count 311
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 476 place count 165 transition count 285
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 479 place count 162 transition count 280
Iterating global reduction 4 with 3 rules applied. Total rules applied 482 place count 162 transition count 280
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 483 place count 161 transition count 279
Iterating global reduction 4 with 1 rules applied. Total rules applied 484 place count 161 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 486 place count 161 transition count 277
Applied a total of 486 rules in 214 ms. Remains 161 /347 variables (removed 186) and now considering 277/672 (removed 395) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13778773462935938363.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6417245503039875346.kers'
[2026-05-23 20:18:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13778773462935938363.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6417245503039875346.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 277 rows 161 cols 823 entries
Finished phase 1 with 153 SingleSign rule and 6 generalized
[2026-05-23 20:18:06] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6417245503039875346.kers
Total runtime 5 ms.
[2026-05-23 20:18:07] [INFO ] Implicit Places using invariants in 685 ms returned []
[2026-05-23 20:18:07] [INFO ] Invariant cache hit.
[2026-05-23 20:18:07] [INFO ] State equation strengthened by 132 read => feed constraints.
[2026-05-23 20:18:08] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2026-05-23 20:18:08] [INFO ] Invariant cache hit.
[2026-05-23 20:18:08] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 277/438 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 132/295 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 296 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 1/161 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 277/438 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 132/296 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 276/572 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 572 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60930ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60961ms
Starting structural reductions in LTL mode, iteration 1 : 161/347 places, 277/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63482 ms. Remains : 161/347 places, 277/672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 277/277 transitions.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2026-05-23 20:19:09] [INFO ] Invariant cache hit.
[2026-05-23 20:19:09] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-23 20:19:09] [INFO ] Invariant cache hit.
[2026-05-23 20:19:10] [INFO ] State equation strengthened by 132 read => feed constraints.
[2026-05-23 20:19:10] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1244 ms. Remains : 161/161 places, 277/277 transitions.
Support contains 35 out of 161 places after structural reductions.
[2026-05-23 20:19:11] [INFO ] Flatten gal took : 94 ms
[2026-05-23 20:19:11] [INFO ] Flatten gal took : 48 ms
[2026-05-23 20:19:11] [INFO ] Input system was already deterministic with 277 transitions.
Reduction of identical properties reduced properties to check from 31 to 29
RANDOM walk for 40000 steps (9181 resets) in 4717 ms. (8 steps per ms) remains 24/29 properties
BEST_FIRST walk for 4004 steps (187 resets) in 51 ms. (77 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (202 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (390 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (165 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (180 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (179 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (206 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (381 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (192 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (210 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (194 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (182 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (189 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (201 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (199 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (190 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (190 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (379 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (188 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (186 resets) in 16 ms. (235 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4004 steps (180 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (194 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (400 resets) in 28 ms. (137 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (178 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
[2026-05-23 20:19:13] [INFO ] Invariant cache hit.
[2026-05-23 20:19:13] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 52/79 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 41/120 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 229/349 variables, 120/123 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 84/207 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 9 (OVERLAPS) 89/438 variables, 41/248 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 48/296 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 0/296 constraints. Problems are: Problem set: 2 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/438 variables, 0/296 constraints. Problems are: Problem set: 2 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 296 constraints, problems are : Problem set: 2 solved, 20 unsolved in 3719 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 53/79 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 41/120 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 229/349 variables, 120/123 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 84/207 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 2/209 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 89/438 variables, 41/250 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 48/298 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 18/316 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 316 constraints, problems are : Problem set: 2 solved, 20 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 20/22 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8788ms problems are : Problem set: 2 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 277/277 transitions.
Graph (complete) has 542 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 160 transition count 273
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 155 transition count 260
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 155 transition count 260
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 151 transition count 256
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 151 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 148 transition count 252
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 148 transition count 252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 148 transition count 250
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 147 transition count 249
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 147 transition count 249
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 146 transition count 247
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 146 transition count 247
Applied a total of 35 rules in 75 ms. Remains 146 /161 variables (removed 15) and now considering 247/277 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 146/161 places, 247/277 transitions.
RANDOM walk for 40000 steps (9149 resets) in 879 ms. (45 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (184 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (188 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (192 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (180 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (181 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (388 resets) in 42 ms. (93 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (179 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (191 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (195 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (197 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (201 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (183 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (190 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (383 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (185 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (173 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (180 resets) in 63 ms. (62 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (188 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (395 resets) in 40 ms. (97 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (188 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
Finished probabilistic random walk after 6060 steps, run visited all 20 properties in 135 ms. (steps per millisecond=44 )
Probabilistic random walk after 6060 steps, saw 2785 distinct states, run finished after 143 ms. (steps per millisecond=42 ) properties seen :20
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 24 stable transitions
Graph (complete) has 596 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((F((X(X(X(p1))) U p1))&&p0))||p2))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 277/277 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 139 transition count 204
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 139 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 139 transition count 203
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 121 transition count 181
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 121 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 121 transition count 178
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 100 place count 105 transition count 155
Iterating global reduction 2 with 16 rules applied. Total rules applied 116 place count 105 transition count 155
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 125 place count 105 transition count 146
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 132 place count 98 transition count 133
Iterating global reduction 3 with 7 rules applied. Total rules applied 139 place count 98 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 98 transition count 132
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 145 place count 93 transition count 127
Iterating global reduction 4 with 5 rules applied. Total rules applied 150 place count 93 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 152 place count 93 transition count 125
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 155 place count 90 transition count 117
Iterating global reduction 5 with 3 rules applied. Total rules applied 158 place count 90 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 90 transition count 116
Applied a total of 159 rules in 63 ms. Remains 90 /161 variables (removed 71) and now considering 116/277 (removed 161) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13607650846141367030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5355542101455406395.kers'
[2026-05-23 20:19:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13607650846141367030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5355542101455406395.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 90 cols 370 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-23 20:19:23] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5355542101455406395.kers
Total runtime 2 ms.
[2026-05-23 20:19:23] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-23 20:19:23] [INFO ] Invariant cache hit.
[2026-05-23 20:19:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-23 20:19:24] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2026-05-23 20:19:24] [INFO ] Redundant transitions in 4 ms returned []
Running 115 sub problems to find dead transitions.
[2026-05-23 20:19:24] [INFO ] Invariant cache hit.
[2026-05-23 20:19:24] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/206 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/133 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 135 constraints, problems are : Problem set: 0 solved, 115 unsolved in 12699 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/206 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 41/135 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 115/250 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 250 constraints, problems are : Problem set: 0 solved, 115 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42817ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 42818ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/161 places, 116/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43669 ms. Remains : 90/161 places, 116/277 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((F((X(X(X(p1))) U p1))&&p0))||p2))))'
Stuttering acceptance computed with spot in 305 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-04 finished in 44131 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((p1||X(F((p2||X(p1))))))&&p0) U X(p3)))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 277/277 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 142 transition count 219
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 142 transition count 219
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 142 transition count 218
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 55 place count 126 transition count 198
Iterating global reduction 1 with 16 rules applied. Total rules applied 71 place count 126 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 75 place count 126 transition count 194
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 90 place count 111 transition count 174
Iterating global reduction 2 with 15 rules applied. Total rules applied 105 place count 111 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 113 place count 111 transition count 166
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 121 place count 103 transition count 154
Iterating global reduction 3 with 8 rules applied. Total rules applied 129 place count 103 transition count 154
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 135 place count 103 transition count 148
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 139 place count 99 transition count 143
Iterating global reduction 4 with 4 rules applied. Total rules applied 143 place count 99 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 145 place count 99 transition count 141
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 98 transition count 135
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 98 transition count 135
Applied a total of 147 rules in 20 ms. Remains 98 /161 variables (removed 63) and now considering 135/277 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7145232021488458291.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5932308956585533574.kers'
[2026-05-23 20:20:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7145232021488458291.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5932308956585533574.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 98 cols 427 entries
Finished phase 1 with 94 SingleSign rule and 2 generalized
[2026-05-23 20:20:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5932308956585533574.kers
Total runtime 1 ms.
[2026-05-23 20:20:07] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-23 20:20:07] [INFO ] Invariant cache hit.
[2026-05-23 20:20:07] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-23 20:20:08] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-23 20:20:08] [INFO ] Invariant cache hit.
[2026-05-23 20:20:08] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/233 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 134 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/233 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 151 constraints, problems are : Problem set: 0 solved, 134 unsolved in 8816 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/233 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 134/285 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/233 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 285 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38914ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 38916ms
Starting structural reductions in LTL mode, iteration 1 : 98/161 places, 135/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39574 ms. Remains : 98/161 places, 135/277 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((p1||X(F((p2||X(p1))))))&&p0) U X(p3)))'
Stuttering acceptance computed with spot in 391 ms :[(NOT p3), (NOT p3), (AND (NOT p3) (NOT p2) (NOT p1)), (NOT p3), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-05 finished in 40013 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(p1)&&p0) U (X(G(p1)) U (G(p2)&&X(G(p3))))))'
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 277/277 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 141 transition count 205
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 141 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 141 transition count 204
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 56 place count 126 transition count 185
Iterating global reduction 1 with 15 rules applied. Total rules applied 71 place count 126 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 75 place count 126 transition count 181
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 90 place count 111 transition count 161
Iterating global reduction 2 with 15 rules applied. Total rules applied 105 place count 111 transition count 161
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 111 place count 111 transition count 155
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 119 place count 103 transition count 141
Iterating global reduction 3 with 8 rules applied. Total rules applied 127 place count 103 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 131 place count 103 transition count 137
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 136 place count 98 transition count 131
Iterating global reduction 4 with 5 rules applied. Total rules applied 141 place count 98 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 143 place count 98 transition count 129
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 145 place count 96 transition count 122
Iterating global reduction 5 with 2 rules applied. Total rules applied 147 place count 96 transition count 122
Applied a total of 147 rules in 16 ms. Remains 96 /161 variables (removed 65) and now considering 122/277 (removed 155) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18418133928233582755.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13091244834838544512.kers'
[2026-05-23 20:20:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18418133928233582755.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13091244834838544512.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 96 cols 396 entries
Finished phase 1 with 92 SingleSign rule and 2 generalized
[2026-05-23 20:20:47] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13091244834838544512.kers
Total runtime 1 ms.
[2026-05-23 20:20:47] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-23 20:20:47] [INFO ] Invariant cache hit.
[2026-05-23 20:20:47] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-23 20:20:48] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-23 20:20:48] [INFO ] Invariant cache hit.
[2026-05-23 20:20:48] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/218 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/139 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 143 constraints, problems are : Problem set: 0 solved, 121 unsolved in 10753 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/218 variables, 96/102 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 41/143 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 121/264 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/218 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 264 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40828ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 40828ms
Starting structural reductions in LTL mode, iteration 1 : 96/161 places, 122/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41526 ms. Remains : 96/161 places, 122/277 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(p1)&&p0) U (X(G(p1)) U (G(p2)&&X(G(p3))))))'
Stuttering acceptance computed with spot in 544 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p2) p1), (AND p1 (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-06 finished in 42162 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||X((X(X(!p1))&&G(!p2)))) U (G((!p0||X((X(X(!p1))&&G(!p2)))))||(!p3&&(!p0||X((X(X(!p1))&&G(!p2))))))))'
Support contains 7 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 277/277 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 143 transition count 214
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 143 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 143 transition count 213
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 129 transition count 195
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 129 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 129 transition count 192
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 81 place count 116 transition count 172
Iterating global reduction 2 with 13 rules applied. Total rules applied 94 place count 116 transition count 172
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 102 place count 116 transition count 164
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 109 place count 109 transition count 153
Iterating global reduction 3 with 7 rules applied. Total rules applied 116 place count 109 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 109 transition count 151
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 122 place count 105 transition count 147
Iterating global reduction 4 with 4 rules applied. Total rules applied 126 place count 105 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 128 place count 105 transition count 145
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 129 place count 104 transition count 144
Iterating global reduction 5 with 1 rules applied. Total rules applied 130 place count 104 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 131 place count 104 transition count 143
Applied a total of 131 rules in 16 ms. Remains 104 /161 variables (removed 57) and now considering 143/277 (removed 134) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8686868275114319671.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9406560050670225645.kers'
[2026-05-23 20:21:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8686868275114319671.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9406560050670225645.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 104 cols 447 entries
Finished phase 1 with 100 SingleSign rule and 2 generalized
[2026-05-23 20:21:29] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9406560050670225645.kers
Total runtime 2 ms.
[2026-05-23 20:21:29] [INFO ] Implicit Places using invariants in 193 ms returned []
[2026-05-23 20:21:29] [INFO ] Invariant cache hit.
[2026-05-23 20:21:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-23 20:21:30] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2026-05-23 20:21:30] [INFO ] Invariant cache hit.
[2026-05-23 20:21:30] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/247 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 56/162 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 162 constraints, problems are : Problem set: 0 solved, 142 unsolved in 10372 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/247 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 56/162 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 142/304 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/247 variables, and 304 constraints, problems are : Problem set: 0 solved, 142 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40473ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 40474ms
Starting structural reductions in LTL mode, iteration 1 : 104/161 places, 143/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41711 ms. Remains : 104/161 places, 143/277 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||X((X(X(!p1))&&G(!p2)))) U (G((!p0||X((X(X(!p1))&&G(!p2)))))||(!p3&&(!p0||X((X(X(!p1))&&G(!p2))))))))'
Stuttering acceptance computed with spot in 197 ms :[(OR (AND p0 p2) (AND p0 p1)), (OR p1 p2), true, p1, p2, p1]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-08
Product exploration explored 100000 steps with 25440 reset in 807 ms.
Product exploration explored 100000 steps with 25525 reset in 390 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 358 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 7 factoid took 66 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (9220 resets) in 761 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1933 resets) in 134 ms. (296 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (1947 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
[2026-05-23 20:22:13] [INFO ] Invariant cache hit.
[2026-05-23 20:22:13] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/171 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 70/241 variables, 32/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/247 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/247 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/171 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 70/241 variables, 32/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/247 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/247 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 945ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 137 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 143/143 transitions.
Graph (complete) has 328 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 103 transition count 141
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 99 transition count 131
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 99 transition count 131
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 95 transition count 127
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 95 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 95 transition count 126
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 91 transition count 122
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 91 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 91 transition count 121
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 89 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 89 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 88 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 88 transition count 112
Applied a total of 35 rules in 28 ms. Remains 88 /104 variables (removed 16) and now considering 112/143 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 88/104 places, 112/143 transitions.
RANDOM walk for 40000 steps (9166 resets) in 252 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1902 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 928 steps, run visited all 1 properties in 21 ms. (steps per millisecond=44 )
Probabilistic random walk after 928 steps, saw 490 distinct states, run finished after 21 ms. (steps per millisecond=44 ) properties seen :1
Negative knowledge disproves property using: (G (NOT p2))
Knowledge based reduction with 7 factoid took 78 ms. Proved property starting from automaton with 6 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 1731 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-08 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-08 finished in 44878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 277/277 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 139 transition count 203
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 139 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 139 transition count 202
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 121 transition count 180
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 121 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 121 transition count 176
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 102 place count 104 transition count 153
Iterating global reduction 2 with 17 rules applied. Total rules applied 119 place count 104 transition count 153
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 127 place count 104 transition count 145
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 135 place count 96 transition count 130
Iterating global reduction 3 with 8 rules applied. Total rules applied 143 place count 96 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 147 place count 96 transition count 126
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 152 place count 91 transition count 120
Iterating global reduction 4 with 5 rules applied. Total rules applied 157 place count 91 transition count 120
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 160 place count 88 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 163 place count 88 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 164 place count 88 transition count 111
Applied a total of 164 rules in 24 ms. Remains 88 /161 variables (removed 73) and now considering 111/277 (removed 166) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17538606942350001019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8680631898749640743.kers'
[2026-05-23 20:22:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17538606942350001019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8680631898749640743.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 88 cols 365 entries
Finished phase 1 with 84 SingleSign rule and 2 generalized
[2026-05-23 20:22:14] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8680631898749640743.kers
Total runtime 5 ms.
[2026-05-23 20:22:14] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-23 20:22:14] [INFO ] Invariant cache hit.
[2026-05-23 20:22:14] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-23 20:22:15] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2026-05-23 20:22:15] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-23 20:22:15] [INFO ] Invariant cache hit.
[2026-05-23 20:22:15] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 128 constraints, problems are : Problem set: 0 solved, 110 unsolved in 8767 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 111/199 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 110/238 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 238 constraints, problems are : Problem set: 0 solved, 110 unsolved in 17776 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26576ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 26576ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/161 places, 111/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27248 ms. Remains : 88/161 places, 111/277 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-09
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-09 finished in 27316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 277/277 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 140 transition count 207
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 140 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 140 transition count 206
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 122 transition count 184
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 122 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 83 place count 122 transition count 180
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 100 place count 105 transition count 157
Iterating global reduction 2 with 17 rules applied. Total rules applied 117 place count 105 transition count 157
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 126 place count 105 transition count 148
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 135 place count 96 transition count 132
Iterating global reduction 3 with 9 rules applied. Total rules applied 144 place count 96 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 146 place count 96 transition count 130
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 152 place count 90 transition count 123
Iterating global reduction 4 with 6 rules applied. Total rules applied 158 place count 90 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 160 place count 90 transition count 121
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 162 place count 88 transition count 119
Iterating global reduction 5 with 2 rules applied. Total rules applied 164 place count 88 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 165 place count 88 transition count 118
Applied a total of 165 rules in 23 ms. Remains 88 /161 variables (removed 73) and now considering 118/277 (removed 159) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8691805070301130784.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10467379296718390959.kers'
[2026-05-23 20:22:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8691805070301130784.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10467379296718390959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 118 rows 88 cols 371 entries
Finished phase 1 with 84 SingleSign rule and 2 generalized
[2026-05-23 20:22:41] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10467379296718390959.kers
Total runtime 1 ms.
[2026-05-23 20:22:41] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-23 20:22:41] [INFO ] Invariant cache hit.
[2026-05-23 20:22:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-23 20:22:42] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2026-05-23 20:22:42] [INFO ] Redundant transitions in 5 ms returned []
Running 117 sub problems to find dead transitions.
[2026-05-23 20:22:42] [INFO ] Invariant cache hit.
[2026-05-23 20:22:42] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/206 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 117 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 137 constraints, problems are : Problem set: 0 solved, 117 unsolved in 8544 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 118/206 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 45/137 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 117/254 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 254 constraints, problems are : Problem set: 0 solved, 117 unsolved in 26325 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34927ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 34928ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/161 places, 118/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35453 ms. Remains : 88/161 places, 118/277 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-10
Product exploration explored 100000 steps with 23020 reset in 357 ms.
Product exploration explored 100000 steps with 23055 reset in 271 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 302 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge based reduction with 5 factoid took 54 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (9124 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1966 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 12982 steps, run visited all 2 properties in 96 ms. (steps per millisecond=135 )
Probabilistic random walk after 12982 steps, saw 6122 distinct states, run finished after 97 ms. (steps per millisecond=133 ) properties seen :2
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 544 ms.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 118/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2026-05-23 20:23:18] [INFO ] Invariant cache hit.
[2026-05-23 20:23:18] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-23 20:23:18] [INFO ] Invariant cache hit.
[2026-05-23 20:23:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-23 20:23:18] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2026-05-23 20:23:18] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 372 ms. Remains : 88/88 places, 118/118 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 302 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge based reduction with 5 factoid took 55 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (9234 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1900 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1950 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 12982 steps, run visited all 2 properties in 102 ms. (steps per millisecond=127 )
Probabilistic random walk after 12982 steps, saw 6122 distinct states, run finished after 102 ms. (steps per millisecond=127 ) properties seen :2
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 540 ms.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22993 reset in 283 ms.
Product exploration explored 100000 steps with 22886 reset in 329 ms.
Built C files in :
/tmp/ltsmin9016001920273547698
[2026-05-23 20:23:20] [INFO ] Computing symmetric may disable matrix : 118 transitions.
[2026-05-23 20:23:20] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 20:23:20] [INFO ] Computing symmetric may enable matrix : 118 transitions.
[2026-05-23 20:23:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 20:23:20] [INFO ] Computing Do-Not-Accords matrix : 118 transitions.
[2026-05-23 20:23:20] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 20:23:20] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9016001920273547698
Running compilation step : cd /tmp/ltsmin9016001920273547698;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 875 ms.
Running link step : cd /tmp/ltsmin9016001920273547698;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin9016001920273547698;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15840374716128598276.hoa' '--buchi-type=spotba'
LTSmin run took 206 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-10 finished in 39944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X((p0||F(p1))))&&F(p2)))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 277/277 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 140 transition count 201
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 140 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 140 transition count 200
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 122 transition count 180
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 122 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 83 place count 122 transition count 176
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 100 place count 105 transition count 152
Iterating global reduction 2 with 17 rules applied. Total rules applied 117 place count 105 transition count 152
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 126 place count 105 transition count 143
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 134 place count 97 transition count 128
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 97 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 97 transition count 126
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 149 place count 92 transition count 120
Iterating global reduction 4 with 5 rules applied. Total rules applied 154 place count 92 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 155 place count 92 transition count 119
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 157 place count 90 transition count 117
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 90 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 160 place count 90 transition count 116
Applied a total of 160 rules in 12 ms. Remains 90 /161 variables (removed 71) and now considering 116/277 (removed 161) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18186350396773865117.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14712560831952615761.kers'
[2026-05-23 20:23:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18186350396773865117.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14712560831952615761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 90 cols 378 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-23 20:23:21] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14712560831952615761.kers
Total runtime 2 ms.
[2026-05-23 20:23:21] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-23 20:23:21] [INFO ] Invariant cache hit.
[2026-05-23 20:23:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 20:23:22] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2026-05-23 20:23:22] [INFO ] Invariant cache hit.
[2026-05-23 20:23:22] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/206 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 130 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6938 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/206 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 115/245 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 245 constraints, problems are : Problem set: 0 solved, 115 unsolved in 28962 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35958ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 35959ms
Starting structural reductions in LTL mode, iteration 1 : 90/161 places, 116/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36629 ms. Remains : 90/161 places, 116/277 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X((p0||F(p1))))&&F(p2)))))'
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-11 finished in 36962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 277/277 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 140 transition count 208
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 140 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 140 transition count 207
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 60 place count 123 transition count 186
Iterating global reduction 1 with 17 rules applied. Total rules applied 77 place count 123 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 79 place count 123 transition count 184
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 95 place count 107 transition count 163
Iterating global reduction 2 with 16 rules applied. Total rules applied 111 place count 107 transition count 163
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 119 place count 107 transition count 155
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 126 place count 100 transition count 142
Iterating global reduction 3 with 7 rules applied. Total rules applied 133 place count 100 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 100 transition count 140
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 139 place count 96 transition count 135
Iterating global reduction 4 with 4 rules applied. Total rules applied 143 place count 96 transition count 135
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 94 transition count 128
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 94 transition count 128
Applied a total of 147 rules in 15 ms. Remains 94 /161 variables (removed 67) and now considering 128/277 (removed 149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14471060109011790271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1197357295070503248.kers'
[2026-05-23 20:23:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14471060109011790271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1197357295070503248.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 94 cols 411 entries
Finished phase 1 with 89 SingleSign rule and 3 generalized
[2026-05-23 20:23:58] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1197357295070503248.kers
Total runtime 2 ms.
[2026-05-23 20:23:58] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-23 20:23:58] [INFO ] Invariant cache hit.
[2026-05-23 20:23:58] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-23 20:23:59] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2026-05-23 20:23:59] [INFO ] Invariant cache hit.
[2026-05-23 20:23:59] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/222 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 45/141 constraints. Problems are: Problem set: 0 solved, 127 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 141 constraints, problems are : Problem set: 0 solved, 127 unsolved in 7944 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/222 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 45/141 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 127/268 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 268 constraints, problems are : Problem set: 0 solved, 127 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38029ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 38030ms
Starting structural reductions in LTL mode, iteration 1 : 94/161 places, 128/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38799 ms. Remains : 94/161 places, 128/277 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-12 finished in 38952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(!p1 U (G(!p1)||(!p1&&G(!p2))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 277/277 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 141 transition count 215
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 141 transition count 215
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 58 place count 123 transition count 193
Iterating global reduction 0 with 18 rules applied. Total rules applied 76 place count 123 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 80 place count 123 transition count 189
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 97 place count 106 transition count 165
Iterating global reduction 1 with 17 rules applied. Total rules applied 114 place count 106 transition count 165
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 124 place count 106 transition count 155
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 132 place count 98 transition count 141
Iterating global reduction 2 with 8 rules applied. Total rules applied 140 place count 98 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 98 transition count 140
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 147 place count 92 transition count 133
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 92 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 155 place count 92 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 157 place count 90 transition count 129
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 90 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 90 transition count 128
Applied a total of 160 rules in 13 ms. Remains 90 /161 variables (removed 71) and now considering 128/277 (removed 149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9554495163346828791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14078589213965992890.kers'
[2026-05-23 20:24:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9554495163346828791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14078589213965992890.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 90 cols 393 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-23 20:24:37] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14078589213965992890.kers
Total runtime 2 ms.
[2026-05-23 20:24:37] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-23 20:24:37] [INFO ] Invariant cache hit.
[2026-05-23 20:24:37] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-23 20:24:38] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2026-05-23 20:24:38] [INFO ] Invariant cache hit.
[2026-05-23 20:24:38] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/218 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 53/145 constraints. Problems are: Problem set: 0 solved, 127 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 145 constraints, problems are : Problem set: 0 solved, 127 unsolved in 7054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/218 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 53/145 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 127/272 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 272 constraints, problems are : Problem set: 0 solved, 127 unsolved in 26535 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33651ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 33651ms
Starting structural reductions in LTL mode, iteration 1 : 90/161 places, 128/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34324 ms. Remains : 90/161 places, 128/277 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(!p1 U (G(!p1)||(!p1&&G(!p2))))))'
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) p1), true, (NOT p0), p1, (AND p1 p2), p2]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-13
Stuttering criterion allowed to conclude after 14 steps with 2 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-13 finished in 34562 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 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 277/277 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 139 transition count 204
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 139 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 139 transition count 203
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 121 transition count 181
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 121 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 121 transition count 177
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 102 place count 104 transition count 153
Iterating global reduction 2 with 17 rules applied. Total rules applied 119 place count 104 transition count 153
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 128 place count 104 transition count 144
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 136 place count 96 transition count 130
Iterating global reduction 3 with 8 rules applied. Total rules applied 144 place count 96 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 146 place count 96 transition count 128
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 151 place count 91 transition count 122
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 91 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 158 place count 91 transition count 120
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 160 place count 89 transition count 113
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 89 transition count 113
Applied a total of 162 rules in 28 ms. Remains 89 /161 variables (removed 72) and now considering 113/277 (removed 164) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16725456398622506420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5864226984848375083.kers'
[2026-05-23 20:25:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16725456398622506420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5864226984848375083.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 89 cols 366 entries
Finished phase 1 with 85 SingleSign rule and 2 generalized
[2026-05-23 20:25:12] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5864226984848375083.kers
Total runtime 1 ms.
[2026-05-23 20:25:12] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-23 20:25:12] [INFO ] Invariant cache hit.
[2026-05-23 20:25:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 20:25:12] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2026-05-23 20:25:12] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
[2026-05-23 20:25:12] [INFO ] Invariant cache hit.
[2026-05-23 20:25:12] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/202 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 129 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/202 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 241 constraints, problems are : Problem set: 0 solved, 112 unsolved in 24476 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28545ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 28546ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/161 places, 113/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29149 ms. Remains : 89/161 places, 113/277 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 35 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-14
Product exploration explored 100000 steps with 22962 reset in 165 ms.
Product exploration explored 100000 steps with 23067 reset in 317 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 302 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9152 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1859 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17417 steps, run visited all 1 properties in 57 ms. (steps per millisecond=305 )
Probabilistic random walk after 17417 steps, saw 8282 distinct states, run finished after 57 ms. (steps per millisecond=305 ) properties seen :1
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Knowledge-based reduction took 313 ms.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 113/113 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2026-05-23 20:25:42] [INFO ] Invariant cache hit.
[2026-05-23 20:25:42] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-23 20:25:42] [INFO ] Invariant cache hit.
[2026-05-23 20:25:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 20:25:42] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2026-05-23 20:25:42] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 473 ms. Remains : 89/89 places, 113/113 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 302 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9184 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1912 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17417 steps, run visited all 1 properties in 56 ms. (steps per millisecond=311 )
Probabilistic random walk after 17417 steps, saw 8282 distinct states, run finished after 56 ms. (steps per millisecond=311 ) properties seen :1
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Knowledge-based reduction took 304 ms.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22880 reset in 161 ms.
Product exploration explored 100000 steps with 22920 reset in 171 ms.
Built C files in :
/tmp/ltsmin14291194320914671472
[2026-05-23 20:25:43] [INFO ] Computing symmetric may disable matrix : 113 transitions.
[2026-05-23 20:25:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 20:25:43] [INFO ] Computing symmetric may enable matrix : 113 transitions.
[2026-05-23 20:25:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 20:25:43] [INFO ] Computing Do-Not-Accords matrix : 113 transitions.
[2026-05-23 20:25:43] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 20:25:43] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14291194320914671472
Running compilation step : cd /tmp/ltsmin14291194320914671472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 597 ms.
Running link step : cd /tmp/ltsmin14291194320914671472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14291194320914671472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1199848776364352690.hoa' '--buchi-type=spotba'
LTSmin run took 83 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-14 finished in 32067 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 (F(p1)||X((X(X(X(X(p2)))) U ((!p3&&X(X(X(X(p2)))))||X(X(X(X(G(p2)))))))))))'
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 277/277 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 141 transition count 208
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 141 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 141 transition count 207
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 125 transition count 189
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 125 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 77 place count 125 transition count 185
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 92 place count 110 transition count 164
Iterating global reduction 2 with 15 rules applied. Total rules applied 107 place count 110 transition count 164
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 114 place count 110 transition count 157
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 122 place count 102 transition count 142
Iterating global reduction 3 with 8 rules applied. Total rules applied 130 place count 102 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 134 place count 102 transition count 138
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 138 place count 98 transition count 133
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 98 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 98 transition count 131
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 97 transition count 130
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 97 transition count 130
Applied a total of 146 rules in 10 ms. Remains 97 /161 variables (removed 64) and now considering 130/277 (removed 147) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-34942541172811354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13261972940509344663.kers'
[2026-05-23 20:25:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-34942541172811354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13261972940509344663.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 97 cols 424 entries
Finished phase 1 with 93 SingleSign rule and 2 generalized
[2026-05-23 20:25:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13261972940509344663.kers
Total runtime 1 ms.
[2026-05-23 20:25:44] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-23 20:25:44] [INFO ] Invariant cache hit.
[2026-05-23 20:25:44] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-23 20:25:44] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-23 20:25:44] [INFO ] Invariant cache hit.
[2026-05-23 20:25:44] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/227 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 43/142 constraints. Problems are: Problem set: 0 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 142 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7149 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/227 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 43/142 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 129/271 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/227 variables, and 271 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37240ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 37242ms
Starting structural reductions in LTL mode, iteration 1 : 97/161 places, 130/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37876 ms. Remains : 97/161 places, 130/277 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 (F(p1)||X((X(X(X(X(p2)))) U ((!p3&&X(X(X(X(p2)))))||X(X(X(X(G(p2)))))))))))'
Stuttering acceptance computed with spot in 2735 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-15 finished in 40855 ms.
All properties solved by simple procedures.
Total runtime 499719 ms.

BK_STOP 1779567985143

--------------------
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="DBSingleClientW-PT-d1m06"
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 DBSingleClientW-PT-d1m06, 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 r082-smll-177946993600156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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