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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 9.5K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:50 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 1.6M 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-d2m06-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779604717242

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-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 06:38:39] [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-24 06:38:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 06:38:40] [INFO ] Load time of PNML (sax parser for PT used): 589 ms
[2026-05-24 06:38:40] [INFO ] Transformed 4763 places.
[2026-05-24 06:38:40] [INFO ] Transformed 2478 transitions.
[2026-05-24 06:38:40] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 841 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 3580 places in 35 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 376 places :
Symmetric choice reduction at 1 with 376 rule applications. Total rules 621 place count 761 transition count 1326
Iterating global reduction 1 with 376 rules applied. Total rules applied 997 place count 761 transition count 1326
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 1024 place count 761 transition count 1299
Discarding 299 places :
Symmetric choice reduction at 2 with 299 rule applications. Total rules 1323 place count 462 transition count 1000
Iterating global reduction 2 with 299 rules applied. Total rules applied 1622 place count 462 transition count 1000
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1630 place count 462 transition count 992
Discarding 218 places :
Symmetric choice reduction at 3 with 218 rule applications. Total rules 1848 place count 244 transition count 685
Iterating global reduction 3 with 218 rules applied. Total rules applied 2066 place count 244 transition count 685
Ensure Unique test removed 220 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 2286 place count 244 transition count 465
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 2302 place count 228 transition count 442
Iterating global reduction 4 with 16 rules applied. Total rules applied 2318 place count 228 transition count 442
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2324 place count 228 transition count 436
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 2333 place count 219 transition count 427
Iterating global reduction 5 with 9 rules applied. Total rules applied 2342 place count 219 transition count 427
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2346 place count 219 transition count 423
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2351 place count 214 transition count 418
Iterating global reduction 6 with 5 rules applied. Total rules applied 2356 place count 214 transition count 418
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2363 place count 214 transition count 411
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2364 place count 213 transition count 409
Iterating global reduction 7 with 1 rules applied. Total rules applied 2365 place count 213 transition count 409
Applied a total of 2365 rules in 440 ms. Remains 213 /1183 variables (removed 970) and now considering 409/2478 (removed 2069) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9745161777141289704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10630905028121346911.kers'
[2026-05-24 06:38:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9745161777141289704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10630905028121346911.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 409 rows 213 cols 1199 entries
Finished phase 1 with 209 SingleSign rule and 2 generalized
[2026-05-24 06:38:41] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10630905028121346911.kers
Total runtime 8 ms.
[2026-05-24 06:38:42] [INFO ] Implicit Places using invariants in 923 ms returned []
[2026-05-24 06:38:42] [INFO ] Invariant cache hit.
[2026-05-24 06:38:42] [INFO ] State equation strengthened by 204 read => feed constraints.
[2026-05-24 06:38:46] [INFO ] Implicit Places using invariants and state equation in 3992 ms returned []
Implicit Place search using SMT with State Equation took 5018 ms to find 0 implicit places.
Running 408 sub problems to find dead transitions.
[2026-05-24 06:38:46] [INFO ] Invariant cache hit.
[2026-05-24 06:38:46] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (OVERLAPS) 409/622 variables, 213/215 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 204/419 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/622 variables, and 419 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 213/213 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (OVERLAPS) 409/622 variables, 213/215 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/622 variables, 204/419 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 408/827 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/622 variables, and 827 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 213/213 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61526ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 61563ms
Starting structural reductions in LTL mode, iteration 1 : 213/1183 places, 409/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67095 ms. Remains : 213/1183 places, 409/2478 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 409/409 transitions.
Applied a total of 0 rules in 10 ms. Remains 213 /213 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2026-05-24 06:39:48] [INFO ] Invariant cache hit.
[2026-05-24 06:39:48] [INFO ] Implicit Places using invariants in 376 ms returned []
[2026-05-24 06:39:48] [INFO ] Invariant cache hit.
[2026-05-24 06:39:48] [INFO ] State equation strengthened by 204 read => feed constraints.
[2026-05-24 06:39:52] [INFO ] Implicit Places using invariants and state equation in 3648 ms returned []
Implicit Place search using SMT with State Equation took 4026 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4039 ms. Remains : 213/213 places, 409/409 transitions.
Support contains 35 out of 213 places after structural reductions.
[2026-05-24 06:39:52] [INFO ] Flatten gal took : 123 ms
[2026-05-24 06:39:52] [INFO ] Flatten gal took : 70 ms
[2026-05-24 06:39:52] [INFO ] Input system was already deterministic with 409 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (9163 resets) in 4907 ms. (8 steps per ms) remains 26/29 properties
BEST_FIRST walk for 4003 steps (168 resets) in 63 ms. (62 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (370 resets) in 97 ms. (40 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (177 resets) in 58 ms. (67 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (180 resets) in 64 ms. (61 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (166 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (168 resets) in 43 ms. (90 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (390 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (197 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (404 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (166 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (178 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (204 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (181 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (185 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (166 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (189 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (398 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (196 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (176 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (183 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (405 resets) in 60 ms. (65 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (412 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (365 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (175 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (199 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (198 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
[2026-05-24 06:39:54] [INFO ] Invariant cache hit.
[2026-05-24 06:39:54] [INFO ] State equation strengthened by 204 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 71/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 47/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 318/467 variables, 149/155 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 113/268 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 9 (OVERLAPS) 155/622 variables, 64/332 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/622 variables, 91/423 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 0/423 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/622 variables, and 423 constraints, problems are : Problem set: 1 solved, 25 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 213/213 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 71/101 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 48/149 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 318/467 variables, 149/159 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 113/272 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 8/280 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/622 variables, and 280 constraints, problems are : Problem set: 1 solved, 25 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/213 constraints, ReadFeed: 113/204 constraints, PredecessorRefiner: 0/26 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10108ms problems are : Problem set: 1 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 409/409 transitions.
Graph (complete) has 777 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 212 transition count 402
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 208 transition count 397
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 208 transition count 397
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 208 transition count 396
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 205 transition count 392
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 205 transition count 392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 204 transition count 391
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 204 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 204 transition count 390
Applied a total of 26 rules in 101 ms. Remains 204 /213 variables (removed 9) and now considering 390/409 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 204/213 places, 390/409 transitions.
RANDOM walk for 40000 steps (9232 resets) in 745 ms. (53 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (173 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (346 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (164 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (180 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (193 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (165 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (403 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (169 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (386 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (186 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (177 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (166 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (169 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (161 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (155 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (163 resets) in 28 ms. (137 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (388 resets) in 70 ms. (56 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (173 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (162 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (181 resets) in 43 ms. (90 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (382 resets) in 52 ms. (75 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (394 resets) in 45 ms. (87 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (390 resets) in 42 ms. (93 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (180 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (181 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
Finished probabilistic random walk after 112900 steps, run visited all 25 properties in 1745 ms. (steps per millisecond=64 )
Probabilistic random walk after 112900 steps, saw 45493 distinct states, run finished after 1752 ms. (steps per millisecond=64 ) properties seen :25
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 32 stable transitions
Graph (complete) has 842 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(!p0))) U ((p1 U p2)&&X(p3)))))'
Support contains 6 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 409/409 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 188 transition count 340
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 188 transition count 340
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 57 place count 188 transition count 333
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 76 place count 169 transition count 308
Iterating global reduction 1 with 19 rules applied. Total rules applied 95 place count 169 transition count 308
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 103 place count 169 transition count 300
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 117 place count 155 transition count 275
Iterating global reduction 2 with 14 rules applied. Total rules applied 131 place count 155 transition count 275
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 137 place count 155 transition count 269
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 145 place count 147 transition count 250
Iterating global reduction 3 with 8 rules applied. Total rules applied 153 place count 147 transition count 250
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 157 place count 147 transition count 246
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 160 place count 144 transition count 243
Iterating global reduction 4 with 3 rules applied. Total rules applied 163 place count 144 transition count 243
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 144 transition count 242
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 166 place count 142 transition count 240
Iterating global reduction 5 with 2 rules applied. Total rules applied 168 place count 142 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 171 place count 142 transition count 237
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 174 place count 139 transition count 217
Iterating global reduction 6 with 3 rules applied. Total rules applied 177 place count 139 transition count 217
Applied a total of 177 rules in 49 ms. Remains 139 /213 variables (removed 74) and now considering 217/409 (removed 192) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9789628757548525825.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3492231899822982354.kers'
[2026-05-24 06:40:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9789628757548525825.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3492231899822982354.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 139 cols 685 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-05-24 06:40:07] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3492231899822982354.kers
Total runtime 3 ms.
[2026-05-24 06:40:07] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-24 06:40:07] [INFO ] Invariant cache hit.
[2026-05-24 06:40:07] [INFO ] State equation strengthened by 83 read => feed constraints.
[2026-05-24 06:40:08] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-24 06:40:08] [INFO ] Invariant cache hit.
[2026-05-24 06:40:08] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/356 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 83/224 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/356 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 224 constraints, problems are : Problem set: 0 solved, 216 unsolved in 25073 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/356 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 83/224 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 216/440 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 440 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55215ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 55217ms
Starting structural reductions in LTL mode, iteration 1 : 139/213 places, 217/409 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56273 ms. Remains : 139/213 places, 217/409 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(!p0))) U ((p1 U p2)&&X(p3)))))'
Stuttering acceptance computed with spot in 825 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p0, (NOT p2), (NOT p3), p0, true, (AND p0 (NOT p2)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-01
Stuttering criterion allowed to conclude after 9 steps with 1 reset in 3 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-01 finished in 57263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(((p1 U X(p1))&&X(F(p2))))))'
Support contains 5 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 409/409 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 187 transition count 332
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 187 transition count 332
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 59 place count 187 transition count 325
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 79 place count 167 transition count 298
Iterating global reduction 1 with 20 rules applied. Total rules applied 99 place count 167 transition count 298
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 109 place count 167 transition count 288
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 124 place count 152 transition count 255
Iterating global reduction 2 with 15 rules applied. Total rules applied 139 place count 152 transition count 255
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 144 place count 152 transition count 250
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 152 place count 144 transition count 236
Iterating global reduction 3 with 8 rules applied. Total rules applied 160 place count 144 transition count 236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 165 place count 144 transition count 231
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 168 place count 141 transition count 228
Iterating global reduction 4 with 3 rules applied. Total rules applied 171 place count 141 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 141 transition count 227
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 174 place count 139 transition count 225
Iterating global reduction 5 with 2 rules applied. Total rules applied 176 place count 139 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 179 place count 139 transition count 222
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 181 place count 137 transition count 210
Iterating global reduction 6 with 2 rules applied. Total rules applied 183 place count 137 transition count 210
Applied a total of 183 rules in 47 ms. Remains 137 /213 variables (removed 76) and now considering 210/409 (removed 199) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2756967090637537136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6476505569116742031.kers'
[2026-05-24 06:41:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2756967090637537136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6476505569116742031.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 137 cols 667 entries
Finished phase 1 with 133 SingleSign rule and 2 generalized
[2026-05-24 06:41:04] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6476505569116742031.kers
Total runtime 3 ms.
[2026-05-24 06:41:05] [INFO ] Implicit Places using invariants in 228 ms returned []
[2026-05-24 06:41:05] [INFO ] Invariant cache hit.
[2026-05-24 06:41:05] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 06:41:06] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1318 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2026-05-24 06:41:06] [INFO ] Invariant cache hit.
[2026-05-24 06:41:06] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/347 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 79/218 constraints. Problems are: Problem set: 0 solved, 209 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/347 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 218 constraints, problems are : Problem set: 0 solved, 209 unsolved in 21768 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/347 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 79/218 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 209/427 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/347 variables, and 427 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51958ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 51962ms
Starting structural reductions in LTL mode, iteration 1 : 137/213 places, 210/409 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53331 ms. Remains : 137/213 places, 210/409 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(((p1 U X(p1))&&X(F(p2))))))'
Stuttering acceptance computed with spot in 605 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-02
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-02 finished in 54018 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||F(!p1)))||((!p0||F(!p1))&&X(F((!p2&&(p3 U (p4||G(p3))))))))))'
Support contains 6 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 409/409 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 187 transition count 332
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 187 transition count 332
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 58 place count 187 transition count 326
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 166 transition count 298
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 166 transition count 298
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 111 place count 166 transition count 287
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 126 place count 151 transition count 262
Iterating global reduction 2 with 15 rules applied. Total rules applied 141 place count 151 transition count 262
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 147 place count 151 transition count 256
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 155 place count 143 transition count 238
Iterating global reduction 3 with 8 rules applied. Total rules applied 163 place count 143 transition count 238
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 170 place count 143 transition count 231
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 173 place count 140 transition count 228
Iterating global reduction 4 with 3 rules applied. Total rules applied 176 place count 140 transition count 228
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 179 place count 137 transition count 225
Iterating global reduction 4 with 3 rules applied. Total rules applied 182 place count 137 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 185 place count 137 transition count 222
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 187 place count 135 transition count 209
Iterating global reduction 5 with 2 rules applied. Total rules applied 189 place count 135 transition count 209
Applied a total of 189 rules in 36 ms. Remains 135 /213 variables (removed 78) and now considering 209/409 (removed 200) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10271938872420816719.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4206874718610125681.kers'
[2026-05-24 06:41:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10271938872420816719.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4206874718610125681.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 135 cols 659 entries
Finished phase 1 with 131 SingleSign rule and 2 generalized
[2026-05-24 06:41:58] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4206874718610125681.kers
Total runtime 3 ms.
[2026-05-24 06:41:59] [INFO ] Implicit Places using invariants in 258 ms returned []
[2026-05-24 06:41:59] [INFO ] Invariant cache hit.
[2026-05-24 06:41:59] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-24 06:41:59] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2026-05-24 06:41:59] [INFO ] Invariant cache hit.
[2026-05-24 06:41:59] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/344 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 81/218 constraints. Problems are: Problem set: 0 solved, 208 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 218 constraints, problems are : Problem set: 0 solved, 208 unsolved in 29932 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/344 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 81/218 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 208/426 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 344/344 variables, and 426 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 135/213 places, 209/409 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61179 ms. Remains : 135/213 places, 209/409 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)||p0))||(X(F((p2&&(p3 U (p4||G(p3))))))&&(F(p1)||p5)))))'
Stuttering acceptance computed with spot in 672 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p5))), (OR (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p5))), (OR (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p5))), (OR (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-03
Product exploration explored 100000 steps with 23015 reset in 829 ms.
Product exploration explored 100000 steps with 22885 reset in 439 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 500 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge based reduction with 41 factoid took 150 ms. Reduced automaton from 9 states, 35 edges and 6 AP (stutter sensitive) to 42 states, 143 edges and 6 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 47 to 39
RANDOM walk for 40000 steps (9167 resets) in 1532 ms. (26 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (172 resets) in 48 ms. (81 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (178 resets) in 42 ms. (93 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (186 resets) in 61 ms. (64 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (169 resets) in 61 ms. (64 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (175 resets) in 67 ms. (58 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (185 resets) in 42 ms. (93 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (385 resets) in 61 ms. (64 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (183 resets) in 51 ms. (76 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (163 resets) in 74 ms. (53 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (184 resets) in 53 ms. (74 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (193 resets) in 70 ms. (56 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (174 resets) in 51 ms. (76 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (182 resets) in 44 ms. (88 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (189 resets) in 60 ms. (65 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (172 resets) in 51 ms. (76 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (195 resets) in 44 ms. (88 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (179 resets) in 64 ms. (61 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (187 resets) in 42 ms. (93 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (165 resets) in 59 ms. (66 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (161 resets) in 87 ms. (45 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (384 resets) in 142 ms. (27 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (152 resets) in 58 ms. (67 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (189 resets) in 45 ms. (87 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (170 resets) in 48 ms. (81 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (171 resets) in 40 ms. (97 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (173 resets) in 43 ms. (90 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (181 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (186 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (178 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (159 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (188 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (178 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (181 resets) in 32 ms. (121 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (391 resets) in 47 ms. (83 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (179 resets) in 37 ms. (105 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (185 resets) in 42 ms. (93 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (174 resets) in 45 ms. (86 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (181 resets) in 45 ms. (87 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (374 resets) in 54 ms. (72 steps per ms) remains 39/39 properties
Interrupted probabilistic random walk after 215811 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :11 out of 39
Probabilistic random walk after 215811 steps, saw 92183 distinct states, run finished after 3004 ms. (steps per millisecond=71 ) properties seen :11
[2026-05-24 06:43:06] [INFO ] Invariant cache hit.
[2026-05-24 06:43:06] [INFO ] State equation strengthened by 81 read => feed constraints.
Problem apf2 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
Problem apf13 is UNSAT
Problem apf14 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
Problem apf24 is UNSAT
Problem apf26 is UNSAT
Problem apf28 is UNSAT
Problem apf29 is UNSAT
Problem apf30 is UNSAT
Problem apf32 is UNSAT
Problem apf35 is UNSAT
Problem apf37 is UNSAT
Problem apf40 is UNSAT
Problem apf44 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 9 unsolved
Problem apf12 is UNSAT
Problem apf22 is UNSAT
Problem apf27 is UNSAT
Problem apf31 is UNSAT
Problem apf33 is UNSAT
Problem apf39 is UNSAT
At refinement iteration 1 (OVERLAPS) 53/59 variables, 1/1 constraints. Problems are: Problem set: 25 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 25 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/92 variables, 1/2 constraints. Problems are: Problem set: 25 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 25 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 149/241 variables, 92/94 constraints. Problems are: Problem set: 25 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 21/115 constraints. Problems are: Problem set: 25 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/115 constraints. Problems are: Problem set: 25 solved, 3 unsolved
Problem apf18 is UNSAT
Problem apf19 is UNSAT
Problem apf34 is UNSAT
After SMT solving in domain Real declared 344/344 variables, and 158 constraints, problems are : Problem set: 28 solved, 0 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 21/81 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 28 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 34 invariant AP formulas.
Knowledge based reduction with 75 factoid took 252 ms. Proved property starting from automaton with 42 states, 143 edges and 6 AP (stutter insensitive
Knowledge-based reduction took 4939 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-03 finished in 68164 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(p0)))&&(X(X(!p0)) U G(p1))))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 409/409 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 332
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 332
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 60 place count 186 transition count 326
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 82 place count 164 transition count 296
Iterating global reduction 1 with 22 rules applied. Total rules applied 104 place count 164 transition count 296
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 115 place count 164 transition count 285
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 131 place count 148 transition count 251
Iterating global reduction 2 with 16 rules applied. Total rules applied 147 place count 148 transition count 251
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 153 place count 148 transition count 245
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 161 place count 140 transition count 225
Iterating global reduction 3 with 8 rules applied. Total rules applied 169 place count 140 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 174 place count 140 transition count 220
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 176 place count 138 transition count 218
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 138 transition count 218
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 180 place count 136 transition count 216
Iterating global reduction 4 with 2 rules applied. Total rules applied 182 place count 136 transition count 216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 185 place count 136 transition count 213
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 188 place count 133 transition count 193
Iterating global reduction 5 with 3 rules applied. Total rules applied 191 place count 133 transition count 193
Applied a total of 191 rules in 22 ms. Remains 133 /213 variables (removed 80) and now considering 193/409 (removed 216) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1648374633734286614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1452178297487805262.kers'
[2026-05-24 06:43:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1648374633734286614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1452178297487805262.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 193 rows 133 cols 633 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-24 06:43:06] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1452178297487805262.kers
Total runtime 3 ms.
[2026-05-24 06:43:07] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-24 06:43:07] [INFO ] Invariant cache hit.
[2026-05-24 06:43:07] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-24 06:43:08] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2026-05-24 06:43:08] [INFO ] Invariant cache hit.
[2026-05-24 06:43:08] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/326 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 63/198 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 198 constraints, problems are : Problem set: 0 solved, 192 unsolved in 19046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/326 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 63/198 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 192/390 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 390 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49266ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 49267ms
Starting structural reductions in LTL mode, iteration 1 : 133/213 places, 193/409 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50711 ms. Remains : 133/213 places, 193/409 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(p0)))&&(X(X(!p0)) U G(p1))))'
Stuttering acceptance computed with spot in 417 ms :[(OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), true, (NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-04 finished in 51181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!p0)) U (p1 U p0))))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 409/409 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 325
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 325
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 61 place count 186 transition count 318
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 81 place count 166 transition count 290
Iterating global reduction 1 with 20 rules applied. Total rules applied 101 place count 166 transition count 290
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 112 place count 166 transition count 279
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 127 place count 151 transition count 249
Iterating global reduction 2 with 15 rules applied. Total rules applied 142 place count 151 transition count 249
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 147 place count 151 transition count 244
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 155 place count 143 transition count 226
Iterating global reduction 3 with 8 rules applied. Total rules applied 163 place count 143 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 168 place count 143 transition count 221
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 171 place count 140 transition count 218
Iterating global reduction 4 with 3 rules applied. Total rules applied 174 place count 140 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 175 place count 140 transition count 217
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 177 place count 138 transition count 215
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 138 transition count 215
Applied a total of 179 rules in 19 ms. Remains 138 /213 variables (removed 75) and now considering 215/409 (removed 194) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11453813648018753706.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16364602201949940372.kers'
[2026-05-24 06:43:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11453813648018753706.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16364602201949940372.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 138 cols 672 entries
Finished phase 1 with 134 SingleSign rule and 2 generalized
[2026-05-24 06:43:58] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16364602201949940372.kers
Total runtime 2 ms.
[2026-05-24 06:43:58] [INFO ] Implicit Places using invariants in 243 ms returned []
[2026-05-24 06:43:58] [INFO ] Invariant cache hit.
[2026-05-24 06:43:58] [INFO ] State equation strengthened by 86 read => feed constraints.
[2026-05-24 06:43:59] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1636 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2026-05-24 06:43:59] [INFO ] Invariant cache hit.
[2026-05-24 06:43:59] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/353 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 86/226 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 353/353 variables, and 230 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 215/353 variables, 138/144 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 86/230 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 214/444 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/353 variables, and 444 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Starting structural reductions in LTL mode, iteration 1 : 138/213 places, 215/409 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61955 ms. Remains : 138/213 places, 215/409 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!p0)) U (p1 U p0))))'
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), p0]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-06 finished in 62125 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&&(!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 409/409 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 185 transition count 324
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 185 transition count 324
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 63 place count 185 transition count 317
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 85 place count 163 transition count 287
Iterating global reduction 1 with 22 rules applied. Total rules applied 107 place count 163 transition count 287
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 118 place count 163 transition count 276
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 135 place count 146 transition count 241
Iterating global reduction 2 with 17 rules applied. Total rules applied 152 place count 146 transition count 241
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 158 place count 146 transition count 235
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 167 place count 137 transition count 216
Iterating global reduction 3 with 9 rules applied. Total rules applied 176 place count 137 transition count 216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 179 place count 137 transition count 213
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 183 place count 133 transition count 209
Iterating global reduction 4 with 4 rules applied. Total rules applied 187 place count 133 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 188 place count 133 transition count 208
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 191 place count 130 transition count 205
Iterating global reduction 5 with 3 rules applied. Total rules applied 194 place count 130 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 197 place count 130 transition count 202
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 199 place count 128 transition count 189
Iterating global reduction 6 with 2 rules applied. Total rules applied 201 place count 128 transition count 189
Applied a total of 201 rules in 73 ms. Remains 128 /213 variables (removed 85) and now considering 189/409 (removed 220) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10066101941542866829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7741095515298674965.kers'
[2026-05-24 06:45:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10066101941542866829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7741095515298674965.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 128 cols 608 entries
Finished phase 1 with 124 SingleSign rule and 2 generalized
[2026-05-24 06:45:00] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7741095515298674965.kers
Total runtime 2 ms.
[2026-05-24 06:45:00] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-24 06:45:00] [INFO ] Invariant cache hit.
[2026-05-24 06:45:00] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-24 06:45:01] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
[2026-05-24 06:45:01] [INFO ] Redundant transitions in 13 ms returned []
Running 188 sub problems to find dead transitions.
[2026-05-24 06:45:01] [INFO ] Invariant cache hit.
[2026-05-24 06:45:01] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/317 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 67/197 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/317 variables, and 201 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 189/317 variables, 128/134 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 67/201 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 188/389 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 389 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/213 places, 189/409 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61246 ms. Remains : 128/213 places, 189/409 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 U (p1||G(!p0)))&&p2))))'
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p2) (AND p0 (NOT p1)))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-07
Product exploration explored 100000 steps with 22839 reset in 520 ms.
Product exploration explored 100000 steps with 23061 reset in 692 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 466 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 11 factoid took 53 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (9155 resets) in 249 ms. (160 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (1817 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
[2026-05-24 06:46:02] [INFO ] Invariant cache hit.
[2026-05-24 06:46:02] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 138/224 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 16/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 87/311 variables, 39/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 48/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/317 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/317 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 67/67 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) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 138/224 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 16/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 87/311 variables, 39/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 48/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/317 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/317 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1347ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 189/189 transitions.
Graph (complete) has 436 edges and 128 vertex of which 127 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 125 transition count 178
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 125 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 124 transition count 175
Applied a total of 12 rules in 23 ms. Remains 124 /128 variables (removed 4) and now considering 175/189 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 124/128 places, 175/189 transitions.
RANDOM walk for 40000 steps (9198 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1821 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14520 steps, run visited all 1 properties in 63 ms. (steps per millisecond=230 )
Probabilistic random walk after 14520 steps, saw 7058 distinct states, run finished after 63 ms. (steps per millisecond=230 ) properties seen :1
Knowledge based reduction with 11 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p2) (AND p0 (NOT p1)))]
Knowledge-based reduction took 1920 ms.
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p2) (AND p0 (NOT p1)))]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 189/189 transitions.
Applied a total of 0 rules in 11 ms. Remains 128 /128 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2026-05-24 06:46:04] [INFO ] Invariant cache hit.
[2026-05-24 06:46:04] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-24 06:46:04] [INFO ] Invariant cache hit.
[2026-05-24 06:46:05] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-24 06:46:05] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
[2026-05-24 06:46:05] [INFO ] Redundant transitions in 13 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1058 ms. Remains : 128/128 places, 189/189 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 466 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 11 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (9276 resets) in 222 ms. (179 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (1783 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
[2026-05-24 06:46:06] [INFO ] Invariant cache hit.
[2026-05-24 06:46:06] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 138/224 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 16/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 87/311 variables, 39/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 48/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/317 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/317 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 67/67 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) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 138/224 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 16/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 87/311 variables, 39/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 48/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/317 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/317 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1399ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 189/189 transitions.
Graph (complete) has 436 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 125 transition count 178
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 125 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 124 transition count 175
Applied a total of 12 rules in 25 ms. Remains 124 /128 variables (removed 4) and now considering 175/189 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 124/128 places, 175/189 transitions.
RANDOM walk for 40000 steps (9244 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1860 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14520 steps, run visited all 1 properties in 58 ms. (steps per millisecond=250 )
Probabilistic random walk after 14520 steps, saw 7058 distinct states, run finished after 58 ms. (steps per millisecond=250 ) properties seen :1
Knowledge based reduction with 11 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p2) (AND p0 (NOT p1)))]
Knowledge-based reduction took 2017 ms.
Stuttering acceptance computed with spot in 55 ms :[(OR (NOT p2) (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 58 ms :[(OR (NOT p2) (AND p0 (NOT p1)))]
Product exploration explored 100000 steps with 22974 reset in 465 ms.
Product exploration explored 100000 steps with 22959 reset in 466 ms.
Built C files in :
/tmp/ltsmin13815283900514128040
[2026-05-24 06:46:08] [INFO ] Computing symmetric may disable matrix : 189 transitions.
[2026-05-24 06:46:08] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 06:46:08] [INFO ] Computing symmetric may enable matrix : 189 transitions.
[2026-05-24 06:46:08] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 06:46:08] [INFO ] Computing Do-Not-Accords matrix : 189 transitions.
[2026-05-24 06:46:08] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 06:46:09] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13815283900514128040
Running compilation step : cd /tmp/ltsmin13815283900514128040;'/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 1952 ms.
Running link step : cd /tmp/ltsmin13815283900514128040;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin13815283900514128040;'/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/stateBased14583546999354028961.hoa' '--buchi-type=spotba'
LTSmin run took 377 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-07 finished in 71249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 409/409 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 187 transition count 332
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 187 transition count 332
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 59 place count 187 transition count 325
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 79 place count 167 transition count 298
Iterating global reduction 1 with 20 rules applied. Total rules applied 99 place count 167 transition count 298
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 107 place count 167 transition count 290
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 120 place count 154 transition count 271
Iterating global reduction 2 with 13 rules applied. Total rules applied 133 place count 154 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 139 place count 154 transition count 265
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 146 place count 147 transition count 248
Iterating global reduction 3 with 7 rules applied. Total rules applied 153 place count 147 transition count 248
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 159 place count 147 transition count 242
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 162 place count 144 transition count 239
Iterating global reduction 4 with 3 rules applied. Total rules applied 165 place count 144 transition count 239
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 168 place count 141 transition count 236
Iterating global reduction 4 with 3 rules applied. Total rules applied 171 place count 141 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 174 place count 141 transition count 233
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 177 place count 138 transition count 213
Iterating global reduction 5 with 3 rules applied. Total rules applied 180 place count 138 transition count 213
Applied a total of 180 rules in 63 ms. Remains 138 /213 variables (removed 75) and now considering 213/409 (removed 196) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15046465643382318013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15408750342988109540.kers'
[2026-05-24 06:46:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15046465643382318013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15408750342988109540.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 138 cols 673 entries
Finished phase 1 with 134 SingleSign rule and 2 generalized
[2026-05-24 06:46:11] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15408750342988109540.kers
Total runtime 4 ms.
[2026-05-24 06:46:11] [INFO ] Implicit Places using invariants in 263 ms returned []
[2026-05-24 06:46:11] [INFO ] Invariant cache hit.
[2026-05-24 06:46:11] [INFO ] State equation strengthened by 82 read => feed constraints.
[2026-05-24 06:46:13] [INFO ] Implicit Places using invariants and state equation in 1734 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2026-05-24 06:46:13] [INFO ] Redundant transitions in 3 ms returned []
Running 212 sub problems to find dead transitions.
[2026-05-24 06:46:13] [INFO ] Invariant cache hit.
[2026-05-24 06:46:13] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/351 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 82/222 constraints. Problems are: Problem set: 0 solved, 212 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/351 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 222 constraints, problems are : Problem set: 0 solved, 212 unsolved in 22030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/351 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 82/222 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 212/434 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 351/351 variables, and 434 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52215ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 52215ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/213 places, 213/409 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54304 ms. Remains : 138/213 places, 213/409 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-08
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-08 finished in 54446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&G(p1)) U X(X((!p0&&X((!p0 U (!p2||G(!p0)))))))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 409/409 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 187 transition count 338
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 187 transition count 338
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 60 place count 187 transition count 330
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 83 place count 164 transition count 299
Iterating global reduction 1 with 23 rules applied. Total rules applied 106 place count 164 transition count 299
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 118 place count 164 transition count 287
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 134 place count 148 transition count 260
Iterating global reduction 2 with 16 rules applied. Total rules applied 150 place count 148 transition count 260
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 156 place count 148 transition count 254
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 165 place count 139 transition count 235
Iterating global reduction 3 with 9 rules applied. Total rules applied 174 place count 139 transition count 235
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 179 place count 139 transition count 230
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 183 place count 135 transition count 226
Iterating global reduction 4 with 4 rules applied. Total rules applied 187 place count 135 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 188 place count 135 transition count 225
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 191 place count 132 transition count 222
Iterating global reduction 5 with 3 rules applied. Total rules applied 194 place count 132 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 197 place count 132 transition count 219
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 200 place count 129 transition count 199
Iterating global reduction 6 with 3 rules applied. Total rules applied 203 place count 129 transition count 199
Applied a total of 203 rules in 21 ms. Remains 129 /213 variables (removed 84) and now considering 199/409 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11056708203358741289.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13272620578684022797.kers'
[2026-05-24 06:47:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11056708203358741289.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13272620578684022797.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 129 cols 625 entries
Finished phase 1 with 125 SingleSign rule and 2 generalized
[2026-05-24 06:47:05] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13272620578684022797.kers
Total runtime 2 ms.
[2026-05-24 06:47:06] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-24 06:47:06] [INFO ] Invariant cache hit.
[2026-05-24 06:47:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 06:47:06] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-24 06:47:07] [INFO ] Invariant cache hit.
[2026-05-24 06:47:07] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/328 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 78/209 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 209 constraints, problems are : Problem set: 0 solved, 198 unsolved in 19739 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/328 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 78/209 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 198/407 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 407 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49843ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 49843ms
Starting structural reductions in LTL mode, iteration 1 : 129/213 places, 199/409 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50930 ms. Remains : 129/213 places, 199/409 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&G(p1)) U X(X((!p0&&X((!p0 U (!p2||G(!p0)))))))))'
Stuttering acceptance computed with spot in 316 ms :[p0, p0, p0, p0, true, (AND p0 p2), p0, (NOT p1), (AND p0 p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-09
Product exploration explored 100000 steps with 28522 reset in 356 ms.
Product exploration explored 100000 steps with 28564 reset in 542 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 477 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge based reduction with 8 factoid took 88 ms. Reduced automaton from 9 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9165 resets) in 252 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1840 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1790 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1817 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1750 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1120494 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :3 out of 4
Probabilistic random walk after 1120494 steps, saw 465218 distinct states, run finished after 3001 ms. (steps per millisecond=373 ) properties seen :3
[2026-05-24 06:48:01] [INFO ] Invariant cache hit.
[2026-05-24 06:48:01] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/224 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 18/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 322/328 variables, and 146 constraints, problems are : Problem set: 1 solved, 0 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/129 constraints, ReadFeed: 18/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 151ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 13 ms. Proved property starting from automaton with 5 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 3456 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-09 finished in 55669 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(p0))&&(F(!p1) U !p0))) U X(!p2)))'
Support contains 4 out of 213 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 409/409 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 187 transition count 326
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 187 transition count 326
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 59 place count 187 transition count 319
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 79 place count 167 transition count 294
Iterating global reduction 1 with 20 rules applied. Total rules applied 99 place count 167 transition count 294
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 110 place count 167 transition count 283
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 125 place count 152 transition count 250
Iterating global reduction 2 with 15 rules applied. Total rules applied 140 place count 152 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 146 place count 152 transition count 244
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 154 place count 144 transition count 220
Iterating global reduction 3 with 8 rules applied. Total rules applied 162 place count 144 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 144 transition count 218
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 168 place count 140 transition count 214
Iterating global reduction 4 with 4 rules applied. Total rules applied 172 place count 140 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 173 place count 140 transition count 213
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 176 place count 137 transition count 210
Iterating global reduction 5 with 3 rules applied. Total rules applied 179 place count 137 transition count 210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 182 place count 137 transition count 207
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 185 place count 134 transition count 187
Iterating global reduction 6 with 3 rules applied. Total rules applied 188 place count 134 transition count 187
Applied a total of 188 rules in 14 ms. Remains 134 /213 variables (removed 79) and now considering 187/409 (removed 222) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4360285848595966683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14263970934319458707.kers'
[2026-05-24 06:48:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4360285848595966683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14263970934319458707.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 134 cols 623 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-24 06:48:01] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14263970934319458707.kers
Total runtime 1 ms.
[2026-05-24 06:48:02] [INFO ] Implicit Places using invariants in 492 ms returned []
[2026-05-24 06:48:02] [INFO ] Invariant cache hit.
[2026-05-24 06:48:02] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-24 06:48:02] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2026-05-24 06:48:02] [INFO ] Invariant cache hit.
[2026-05-24 06:48:02] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/321 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 56/192 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 192 constraints, problems are : Problem set: 0 solved, 186 unsolved in 16786 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/321 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 56/192 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 186/378 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/321 variables, and 378 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46919ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 46920ms
Starting structural reductions in LTL mode, iteration 1 : 134/213 places, 187/409 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48034 ms. Remains : 134/213 places, 187/409 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(p0))&&(F(!p1) U !p0))) U X(!p2)))'
Stuttering acceptance computed with spot in 214 ms :[p2, p2, (AND p0 p2), (NOT p0), (NOT p0), p0]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 387 ms.
Product exploration explored 100000 steps with 50000 reset in 455 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 478 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 26 ms. Proved property starting from automaton with 6 states, 11 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 48 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-10 finished in 49184 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((X(X(p0))||G(p1))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 409/409 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 325
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 325
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 59 place count 186 transition count 320
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 81 place count 164 transition count 290
Iterating global reduction 1 with 22 rules applied. Total rules applied 103 place count 164 transition count 290
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 114 place count 164 transition count 279
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 129 place count 149 transition count 254
Iterating global reduction 2 with 15 rules applied. Total rules applied 144 place count 149 transition count 254
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 149 place count 149 transition count 249
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 159 place count 139 transition count 223
Iterating global reduction 3 with 10 rules applied. Total rules applied 169 place count 139 transition count 223
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 174 place count 139 transition count 218
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 178 place count 135 transition count 214
Iterating global reduction 4 with 4 rules applied. Total rules applied 182 place count 135 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 183 place count 135 transition count 213
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 186 place count 132 transition count 210
Iterating global reduction 5 with 3 rules applied. Total rules applied 189 place count 132 transition count 210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 192 place count 132 transition count 207
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 195 place count 129 transition count 187
Iterating global reduction 6 with 3 rules applied. Total rules applied 198 place count 129 transition count 187
Applied a total of 198 rules in 26 ms. Remains 129 /213 variables (removed 84) and now considering 187/409 (removed 222) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17436302413842386431.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10234910222919085032.kers'
[2026-05-24 06:48:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17436302413842386431.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10234910222919085032.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 129 cols 606 entries
Finished phase 1 with 125 SingleSign rule and 2 generalized
[2026-05-24 06:48:50] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10234910222919085032.kers
Total runtime 2 ms.
[2026-05-24 06:48:51] [INFO ] Implicit Places using invariants in 801 ms returned []
[2026-05-24 06:48:51] [INFO ] Invariant cache hit.
[2026-05-24 06:48:51] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 06:48:52] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2026-05-24 06:48:52] [INFO ] Invariant cache hit.
[2026-05-24 06:48:52] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/316 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 64/195 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/316 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 197 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 187/316 variables, 129/133 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 64/197 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 186/383 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 383 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 129/213 places, 187/409 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61693 ms. Remains : 129/213 places, 187/409 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((X(X(p0))||G(p1))))'
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-11
Product exploration explored 100000 steps with 22983 reset in 241 ms.
Product exploration explored 100000 steps with 22888 reset in 231 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 469 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 5 factoid took 54 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9185 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3807 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1830 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3819 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1842 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 21853 steps, run visited all 4 properties in 133 ms. (steps per millisecond=164 )
Probabilistic random walk after 21853 steps, saw 10777 distinct states, run finished after 133 ms. (steps per millisecond=164 ) properties seen :4
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 591 ms.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 187/187 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2026-05-24 06:49:53] [INFO ] Invariant cache hit.
[2026-05-24 06:49:53] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-24 06:49:53] [INFO ] Invariant cache hit.
[2026-05-24 06:49:54] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 06:49:54] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1040 ms. Remains : 129/129 places, 187/187 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 469 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge based reduction with 5 factoid took 52 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9198 resets) in 252 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (3846 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1768 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (3764 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1795 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 21853 steps, run visited all 4 properties in 176 ms. (steps per millisecond=124 )
Probabilistic random walk after 21853 steps, saw 10777 distinct states, run finished after 178 ms. (steps per millisecond=122 ) properties seen :4
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 704 ms.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22983 reset in 223 ms.
Product exploration explored 100000 steps with 23082 reset in 242 ms.
Spot run failed in 119 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin6848340030924214886
[2026-05-24 06:49:56] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6848340030924214886
Running compilation step : cd /tmp/ltsmin6848340030924214886;'/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 496 ms.
Running link step : cd /tmp/ltsmin6848340030924214886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6848340030924214886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3141241843054197439.hoa' '--buchi-type=spotba'
LTSmin run took 48 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-11 finished in 66217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 409/409 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 332
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 332
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 60 place count 186 transition count 326
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 82 place count 164 transition count 296
Iterating global reduction 1 with 22 rules applied. Total rules applied 104 place count 164 transition count 296
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 113 place count 164 transition count 287
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 128 place count 149 transition count 262
Iterating global reduction 2 with 15 rules applied. Total rules applied 143 place count 149 transition count 262
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 149 place count 149 transition count 256
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 158 place count 140 transition count 232
Iterating global reduction 3 with 9 rules applied. Total rules applied 167 place count 140 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 171 place count 140 transition count 228
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 175 place count 136 transition count 224
Iterating global reduction 4 with 4 rules applied. Total rules applied 179 place count 136 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 180 place count 136 transition count 223
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 183 place count 133 transition count 220
Iterating global reduction 5 with 3 rules applied. Total rules applied 186 place count 133 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 189 place count 133 transition count 217
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 191 place count 131 transition count 204
Iterating global reduction 6 with 2 rules applied. Total rules applied 193 place count 131 transition count 204
Applied a total of 193 rules in 34 ms. Remains 131 /213 variables (removed 82) and now considering 204/409 (removed 205) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7807382418537017668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-750806847727972826.kers'
[2026-05-24 06:49:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7807382418537017668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-750806847727972826.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 131 cols 644 entries
Finished phase 1 with 127 SingleSign rule and 2 generalized
[2026-05-24 06:49:57] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-750806847727972826.kers
Total runtime 1 ms.
[2026-05-24 06:49:57] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-24 06:49:57] [INFO ] Invariant cache hit.
[2026-05-24 06:49:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 06:49:58] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
[2026-05-24 06:49:58] [INFO ] Redundant transitions in 4 ms returned []
Running 203 sub problems to find dead transitions.
[2026-05-24 06:49:58] [INFO ] Invariant cache hit.
[2026-05-24 06:49:58] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/335 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 78/211 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 211 constraints, problems are : Problem set: 0 solved, 203 unsolved in 15571 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/335 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 78/211 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 203/414 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 414 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45752ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 45753ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/213 places, 204/409 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46929 ms. Remains : 131/213 places, 204/409 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-13
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-13 finished in 47125 ms.
All properties solved by simple procedures.
Total runtime 724487 ms.

BK_STOP 1779605444131

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

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