Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063400028.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-d0m07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063400028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 119K 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-d0m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748552812958

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-d0m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-29 21:06:55] [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-29 21:06:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 21:06:55] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2025-05-29 21:06:55] [INFO ] Transformed 553 places.
[2025-05-29 21:06:55] [INFO ] Transformed 150 transitions.
[2025-05-29 21:06:55] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 398 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 444 places in 4 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 33 place count 87 transition count 119
Iterating global reduction 1 with 15 rules applied. Total rules applied 48 place count 87 transition count 119
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 84 transition count 116
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 84 transition count 116
Applied a total of 54 rules in 73 ms. Remains 84 /109 variables (removed 25) and now considering 116/150 (removed 34) transitions.
// Phase 1: matrix 116 rows 84 cols
[2025-05-29 21:06:56] [INFO ] Computed 2 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:06:56] [INFO ] Implicit Places using invariants in 433 ms returned []
[2025-05-29 21:06:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:06:56] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-29 21:06:56] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2025-05-29 21:06:57] [INFO ] Invariant cache hit.
[2025-05-29 21:06:57] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/200 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 49/135 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:01] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:01] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:03] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:03] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:04] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:04] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:06] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:06] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:06] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:06] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/200 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 145 constraints, problems are : Problem set: 0 solved, 115 unsolved in 14595 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/200 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 115/260 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 260 constraints, problems are : Problem set: 0 solved, 115 unsolved in 23470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38410ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 38432ms
Starting structural reductions in LTL mode, iteration 1 : 84/109 places, 116/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39513 ms. Remains : 84/109 places, 116/150 transitions.
Support contains 38 out of 84 places after structural reductions.
[2025-05-29 21:07:35] [INFO ] Flatten gal took : 53 ms
[2025-05-29 21:07:35] [INFO ] Flatten gal took : 23 ms
[2025-05-29 21:07:35] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 35 out of 84 places (down from 38) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 31 to 29
RANDOM walk for 40000 steps (9147 resets) in 2850 ms. (14 steps per ms) remains 15/29 properties
BEST_FIRST walk for 4001 steps (223 resets) in 75 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (204 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (800 resets) in 45 ms. (86 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (212 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (192 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (386 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (174 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (403 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (434 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (149 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (225 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (199 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (390 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (423 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (205 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
[2025-05-29 21:07:36] [INFO ] Invariant cache hit.
[2025-05-29 21:07:36] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 1 (OVERLAPS) 23/46 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 20/66 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 104/170 variables, 66/68 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 37/105 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 30/200 variables, 18/123 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 12/135 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/200 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 135 constraints, problems are : Problem set: 2 solved, 13 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 24/44 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 22/66 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:37] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:37] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 104/170 variables, 66/70 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 37/107 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/108 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 30/200 variables, 18/126 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 12/138 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 12/150 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 150 constraints, problems are : Problem set: 2 solved, 13 unsolved in 3017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 13/15 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3592ms problems are : Problem set: 2 solved, 13 unsolved
Parikh walk visited 1 properties in 5433 ms.
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 111
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 79 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 79 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 78 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 78 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 78 transition count 107
Applied a total of 13 rules in 32 ms. Remains 78 /84 variables (removed 6) and now considering 107/116 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 78/84 places, 107/116 transitions.
RANDOM walk for 40000 steps (9124 resets) in 261 ms. (152 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1965 resets) in 124 ms. (320 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40003 steps (2017 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 191 ms. (208 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1966 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1996 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (4007 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (4007 resets) in 226 ms. (176 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (4058 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1982 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
// Phase 1: matrix 107 rows 78 cols
[2025-05-29 21:07:46] [INFO ] Computed 2 invariants in 7 ms
[2025-05-29 21:07:46] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 23/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 22/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 92/150 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 35/185 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 15/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 126 constraints, problems are : Problem set: 0 solved, 8 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 23/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 22/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 92/150 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 35/185 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 15/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/185 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 134 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1361 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1822ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 2 properties in 3348 ms.
Support contains 10 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 107/107 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 75 transition count 100
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 75 transition count 100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 73 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 73 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 73 transition count 96
Applied a total of 12 rules in 16 ms. Remains 73 /78 variables (removed 5) and now considering 96/107 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 73/78 places, 96/107 transitions.
RANDOM walk for 40000 steps (9148 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1964 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1971 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1948 resets) in 39 ms. (1000 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40001 steps (3975 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
// Phase 1: matrix 96 rows 73 cols
[2025-05-29 21:07:51] [INFO ] Computed 2 invariants in 2 ms
[2025-05-29 21:07:51] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 23/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 79/132 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 22/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 35/167 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/169 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/169 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 114 constraints, problems are : Problem set: 0 solved, 4 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 23/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 79/132 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 22/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 35/167 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/169 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/169 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 118 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1064 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1437ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 865 ms.
Support contains 8 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 96/96 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 92
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 69 transition count 90
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 68 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 68 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 67 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 67 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 66 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 66 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 66 transition count 83
Applied a total of 16 rules in 26 ms. Remains 66 /73 variables (removed 7) and now considering 83/96 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 66/73 places, 83/96 transitions.
RANDOM walk for 40000 steps (9111 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (2004 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 58 ms. (677 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1975 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4124 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 6187 steps, run visited all 4 properties in 54 ms. (steps per millisecond=114 )
Probabilistic random walk after 6187 steps, saw 2733 distinct states, run finished after 60 ms. (steps per millisecond=103 ) properties seen :4
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 280 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-15 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 74 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 74 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 74 transition count 93
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 70 transition count 89
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 69 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 69 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 69 transition count 84
Applied a total of 34 rules in 20 ms. Remains 69 /84 variables (removed 15) and now considering 84/116 (removed 32) transitions.
// Phase 1: matrix 84 rows 69 cols
[2025-05-29 21:07:55] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:07:55] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-29 21:07:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:07:55] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-05-29 21:07:55] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:07:55] [INFO ] Redundant transitions in 3 ms returned []
Running 83 sub problems to find dead transitions.
[2025-05-29 21:07:55] [INFO ] Invariant cache hit.
[2025-05-29 21:07:55] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/153 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:58] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:59] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 6 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/153 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 100 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5684 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 84/153 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 83/183 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 183 constraints, problems are : Problem set: 0 solved, 83 unsolved in 10382 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16135ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 16136ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/84 places, 84/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16598 ms. Remains : 69/84 places, 84/116 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-00
Product exploration explored 100000 steps with 22755 reset in 574 ms.
Product exploration explored 100000 steps with 22971 reset in 405 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 225 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (9206 resets) in 744 ms. (53 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2027 resets) in 417 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2041 resets) in 315 ms. (126 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 9663 steps, run visited all 2 properties in 98 ms. (steps per millisecond=98 )
Probabilistic random walk after 9663 steps, saw 4148 distinct states, run finished after 98 ms. (steps per millisecond=98 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 84/84 transitions.
Applied a total of 0 rules in 11 ms. Remains 69 /69 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2025-05-29 21:08:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:08:14] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-05-29 21:08:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:08:14] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-05-29 21:08:14] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:08:14] [INFO ] Redundant transitions in 2 ms returned []
Running 83 sub problems to find dead transitions.
[2025-05-29 21:08:14] [INFO ] Invariant cache hit.
[2025-05-29 21:08:14] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/153 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 27/98 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:17] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:18] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 6 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/153 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 100 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 84/153 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 83/183 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 183 constraints, problems are : Problem set: 0 solved, 83 unsolved in 10386 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15580ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 15581ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16038 ms. Remains : 69/69 places, 84/84 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 225 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (9195 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1911 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1956 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 9663 steps, run visited all 2 properties in 31 ms. (steps per millisecond=311 )
Probabilistic random walk after 9663 steps, saw 4148 distinct states, run finished after 31 ms. (steps per millisecond=311 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22964 reset in 237 ms.
Product exploration explored 100000 steps with 22998 reset in 256 ms.
Built C files in :
/tmp/ltsmin372842802850376033
[2025-05-29 21:08:32] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2025-05-29 21:08:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:08:32] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2025-05-29 21:08:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:08:32] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2025-05-29 21:08:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:08:32] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin372842802850376033
Running compilation step : cd /tmp/ltsmin372842802850376033;'/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 731 ms.
Running link step : cd /tmp/ltsmin372842802850376033;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin372842802850376033;'/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/stateBased330998378295717662.hoa' '--buchi-type=spotba'
LTSmin run took 426 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-00 finished in 38363 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 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 92
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 67 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 67 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 64 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 62 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 60 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 59 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 59 transition count 67
Applied a total of 57 rules in 38 ms. Remains 59 /84 variables (removed 25) and now considering 67/116 (removed 49) transitions.
// Phase 1: matrix 67 rows 59 cols
[2025-05-29 21:08:33] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:08:33] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-29 21:08:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:08:33] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 21:08:33] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:08:33] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2025-05-29 21:08:33] [INFO ] Invariant cache hit.
[2025-05-29 21:08:33] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:35] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:35] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:35] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:35] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:35] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 89 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3630 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/126 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 23/89 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 66/155 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 155 constraints, problems are : Problem set: 0 solved, 66 unsolved in 10219 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13874ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 13875ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/84 places, 67/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14273 ms. Remains : 59/84 places, 67/116 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-01 finished in 14332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(!p0))&&F(p1)))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 92
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 67 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 65 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 63 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 62 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 62 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 62 transition count 74
Applied a total of 48 rules in 23 ms. Remains 62 /84 variables (removed 22) and now considering 74/116 (removed 42) transitions.
// Phase 1: matrix 74 rows 62 cols
[2025-05-29 21:08:47] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:08:47] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-29 21:08:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:08:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 21:08:48] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:08:48] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2025-05-29 21:08:48] [INFO ] Invariant cache hit.
[2025-05-29 21:08:48] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/136 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 25/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 89 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2662 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/136 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 25/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 73/162 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 162 constraints, problems are : Problem set: 0 solved, 73 unsolved in 11211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13898ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 13899ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/84 places, 74/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14234 ms. Remains : 62/84 places, 74/116 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), p0, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-02 finished in 14463 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(X(p0))&&(!(!p0 U p1) U G(!p2))))'
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 91
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 90
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 67 transition count 84
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 64 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 62 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 59 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 59 transition count 66
Applied a total of 57 rules in 10 ms. Remains 59 /84 variables (removed 25) and now considering 66/116 (removed 50) transitions.
// Phase 1: matrix 66 rows 59 cols
[2025-05-29 21:09:02] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:02] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-29 21:09:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 21:09:02] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2025-05-29 21:09:02] [INFO ] Invariant cache hit.
[2025-05-29 21:09:02] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 81 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2480 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 65/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 146 constraints, problems are : Problem set: 0 solved, 65 unsolved in 9076 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11598ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 11599ms
Starting structural reductions in LTL mode, iteration 1 : 59/84 places, 66/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11844 ms. Remains : 59/84 places, 66/116 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) p2), true, (AND p1 (NOT p2)), p2, (NOT p0), p2]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-03
Product exploration explored 100000 steps with 31440 reset in 420 ms.
Product exploration explored 100000 steps with 31594 reset in 383 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 190 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 120 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[p2, true, (AND p1 (NOT p2)), p2]
RANDOM walk for 40000 steps (9244 resets) in 125 ms. (317 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (1387 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1992 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
[2025-05-29 21:09:15] [INFO ] Invariant cache hit.
[2025-05-29 21:09:15] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Real declared 25/125 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/59 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2))), (G (OR p1 (NOT p2) p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT p0))]
Knowledge based reduction with 21 factoid took 416 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 118 ms :[p2, true, p2]
Support contains 4 out of 59 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 66/66 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2025-05-29 21:09:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:16] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-29 21:09:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 21:09:16] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:09:16] [INFO ] Redundant transitions in 2 ms returned []
Running 65 sub problems to find dead transitions.
[2025-05-29 21:09:16] [INFO ] Invariant cache hit.
[2025-05-29 21:09:16] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 81 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2497 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 65/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 146 constraints, problems are : Problem set: 0 solved, 65 unsolved in 7803 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10330ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 10331ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10649 ms. Remains : 59/59 places, 66/66 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 190 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 163 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[p2, true, p2]
RANDOM walk for 40000 steps (9258 resets) in 247 ms. (161 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (1995 resets) in 45 ms. (869 steps per ms) remains 1/3 properties
[2025-05-29 21:09:27] [INFO ] Invariant cache hit.
[2025-05-29 21:09:27] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 24/125 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/59 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F p2), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 14 factoid took 522 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 93 ms :[p2, true, p2]
Stuttering acceptance computed with spot in 93 ms :[p2, true, p2]
Product exploration explored 100000 steps with 22793 reset in 290 ms.
Product exploration explored 100000 steps with 22949 reset in 659 ms.
Built C files in :
/tmp/ltsmin978303937730434456
[2025-05-29 21:09:29] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2025-05-29 21:09:29] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:09:29] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2025-05-29 21:09:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:09:29] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2025-05-29 21:09:29] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 21:09:29] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin978303937730434456
Running compilation step : cd /tmp/ltsmin978303937730434456;'/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 349 ms.
Running link step : cd /tmp/ltsmin978303937730434456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin978303937730434456;'/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/stateBased17625920332641841482.hoa' '--buchi-type=spotba'
LTSmin run took 119 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-03 finished in 27547 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((p0 U X(p1)))&&(G(p2)||(X(!p2) U ((!p0&&X(!p2))||X(G(!p2))))))))'
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 75 transition count 99
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 75 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 75 transition count 98
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 70 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 70 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 70 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 68 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 68 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 68 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 67 transition count 85
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 67 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 66 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 66 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 65 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 65 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 44 place count 65 transition count 81
Applied a total of 44 rules in 7 ms. Remains 65 /84 variables (removed 19) and now considering 81/116 (removed 35) transitions.
// Phase 1: matrix 81 rows 65 cols
[2025-05-29 21:09:29] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:29] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-29 21:09:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-29 21:09:30] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2025-05-29 21:09:30] [INFO ] Invariant cache hit.
[2025-05-29 21:09:30] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/146 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 30/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 97 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2803 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/146 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 30/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 80/177 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 177 constraints, problems are : Problem set: 0 solved, 80 unsolved in 12265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15113ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 15114ms
Starting structural reductions in LTL mode, iteration 1 : 65/84 places, 81/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15444 ms. Remains : 65/84 places, 81/116 transitions.
Stuttering acceptance computed with spot in 418 ms :[(NOT p1), (NOT p1), (NOT p1), p2, p2, false, false, (NOT p1), (NOT p1), true, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-04
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-04 finished in 15905 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 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 91
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 90
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 67 transition count 84
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 64 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 62 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 59 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 59 transition count 66
Applied a total of 57 rules in 14 ms. Remains 59 /84 variables (removed 25) and now considering 66/116 (removed 50) transitions.
// Phase 1: matrix 66 rows 59 cols
[2025-05-29 21:09:45] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-29 21:09:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 21:09:45] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:09:45] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2025-05-29 21:09:45] [INFO ] Invariant cache hit.
[2025-05-29 21:09:45] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 81 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1565 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 65/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 146 constraints, problems are : Problem set: 0 solved, 65 unsolved in 8281 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9876ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 9876ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/84 places, 66/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10122 ms. Remains : 59/84 places, 66/116 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-05 finished in 10208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))||X(G(!p0))))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 68 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 61 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 60 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 60 transition count 70
Applied a total of 54 rules in 8 ms. Remains 60 /84 variables (removed 24) and now considering 70/116 (removed 46) transitions.
// Phase 1: matrix 70 rows 60 cols
[2025-05-29 21:09:55] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-29 21:09:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:56] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 21:09:56] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2025-05-29 21:09:56] [INFO ] Invariant cache hit.
[2025-05-29 21:09:56] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 85 constraints, problems are : Problem set: 0 solved, 69 unsolved in 2884 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 154 constraints, problems are : Problem set: 0 solved, 69 unsolved in 8922 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11844ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 11844ms
Starting structural reductions in LTL mode, iteration 1 : 60/84 places, 70/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12185 ms. Remains : 60/84 places, 70/116 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-06
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-06 finished in 12347 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((X(G((X(p2)&&p1)))||p0))))'
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 95
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 94
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 68 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 68 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 66 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 65 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 64 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 63 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 63 transition count 77
Applied a total of 48 rules in 4 ms. Remains 63 /84 variables (removed 21) and now considering 77/116 (removed 39) transitions.
// Phase 1: matrix 77 rows 63 cols
[2025-05-29 21:10:08] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:08] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-05-29 21:10:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:08] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-29 21:10:08] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2025-05-29 21:10:08] [INFO ] Invariant cache hit.
[2025-05-29 21:10:08] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:10] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:11] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 7 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/140 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 93 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3999 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 77/140 variables, 63/67 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 76/169 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 169 constraints, problems are : Problem set: 0 solved, 76 unsolved in 12183 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16209ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 16209ms
Starting structural reductions in LTL mode, iteration 1 : 63/84 places, 77/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16460 ms. Remains : 63/84 places, 77/116 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-08
Product exploration explored 100000 steps with 22977 reset in 233 ms.
Product exploration explored 100000 steps with 23010 reset in 249 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (9144 resets) in 151 ms. (263 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (2004 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (4166 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4076 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
[2025-05-29 21:10:25] [INFO ] Invariant cache hit.
[2025-05-29 21:10:25] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/26 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 11/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/138 variables, 16/75 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 1/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 1 solved, 2 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/26 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 11/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/138 variables, 16/75 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 2/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/140 variables, 1/92 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 93 constraints, problems are : Problem set: 1 solved, 2 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 597ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 76
Applied a total of 2 rules in 15 ms. Remains 62 /63 variables (removed 1) and now considering 76/77 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 62/63 places, 76/77 transitions.
RANDOM walk for 40000 steps (9179 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4067 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4084 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7112 steps, run visited all 2 properties in 50 ms. (steps per millisecond=142 )
Probabilistic random walk after 7112 steps, saw 3049 distinct states, run finished after 50 ms. (steps per millisecond=142 ) properties seen :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p0), (X (X (NOT p1))), (X (X p0)), (G (OR (NOT p2) (NOT p1))), (G (OR (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 6 factoid took 169 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-08 finished in 18663 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((!p0&&G(p1))) U (G(X((!p0&&G(p1))))||(!p2&&X((!p0&&G(p1)))))))))'
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 92
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 73 transition count 90
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 68 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 66 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 65 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 64 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 64 transition count 75
Applied a total of 46 rules in 9 ms. Remains 64 /84 variables (removed 20) and now considering 75/116 (removed 41) transitions.
// Phase 1: matrix 75 rows 64 cols
[2025-05-29 21:10:26] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:26] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-05-29 21:10:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:27] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 21:10:27] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-05-29 21:10:27] [INFO ] Invariant cache hit.
[2025-05-29 21:10:27] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 23/89 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:29] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:29] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 91 constraints, problems are : Problem set: 0 solved, 74 unsolved in 4637 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/139 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 23/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 74/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 165 constraints, problems are : Problem set: 0 solved, 74 unsolved in 10207 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14885ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 14886ms
Starting structural reductions in LTL mode, iteration 1 : 64/84 places, 75/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15243 ms. Remains : 64/84 places, 75/116 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-09 finished in 15501 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((G(!p1)||p0)))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 95
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 67 transition count 88
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 67 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 65 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 65 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 65 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 64 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 63 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 63 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 62 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 62 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 62 transition count 76
Applied a total of 50 rules in 18 ms. Remains 62 /84 variables (removed 22) and now considering 76/116 (removed 40) transitions.
// Phase 1: matrix 76 rows 62 cols
[2025-05-29 21:10:42] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:42] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-29 21:10:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:42] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-29 21:10:42] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:10:42] [INFO ] Redundant transitions in 2 ms returned []
Running 75 sub problems to find dead transitions.
[2025-05-29 21:10:42] [INFO ] Invariant cache hit.
[2025-05-29 21:10:42] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 76/138 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 26/90 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:44] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:44] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 92 constraints, problems are : Problem set: 0 solved, 75 unsolved in 3499 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 76/138 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 75/167 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 167 constraints, problems are : Problem set: 0 solved, 75 unsolved in 7859 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11392ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 11393ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/84 places, 76/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11692 ms. Remains : 62/84 places, 76/116 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-10
Product exploration explored 100000 steps with 22813 reset in 237 ms.
Entered a terminal (fully accepting) state of product in 86188 steps with 19631 reset in 214 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-10 finished in 12266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(F(p1)) U (G(p3)&&p2)))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 68 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 66 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 66 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 65 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 65 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 64 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 63 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 63 transition count 75
Applied a total of 48 rules in 5 ms. Remains 63 /84 variables (removed 21) and now considering 75/116 (removed 41) transitions.
// Phase 1: matrix 75 rows 63 cols
[2025-05-29 21:10:54] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:54] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-29 21:10:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 21:10:54] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-05-29 21:10:54] [INFO ] Invariant cache hit.
[2025-05-29 21:10:54] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:56] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 91 constraints, problems are : Problem set: 0 solved, 74 unsolved in 3290 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 75/138 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 74/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 165 constraints, problems are : Problem set: 0 solved, 74 unsolved in 7589 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10904ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 10904ms
Starting structural reductions in LTL mode, iteration 1 : 63/84 places, 75/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11216 ms. Remains : 63/84 places, 75/116 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-12 finished in 11566 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 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 68 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 61 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 60 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 60 transition count 70
Applied a total of 54 rules in 9 ms. Remains 60 /84 variables (removed 24) and now considering 70/116 (removed 46) transitions.
// Phase 1: matrix 70 rows 60 cols
[2025-05-29 21:11:06] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:11:06] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-05-29 21:11:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:11:06] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 21:11:06] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:11:06] [INFO ] Redundant transitions in 2 ms returned []
Running 69 sub problems to find dead transitions.
[2025-05-29 21:11:06] [INFO ] Invariant cache hit.
[2025-05-29 21:11:06] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 85 constraints, problems are : Problem set: 0 solved, 69 unsolved in 2462 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 154 constraints, problems are : Problem set: 0 solved, 69 unsolved in 9597 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12090ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 12092ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/84 places, 70/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12389 ms. Remains : 60/84 places, 70/116 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-13
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-13 finished in 12504 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((((X((X(p1)||p2)) U p2)&&p0)||p3))||G(p2)))'
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 72 transition count 90
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 72 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 72 transition count 89
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 66 transition count 83
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 60 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 60 transition count 68
Applied a total of 54 rules in 3 ms. Remains 60 /84 variables (removed 24) and now considering 68/116 (removed 48) transitions.
// Phase 1: matrix 68 rows 60 cols
[2025-05-29 21:11:18] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:11:18] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-05-29 21:11:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:11:18] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 21:11:19] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2025-05-29 21:11:19] [INFO ] Invariant cache hit.
[2025-05-29 21:11:19] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 83 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 67/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 150 constraints, problems are : Problem set: 0 solved, 67 unsolved in 8302 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10469ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 10470ms
Starting structural reductions in LTL mode, iteration 1 : 60/84 places, 68/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10780 ms. Remains : 60/84 places, 68/116 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-14 finished in 11003 ms.
All properties solved by simple procedures.
Total runtime 274540 ms.

BK_STOP 1748553089771

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

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m07.tgz
mv DBSingleClientW-PT-d0m07 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;