Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063500084.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DBSingleClientW-PT-d1m07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063500084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 908K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 432K May 29 14:32 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-d1m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748575063777

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-d1m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 03:17:45] [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]
[2025-05-30 03:17:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 03:17:46] [INFO ] Load time of PNML (sax parser for PT used): 256 ms
[2025-05-30 03:17:46] [INFO ] Transformed 1440 places.
[2025-05-30 03:17:46] [INFO ] Transformed 672 transitions.
[2025-05-30 03:17:46] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 14 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 181 place count 246 transition count 403
Iterating global reduction 1 with 80 rules applied. Total rules applied 261 place count 246 transition count 403
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 269 place count 246 transition count 395
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 328 place count 187 transition count 336
Iterating global reduction 2 with 59 rules applied. Total rules applied 387 place count 187 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 388 place count 187 transition count 335
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 414 place count 161 transition count 293
Iterating global reduction 3 with 26 rules applied. Total rules applied 440 place count 161 transition count 293
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 459 place count 161 transition count 274
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 463 place count 157 transition count 269
Iterating global reduction 4 with 4 rules applied. Total rules applied 467 place count 157 transition count 269
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 470 place count 154 transition count 266
Iterating global reduction 4 with 3 rules applied. Total rules applied 473 place count 154 transition count 266
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 476 place count 151 transition count 263
Iterating global reduction 4 with 3 rules applied. Total rules applied 479 place count 151 transition count 263
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 480 place count 150 transition count 261
Iterating global reduction 4 with 1 rules applied. Total rules applied 481 place count 150 transition count 261
Applied a total of 481 rules in 219 ms. Remains 150 /347 variables (removed 197) and now considering 261/672 (removed 411) transitions.
// Phase 1: matrix 261 rows 150 cols
[2025-05-30 03:17:46] [INFO ] Computed 2 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:17:47] [INFO ] Implicit Places using invariants in 593 ms returned []
[2025-05-30 03:17:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:17:47] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-30 03:17:48] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2025-05-30 03:17:48] [INFO ] Invariant cache hit.
[2025-05-30 03:17:48] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/411 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 126/278 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 278 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/411 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 126/278 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 260/538 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 538 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60672ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60696ms
Starting structural reductions in LTL mode, iteration 1 : 150/347 places, 261/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62719 ms. Remains : 150/347 places, 261/672 transitions.
Support contains 33 out of 150 places after structural reductions.
[2025-05-30 03:18:49] [INFO ] Flatten gal took : 77 ms
[2025-05-30 03:18:49] [INFO ] Flatten gal took : 32 ms
[2025-05-30 03:18:49] [INFO ] Input system was already deterministic with 261 transitions.
RANDOM walk for 40000 steps (9120 resets) in 3208 ms. (12 steps per ms) remains 24/30 properties
BEST_FIRST walk for 4003 steps (201 resets) in 118 ms. (33 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (174 resets) in 83 ms. (47 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (372 resets) in 134 ms. (29 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (422 resets) in 150 ms. (26 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (202 resets) in 91 ms. (43 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (204 resets) in 87 ms. (45 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (183 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (393 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (169 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (201 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (800 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (190 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (374 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (383 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (188 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (800 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (200 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (195 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (195 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (192 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (182 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (193 resets) in 70 ms. (56 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (189 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (186 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
[2025-05-30 03:18:51] [INFO ] Invariant cache hit.
[2025-05-30 03:18:51] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 48/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 37/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:51] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:51] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:52] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:52] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:52] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:52] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:52] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:52] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:52] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:52] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:52] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 219/331 variables, 112/125 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 84/209 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 80/411 variables, 38/247 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 0/411 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 289 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 48/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 37/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:56] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 219/331 variables, 112/126 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 84/210 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:57] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:57] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:58] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:58] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:58] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:58] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:58] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:58] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 8/219 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:59] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/411 variables, and 220 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/150 constraints, ReadFeed: 84/126 constraints, PredecessorRefiner: 1/24 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10063ms problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 147 transition count 254
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 147 transition count 254
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 145 transition count 252
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 145 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 145 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 144 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 144 transition count 250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 144 transition count 248
Applied a total of 15 rules in 54 ms. Remains 144 /150 variables (removed 6) and now considering 248/261 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 144/150 places, 248/261 transitions.
RANDOM walk for 40000 steps (9147 resets) in 662 ms. (60 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (191 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (185 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (404 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (419 resets) in 53 ms. (74 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (198 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (208 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (158 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (364 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (182 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (199 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (800 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (178 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (363 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (422 resets) in 41 ms. (95 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (204 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (800 resets) in 63 ms. (62 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (205 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (205 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (204 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (166 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (177 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (174 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (195 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (190 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
Finished probabilistic random walk after 54700 steps, run visited all 24 properties in 482 ms. (steps per millisecond=113 )
Probabilistic random walk after 54700 steps, saw 24051 distinct states, run finished after 491 ms. (steps per millisecond=111 ) properties seen :24
Computed a total of 5 stabilizing places and 24 stable transitions
Graph (complete) has 560 edges and 150 vertex of which 149 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&F((!p1&&X(!p1))))) U X((G(p2) U p3))))'
Support contains 7 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 130 transition count 201
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 130 transition count 201
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 48 place count 130 transition count 193
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 115 transition count 178
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 115 transition count 178
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 85 place count 115 transition count 171
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 98 place count 102 transition count 152
Iterating global reduction 2 with 13 rules applied. Total rules applied 111 place count 102 transition count 152
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 121 place count 102 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 124 place count 99 transition count 135
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 99 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 99 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 132 place count 97 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 97 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 96 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 96 transition count 129
Applied a total of 136 rules in 25 ms. Remains 96 /150 variables (removed 54) and now considering 129/261 (removed 132) transitions.
// Phase 1: matrix 129 rows 96 cols
[2025-05-30 03:19:03] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:19:03] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-30 03:19:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:19:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 03:19:03] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-05-30 03:19:03] [INFO ] Invariant cache hit.
[2025-05-30 03:19:03] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/225 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 45/143 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:08] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 144 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8735 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 129/225 variables, 96/99 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 45/144 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 128/272 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 225/225 variables, and 272 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38872ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38873ms
Starting structural reductions in LTL mode, iteration 1 : 96/150 places, 129/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39565 ms. Remains : 96/150 places, 129/261 transitions.
Stuttering acceptance computed with spot in 793 ms :[(NOT p3), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), p1, (AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (OR p0 p1), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-00
Stuttering criterion allowed to conclude after 39 steps with 16 reset in 3 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-00 finished in 40516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 128 transition count 193
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 128 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 128 transition count 189
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 111 transition count 171
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 111 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 88 place count 111 transition count 165
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 98 transition count 146
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 98 transition count 146
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 98 transition count 137
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 128 place count 93 transition count 123
Iterating global reduction 3 with 5 rules applied. Total rules applied 133 place count 93 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 89 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 89 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 144 place count 88 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 145 place count 88 transition count 116
Applied a total of 145 rules in 19 ms. Remains 88 /150 variables (removed 62) and now considering 116/261 (removed 145) transitions.
// Phase 1: matrix 116 rows 88 cols
[2025-05-30 03:19:43] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:19:43] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-30 03:19:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:19:43] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 03:19:44] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2025-05-30 03:19:44] [INFO ] Invariant cache hit.
[2025-05-30 03:19:44] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/204 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 39/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 129 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5792 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/204 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 39/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 115/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 244 constraints, problems are : Problem set: 0 solved, 115 unsolved in 26179 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32066ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 32067ms
Starting structural reductions in LTL mode, iteration 1 : 88/150 places, 116/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32514 ms. Remains : 88/150 places, 116/261 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 338 ms.
Product exploration explored 100000 steps with 50000 reset in 303 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 302 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-02 finished in 33367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0))||F(G(p1))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 128 transition count 189
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 128 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 128 transition count 185
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 111 transition count 167
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 111 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 89 place count 111 transition count 160
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 98 transition count 141
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 98 transition count 141
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 98 transition count 132
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 129 place count 93 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 134 place count 93 transition count 118
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 138 place count 89 transition count 114
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 89 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 89 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 87 transition count 110
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 87 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 149 place count 87 transition count 109
Applied a total of 149 rules in 12 ms. Remains 87 /150 variables (removed 63) and now considering 109/261 (removed 152) transitions.
// Phase 1: matrix 109 rows 87 cols
[2025-05-30 03:20:16] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:20:17] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-05-30 03:20:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:20:17] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-30 03:20:17] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2025-05-30 03:20:17] [INFO ] Invariant cache hit.
[2025-05-30 03:20:17] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/196 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 35/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 124 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4827 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/196 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 35/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 108/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 232 constraints, problems are : Problem set: 0 solved, 108 unsolved in 27121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31998ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 31999ms
Starting structural reductions in LTL mode, iteration 1 : 87/150 places, 109/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32419 ms. Remains : 87/150 places, 109/261 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-03
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-03 finished in 32626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 128 transition count 193
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 128 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 128 transition count 189
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 111 transition count 171
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 111 transition count 171
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 90 place count 111 transition count 163
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 102 place count 99 transition count 144
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 99 transition count 144
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 99 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 128 place count 94 transition count 123
Iterating global reduction 3 with 5 rules applied. Total rules applied 133 place count 94 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 94 transition count 122
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 137 place count 91 transition count 119
Iterating global reduction 4 with 3 rules applied. Total rules applied 140 place count 91 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 142 place count 91 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 90 transition count 116
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 90 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 145 place count 90 transition count 115
Applied a total of 145 rules in 33 ms. Remains 90 /150 variables (removed 60) and now considering 115/261 (removed 146) transitions.
// Phase 1: matrix 115 rows 90 cols
[2025-05-30 03:20:49] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:20:49] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-05-30 03:20:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:20:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 03:20:50] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:20:50] [INFO ] Redundant transitions in 2 ms returned []
Running 114 sub problems to find dead transitions.
[2025-05-30 03:20:50] [INFO ] Invariant cache hit.
[2025-05-30 03:20:50] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/205 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 130 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4638 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/205 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 114/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 244 constraints, problems are : Problem set: 0 solved, 114 unsolved in 24281 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28962ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 28963ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/150 places, 115/261 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29571 ms. Remains : 90/150 places, 115/261 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-04
Product exploration explored 100000 steps with 23016 reset in 227 ms.
Product exploration explored 100000 steps with 22979 reset in 251 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 307 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9225 resets) in 420 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1847 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7202 steps, run visited all 1 properties in 19 ms. (steps per millisecond=379 )
Probabilistic random walk after 7202 steps, saw 3285 distinct states, run finished after 20 ms. (steps per millisecond=360 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2025-05-30 03:21:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:21:20] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-05-30 03:21:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:21:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 03:21:20] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:21:20] [INFO ] Redundant transitions in 2 ms returned []
Running 114 sub problems to find dead transitions.
[2025-05-30 03:21:20] [INFO ] Invariant cache hit.
[2025-05-30 03:21:20] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/205 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 130 constraints, problems are : Problem set: 0 solved, 114 unsolved in 5925 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/205 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 114/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 244 constraints, problems are : Problem set: 0 solved, 114 unsolved in 25490 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31463ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 31464ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31867 ms. Remains : 90/90 places, 115/115 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 307 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9118 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1911 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7202 steps, run visited all 1 properties in 24 ms. (steps per millisecond=300 )
Probabilistic random walk after 7202 steps, saw 3285 distinct states, run finished after 24 ms. (steps per millisecond=300 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22871 reset in 194 ms.
Product exploration explored 100000 steps with 22981 reset in 184 ms.
Built C files in :
/tmp/ltsmin15295824734243007668
[2025-05-30 03:21:53] [INFO ] Computing symmetric may disable matrix : 115 transitions.
[2025-05-30 03:21:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:21:53] [INFO ] Computing symmetric may enable matrix : 115 transitions.
[2025-05-30 03:21:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:21:53] [INFO ] Computing Do-Not-Accords matrix : 115 transitions.
[2025-05-30 03:21:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:21:53] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15295824734243007668
Running compilation step : cd /tmp/ltsmin15295824734243007668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 610 ms.
Running link step : cd /tmp/ltsmin15295824734243007668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin15295824734243007668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11539849580055280423.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2025-05-30 03:22:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:22:08] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-05-30 03:22:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:22:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 03:22:08] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:22:08] [INFO ] Redundant transitions in 3 ms returned []
Running 114 sub problems to find dead transitions.
[2025-05-30 03:22:08] [INFO ] Invariant cache hit.
[2025-05-30 03:22:08] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/205 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 130 constraints, problems are : Problem set: 0 solved, 114 unsolved in 5528 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/205 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 114/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 244 constraints, problems are : Problem set: 0 solved, 114 unsolved in 25023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30598ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 30598ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30996 ms. Remains : 90/90 places, 115/115 transitions.
Built C files in :
/tmp/ltsmin10736135919237049858
[2025-05-30 03:22:39] [INFO ] Computing symmetric may disable matrix : 115 transitions.
[2025-05-30 03:22:39] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:22:39] [INFO ] Computing symmetric may enable matrix : 115 transitions.
[2025-05-30 03:22:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:22:39] [INFO ] Computing Do-Not-Accords matrix : 115 transitions.
[2025-05-30 03:22:39] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:22:39] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10736135919237049858
Running compilation step : cd /tmp/ltsmin10736135919237049858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 587 ms.
Running link step : cd /tmp/ltsmin10736135919237049858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin10736135919237049858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased71969733603354232.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 03:22:54] [INFO ] Flatten gal took : 11 ms
[2025-05-30 03:22:54] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:22:54] [INFO ] Time to serialize gal into /tmp/LTL10230998156131287462.gal : 5 ms
[2025-05-30 03:22:54] [INFO ] Time to serialize properties into /tmp/LTL16243355271603145419.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10230998156131287462.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7954767466274659236.hoa' '-atoms' '/tmp/LTL16243355271603145419.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16243355271603145419.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7954767466274659236.hoa
Detected timeout of ITS tools.
[2025-05-30 03:23:09] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:23:09] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:23:09] [INFO ] Time to serialize gal into /tmp/LTL17054132153470235263.gal : 5 ms
[2025-05-30 03:23:09] [INFO ] Time to serialize properties into /tmp/LTL10896600798771515847.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17054132153470235263.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10896600798771515847.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l1241<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1241<1))"
Detected timeout of ITS tools.
[2025-05-30 03:23:24] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:23:24] [INFO ] Applying decomposition
[2025-05-30 03:23:24] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14403543260800906723.txt' '-o' '/tmp/graph14403543260800906723.bin' '-w' '/tmp/graph14403543260800906723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14403543260800906723.bin' '-l' '-1' '-v' '-w' '/tmp/graph14403543260800906723.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:23:25] [INFO ] Decomposing Gal with order
[2025-05-30 03:23:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:23:25] [INFO ] Removed a total of 92 redundant transitions.
[2025-05-30 03:23:25] [INFO ] Flatten gal took : 75 ms
[2025-05-30 03:23:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 14 ms.
[2025-05-30 03:23:25] [INFO ] Time to serialize gal into /tmp/LTL16529420786572506027.gal : 6 ms
[2025-05-30 03:23:25] [INFO ] Time to serialize properties into /tmp/LTL16421540004883015495.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16529420786572506027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16421540004883015495.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i6.u1.s1<1)||(i5.u15.l1241<1))"))))
Formula 0 simplified : FG!"((i6.u1.s1<1)||(i5.u15.l1241<1))"
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-04 finished in 170692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 128 transition count 189
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 128 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 128 transition count 185
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 111 transition count 167
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 111 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 89 place count 111 transition count 160
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 103 place count 97 transition count 139
Iterating global reduction 2 with 14 rules applied. Total rules applied 117 place count 97 transition count 139
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 126 place count 97 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 131 place count 92 transition count 120
Iterating global reduction 3 with 5 rules applied. Total rules applied 136 place count 92 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 137 place count 92 transition count 119
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 141 place count 88 transition count 115
Iterating global reduction 4 with 4 rules applied. Total rules applied 145 place count 88 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 147 place count 88 transition count 113
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 149 place count 86 transition count 111
Iterating global reduction 5 with 2 rules applied. Total rules applied 151 place count 86 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 152 place count 86 transition count 110
Applied a total of 152 rules in 47 ms. Remains 86 /150 variables (removed 64) and now considering 110/261 (removed 151) transitions.
// Phase 1: matrix 110 rows 86 cols
[2025-05-30 03:23:40] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:23:40] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-05-30 03:23:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:23:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 03:23:40] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:23:40] [INFO ] Redundant transitions in 4 ms returned []
Running 109 sub problems to find dead transitions.
[2025-05-30 03:23:40] [INFO ] Invariant cache hit.
[2025-05-30 03:23:40] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:43] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:23:43] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 128 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5705 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/196 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 38/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 109/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 237 constraints, problems are : Problem set: 0 solved, 109 unsolved in 24428 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30209ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 30210ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/150 places, 110/261 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30760 ms. Remains : 86/150 places, 110/261 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-05 finished in 30823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(X(p0))&&G(p1))) U (X(X(p2))||F(p3)))))'
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 131 transition count 206
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 131 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 131 transition count 202
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 116 transition count 186
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 116 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 116 transition count 180
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 105 transition count 164
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 105 transition count 164
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 109 place count 105 transition count 155
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 102 transition count 146
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 102 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 100 transition count 144
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 100 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 121 place count 100 transition count 142
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 99 transition count 141
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 99 transition count 141
Applied a total of 123 rules in 10 ms. Remains 99 /150 variables (removed 51) and now considering 141/261 (removed 120) transitions.
// Phase 1: matrix 141 rows 99 cols
[2025-05-30 03:24:11] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:24:11] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-30 03:24:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:24:11] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-30 03:24:11] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2025-05-30 03:24:11] [INFO ] Invariant cache hit.
[2025-05-30 03:24:11] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/240 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 55/156 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 156 constraints, problems are : Problem set: 0 solved, 140 unsolved in 7410 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/240 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 55/156 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 140/296 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 296 constraints, problems are : Problem set: 0 solved, 140 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37487ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 37487ms
Starting structural reductions in LTL mode, iteration 1 : 99/150 places, 141/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38246 ms. Remains : 99/150 places, 141/261 transitions.
Stuttering acceptance computed with spot in 531 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) p1 (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-06 finished in 38829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(G(p1)))))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 129 transition count 194
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 129 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 129 transition count 190
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 62 place count 113 transition count 173
Iterating global reduction 1 with 16 rules applied. Total rules applied 78 place count 113 transition count 173
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 83 place count 113 transition count 168
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 95 place count 101 transition count 151
Iterating global reduction 2 with 12 rules applied. Total rules applied 107 place count 101 transition count 151
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 116 place count 101 transition count 142
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 121 place count 96 transition count 128
Iterating global reduction 3 with 5 rules applied. Total rules applied 126 place count 96 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 130 place count 92 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 92 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 92 transition count 122
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 138 place count 90 transition count 120
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 90 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 90 transition count 119
Applied a total of 141 rules in 24 ms. Remains 90 /150 variables (removed 60) and now considering 119/261 (removed 142) transitions.
// Phase 1: matrix 119 rows 90 cols
[2025-05-30 03:24:49] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:24:50] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-05-30 03:24:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:24:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-30 03:24:50] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:24:50] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
[2025-05-30 03:24:50] [INFO ] Invariant cache hit.
[2025-05-30 03:24:50] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/209 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 118 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 134 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5904 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/209 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 42/134 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 118/252 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 252 constraints, problems are : Problem set: 0 solved, 118 unsolved in 29686 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35636ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 35637ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/150 places, 119/261 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36370 ms. Remains : 90/150 places, 119/261 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-07 finished in 36523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U X(X(p1))) U p1)))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 128 transition count 189
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 128 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 128 transition count 186
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 64 place count 111 transition count 168
Iterating global reduction 1 with 17 rules applied. Total rules applied 81 place count 111 transition count 168
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 111 transition count 160
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 98 transition count 141
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 98 transition count 141
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 123 place count 98 transition count 133
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 128 place count 93 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 133 place count 93 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 93 transition count 117
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 137 place count 90 transition count 114
Iterating global reduction 4 with 3 rules applied. Total rules applied 140 place count 90 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 142 place count 90 transition count 112
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 144 place count 88 transition count 110
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 88 transition count 110
Applied a total of 146 rules in 11 ms. Remains 88 /150 variables (removed 62) and now considering 110/261 (removed 151) transitions.
// Phase 1: matrix 110 rows 88 cols
[2025-05-30 03:25:26] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:25:26] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-30 03:25:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:25:26] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-30 03:25:26] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2025-05-30 03:25:26] [INFO ] Invariant cache hit.
[2025-05-30 03:25:27] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 8754 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 23511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32334ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 32334ms
Starting structural reductions in LTL mode, iteration 1 : 88/150 places, 110/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32851 ms. Remains : 88/150 places, 110/261 transitions.
Stuttering acceptance computed with spot in 376 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-08 finished in 33256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U (!X(G(p1)) U p0)))||F(p2)))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 130 transition count 200
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 130 transition count 200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 130 transition count 196
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 61 place count 113 transition count 178
Iterating global reduction 1 with 17 rules applied. Total rules applied 78 place count 113 transition count 178
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 87 place count 113 transition count 169
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 100 place count 100 transition count 149
Iterating global reduction 2 with 13 rules applied. Total rules applied 113 place count 100 transition count 149
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 121 place count 100 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 126 place count 95 transition count 131
Iterating global reduction 3 with 5 rules applied. Total rules applied 131 place count 95 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 95 transition count 130
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 136 place count 91 transition count 126
Iterating global reduction 4 with 4 rules applied. Total rules applied 140 place count 91 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 142 place count 91 transition count 124
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 144 place count 89 transition count 122
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 89 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 147 place count 89 transition count 121
Applied a total of 147 rules in 7 ms. Remains 89 /150 variables (removed 61) and now considering 121/261 (removed 140) transitions.
// Phase 1: matrix 121 rows 89 cols
[2025-05-30 03:25:59] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:25:59] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-05-30 03:25:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:25:59] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 03:26:00] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-05-30 03:26:00] [INFO ] Invariant cache hit.
[2025-05-30 03:26:00] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/210 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 49/140 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:06] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:06] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 8 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/210 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:07] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:07] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:07] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:07] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:07] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:07] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:09] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:09] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:09] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:09] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:11] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:13] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:26:13] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 13 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/210 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (OVERLAPS) 0/210 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 155 constraints, problems are : Problem set: 0 solved, 120 unsolved in 17888 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/210 variables, 89/106 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 49/155 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 120/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 275 constraints, problems are : Problem set: 0 solved, 120 unsolved in 24174 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42139ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 42141ms
Starting structural reductions in LTL mode, iteration 1 : 89/150 places, 121/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42665 ms. Remains : 89/150 places, 121/261 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-09
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-09 finished in 42871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 128 transition count 193
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 128 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 128 transition count 189
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 111 transition count 171
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 111 transition count 171
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 90 place count 111 transition count 163
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 102 place count 99 transition count 145
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 99 transition count 145
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 99 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 95 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 95 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 92 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 92 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 139 place count 92 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 91 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 91 transition count 118
Applied a total of 141 rules in 23 ms. Remains 91 /150 variables (removed 59) and now considering 118/261 (removed 143) transitions.
// Phase 1: matrix 118 rows 91 cols
[2025-05-30 03:26:42] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:26:42] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-05-30 03:26:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:26:42] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-30 03:26:43] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:26:43] [INFO ] Redundant transitions in 1 ms returned []
Running 117 sub problems to find dead transitions.
[2025-05-30 03:26:43] [INFO ] Invariant cache hit.
[2025-05-30 03:26:43] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/209 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5258 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/209 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 13433 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18754ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 18754ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/150 places, 118/261 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19406 ms. Remains : 91/150 places, 118/261 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-10
Product exploration explored 100000 steps with 22900 reset in 328 ms.
Product exploration explored 100000 steps with 22833 reset in 298 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 311 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9135 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1869 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1928 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1895 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1940 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 27418 steps, run visited all 4 properties in 133 ms. (steps per millisecond=206 )
Probabilistic random walk after 27418 steps, saw 12710 distinct states, run finished after 133 ms. (steps per millisecond=206 ) properties seen :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 337 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2025-05-30 03:27:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:27:04] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-05-30 03:27:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:27:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-30 03:27:04] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:27:04] [INFO ] Redundant transitions in 1 ms returned []
Running 117 sub problems to find dead transitions.
[2025-05-30 03:27:04] [INFO ] Invariant cache hit.
[2025-05-30 03:27:04] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/209 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5867 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/209 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 12924 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18862ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 18864ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19352 ms. Remains : 91/91 places, 118/118 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 311 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 127 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9328 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1946 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1860 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1967 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 27418 steps, run visited all 4 properties in 133 ms. (steps per millisecond=206 )
Probabilistic random walk after 27418 steps, saw 12710 distinct states, run finished after 134 ms. (steps per millisecond=204 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 350 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22826 reset in 164 ms.
Product exploration explored 100000 steps with 22945 reset in 169 ms.
Built C files in :
/tmp/ltsmin12702397108162771252
[2025-05-30 03:27:24] [INFO ] Computing symmetric may disable matrix : 118 transitions.
[2025-05-30 03:27:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:27:24] [INFO ] Computing symmetric may enable matrix : 118 transitions.
[2025-05-30 03:27:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:27:24] [INFO ] Computing Do-Not-Accords matrix : 118 transitions.
[2025-05-30 03:27:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:27:24] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12702397108162771252
Running compilation step : cd /tmp/ltsmin12702397108162771252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 417 ms.
Running link step : cd /tmp/ltsmin12702397108162771252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12702397108162771252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8062234967798307017.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 118/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2025-05-30 03:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:27:39] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-05-30 03:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:27:40] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-30 03:27:40] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:27:40] [INFO ] Redundant transitions in 2 ms returned []
Running 117 sub problems to find dead transitions.
[2025-05-30 03:27:40] [INFO ] Invariant cache hit.
[2025-05-30 03:27:40] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/209 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 6833 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/209 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 251 constraints, problems are : Problem set: 0 solved, 117 unsolved in 14234 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21130ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 21131ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21552 ms. Remains : 91/91 places, 118/118 transitions.
Built C files in :
/tmp/ltsmin13564977326020515933
[2025-05-30 03:28:01] [INFO ] Computing symmetric may disable matrix : 118 transitions.
[2025-05-30 03:28:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:28:01] [INFO ] Computing symmetric may enable matrix : 118 transitions.
[2025-05-30 03:28:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:28:01] [INFO ] Computing Do-Not-Accords matrix : 118 transitions.
[2025-05-30 03:28:01] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:28:01] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13564977326020515933
Running compilation step : cd /tmp/ltsmin13564977326020515933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 608 ms.
Running link step : cd /tmp/ltsmin13564977326020515933;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13564977326020515933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased436950904430301680.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 03:28:16] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:28:16] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:28:16] [INFO ] Time to serialize gal into /tmp/LTL15132360481385473564.gal : 3 ms
[2025-05-30 03:28:16] [INFO ] Time to serialize properties into /tmp/LTL7908745500096740754.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15132360481385473564.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17423301068151777119.hoa' '-atoms' '/tmp/LTL7908745500096740754.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7908745500096740754.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17423301068151777119.hoa
Detected timeout of ITS tools.
[2025-05-30 03:28:31] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:28:31] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:28:31] [INFO ] Time to serialize gal into /tmp/LTL10012207898906445839.gal : 1 ms
[2025-05-30 03:28:31] [INFO ] Time to serialize properties into /tmp/LTL12437210614367390816.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10012207898906445839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12437210614367390816.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((s1<1)||(l1282<1))")||(G("((s1<1)||(l1023<1))"))))))
Formula 0 simplified : G(F!"((s1<1)||(l1023<1))" & FG!"((s1<1)||(l1282<1))")
Detected timeout of ITS tools.
[2025-05-30 03:28:46] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:28:46] [INFO ] Applying decomposition
[2025-05-30 03:28:46] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5793011496162811810.txt' '-o' '/tmp/graph5793011496162811810.bin' '-w' '/tmp/graph5793011496162811810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5793011496162811810.bin' '-l' '-1' '-v' '-w' '/tmp/graph5793011496162811810.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:28:46] [INFO ] Decomposing Gal with order
[2025-05-30 03:28:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:28:46] [INFO ] Removed a total of 117 redundant transitions.
[2025-05-30 03:28:46] [INFO ] Flatten gal took : 20 ms
[2025-05-30 03:28:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 10 ms.
[2025-05-30 03:28:46] [INFO ] Time to serialize gal into /tmp/LTL7118936988810814623.gal : 4 ms
[2025-05-30 03:28:46] [INFO ] Time to serialize properties into /tmp/LTL4349629625712078249.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7118936988810814623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4349629625712078249.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i3.u2.s1<1)||(i4.u19.l1282<1))")||(G("((i3.u2.s1<1)||(i5.i1.u16.l1023<1))"))))))
Formula 0 simplified : G(F!"((i3.u2.s1<1)||(i5.i1.u16.l1023<1))" & FG!"((i3.u2.s1<1)||(i4.u19.l1282<1))")
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-10 finished in 139299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!((!p0 U X(X(X((X(p2)&&p1))))) U !p2)))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 129 transition count 193
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 129 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 129 transition count 189
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 62 place count 113 transition count 172
Iterating global reduction 1 with 16 rules applied. Total rules applied 78 place count 113 transition count 172
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 86 place count 113 transition count 164
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 98 place count 101 transition count 146
Iterating global reduction 2 with 12 rules applied. Total rules applied 110 place count 101 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 116 place count 101 transition count 140
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 121 place count 96 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 126 place count 96 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 127 place count 96 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 130 place count 93 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 93 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 135 place count 93 transition count 119
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 137 place count 91 transition count 117
Iterating global reduction 5 with 2 rules applied. Total rules applied 139 place count 91 transition count 117
Applied a total of 139 rules in 10 ms. Remains 91 /150 variables (removed 59) and now considering 117/261 (removed 144) transitions.
// Phase 1: matrix 117 rows 91 cols
[2025-05-30 03:29:01] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:29:02] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-05-30 03:29:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:29:02] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-30 03:29:02] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2025-05-30 03:29:02] [INFO ] Invariant cache hit.
[2025-05-30 03:29:02] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/208 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 128 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5166 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/208 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 116/244 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 244 constraints, problems are : Problem set: 0 solved, 116 unsolved in 20113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25328ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 25329ms
Starting structural reductions in LTL mode, iteration 1 : 91/150 places, 117/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25724 ms. Remains : 91/150 places, 117/261 transitions.
Stuttering acceptance computed with spot in 1068 ms :[(NOT p2), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-11 finished in 26834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1&&X(G(p2))))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 129 transition count 191
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 129 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 129 transition count 188
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 62 place count 112 transition count 170
Iterating global reduction 1 with 17 rules applied. Total rules applied 79 place count 112 transition count 170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 87 place count 112 transition count 162
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 100 place count 99 transition count 143
Iterating global reduction 2 with 13 rules applied. Total rules applied 113 place count 99 transition count 143
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 121 place count 99 transition count 135
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 125 place count 95 transition count 126
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 95 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 130 place count 95 transition count 125
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 133 place count 92 transition count 122
Iterating global reduction 4 with 3 rules applied. Total rules applied 136 place count 92 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 138 place count 92 transition count 120
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 140 place count 90 transition count 118
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 90 transition count 118
Applied a total of 142 rules in 10 ms. Remains 90 /150 variables (removed 60) and now considering 118/261 (removed 143) transitions.
// Phase 1: matrix 118 rows 90 cols
[2025-05-30 03:29:28] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:29:28] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-30 03:29:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:29:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-30 03:29:29] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2025-05-30 03:29:29] [INFO ] Invariant cache hit.
[2025-05-30 03:29:29] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 41/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 133 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5647 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 41/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 117/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 250 constraints, problems are : Problem set: 0 solved, 117 unsolved in 18869 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24571ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 24573ms
Starting structural reductions in LTL mode, iteration 1 : 90/150 places, 118/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25141 ms. Remains : 90/150 places, 118/261 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-12
Product exploration explored 100000 steps with 22814 reset in 380 ms.
Product exploration explored 100000 steps with 23127 reset in 406 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 130 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 40000 steps (9215 resets) in 503 ms. (79 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1908 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1909 resets) in 484 ms. (82 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1893 resets) in 205 ms. (194 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1844 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1915 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 25271 steps, run visited all 5 properties in 137 ms. (steps per millisecond=184 )
Probabilistic random walk after 25271 steps, saw 11782 distinct states, run finished after 137 ms. (steps per millisecond=184 ) properties seen :5
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND (OR p0 p1) p2))), (F (NOT (OR (AND p0 p2) (AND p2 p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 15 factoid took 306 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-12 finished in 27154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 129 transition count 191
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 129 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 129 transition count 187
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 63 place count 112 transition count 169
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 112 transition count 169
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 88 place count 112 transition count 161
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 99 transition count 141
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 99 transition count 141
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 122 place count 99 transition count 133
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 126 place count 95 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 95 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 95 transition count 123
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 92 transition count 120
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 92 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 90 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 90 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 142 place count 90 transition count 117
Applied a total of 142 rules in 10 ms. Remains 90 /150 variables (removed 60) and now considering 117/261 (removed 144) transitions.
// Phase 1: matrix 117 rows 90 cols
[2025-05-30 03:29:55] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:29:56] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-05-30 03:29:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:29:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-30 03:29:56] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2025-05-30 03:29:56] [INFO ] Invariant cache hit.
[2025-05-30 03:29:56] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/207 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:00] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:00] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:00] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:03] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:03] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 12 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/207 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:04] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:07] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:07] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 15 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/207 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:08] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 14 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 141 constraints, problems are : Problem set: 0 solved, 116 unsolved in 17351 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/207 variables, 90/101 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 40/141 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 116/257 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 207/207 variables, and 257 constraints, problems are : Problem set: 0 solved, 116 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47406ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 47406ms
Starting structural reductions in LTL mode, iteration 1 : 90/150 places, 117/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48054 ms. Remains : 90/150 places, 117/261 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-14
Product exploration explored 100000 steps with 22888 reset in 285 ms.
Product exploration explored 100000 steps with 23006 reset in 363 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (9231 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1881 resets) in 44 ms. (888 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (1922 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
[2025-05-30 03:30:45] [INFO ] Invariant cache hit.
[2025-05-30 03:30:45] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/207 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 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
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/207 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 740ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 117/117 transitions.
Graph (complete) has 282 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 86 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 86 transition count 109
Applied a total of 11 rules in 19 ms. Remains 86 /90 variables (removed 4) and now considering 109/117 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 86/90 places, 109/117 transitions.
RANDOM walk for 40000 steps (9202 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1941 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8656 steps, run visited all 1 properties in 26 ms. (steps per millisecond=332 )
Probabilistic random walk after 8656 steps, saw 4022 distinct states, run finished after 27 ms. (steps per millisecond=320 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2025-05-30 03:30:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:30:46] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-05-30 03:30:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:30:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-30 03:30:46] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:30:46] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2025-05-30 03:30:46] [INFO ] Invariant cache hit.
[2025-05-30 03:30:46] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/207 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:50] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:51] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:51] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:54] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:54] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 13 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/207 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:55] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:57] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:57] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 16 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/207 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:30:59] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 14 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 141 constraints, problems are : Problem set: 0 solved, 116 unsolved in 16004 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/207 variables, 90/101 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 40/141 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 116/257 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 207/207 variables, and 257 constraints, problems are : Problem set: 0 solved, 116 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46085ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 46086ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46791 ms. Remains : 90/90 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (9167 resets) in 139 ms. (285 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (1897 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2025-05-30 03:31:33] [INFO ] Invariant cache hit.
[2025-05-30 03:31:33] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/207 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 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
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/146 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/203 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/207 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 634ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 117/117 transitions.
Graph (complete) has 282 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 86 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 86 transition count 109
Applied a total of 11 rules in 12 ms. Remains 86 /90 variables (removed 4) and now considering 109/117 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 86/90 places, 109/117 transitions.
RANDOM walk for 40000 steps (9214 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1898 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8656 steps, run visited all 1 properties in 30 ms. (steps per millisecond=288 )
Probabilistic random walk after 8656 steps, saw 4022 distinct states, run finished after 30 ms. (steps per millisecond=288 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22974 reset in 177 ms.
Product exploration explored 100000 steps with 22933 reset in 194 ms.
Built C files in :
/tmp/ltsmin16493291254091488016
[2025-05-30 03:31:34] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2025-05-30 03:31:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:31:34] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2025-05-30 03:31:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:31:34] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2025-05-30 03:31:34] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:31:34] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16493291254091488016
Running compilation step : cd /tmp/ltsmin16493291254091488016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 376 ms.
Running link step : cd /tmp/ltsmin16493291254091488016;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16493291254091488016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15612424081461680455.hoa' '--buchi-type=spotba'
LTSmin run took 371 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-14 finished in 99757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 261/261 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 127 transition count 188
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 127 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 127 transition count 184
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 109 transition count 165
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 109 transition count 165
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 94 place count 109 transition count 157
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 96 transition count 138
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 96 transition count 138
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 129 place count 96 transition count 129
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 134 place count 91 transition count 115
Iterating global reduction 3 with 5 rules applied. Total rules applied 139 place count 91 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 87 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 87 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 87 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 151 place count 85 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 85 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 154 place count 85 transition count 106
Applied a total of 154 rules in 6 ms. Remains 85 /150 variables (removed 65) and now considering 106/261 (removed 155) transitions.
// Phase 1: matrix 106 rows 85 cols
[2025-05-30 03:31:35] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:31:35] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-30 03:31:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:31:35] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-30 03:31:35] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-05-30 03:31:35] [INFO ] Invariant cache hit.
[2025-05-30 03:31:35] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/191 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 121 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5670 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/191 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 105/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 226 constraints, problems are : Problem set: 0 solved, 105 unsolved in 26880 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32588ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 32588ms
Starting structural reductions in LTL mode, iteration 1 : 85/150 places, 106/261 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32941 ms. Remains : 85/150 places, 106/261 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 288 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-15 finished in 33436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2025-05-30 03:32:09] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10948020044159408994
[2025-05-30 03:32:09] [INFO ] Applying decomposition
[2025-05-30 03:32:09] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2025-05-30 03:32:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:32:09] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2025-05-30 03:32:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:32:09] [INFO ] Flatten gal took : 28 ms
[2025-05-30 03:32:09] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2025-05-30 03:32:09] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8036030073160385765.txt' '-o' '/tmp/graph8036030073160385765.bin' '-w' '/tmp/graph8036030073160385765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8036030073160385765.bin' '-l' '-1' '-v' '-w' '/tmp/graph8036030073160385765.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:32:09] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10948020044159408994
Running compilation step : cd /tmp/ltsmin10948020044159408994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 03:32:09] [INFO ] Decomposing Gal with order
[2025-05-30 03:32:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:32:09] [INFO ] Removed a total of 315 redundant transitions.
[2025-05-30 03:32:09] [INFO ] Flatten gal took : 38 ms
[2025-05-30 03:32:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 256 labels/synchronizations in 14 ms.
[2025-05-30 03:32:09] [INFO ] Time to serialize gal into /tmp/LTLFireability10936246793071649661.gal : 4 ms
[2025-05-30 03:32:09] [INFO ] Time to serialize properties into /tmp/LTLFireability14221720639981896327.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10936246793071649661.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14221720639981896327.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((G(F("((i3.i1.u0.s1<1)||(i3.i0.u24.l1241<1))"))))
Formula 0 simplified : FG!"((i3.i1.u0.s1<1)||(i3.i0.u24.l1241<1))"
Compilation finished in 1093 ms.
Running link step : cd /tmp/ltsmin10948020044159408994;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10948020044159408994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10948020044159408994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10948020044159408994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 03:56:58] [INFO ] Flatten gal took : 43 ms
[2025-05-30 03:56:58] [INFO ] Time to serialize gal into /tmp/LTLFireability9600444363790508057.gal : 3 ms
[2025-05-30 03:56:58] [INFO ] Time to serialize properties into /tmp/LTLFireability1437242715572037821.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9600444363790508057.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1437242715572037821.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l1241<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1241<1))"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10948020044159408994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin10948020044159408994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t21, t23, t24, t46, t47, t48, t50, t51, t52, t53, t54,...954
Computing Next relation with stutter on 9.31306e+07 deadlock states

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-d1m07"
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-5832"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m07, 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 r058-smll-174854063500084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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