About the Execution of ITS-Tools for DBSingleClientW-PT-d2m05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 793505.00 | 0.00 | 0.00 | FFFFFFFFFFFFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063600124.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-d2m05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063600124
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 1.6M 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-d2m05-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748606453589
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-d2m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 12:00:56] [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 12:00:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:00:56] [INFO ] Load time of PNML (sax parser for PT used): 552 ms
[2025-05-30 12:00:56] [INFO ] Transformed 4763 places.
[2025-05-30 12:00:56] [INFO ] Transformed 2478 transitions.
[2025-05-30 12:00:56] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 806 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 3580 places in 36 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 367 places :
Symmetric choice reduction at 1 with 367 rule applications. Total rules 612 place count 770 transition count 1482
Iterating global reduction 1 with 367 rules applied. Total rules applied 979 place count 770 transition count 1482
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 1051 place count 770 transition count 1410
Discarding 294 places :
Symmetric choice reduction at 2 with 294 rule applications. Total rules 1345 place count 476 transition count 1116
Iterating global reduction 2 with 294 rules applied. Total rules applied 1639 place count 476 transition count 1116
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1645 place count 476 transition count 1110
Discarding 218 places :
Symmetric choice reduction at 3 with 218 rule applications. Total rules 1863 place count 258 transition count 811
Iterating global reduction 3 with 218 rules applied. Total rules applied 2081 place count 258 transition count 811
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Iterating post reduction 3 with 254 rules applied. Total rules applied 2335 place count 258 transition count 557
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 2350 place count 243 transition count 531
Iterating global reduction 4 with 15 rules applied. Total rules applied 2365 place count 243 transition count 531
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2373 place count 243 transition count 523
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2380 place count 236 transition count 516
Iterating global reduction 5 with 7 rules applied. Total rules applied 2387 place count 236 transition count 516
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2390 place count 236 transition count 513
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2395 place count 231 transition count 508
Iterating global reduction 6 with 5 rules applied. Total rules applied 2400 place count 231 transition count 508
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 2403 place count 231 transition count 505
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2404 place count 230 transition count 503
Iterating global reduction 7 with 1 rules applied. Total rules applied 2405 place count 230 transition count 503
Applied a total of 2405 rules in 428 ms. Remains 230 /1183 variables (removed 953) and now considering 503/2478 (removed 1975) transitions.
// Phase 1: matrix 503 rows 230 cols
[2025-05-30 12:00:57] [INFO ] Computed 2 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:58] [INFO ] Implicit Places using invariants in 1008 ms returned []
[2025-05-30 12:00:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:59] [INFO ] State equation strengthened by 287 read => feed constraints.
[2025-05-30 12:01:02] [INFO ] Implicit Places using invariants and state equation in 3681 ms returned []
Implicit Place search using SMT with State Equation took 4761 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2025-05-30 12:01:02] [INFO ] Invariant cache hit.
[2025-05-30 12:01:02] [INFO ] State equation strengthened by 287 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 503/733 variables, 230/232 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/733 variables, 287/519 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 733/733 variables, and 519 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 230/230 constraints, ReadFeed: 287/287 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 503/733 variables, 230/232 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/733 variables, 287/519 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 733/733 variables, and 1021 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30386 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 230/230 constraints, ReadFeed: 287/287 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62036ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 62075ms
Starting structural reductions in LTL mode, iteration 1 : 230/1183 places, 503/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67312 ms. Remains : 230/1183 places, 503/2478 transitions.
Support contains 40 out of 230 places after structural reductions.
[2025-05-30 12:02:05] [INFO ] Flatten gal took : 92 ms
[2025-05-30 12:02:05] [INFO ] Flatten gal took : 49 ms
[2025-05-30 12:02:05] [INFO ] Input system was already deterministic with 503 transitions.
Support contains 39 out of 230 places (down from 40) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 37 to 36
RANDOM walk for 40000 steps (9131 resets) in 5157 ms. (7 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4004 steps (210 resets) in 64 ms. (61 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (179 resets) in 51 ms. (77 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (156 resets) in 45 ms. (87 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (158 resets) in 97 ms. (40 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (169 resets) in 70 ms. (56 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (177 resets) in 52 ms. (75 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (164 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (185 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (155 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (380 resets) in 41 ms. (95 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (161 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (172 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (186 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (167 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (170 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (203 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (169 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (158 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (170 resets) in 27 ms. (143 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (419 resets) in 40 ms. (97 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (175 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (174 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (186 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (160 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (161 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (369 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (183 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (175 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (181 resets) in 21 ms. (181 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (172 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (172 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (195 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (181 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (170 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 449933 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :30 out of 33
Probabilistic random walk after 449933 steps, saw 172902 distinct states, run finished after 3007 ms. (steps per millisecond=149 ) properties seen :30
[2025-05-30 12:02:10] [INFO ] Invariant cache hit.
[2025-05-30 12:02:10] [INFO ] State equation strengthened by 287 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 84/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 53/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 255/399 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 39/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 8 (OVERLAPS) 316/715 variables, 77/262 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/715 variables, 239/501 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/715 variables, 0/501 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 11 (OVERLAPS) 18/733 variables, 9/510 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/733 variables, 9/519 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/733 variables, 0/519 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/733 variables, 0/519 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 733/733 variables, and 519 constraints, problems are : Problem set: 2 solved, 1 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 230/230 constraints, ReadFeed: 287/287 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/87 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/142 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/394 variables, 142/144 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 36/180 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 319/713 variables, 78/258 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/713 variables, 241/499 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/713 variables, 1/500 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/713 variables, 0/500 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/733 variables, 10/510 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/733 variables, 10/520 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/733 variables, 0/520 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/733 variables, 0/520 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 733/733 variables, and 520 constraints, problems are : Problem set: 2 solved, 1 unsolved in 2525 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 230/230 constraints, ReadFeed: 287/287 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3194ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 114 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 503/503 transitions.
Graph (complete) has 884 edges and 230 vertex of which 229 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 229 transition count 495
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 39 place count 199 transition count 345
Iterating global reduction 1 with 30 rules applied. Total rules applied 69 place count 199 transition count 345
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 72 place count 199 transition count 342
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 97 place count 174 transition count 313
Iterating global reduction 2 with 25 rules applied. Total rules applied 122 place count 174 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 174 transition count 307
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 148 place count 154 transition count 273
Iterating global reduction 3 with 20 rules applied. Total rules applied 168 place count 154 transition count 273
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 181 place count 154 transition count 260
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 194 place count 141 transition count 225
Iterating global reduction 4 with 13 rules applied. Total rules applied 207 place count 141 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 211 place count 141 transition count 221
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 217 place count 135 transition count 215
Iterating global reduction 5 with 6 rules applied. Total rules applied 223 place count 135 transition count 215
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 229 place count 135 transition count 209
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 234 place count 130 transition count 187
Iterating global reduction 6 with 5 rules applied. Total rules applied 239 place count 130 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 240 place count 130 transition count 186
Applied a total of 240 rules in 82 ms. Remains 130 /230 variables (removed 100) and now considering 186/503 (removed 317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 130/230 places, 186/503 transitions.
RANDOM walk for 40000 steps (9213 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1776 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 71660 steps, run visited all 1 properties in 113 ms. (steps per millisecond=634 )
Probabilistic random walk after 71660 steps, saw 31511 distinct states, run finished after 118 ms. (steps per millisecond=607 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 5 stabilizing places and 38 stable transitions
Graph (complete) has 962 edges and 230 vertex of which 229 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 p1) U ((p2||F(!p0)) U p3)))'
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 203 transition count 364
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 203 transition count 364
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 203 transition count 361
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 78 place count 182 transition count 336
Iterating global reduction 1 with 21 rules applied. Total rules applied 99 place count 182 transition count 336
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 106 place count 182 transition count 329
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 124 place count 164 transition count 302
Iterating global reduction 2 with 18 rules applied. Total rules applied 142 place count 164 transition count 302
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 153 place count 164 transition count 291
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 164 place count 153 transition count 259
Iterating global reduction 3 with 11 rules applied. Total rules applied 175 place count 153 transition count 259
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 190 place count 153 transition count 244
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 194 place count 149 transition count 240
Iterating global reduction 4 with 4 rules applied. Total rules applied 198 place count 149 transition count 240
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 203 place count 149 transition count 235
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 208 place count 144 transition count 213
Iterating global reduction 5 with 5 rules applied. Total rules applied 213 place count 144 transition count 213
Applied a total of 213 rules in 68 ms. Remains 144 /230 variables (removed 86) and now considering 213/503 (removed 290) transitions.
// Phase 1: matrix 213 rows 144 cols
[2025-05-30 12:02:14] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:02:14] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-05-30 12:02:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:02:14] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-05-30 12:02:15] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:02:15] [INFO ] Redundant transitions in 17 ms returned []
Running 212 sub problems to find dead transitions.
[2025-05-30 12:02:15] [INFO ] Invariant cache hit.
[2025-05-30 12:02:15] [INFO ] State equation strengthened by 73 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/357 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 73/219 constraints. Problems are: Problem set: 0 solved, 212 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/357 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 219 constraints, problems are : Problem set: 0 solved, 212 unsolved in 20387 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/357 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 73/219 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 212/431 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/357 variables, and 431 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50636ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 50640ms
Starting structural reductions in SI_LTL mode, iteration 1 : 144/230 places, 213/503 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51588 ms. Remains : 144/230 places, 213/503 transitions.
Stuttering acceptance computed with spot in 543 ms :[(NOT p3), p0, (AND p0 p1 (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-01 finished in 52263 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||(p1&&G(p2))))))'
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 202 transition count 361
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 202 transition count 361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 202 transition count 358
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 82 place count 179 transition count 334
Iterating global reduction 1 with 23 rules applied. Total rules applied 105 place count 179 transition count 334
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 111 place count 179 transition count 328
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 130 place count 160 transition count 294
Iterating global reduction 2 with 19 rules applied. Total rules applied 149 place count 160 transition count 294
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 163 place count 160 transition count 280
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 175 place count 148 transition count 246
Iterating global reduction 3 with 12 rules applied. Total rules applied 187 place count 148 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 191 place count 148 transition count 242
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 196 place count 143 transition count 237
Iterating global reduction 4 with 5 rules applied. Total rules applied 201 place count 143 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 205 place count 143 transition count 233
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 206 place count 142 transition count 232
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 142 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 208 place count 142 transition count 231
Applied a total of 208 rules in 162 ms. Remains 142 /230 variables (removed 88) and now considering 231/503 (removed 272) transitions.
// Phase 1: matrix 231 rows 142 cols
[2025-05-30 12:03:06] [INFO ] Computed 2 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:03:07] [INFO ] Implicit Places using invariants in 491 ms returned []
[2025-05-30 12:03:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:03:07] [INFO ] State equation strengthened by 95 read => feed constraints.
[2025-05-30 12:03:08] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1556 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:03:08] [INFO ] Redundant transitions in 20 ms returned []
Running 230 sub problems to find dead transitions.
[2025-05-30 12:03:08] [INFO ] Invariant cache hit.
[2025-05-30 12:03:08] [INFO ] State equation strengthened by 95 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 231/373 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 95/239 constraints. Problems are: Problem set: 0 solved, 230 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 0/373 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 239 constraints, problems are : Problem set: 0 solved, 230 unsolved in 24013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 231/373 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 95/239 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 230/469 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 469 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54350ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 54352ms
Starting structural reductions in SI_LTL mode, iteration 1 : 142/230 places, 231/503 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56101 ms. Remains : 142/230 places, 231/503 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-03 finished in 56336 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((X((X(p1)&&p0)) U G((p2||F(p3))))))'
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 202 transition count 367
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 202 transition count 367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 202 transition count 364
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 82 place count 179 transition count 337
Iterating global reduction 1 with 23 rules applied. Total rules applied 105 place count 179 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 108 place count 179 transition count 334
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 126 place count 161 transition count 303
Iterating global reduction 2 with 18 rules applied. Total rules applied 144 place count 161 transition count 303
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 157 place count 161 transition count 290
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 168 place count 150 transition count 255
Iterating global reduction 3 with 11 rules applied. Total rules applied 179 place count 150 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 150 transition count 253
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 187 place count 144 transition count 247
Iterating global reduction 4 with 6 rules applied. Total rules applied 193 place count 144 transition count 247
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 199 place count 144 transition count 241
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 204 place count 139 transition count 219
Iterating global reduction 5 with 5 rules applied. Total rules applied 209 place count 139 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 210 place count 139 transition count 218
Applied a total of 210 rules in 17 ms. Remains 139 /230 variables (removed 91) and now considering 218/503 (removed 285) transitions.
// Phase 1: matrix 218 rows 139 cols
[2025-05-30 12:04:02] [INFO ] Computed 2 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:03] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-05-30 12:04:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:03] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-05-30 12:04:04] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-30 12:04:04] [INFO ] Invariant cache hit.
[2025-05-30 12:04:04] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/357 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 84/225 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:04:18] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:04:18] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:04:18] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/357 variables, and 228 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/357 variables, 139/144 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 84/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 217/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/357 variables, and 445 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Starting structural reductions in LTL mode, iteration 1 : 139/230 places, 218/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61821 ms. Remains : 139/230 places, 218/503 transitions.
Stuttering acceptance computed with spot in 782 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2) p0), (AND (NOT p3) (NOT p2) p0 (NOT p1)), (AND (NOT p3) (NOT p2) p0), (AND (NOT p3) (NOT p2) p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-04 finished in 62633 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) U G(p1)))&&((X(p1) U p2) U p3)))'
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 202 transition count 350
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 202 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 202 transition count 348
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 82 place count 178 transition count 320
Iterating global reduction 1 with 24 rules applied. Total rules applied 106 place count 178 transition count 320
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 113 place count 178 transition count 313
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 134 place count 157 transition count 277
Iterating global reduction 2 with 21 rules applied. Total rules applied 155 place count 157 transition count 277
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 166 place count 157 transition count 266
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 178 place count 145 transition count 244
Iterating global reduction 3 with 12 rules applied. Total rules applied 190 place count 145 transition count 244
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 195 place count 145 transition count 239
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 202 place count 138 transition count 232
Iterating global reduction 4 with 7 rules applied. Total rules applied 209 place count 138 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 215 place count 138 transition count 226
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 218 place count 135 transition count 219
Iterating global reduction 5 with 3 rules applied. Total rules applied 221 place count 135 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 222 place count 135 transition count 218
Applied a total of 222 rules in 26 ms. Remains 135 /230 variables (removed 95) and now considering 218/503 (removed 285) transitions.
// Phase 1: matrix 218 rows 135 cols
[2025-05-30 12:05:05] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:05] [INFO ] Implicit Places using invariants in 260 ms returned []
[2025-05-30 12:05:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:05] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-05-30 12:05:06] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-30 12:05:06] [INFO ] Invariant cache hit.
[2025-05-30 12:05:06] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/353 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 93/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:17] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:18] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 232 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/353 variables, 135/139 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 93/232 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 217/449 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/353 variables, and 449 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Starting structural reductions in LTL mode, iteration 1 : 135/230 places, 218/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61400 ms. Remains : 135/230 places, 218/503 transitions.
Stuttering acceptance computed with spot in 422 ms :[(OR (NOT p3) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p3), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-05 finished in 61863 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 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 200 transition count 357
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 200 transition count 357
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 200 transition count 353
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 90 place count 174 transition count 323
Iterating global reduction 1 with 26 rules applied. Total rules applied 116 place count 174 transition count 323
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 123 place count 174 transition count 316
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 145 place count 152 transition count 279
Iterating global reduction 2 with 22 rules applied. Total rules applied 167 place count 152 transition count 279
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 182 place count 152 transition count 264
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 197 place count 137 transition count 222
Iterating global reduction 3 with 15 rules applied. Total rules applied 212 place count 137 transition count 222
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 217 place count 137 transition count 217
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 224 place count 130 transition count 210
Iterating global reduction 4 with 7 rules applied. Total rules applied 231 place count 130 transition count 210
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 239 place count 130 transition count 202
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 244 place count 125 transition count 180
Iterating global reduction 5 with 5 rules applied. Total rules applied 249 place count 125 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 250 place count 125 transition count 179
Applied a total of 250 rules in 86 ms. Remains 125 /230 variables (removed 105) and now considering 179/503 (removed 324) transitions.
// Phase 1: matrix 179 rows 125 cols
[2025-05-30 12:06:07] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:07] [INFO ] Implicit Places using invariants in 348 ms returned []
[2025-05-30 12:06:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:07] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-30 12:06:08] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:06:08] [INFO ] Redundant transitions in 4 ms returned []
Running 178 sub problems to find dead transitions.
[2025-05-30 12:06:08] [INFO ] Invariant cache hit.
[2025-05-30 12:06:08] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 16226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46422ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 46423ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/230 places, 179/503 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47896 ms. Remains : 125/230 places, 179/503 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-06 finished in 48000 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(G(p0)))'
Support contains 2 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 200 transition count 347
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 200 transition count 347
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 200 transition count 344
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 88 place count 175 transition count 315
Iterating global reduction 1 with 25 rules applied. Total rules applied 113 place count 175 transition count 315
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 120 place count 175 transition count 308
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 141 place count 154 transition count 273
Iterating global reduction 2 with 21 rules applied. Total rules applied 162 place count 154 transition count 273
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 176 place count 154 transition count 259
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 191 place count 139 transition count 217
Iterating global reduction 3 with 15 rules applied. Total rules applied 206 place count 139 transition count 217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 211 place count 139 transition count 212
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 218 place count 132 transition count 205
Iterating global reduction 4 with 7 rules applied. Total rules applied 225 place count 132 transition count 205
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 232 place count 132 transition count 198
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 237 place count 127 transition count 176
Iterating global reduction 5 with 5 rules applied. Total rules applied 242 place count 127 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 243 place count 127 transition count 175
Applied a total of 243 rules in 39 ms. Remains 127 /230 variables (removed 103) and now considering 175/503 (removed 328) transitions.
// Phase 1: matrix 175 rows 127 cols
[2025-05-30 12:06:55] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:55] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-30 12:06:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:55] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-30 12:06:56] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:06:56] [INFO ] Redundant transitions in 3 ms returned []
Running 174 sub problems to find dead transitions.
[2025-05-30 12:06:56] [INFO ] Invariant cache hit.
[2025-05-30 12:06:56] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/302 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 54/183 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 183 constraints, problems are : Problem set: 0 solved, 174 unsolved in 14768 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/302 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 54/183 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 174/357 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 357 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45020ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 45021ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/230 places, 175/503 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45968 ms. Remains : 127/230 places, 175/503 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-07 finished in 46024 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)||X(F(p1)))) U (F(p2)&&X(p3))))'
Support contains 6 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 202 transition count 366
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 202 transition count 366
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 202 transition count 362
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 84 place count 178 transition count 335
Iterating global reduction 1 with 24 rules applied. Total rules applied 108 place count 178 transition count 335
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 114 place count 178 transition count 329
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 135 place count 157 transition count 294
Iterating global reduction 2 with 21 rules applied. Total rules applied 156 place count 157 transition count 294
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 171 place count 157 transition count 279
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 184 place count 144 transition count 245
Iterating global reduction 3 with 13 rules applied. Total rules applied 197 place count 144 transition count 245
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 207 place count 144 transition count 235
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 213 place count 138 transition count 229
Iterating global reduction 4 with 6 rules applied. Total rules applied 219 place count 138 transition count 229
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 225 place count 138 transition count 223
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 230 place count 133 transition count 201
Iterating global reduction 5 with 5 rules applied. Total rules applied 235 place count 133 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 133 transition count 200
Applied a total of 236 rules in 16 ms. Remains 133 /230 variables (removed 97) and now considering 200/503 (removed 303) transitions.
// Phase 1: matrix 200 rows 133 cols
[2025-05-30 12:07:41] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:41] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-05-30 12:07:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:41] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-05-30 12:07:42] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2025-05-30 12:07:42] [INFO ] Invariant cache hit.
[2025-05-30 12:07:42] [INFO ] State equation strengthened by 73 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/333 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 73/208 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:53] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:53] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:54] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:54] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:54] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:54] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:54] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 7/215 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/333 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 215 constraints, problems are : Problem set: 0 solved, 199 unsolved in 27001 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 200/333 variables, 133/142 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 73/215 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 199/414 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 414 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57152ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 57154ms
Starting structural reductions in LTL mode, iteration 1 : 133/230 places, 200/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58014 ms. Remains : 133/230 places, 200/503 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-10
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-10 finished in 58308 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(X((X((X(X(G(p2)))||p1))&&p0))))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 201 transition count 358
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 201 transition count 358
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 201 transition count 354
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 87 place count 176 transition count 325
Iterating global reduction 1 with 25 rules applied. Total rules applied 112 place count 176 transition count 325
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 119 place count 176 transition count 318
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 140 place count 155 transition count 282
Iterating global reduction 2 with 21 rules applied. Total rules applied 161 place count 155 transition count 282
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 175 place count 155 transition count 268
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 189 place count 141 transition count 233
Iterating global reduction 3 with 14 rules applied. Total rules applied 203 place count 141 transition count 233
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 208 place count 141 transition count 228
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 215 place count 134 transition count 221
Iterating global reduction 4 with 7 rules applied. Total rules applied 222 place count 134 transition count 221
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 230 place count 134 transition count 213
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 235 place count 129 transition count 191
Iterating global reduction 5 with 5 rules applied. Total rules applied 240 place count 129 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 129 transition count 190
Applied a total of 241 rules in 25 ms. Remains 129 /230 variables (removed 101) and now considering 190/503 (removed 313) transitions.
// Phase 1: matrix 190 rows 129 cols
[2025-05-30 12:08:39] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:39] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-05-30 12:08:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:39] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-05-30 12:08:40] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2025-05-30 12:08:40] [INFO ] Invariant cache hit.
[2025-05-30 12:08:40] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/319 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 69/200 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 200 constraints, problems are : Problem set: 0 solved, 189 unsolved in 17004 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/319 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 69/200 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 189/389 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 389 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47153ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 47154ms
Starting structural reductions in LTL mode, iteration 1 : 129/230 places, 190/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48503 ms. Remains : 129/230 places, 190/503 transitions.
Stuttering acceptance computed with spot in 269 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-11 finished in 48791 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 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 200 transition count 354
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 200 transition count 354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 200 transition count 351
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 88 place count 175 transition count 322
Iterating global reduction 1 with 25 rules applied. Total rules applied 113 place count 175 transition count 322
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 120 place count 175 transition count 315
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 141 place count 154 transition count 280
Iterating global reduction 2 with 21 rules applied. Total rules applied 162 place count 154 transition count 280
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 175 place count 154 transition count 267
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 189 place count 140 transition count 226
Iterating global reduction 3 with 14 rules applied. Total rules applied 203 place count 140 transition count 226
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 213 place count 140 transition count 216
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 219 place count 134 transition count 210
Iterating global reduction 4 with 6 rules applied. Total rules applied 225 place count 134 transition count 210
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 230 place count 134 transition count 205
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 235 place count 129 transition count 183
Iterating global reduction 5 with 5 rules applied. Total rules applied 240 place count 129 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 129 transition count 182
Applied a total of 241 rules in 57 ms. Remains 129 /230 variables (removed 101) and now considering 182/503 (removed 321) transitions.
// Phase 1: matrix 182 rows 129 cols
[2025-05-30 12:09:28] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:28] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-05-30 12:09:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 12:09:29] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:09:29] [INFO ] Redundant transitions in 3 ms returned []
Running 181 sub problems to find dead transitions.
[2025-05-30 12:09:29] [INFO ] Invariant cache hit.
[2025-05-30 12:09:29] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 188 constraints, problems are : Problem set: 0 solved, 181 unsolved in 16078 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 181/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 369 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46215ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 46217ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/230 places, 182/503 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47317 ms. Remains : 129/230 places, 182/503 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-12
Product exploration explored 100000 steps with 22901 reset in 554 ms.
Product exploration explored 100000 steps with 22979 reset in 357 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 465 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 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 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9228 resets) in 427 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1814 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21094 steps, run visited all 1 properties in 121 ms. (steps per millisecond=174 )
Probabilistic random walk after 21094 steps, saw 10364 distinct states, run finished after 122 ms. (steps per millisecond=172 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 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 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 182/182 transitions.
Applied a total of 0 rules in 8 ms. Remains 129 /129 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2025-05-30 12:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:10:17] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-05-30 12:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:10:17] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 12:10:18] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:10:18] [INFO ] Redundant transitions in 1 ms returned []
Running 181 sub problems to find dead transitions.
[2025-05-30 12:10:18] [INFO ] Invariant cache hit.
[2025-05-30 12:10:18] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 188 constraints, problems are : Problem set: 0 solved, 181 unsolved in 16650 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 181/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 369 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46832ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 46834ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48015 ms. Remains : 129/129 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 465 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9179 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1783 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21094 steps, run visited all 1 properties in 78 ms. (steps per millisecond=270 )
Probabilistic random walk after 21094 steps, saw 10364 distinct states, run finished after 79 ms. (steps per millisecond=267 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 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 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23034 reset in 351 ms.
Product exploration explored 100000 steps with 23132 reset in 374 ms.
Built C files in :
/tmp/ltsmin1204067419768803761
[2025-05-30 12:11:07] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2025-05-30 12:11:07] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:11:07] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2025-05-30 12:11:07] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:11:07] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2025-05-30 12:11:07] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:11:07] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1204067419768803761
Running compilation step : cd /tmp/ltsmin1204067419768803761;'/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 1074 ms.
Running link step : cd /tmp/ltsmin1204067419768803761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin1204067419768803761;'/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/stateBased2393906927112218227.hoa' '--buchi-type=spotba'
LTSmin run took 10286 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-12 finished in 110303 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(p1))))'
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 201 transition count 361
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 201 transition count 361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 201 transition count 358
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 85 place count 177 transition count 330
Iterating global reduction 1 with 24 rules applied. Total rules applied 109 place count 177 transition count 330
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 115 place count 177 transition count 324
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 135 place count 157 transition count 290
Iterating global reduction 2 with 20 rules applied. Total rules applied 155 place count 157 transition count 290
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 168 place count 157 transition count 277
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 181 place count 144 transition count 238
Iterating global reduction 3 with 13 rules applied. Total rules applied 194 place count 144 transition count 238
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 202 place count 144 transition count 230
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 208 place count 138 transition count 224
Iterating global reduction 4 with 6 rules applied. Total rules applied 214 place count 138 transition count 224
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 221 place count 138 transition count 217
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 226 place count 133 transition count 195
Iterating global reduction 5 with 5 rules applied. Total rules applied 231 place count 133 transition count 195
Applied a total of 231 rules in 14 ms. Remains 133 /230 variables (removed 97) and now considering 195/503 (removed 308) transitions.
// Phase 1: matrix 195 rows 133 cols
[2025-05-30 12:11:18] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:18] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-05-30 12:11:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-05-30 12:11:19] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-05-30 12:11:19] [INFO ] Invariant cache hit.
[2025-05-30 12:11:19] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/328 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 68/203 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:29] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:30] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:30] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:30] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:31] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:42] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:43] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:43] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 18 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/328 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 328/328 variables, and 211 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/328 variables, 133/143 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 68/211 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 194/405 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 405 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in LTL mode, iteration 1 : 133/230 places, 195/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61288 ms. Remains : 133/230 places, 195/503 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-13
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-13 finished in 61480 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)||(X(G(p1)) U G(p2))))'
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 202 transition count 363
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 202 transition count 363
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 202 transition count 361
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 82 place count 178 transition count 333
Iterating global reduction 1 with 24 rules applied. Total rules applied 106 place count 178 transition count 333
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 112 place count 178 transition count 327
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 132 place count 158 transition count 293
Iterating global reduction 2 with 20 rules applied. Total rules applied 152 place count 158 transition count 293
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 165 place count 158 transition count 280
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 177 place count 146 transition count 242
Iterating global reduction 3 with 12 rules applied. Total rules applied 189 place count 146 transition count 242
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 197 place count 146 transition count 234
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 202 place count 141 transition count 229
Iterating global reduction 4 with 5 rules applied. Total rules applied 207 place count 141 transition count 229
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 212 place count 141 transition count 224
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 217 place count 136 transition count 202
Iterating global reduction 5 with 5 rules applied. Total rules applied 222 place count 136 transition count 202
Applied a total of 222 rules in 14 ms. Remains 136 /230 variables (removed 94) and now considering 202/503 (removed 301) transitions.
// Phase 1: matrix 202 rows 136 cols
[2025-05-30 12:12:20] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:12:20] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-05-30 12:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:12:20] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-05-30 12:12:21] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-05-30 12:12:22] [INFO ] Invariant cache hit.
[2025-05-30 12:12:22] [INFO ] State equation strengthened by 70 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/338 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 70/208 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:34] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:34] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:34] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:35] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:36] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:36] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 22 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 6/214 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 338/338 variables, and 214 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 202/338 variables, 136/144 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 70/214 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 201/415 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 338/338 variables, and 415 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in LTL mode, iteration 1 : 136/230 places, 202/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62075 ms. Remains : 136/230 places, 202/503 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-14
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-14 finished in 62367 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 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 199 transition count 346
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 199 transition count 346
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 199 transition count 343
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 91 place count 173 transition count 313
Iterating global reduction 1 with 26 rules applied. Total rules applied 117 place count 173 transition count 313
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 124 place count 173 transition count 306
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 146 place count 151 transition count 269
Iterating global reduction 2 with 22 rules applied. Total rules applied 168 place count 151 transition count 269
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 182 place count 151 transition count 255
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 196 place count 137 transition count 220
Iterating global reduction 3 with 14 rules applied. Total rules applied 210 place count 137 transition count 220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 137 transition count 215
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 222 place count 130 transition count 208
Iterating global reduction 4 with 7 rules applied. Total rules applied 229 place count 130 transition count 208
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 236 place count 130 transition count 201
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 241 place count 125 transition count 179
Iterating global reduction 5 with 5 rules applied. Total rules applied 246 place count 125 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 247 place count 125 transition count 178
Applied a total of 247 rules in 35 ms. Remains 125 /230 variables (removed 105) and now considering 178/503 (removed 325) transitions.
// Phase 1: matrix 178 rows 125 cols
[2025-05-30 12:13:22] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:13:22] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-30 12:13:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:13:22] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-30 12:13:23] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:13:23] [INFO ] Redundant transitions in 1 ms returned []
Running 177 sub problems to find dead transitions.
[2025-05-30 12:13:23] [INFO ] Invariant cache hit.
[2025-05-30 12:13:23] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 59/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 186 constraints, problems are : Problem set: 0 solved, 177 unsolved in 12979 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 59/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/303 variables, and 363 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43165ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 43166ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/230 places, 178/503 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44389 ms. Remains : 125/230 places, 178/503 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m05-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m05-LTLFireability-15 finished in 44531 ms.
All properties solved by simple procedures.
Total runtime 790980 ms.
BK_STOP 1748607247094
--------------------
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-d2m05"
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-d2m05, 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-174854063600124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m05.tgz
mv DBSingleClientW-PT-d2m05 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 '
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 ;