Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r579-smll-171734921300132.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is MedleyA-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921300132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 175K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-17-LTLFireability-00
FORMULA_NAME MedleyA-PT-17-LTLFireability-01
FORMULA_NAME MedleyA-PT-17-LTLFireability-02
FORMULA_NAME MedleyA-PT-17-LTLFireability-03
FORMULA_NAME MedleyA-PT-17-LTLFireability-04
FORMULA_NAME MedleyA-PT-17-LTLFireability-05
FORMULA_NAME MedleyA-PT-17-LTLFireability-06
FORMULA_NAME MedleyA-PT-17-LTLFireability-07
FORMULA_NAME MedleyA-PT-17-LTLFireability-08
FORMULA_NAME MedleyA-PT-17-LTLFireability-09
FORMULA_NAME MedleyA-PT-17-LTLFireability-10
FORMULA_NAME MedleyA-PT-17-LTLFireability-11
FORMULA_NAME MedleyA-PT-17-LTLFireability-12
FORMULA_NAME MedleyA-PT-17-LTLFireability-13
FORMULA_NAME MedleyA-PT-17-LTLFireability-14
FORMULA_NAME MedleyA-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717359381205

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:16:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 20:16:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:16:24] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2024-06-02 20:16:24] [INFO ] Transformed 248 places.
[2024-06-02 20:16:24] [INFO ] Transformed 591 transitions.
[2024-06-02 20:16:24] [INFO ] Found NUPN structural information;
[2024-06-02 20:16:24] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 636 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-17-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 199 transition count 509
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 199 transition count 509
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 132 place count 199 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 197 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 197 transition count 471
Applied a total of 136 rules in 136 ms. Remains 197 /248 variables (removed 51) and now considering 471/589 (removed 118) transitions.
// Phase 1: matrix 471 rows 197 cols
[2024-06-02 20:16:25] [INFO ] Computed 7 invariants in 45 ms
[2024-06-02 20:16:25] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-06-02 20:16:25] [INFO ] Invariant cache hit.
[2024-06-02 20:16:26] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-06-02 20:16:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 20:16:34] [INFO ] Deduced a trap composed of 15 places in 343 ms of which 52 ms to minimize.
[2024-06-02 20:16:34] [INFO ] Deduced a trap composed of 17 places in 313 ms of which 4 ms to minimize.
[2024-06-02 20:16:34] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 3 ms to minimize.
[2024-06-02 20:16:35] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 4 ms to minimize.
[2024-06-02 20:16:35] [INFO ] Deduced a trap composed of 114 places in 203 ms of which 3 ms to minimize.
[2024-06-02 20:16:35] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 2 ms to minimize.
[2024-06-02 20:16:35] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 4 ms to minimize.
[2024-06-02 20:16:35] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-06-02 20:16:36] [INFO ] Deduced a trap composed of 114 places in 187 ms of which 21 ms to minimize.
[2024-06-02 20:16:36] [INFO ] Deduced a trap composed of 115 places in 172 ms of which 3 ms to minimize.
[2024-06-02 20:16:36] [INFO ] Deduced a trap composed of 114 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:16:36] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:16:36] [INFO ] Deduced a trap composed of 114 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:16:37] [INFO ] Deduced a trap composed of 39 places in 241 ms of which 3 ms to minimize.
[2024-06-02 20:16:38] [INFO ] Deduced a trap composed of 122 places in 222 ms of which 3 ms to minimize.
[2024-06-02 20:16:38] [INFO ] Deduced a trap composed of 37 places in 245 ms of which 4 ms to minimize.
[2024-06-02 20:16:39] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 3 ms to minimize.
[2024-06-02 20:16:39] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:16:39] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 3 ms to minimize.
[2024-06-02 20:16:39] [INFO ] Deduced a trap composed of 25 places in 294 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 20:16:40] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 3 ms to minimize.
[2024-06-02 20:16:40] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 4 ms to minimize.
[2024-06-02 20:16:40] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 3 ms to minimize.
[2024-06-02 20:16:41] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 4 ms to minimize.
[2024-06-02 20:16:41] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 3 ms to minimize.
[2024-06-02 20:16:41] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 3 ms to minimize.
[2024-06-02 20:16:42] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 3 ms to minimize.
[2024-06-02 20:16:43] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 3 ms to minimize.
[2024-06-02 20:16:43] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 3 ms to minimize.
[2024-06-02 20:16:44] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 4 ms to minimize.
[2024-06-02 20:16:44] [INFO ] Deduced a trap composed of 25 places in 324 ms of which 4 ms to minimize.
[2024-06-02 20:16:44] [INFO ] Deduced a trap composed of 37 places in 313 ms of which 3 ms to minimize.
[2024-06-02 20:16:45] [INFO ] Deduced a trap composed of 26 places in 296 ms of which 4 ms to minimize.
[2024-06-02 20:16:45] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 4 ms to minimize.
[2024-06-02 20:16:45] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 5 ms to minimize.
[2024-06-02 20:16:46] [INFO ] Deduced a trap composed of 39 places in 296 ms of which 4 ms to minimize.
[2024-06-02 20:16:46] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 4 ms to minimize.
[2024-06-02 20:16:46] [INFO ] Deduced a trap composed of 117 places in 274 ms of which 4 ms to minimize.
[2024-06-02 20:16:47] [INFO ] Deduced a trap composed of 47 places in 274 ms of which 3 ms to minimize.
[2024-06-02 20:16:47] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 20:16:51] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 ms to minimize.
[2024-06-02 20:16:51] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 3 ms to minimize.
[2024-06-02 20:16:52] [INFO ] Deduced a trap composed of 49 places in 245 ms of which 4 ms to minimize.
[2024-06-02 20:16:52] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 3 ms to minimize.
[2024-06-02 20:16:52] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 4 ms to minimize.
[2024-06-02 20:16:53] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:16:53] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 2 ms to minimize.
[2024-06-02 20:16:54] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 2 ms to minimize.
[2024-06-02 20:16:54] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 197/668 variables, and 56 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 20:17:02] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
[2024-06-02 20:17:04] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 20:17:05] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:17:05] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 2 ms to minimize.
[2024-06-02 20:17:06] [INFO ] Deduced a trap composed of 124 places in 206 ms of which 3 ms to minimize.
[2024-06-02 20:17:07] [INFO ] Deduced a trap composed of 118 places in 199 ms of which 2 ms to minimize.
[2024-06-02 20:17:07] [INFO ] Deduced a trap composed of 130 places in 265 ms of which 3 ms to minimize.
[2024-06-02 20:17:07] [INFO ] Deduced a trap composed of 123 places in 217 ms of which 5 ms to minimize.
[2024-06-02 20:17:08] [INFO ] Deduced a trap composed of 48 places in 306 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 20:17:11] [INFO ] Deduced a trap composed of 118 places in 270 ms of which 3 ms to minimize.
[2024-06-02 20:17:13] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 2 ms to minimize.
[2024-06-02 20:17:13] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 3 ms to minimize.
[2024-06-02 20:17:14] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 2 ms to minimize.
[2024-06-02 20:17:14] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 3 ms to minimize.
[2024-06-02 20:17:14] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 20:17:19] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-06-02 20:17:24] [INFO ] Deduced a trap composed of 112 places in 261 ms of which 4 ms to minimize.
[2024-06-02 20:17:24] [INFO ] Deduced a trap composed of 90 places in 216 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 197/668 variables, and 74 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 0/470 constraints, Known Traps: 67/67 constraints]
After SMT, in 61096ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 61148ms
Starting structural reductions in LTL mode, iteration 1 : 197/248 places, 471/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62532 ms. Remains : 197/248 places, 471/589 transitions.
Support contains 43 out of 197 places after structural reductions.
[2024-06-02 20:17:27] [INFO ] Flatten gal took : 170 ms
[2024-06-02 20:17:28] [INFO ] Flatten gal took : 95 ms
[2024-06-02 20:17:28] [INFO ] Input system was already deterministic with 471 transitions.
Support contains 39 out of 197 places (down from 43) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (1376 resets) in 2858 ms. (13 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 62 ms. (63 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 59 ms. (66 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (28 resets) in 57 ms. (68 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 66 ms. (59 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (31 resets) in 48 ms. (81 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (28 resets) in 67 ms. (58 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (29 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (29 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (28 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (28 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (27 resets) in 21 ms. (182 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (27 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (28 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (28 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (28 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (27 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (28 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (29 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (28 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (29 resets) in 46 ms. (85 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (29 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 376288 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :9 out of 22
Probabilistic random walk after 376288 steps, saw 69211 distinct states, run finished after 3006 ms. (steps per millisecond=125 ) properties seen :9
[2024-06-02 20:17:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 172/197 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 20:17:33] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 3 ms to minimize.
[2024-06-02 20:17:33] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 3 ms to minimize.
[2024-06-02 20:17:33] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 3 ms to minimize.
[2024-06-02 20:17:33] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 20:17:34] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 2 ms to minimize.
[2024-06-02 20:17:34] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 2 ms to minimize.
[2024-06-02 20:17:34] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 3 ms to minimize.
[2024-06-02 20:17:34] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 2 ms to minimize.
[2024-06-02 20:17:35] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 5/16 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 471/668 variables, 197/213 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/668 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/668 variables, and 213 constraints, problems are : Problem set: 1 solved, 12 unsolved in 3273 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 172/197 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 9/16 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 4 (OVERLAPS) 471/668 variables, 197/213 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/668 variables, 10/223 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-02 20:17:38] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 3 ms to minimize.
[2024-06-02 20:17:39] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 3/226 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/226 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/668 variables, and 226 constraints, problems are : Problem set: 3 solved, 10 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 10/13 constraints, Known Traps: 12/12 constraints]
After SMT, in 8337ms problems are : Problem set: 3 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 144 edges and 197 vertex of which 6 / 197 are part of one of the 2 SCC in 6 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 193 transition count 440
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 168 transition count 438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 166 transition count 438
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 55 place count 166 transition count 423
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 85 place count 151 transition count 423
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 147 transition count 415
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 147 transition count 415
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 146 transition count 399
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 146 transition count 399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 137 place count 125 transition count 378
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 120 transition count 390
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 158 place count 120 transition count 379
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 166 place count 116 transition count 375
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 178 place count 110 transition count 415
Free-agglomeration rule applied 27 times.
Iterating global reduction 3 with 27 rules applied. Total rules applied 205 place count 110 transition count 388
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 252 place count 83 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 257 place count 83 transition count 363
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 262 place count 83 transition count 370
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 275 place count 78 transition count 362
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 77 transition count 361
Applied a total of 276 rules in 363 ms. Remains 77 /197 variables (removed 120) and now considering 361/471 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 365 ms. Remains : 77/197 places, 361/471 transitions.
RANDOM walk for 40000 steps (6223 resets) in 721 ms. (55 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (1983 resets) in 213 ms. (186 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (1949 resets) in 213 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (4000 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (17 resets) in 232 ms. (171 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (2038 resets) in 403 ms. (99 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (30 resets) in 316 ms. (126 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (4000 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1998 resets) in 84 ms. (470 steps per ms) remains 6/7 properties
[2024-06-02 20:17:42] [INFO ] Flow matrix only has 318 transitions (discarded 43 similar events)
// Phase 1: matrix 318 rows 77 cols
[2024-06-02 20:17:42] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:17:42] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 60/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 20:17:42] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-06-02 20:17:42] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:17:42] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 20:17:42] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2024-06-02 20:17:42] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 318/395 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 37/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/395 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 126 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1098 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 60/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 318/395 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 37/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/395 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 132 constraints, problems are : Problem set: 0 solved, 6 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 1939ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 8819 ms.
Support contains 17 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 361/361 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 77 transition count 360
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 75 transition count 358
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 75 transition count 358
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 74 transition count 357
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 72 transition count 373
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 72 transition count 371
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 72 transition count 370
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 71 transition count 358
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 71 transition count 354
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 71 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 70 transition count 368
Applied a total of 32 rules in 56 ms. Remains 70 /77 variables (removed 7) and now considering 368/361 (removed -7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 70/77 places, 368/361 transitions.
RANDOM walk for 40000 steps (6209 resets) in 1142 ms. (34 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40000 steps (4000 resets) in 401 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1747 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1927 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
[2024-06-02 20:17:53] [INFO ] Flow matrix only has 305 transitions (discarded 63 similar events)
// Phase 1: matrix 305 rows 70 cols
[2024-06-02 20:17:53] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:17:53] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 56/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:17:53] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 305/375 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 41/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/375 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 119 constraints, problems are : Problem set: 0 solved, 4 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 56/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 305/375 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 41/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:17:55] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2024-06-02 20:17:55] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:17:55] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:17:56] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2024-06-02 20:17:56] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-06-02 20:17:56] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/375 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/375 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 129 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2483 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 3021ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 4833 ms.
Support contains 14 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 368/368 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 69 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 69 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 68 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 68 transition count 354
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 68 transition count 351
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 10 place count 65 transition count 351
Applied a total of 10 rules in 37 ms. Remains 65 /70 variables (removed 5) and now considering 351/368 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 65/70 places, 351/368 transitions.
RANDOM walk for 40000 steps (6446 resets) in 231 ms. (172 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (1518 resets) in 294 ms. (135 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1957 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
[2024-06-02 20:18:01] [INFO ] Flow matrix only has 276 transitions (discarded 75 similar events)
// Phase 1: matrix 276 rows 65 cols
[2024-06-02 20:18:01] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 20:18:01] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 260/309 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 21/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 32/341 variables, 16/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:18:02] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-06-02 20:18:02] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-06-02 20:18:02] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/341 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 116 constraints, problems are : Problem set: 0 solved, 2 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 65/65 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 260/309 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 21/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 32/341 variables, 16/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:18:02] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:18:03] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:18:03] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-06-02 20:18:03] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/341 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 122 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1225 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 65/65 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 1877ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 751 ms.
Support contains 5 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 351/351 transitions.
Graph (trivial) has 35 edges and 65 vertex of which 2 / 65 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 62 transition count 351
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 62 transition count 348
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 62 transition count 343
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 18 place count 57 transition count 343
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 57 transition count 357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 56 transition count 357
Applied a total of 20 rules in 58 ms. Remains 56 /65 variables (removed 9) and now considering 357/351 (removed -6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 56/65 places, 357/351 transitions.
RANDOM walk for 40000 steps (1874 resets) in 288 ms. (138 steps per ms) remains 1/2 properties
BEST_FIRST walk for 31979 steps (418 resets) in 90 ms. (351 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-17-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 16 stable transitions
FORMULA MedleyA-PT-17-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 197 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 190 transition count 439
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 165 transition count 437
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 163 transition count 437
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 55 place count 163 transition count 422
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 85 place count 148 transition count 422
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 93 place count 140 transition count 407
Iterating global reduction 3 with 8 rules applied. Total rules applied 101 place count 140 transition count 407
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 139 transition count 391
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 139 transition count 391
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 149 place count 116 transition count 368
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 115 transition count 356
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 115 transition count 356
Performed 23 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 197 place count 92 transition count 444
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 201 place count 92 transition count 440
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 203 place count 90 transition count 424
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 90 transition count 424
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 213 place count 90 transition count 416
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 89 transition count 431
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 237 place count 89 transition count 409
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 245 place count 85 transition count 405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 84 transition count 404
Applied a total of 246 rules in 112 ms. Remains 84 /197 variables (removed 113) and now considering 404/471 (removed 67) transitions.
[2024-06-02 20:18:05] [INFO ] Flow matrix only has 372 transitions (discarded 32 similar events)
// Phase 1: matrix 372 rows 84 cols
[2024-06-02 20:18:05] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:18:05] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 20:18:05] [INFO ] Flow matrix only has 372 transitions (discarded 32 similar events)
[2024-06-02 20:18:05] [INFO ] Invariant cache hit.
[2024-06-02 20:18:05] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-02 20:18:05] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-06-02 20:18:05] [INFO ] Redundant transitions in 39 ms returned []
Running 395 sub problems to find dead transitions.
[2024-06-02 20:18:05] [INFO ] Flow matrix only has 372 transitions (discarded 32 similar events)
[2024-06-02 20:18:05] [INFO ] Invariant cache hit.
[2024-06-02 20:18:05] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-02 20:18:08] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 3 ms to minimize.
[2024-06-02 20:18:08] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:18:08] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 2 ms to minimize.
[2024-06-02 20:18:08] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 2 ms to minimize.
[2024-06-02 20:18:09] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 2 ms to minimize.
[2024-06-02 20:18:09] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:18:09] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:18:09] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:18:09] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-06-02 20:18:09] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:18:09] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:18:09] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2024-06-02 20:18:10] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-02 20:18:12] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 371/455 variables, 84/105 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 75/180 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (OVERLAPS) 1/456 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/456 variables, and 181 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 3 (OVERLAPS) 371/455 variables, 84/105 constraints. Problems are: Problem set: 42 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 75/180 constraints. Problems are: Problem set: 42 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 353/533 constraints. Problems are: Problem set: 42 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/533 constraints. Problems are: Problem set: 42 solved, 353 unsolved
At refinement iteration 7 (OVERLAPS) 1/456 variables, 1/534 constraints. Problems are: Problem set: 42 solved, 353 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/534 constraints. Problems are: Problem set: 42 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 534 constraints, problems are : Problem set: 42 solved, 353 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 353/395 constraints, Known Traps: 14/14 constraints]
After SMT, in 60758ms problems are : Problem set: 42 solved, 353 unsolved
Search for dead transitions found 42 dead transitions in 60769ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 84/197 places, 362/471 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 81 transition count 396
Applied a total of 6 rules in 14 ms. Remains 81 /84 variables (removed 3) and now considering 396/362 (removed -34) transitions.
[2024-06-02 20:19:06] [INFO ] Flow matrix only has 354 transitions (discarded 42 similar events)
// Phase 1: matrix 354 rows 81 cols
[2024-06-02 20:19:06] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:19:06] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-02 20:19:06] [INFO ] Flow matrix only has 354 transitions (discarded 42 similar events)
[2024-06-02 20:19:06] [INFO ] Invariant cache hit.
[2024-06-02 20:19:06] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-02 20:19:07] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/197 places, 396/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62059 ms. Remains : 81/197 places, 396/471 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-17-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-03 finished in 62485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||F(G((X(p1) U p2)))))'
Support contains 10 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 190 transition count 458
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 190 transition count 458
Applied a total of 14 rules in 9 ms. Remains 190 /197 variables (removed 7) and now considering 458/471 (removed 13) transitions.
// Phase 1: matrix 458 rows 190 cols
[2024-06-02 20:19:07] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:19:07] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-02 20:19:07] [INFO ] Invariant cache hit.
[2024-06-02 20:19:08] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-02 20:19:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:19:13] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 4 ms to minimize.
[2024-06-02 20:19:14] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:19:14] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:19:14] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 2 ms to minimize.
[2024-06-02 20:19:14] [INFO ] Deduced a trap composed of 112 places in 284 ms of which 3 ms to minimize.
[2024-06-02 20:19:15] [INFO ] Deduced a trap composed of 40 places in 299 ms of which 3 ms to minimize.
[2024-06-02 20:19:15] [INFO ] Deduced a trap composed of 111 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:19:15] [INFO ] Deduced a trap composed of 112 places in 299 ms of which 4 ms to minimize.
[2024-06-02 20:19:15] [INFO ] Deduced a trap composed of 25 places in 301 ms of which 4 ms to minimize.
[2024-06-02 20:19:16] [INFO ] Deduced a trap composed of 111 places in 231 ms of which 3 ms to minimize.
[2024-06-02 20:19:16] [INFO ] Deduced a trap composed of 111 places in 196 ms of which 4 ms to minimize.
[2024-06-02 20:19:16] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 4 ms to minimize.
[2024-06-02 20:19:16] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 3 ms to minimize.
[2024-06-02 20:19:17] [INFO ] Deduced a trap composed of 113 places in 222 ms of which 3 ms to minimize.
[2024-06-02 20:19:18] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 3 ms to minimize.
[2024-06-02 20:19:18] [INFO ] Deduced a trap composed of 39 places in 296 ms of which 3 ms to minimize.
[2024-06-02 20:19:19] [INFO ] Deduced a trap composed of 24 places in 317 ms of which 3 ms to minimize.
[2024-06-02 20:19:19] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 4 ms to minimize.
[2024-06-02 20:19:19] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 4 ms to minimize.
[2024-06-02 20:19:20] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:19:21] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 3 ms to minimize.
[2024-06-02 20:19:22] [INFO ] Deduced a trap composed of 21 places in 285 ms of which 4 ms to minimize.
[2024-06-02 20:19:22] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 3 ms to minimize.
[2024-06-02 20:19:22] [INFO ] Deduced a trap composed of 115 places in 265 ms of which 3 ms to minimize.
[2024-06-02 20:19:23] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 3 ms to minimize.
[2024-06-02 20:19:23] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 3 ms to minimize.
[2024-06-02 20:19:23] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 3 ms to minimize.
[2024-06-02 20:19:24] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 3 ms to minimize.
[2024-06-02 20:19:24] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 3 ms to minimize.
[2024-06-02 20:19:24] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 3 ms to minimize.
[2024-06-02 20:19:26] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 3 ms to minimize.
[2024-06-02 20:19:26] [INFO ] Deduced a trap composed of 54 places in 245 ms of which 3 ms to minimize.
[2024-06-02 20:19:27] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:19:32] [INFO ] Deduced a trap composed of 37 places in 261 ms of which 3 ms to minimize.
[2024-06-02 20:19:33] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 3 ms to minimize.
[2024-06-02 20:19:33] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 3 ms to minimize.
[2024-06-02 20:19:33] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 3 ms to minimize.
[2024-06-02 20:19:34] [INFO ] Deduced a trap composed of 114 places in 291 ms of which 3 ms to minimize.
[2024-06-02 20:19:34] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 4 ms to minimize.
[2024-06-02 20:19:34] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 4 ms to minimize.
[2024-06-02 20:19:36] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 48 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:19:42] [INFO ] Deduced a trap composed of 58 places in 241 ms of which 4 ms to minimize.
[2024-06-02 20:19:44] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:19:48] [INFO ] Deduced a trap composed of 130 places in 230 ms of which 3 ms to minimize.
[2024-06-02 20:19:48] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 2 ms to minimize.
[2024-06-02 20:19:49] [INFO ] Deduced a trap composed of 112 places in 284 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:19:53] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:19:58] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 3 ms to minimize.
[2024-06-02 20:19:58] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 8 (OVERLAPS) 458/648 variables, 190/246 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 653 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 49/49 constraints]
After SMT, in 60462ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60468ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 408/471 transitions.
Applied a total of 0 rules in 5 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61132 ms. Remains : 190/197 places, 408/471 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-05
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-05 finished in 61321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (p1||G(!p0))) U (F(p2) U p3)))'
Support contains 7 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 175 edges and 197 vertex of which 6 / 197 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 192 transition count 439
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 165 transition count 439
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 55 place count 165 transition count 422
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 89 place count 148 transition count 422
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 95 place count 142 transition count 411
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 142 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 141 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 141 transition count 395
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 149 place count 118 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 118 transition count 371
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 117 transition count 359
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 117 transition count 359
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 176 place count 105 transition count 412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 178 place count 105 transition count 410
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 104 transition count 425
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 197 place count 104 transition count 408
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 205 place count 100 transition count 404
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 209 place count 98 transition count 413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 97 transition count 412
Applied a total of 210 rules in 126 ms. Remains 97 /197 variables (removed 100) and now considering 412/471 (removed 59) transitions.
[2024-06-02 20:20:08] [INFO ] Flow matrix only has 397 transitions (discarded 15 similar events)
// Phase 1: matrix 397 rows 97 cols
[2024-06-02 20:20:08] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 20:20:08] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-02 20:20:08] [INFO ] Flow matrix only has 397 transitions (discarded 15 similar events)
[2024-06-02 20:20:08] [INFO ] Invariant cache hit.
[2024-06-02 20:20:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 20:20:09] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2024-06-02 20:20:09] [INFO ] Redundant transitions in 12 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-02 20:20:09] [INFO ] Flow matrix only has 397 transitions (discarded 15 similar events)
[2024-06-02 20:20:09] [INFO ] Invariant cache hit.
[2024-06-02 20:20:09] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-02 20:20:12] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 2 ms to minimize.
[2024-06-02 20:20:12] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 2 ms to minimize.
[2024-06-02 20:20:12] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 2 ms to minimize.
[2024-06-02 20:20:12] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-06-02 20:20:12] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:20:13] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 2 ms to minimize.
[2024-06-02 20:20:13] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:20:13] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 2 ms to minimize.
[2024-06-02 20:20:13] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:20:13] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:20:13] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 2 ms to minimize.
[2024-06-02 20:20:14] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 2 ms to minimize.
[2024-06-02 20:20:15] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-02 20:20:16] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 2 ms to minimize.
[2024-06-02 20:20:17] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (OVERLAPS) 396/493 variables, 97/119 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 13/132 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (OVERLAPS) 1/494 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/494 variables, and 133 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
At refinement iteration 3 (OVERLAPS) 396/493 variables, 97/119 constraints. Problems are: Problem set: 42 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 13/132 constraints. Problems are: Problem set: 42 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 361/493 constraints. Problems are: Problem set: 42 solved, 361 unsolved
[2024-06-02 20:20:54] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 1/494 constraints. Problems are: Problem set: 42 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/494 constraints. Problems are: Problem set: 42 solved, 361 unsolved
SMT process timed out in 60680ms, After SMT, problems are : Problem set: 42 solved, 361 unsolved
Search for dead transitions found 42 dead transitions in 60687ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 97/197 places, 370/471 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 95 transition count 393
Applied a total of 4 rules in 10 ms. Remains 95 /97 variables (removed 2) and now considering 393/370 (removed -23) transitions.
[2024-06-02 20:21:10] [INFO ] Flow matrix only has 371 transitions (discarded 22 similar events)
// Phase 1: matrix 371 rows 95 cols
[2024-06-02 20:21:10] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:21:10] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 20:21:10] [INFO ] Flow matrix only has 371 transitions (discarded 22 similar events)
[2024-06-02 20:21:10] [INFO ] Invariant cache hit.
[2024-06-02 20:21:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 20:21:10] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/197 places, 393/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62036 ms. Remains : 95/197 places, 393/471 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-07 finished in 62238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 189 transition count 456
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 189 transition count 456
Applied a total of 16 rules in 3 ms. Remains 189 /197 variables (removed 8) and now considering 456/471 (removed 15) transitions.
// Phase 1: matrix 456 rows 189 cols
[2024-06-02 20:21:10] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 20:21:11] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 20:21:11] [INFO ] Invariant cache hit.
[2024-06-02 20:21:11] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-02 20:21:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 20:21:17] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 3 ms to minimize.
[2024-06-02 20:21:17] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 3 ms to minimize.
[2024-06-02 20:21:17] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 3 ms to minimize.
[2024-06-02 20:21:17] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:21:18] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 3 ms to minimize.
[2024-06-02 20:21:18] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 3 ms to minimize.
[2024-06-02 20:21:18] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 3 ms to minimize.
[2024-06-02 20:21:18] [INFO ] Deduced a trap composed of 111 places in 162 ms of which 3 ms to minimize.
[2024-06-02 20:21:18] [INFO ] Deduced a trap composed of 85 places in 209 ms of which 3 ms to minimize.
[2024-06-02 20:21:19] [INFO ] Deduced a trap composed of 85 places in 198 ms of which 3 ms to minimize.
[2024-06-02 20:21:19] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 3 ms to minimize.
[2024-06-02 20:21:19] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 3 ms to minimize.
[2024-06-02 20:21:19] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 4 ms to minimize.
[2024-06-02 20:21:20] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 3 ms to minimize.
[2024-06-02 20:21:21] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 3 ms to minimize.
[2024-06-02 20:21:21] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 3 ms to minimize.
[2024-06-02 20:21:21] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 3 ms to minimize.
[2024-06-02 20:21:22] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 3 ms to minimize.
[2024-06-02 20:21:22] [INFO ] Deduced a trap composed of 40 places in 294 ms of which 4 ms to minimize.
[2024-06-02 20:21:22] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 20:21:23] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 3 ms to minimize.
[2024-06-02 20:21:23] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 3 ms to minimize.
[2024-06-02 20:21:24] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 4 ms to minimize.
[2024-06-02 20:21:24] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 4 ms to minimize.
[2024-06-02 20:21:24] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 4 ms to minimize.
[2024-06-02 20:21:25] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 3 ms to minimize.
[2024-06-02 20:21:25] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 3 ms to minimize.
[2024-06-02 20:21:25] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 3 ms to minimize.
[2024-06-02 20:21:26] [INFO ] Deduced a trap composed of 39 places in 268 ms of which 3 ms to minimize.
[2024-06-02 20:21:27] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 3 ms to minimize.
[2024-06-02 20:21:28] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 3 ms to minimize.
[2024-06-02 20:21:29] [INFO ] Deduced a trap composed of 115 places in 251 ms of which 3 ms to minimize.
[2024-06-02 20:21:29] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 3 ms to minimize.
[2024-06-02 20:21:30] [INFO ] Deduced a trap composed of 125 places in 292 ms of which 3 ms to minimize.
[2024-06-02 20:21:30] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 3 ms to minimize.
[2024-06-02 20:21:31] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 111 places in 216 ms of which 3 ms to minimize.
[2024-06-02 20:21:35] [INFO ] Deduced a trap composed of 111 places in 223 ms of which 4 ms to minimize.
[2024-06-02 20:21:35] [INFO ] Deduced a trap composed of 111 places in 207 ms of which 3 ms to minimize.
[2024-06-02 20:21:36] [INFO ] Deduced a trap composed of 39 places in 283 ms of which 3 ms to minimize.
[2024-06-02 20:21:37] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 4 ms to minimize.
[2024-06-02 20:21:37] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 4 ms to minimize.
[2024-06-02 20:21:38] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 4 ms to minimize.
[2024-06-02 20:21:38] [INFO ] Deduced a trap composed of 28 places in 268 ms of which 3 ms to minimize.
[2024-06-02 20:21:38] [INFO ] Deduced a trap composed of 90 places in 201 ms of which 3 ms to minimize.
[2024-06-02 20:21:38] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 3 ms to minimize.
[2024-06-02 20:21:40] [INFO ] Deduced a trap composed of 47 places in 274 ms of which 4 ms to minimize.
[2024-06-02 20:21:40] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/645 variables, and 55 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 20:21:47] [INFO ] Deduced a trap composed of 44 places in 266 ms of which 4 ms to minimize.
[2024-06-02 20:21:47] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 3 ms to minimize.
[2024-06-02 20:21:48] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 20:21:52] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 20:21:56] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 3 ms to minimize.
[2024-06-02 20:21:57] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 3 ms to minimize.
[2024-06-02 20:21:57] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 4 ms to minimize.
[2024-06-02 20:21:58] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 3 ms to minimize.
[2024-06-02 20:21:58] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 4 ms to minimize.
[2024-06-02 20:21:58] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-02 20:22:02] [INFO ] Deduced a trap composed of 112 places in 262 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 8 (OVERLAPS) 456/645 variables, 189/255 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 660 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30133 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 59/59 constraints]
After SMT, in 60490ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60496ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/197 places, 406/471 transitions.
Applied a total of 0 rules in 3 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60935 ms. Remains : 189/197 places, 406/471 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-09
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-09 finished in 61066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((F(p1)&&F(G(p2)))))))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 191 transition count 459
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 191 transition count 459
Applied a total of 12 rules in 7 ms. Remains 191 /197 variables (removed 6) and now considering 459/471 (removed 12) transitions.
// Phase 1: matrix 459 rows 191 cols
[2024-06-02 20:22:12] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 20:22:12] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-02 20:22:12] [INFO ] Invariant cache hit.
[2024-06-02 20:22:12] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2024-06-02 20:22:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:22:19] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 3 ms to minimize.
[2024-06-02 20:22:19] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 2 ms to minimize.
[2024-06-02 20:22:19] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 2 ms to minimize.
[2024-06-02 20:22:19] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:22:20] [INFO ] Deduced a trap composed of 37 places in 309 ms of which 4 ms to minimize.
[2024-06-02 20:22:20] [INFO ] Deduced a trap composed of 37 places in 290 ms of which 3 ms to minimize.
[2024-06-02 20:22:20] [INFO ] Deduced a trap composed of 112 places in 217 ms of which 3 ms to minimize.
[2024-06-02 20:22:21] [INFO ] Deduced a trap composed of 112 places in 215 ms of which 3 ms to minimize.
[2024-06-02 20:22:21] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 3 ms to minimize.
[2024-06-02 20:22:21] [INFO ] Deduced a trap composed of 112 places in 207 ms of which 3 ms to minimize.
[2024-06-02 20:22:21] [INFO ] Deduced a trap composed of 21 places in 313 ms of which 4 ms to minimize.
[2024-06-02 20:22:22] [INFO ] Deduced a trap composed of 28 places in 303 ms of which 3 ms to minimize.
[2024-06-02 20:22:22] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 3 ms to minimize.
[2024-06-02 20:22:22] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 3 ms to minimize.
[2024-06-02 20:22:24] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 3 ms to minimize.
[2024-06-02 20:22:24] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 3 ms to minimize.
[2024-06-02 20:22:24] [INFO ] Deduced a trap composed of 28 places in 283 ms of which 4 ms to minimize.
[2024-06-02 20:22:24] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 4 ms to minimize.
[2024-06-02 20:22:25] [INFO ] Deduced a trap composed of 50 places in 293 ms of which 4 ms to minimize.
[2024-06-02 20:22:25] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:22:26] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 2 ms to minimize.
[2024-06-02 20:22:27] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 3 ms to minimize.
[2024-06-02 20:22:27] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 3 ms to minimize.
[2024-06-02 20:22:28] [INFO ] Deduced a trap composed of 85 places in 231 ms of which 3 ms to minimize.
[2024-06-02 20:22:28] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 2 ms to minimize.
[2024-06-02 20:22:28] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 3 ms to minimize.
[2024-06-02 20:22:28] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2024-06-02 20:22:29] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 3 ms to minimize.
[2024-06-02 20:22:29] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 3 ms to minimize.
[2024-06-02 20:22:29] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 2 ms to minimize.
[2024-06-02 20:22:29] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 3 ms to minimize.
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 3 ms to minimize.
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 2 ms to minimize.
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 3 ms to minimize.
[2024-06-02 20:22:31] [INFO ] Deduced a trap composed of 43 places in 256 ms of which 4 ms to minimize.
[2024-06-02 20:22:32] [INFO ] Deduced a trap composed of 123 places in 264 ms of which 3 ms to minimize.
[2024-06-02 20:22:32] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 4 ms to minimize.
[2024-06-02 20:22:32] [INFO ] Deduced a trap composed of 125 places in 250 ms of which 3 ms to minimize.
[2024-06-02 20:22:33] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:22:39] [INFO ] Deduced a trap composed of 21 places in 289 ms of which 3 ms to minimize.
[2024-06-02 20:22:39] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 3 ms to minimize.
[2024-06-02 20:22:40] [INFO ] Deduced a trap composed of 23 places in 296 ms of which 3 ms to minimize.
[2024-06-02 20:22:40] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 191/650 variables, and 50 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/191 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:22:48] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 4 ms to minimize.
[2024-06-02 20:22:49] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 2 ms to minimize.
[2024-06-02 20:22:49] [INFO ] Deduced a trap composed of 28 places in 308 ms of which 3 ms to minimize.
[2024-06-02 20:22:49] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-06-02 20:22:50] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 3 ms to minimize.
[2024-06-02 20:22:50] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:22:53] [INFO ] Deduced a trap composed of 95 places in 189 ms of which 4 ms to minimize.
[2024-06-02 20:22:54] [INFO ] Deduced a trap composed of 95 places in 219 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:23:00] [INFO ] Deduced a trap composed of 116 places in 230 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:23:05] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 3 ms to minimize.
[2024-06-02 20:23:05] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 3 ms to minimize.
[2024-06-02 20:23:05] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 20:23:12] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 3 ms to minimize.
[2024-06-02 20:23:12] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/650 variables, and 64 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/191 constraints, PredecessorRefiner: 0/458 constraints, Known Traps: 57/57 constraints]
After SMT, in 60530ms problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 60539ms
Starting structural reductions in LTL mode, iteration 1 : 191/197 places, 459/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61268 ms. Remains : 191/197 places, 459/471 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 3447 reset in 461 ms.
Product exploration explored 100000 steps with 3448 reset in 464 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 218 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (1376 resets) in 592 ms. (67 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (300 resets) in 229 ms. (173 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (296 resets) in 288 ms. (138 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (299 resets) in 288 ms. (138 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (297 resets) in 244 ms. (163 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (299 resets) in 290 ms. (137 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 407650 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :1 out of 5
Probabilistic random walk after 407650 steps, saw 75414 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :1
[2024-06-02 20:23:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 126/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/191 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:23:19] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 459/650 variables, 191/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:23:19] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 3 ms to minimize.
[2024-06-02 20:23:19] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/650 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 201 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1199 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 126/131 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/191 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:23:20] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 3 ms to minimize.
[2024-06-02 20:23:20] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 459/650 variables, 191/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/650 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 650/650 variables, and 207 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1942 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 3151ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4115 ms.
Support contains 5 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 459/459 transitions.
Graph (trivial) has 184 edges and 191 vertex of which 9 / 191 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 185 transition count 423
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 158 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 157 transition count 422
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 57 place count 157 transition count 408
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 85 place count 143 transition count 408
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 133 place count 119 transition count 384
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 117 transition count 356
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 117 transition count 356
Performed 24 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 185 place count 93 transition count 473
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 203 place count 93 transition count 455
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 205 place count 91 transition count 439
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 91 transition count 439
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 211 place count 91 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 91 transition count 431
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 223 place count 87 transition count 427
Free-agglomeration rule applied 30 times.
Iterating global reduction 5 with 30 rules applied. Total rules applied 253 place count 87 transition count 397
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 5 with 82 rules applied. Total rules applied 335 place count 57 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 6 with 34 rules applied. Total rules applied 369 place count 57 transition count 311
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 373 place count 57 transition count 307
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 377 place count 53 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 7 with 32 rules applied. Total rules applied 409 place count 53 transition count 275
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 413 place count 51 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 416 place count 51 transition count 302
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 418 place count 51 transition count 330
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 420 place count 49 transition count 330
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 421 place count 48 transition count 329
Applied a total of 421 rules in 91 ms. Remains 48 /191 variables (removed 143) and now considering 329/459 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 48/191 places, 329/459 transitions.
RANDOM walk for 40000 steps (691 resets) in 199 ms. (200 steps per ms) remains 1/4 properties
BEST_FIRST walk for 33055 steps (399 resets) in 72 ms. (452 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0))), (F p2)]
Knowledge based reduction with 11 factoid took 535 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 5 out of 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 459/459 transitions.
Graph (trivial) has 184 edges and 191 vertex of which 9 / 191 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 184 transition count 426
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 158 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 157 transition count 425
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 55 place count 157 transition count 411
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 83 place count 143 transition count 411
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 131 place count 119 transition count 387
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 117 transition count 359
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 117 transition count 359
Performed 22 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 179 place count 95 transition count 442
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 183 place count 95 transition count 438
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 185 place count 93 transition count 422
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 93 transition count 422
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 191 place count 93 transition count 418
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 195 place count 91 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 221 place count 91 transition count 422
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 229 place count 87 transition count 418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 86 transition count 417
Applied a total of 230 rules in 83 ms. Remains 86 /191 variables (removed 105) and now considering 417/459 (removed 42) transitions.
[2024-06-02 20:23:27] [INFO ] Flow matrix only has 389 transitions (discarded 28 similar events)
// Phase 1: matrix 389 rows 86 cols
[2024-06-02 20:23:27] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:23:27] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-02 20:23:27] [INFO ] Flow matrix only has 389 transitions (discarded 28 similar events)
[2024-06-02 20:23:27] [INFO ] Invariant cache hit.
[2024-06-02 20:23:27] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:23:27] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-06-02 20:23:27] [INFO ] Redundant transitions in 7 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-02 20:23:27] [INFO ] Flow matrix only has 389 transitions (discarded 28 similar events)
[2024-06-02 20:23:27] [INFO ] Invariant cache hit.
[2024-06-02 20:23:27] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 20:23:30] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
[2024-06-02 20:23:30] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:23:31] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 1 ms to minimize.
[2024-06-02 20:23:31] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 1 ms to minimize.
[2024-06-02 20:23:31] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 2 ms to minimize.
[2024-06-02 20:23:31] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 2 ms to minimize.
[2024-06-02 20:23:31] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 2 ms to minimize.
[2024-06-02 20:23:31] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 2 ms to minimize.
[2024-06-02 20:23:32] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 2 ms to minimize.
[2024-06-02 20:23:32] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 2 ms to minimize.
[2024-06-02 20:23:32] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-06-02 20:23:32] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2024-06-02 20:23:32] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-06-02 20:23:32] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 388/474 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 78/185 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (OVERLAPS) 1/475 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/475 variables, and 186 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 20:23:59] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 4 (OVERLAPS) 388/474 variables, 86/108 constraints. Problems are: Problem set: 42 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 78/186 constraints. Problems are: Problem set: 42 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 366/552 constraints. Problems are: Problem set: 42 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/552 constraints. Problems are: Problem set: 42 solved, 366 unsolved
At refinement iteration 8 (OVERLAPS) 1/475 variables, 1/553 constraints. Problems are: Problem set: 42 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 553 constraints, problems are : Problem set: 42 solved, 366 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 366/408 constraints, Known Traps: 15/15 constraints]
After SMT, in 60707ms problems are : Problem set: 42 solved, 366 unsolved
Search for dead transitions found 42 dead transitions in 60712ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 86/191 places, 375/459 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 385
Applied a total of 2 rules in 10 ms. Remains 85 /86 variables (removed 1) and now considering 385/375 (removed -10) transitions.
[2024-06-02 20:24:28] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
// Phase 1: matrix 357 rows 85 cols
[2024-06-02 20:24:28] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:24:28] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 20:24:28] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
[2024-06-02 20:24:28] [INFO ] Invariant cache hit.
[2024-06-02 20:24:28] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:24:29] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/191 places, 385/459 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61807 ms. Remains : 85/191 places, 385/459 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 138 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (7425 resets) in 1512 ms. (26 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1384 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1405 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1384 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1380 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1388 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 272136 steps, run visited all 5 properties in 1520 ms. (steps per millisecond=179 )
Probabilistic random walk after 272136 steps, saw 61491 distinct states, run finished after 1534 ms. (steps per millisecond=177 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0))), (F p2)]
Knowledge based reduction with 11 factoid took 320 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 18189 reset in 358 ms.
Product exploration explored 100000 steps with 18227 reset in 303 ms.
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 385/385 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 385/385 (removed 0) transitions.
[2024-06-02 20:24:33] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
[2024-06-02 20:24:33] [INFO ] Invariant cache hit.
[2024-06-02 20:24:33] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-02 20:24:33] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
[2024-06-02 20:24:33] [INFO ] Invariant cache hit.
[2024-06-02 20:24:33] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:24:33] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2024-06-02 20:24:33] [INFO ] Redundant transitions in 4 ms returned []
Running 376 sub problems to find dead transitions.
[2024-06-02 20:24:33] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
[2024-06-02 20:24:33] [INFO ] Invariant cache hit.
[2024-06-02 20:24:33] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 20:24:35] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-06-02 20:24:35] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:24:35] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:24:35] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 2 ms to minimize.
[2024-06-02 20:24:36] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:24:36] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:24:36] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 1 ms to minimize.
[2024-06-02 20:24:36] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-06-02 20:24:36] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:24:36] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
[2024-06-02 20:24:36] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 2 ms to minimize.
[2024-06-02 20:24:37] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2024-06-02 20:24:37] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2024-06-02 20:24:37] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:24:37] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:24:37] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2024-06-02 20:24:37] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-02 20:24:37] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 2 ms to minimize.
[2024-06-02 20:24:37] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2024-06-02 20:24:38] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 20:24:38] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-06-02 20:24:39] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 20:24:40] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (OVERLAPS) 356/441 variables, 85/115 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 78/193 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 8 (OVERLAPS) 1/442 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 10 (OVERLAPS) 0/442 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 376 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 194 constraints, problems are : Problem set: 0 solved, 376 unsolved in 25912 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (OVERLAPS) 356/441 variables, 85/115 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 78/193 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 376/569 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/442 variables, and 569 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 23/23 constraints]
After SMT, in 56457ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 56465ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57100 ms. Remains : 85/85 places, 385/385 transitions.
Treatment of property MedleyA-PT-17-LTLFireability-10 finished in 198407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 190 transition count 458
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 190 transition count 458
Applied a total of 14 rules in 6 ms. Remains 190 /197 variables (removed 7) and now considering 458/471 (removed 13) transitions.
// Phase 1: matrix 458 rows 190 cols
[2024-06-02 20:25:30] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:25:30] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-02 20:25:30] [INFO ] Invariant cache hit.
[2024-06-02 20:25:31] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-02 20:25:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:25:38] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 3 ms to minimize.
[2024-06-02 20:25:38] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 3 ms to minimize.
[2024-06-02 20:25:38] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:25:38] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-06-02 20:25:39] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 3 ms to minimize.
[2024-06-02 20:25:39] [INFO ] Deduced a trap composed of 95 places in 230 ms of which 3 ms to minimize.
[2024-06-02 20:25:40] [INFO ] Deduced a trap composed of 24 places in 313 ms of which 4 ms to minimize.
[2024-06-02 20:25:40] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 3 ms to minimize.
[2024-06-02 20:25:41] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 3 ms to minimize.
[2024-06-02 20:25:41] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 3 ms to minimize.
[2024-06-02 20:25:41] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 4 ms to minimize.
[2024-06-02 20:25:41] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 3 ms to minimize.
[2024-06-02 20:25:42] [INFO ] Deduced a trap composed of 25 places in 292 ms of which 3 ms to minimize.
[2024-06-02 20:25:42] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 3 ms to minimize.
[2024-06-02 20:25:42] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 3 ms to minimize.
[2024-06-02 20:25:43] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 4 ms to minimize.
[2024-06-02 20:25:43] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 3 ms to minimize.
[2024-06-02 20:25:43] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 2 ms to minimize.
[2024-06-02 20:25:44] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 1 ms to minimize.
[2024-06-02 20:25:44] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:25:44] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 3 ms to minimize.
[2024-06-02 20:25:44] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 2 ms to minimize.
[2024-06-02 20:25:44] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 3 ms to minimize.
[2024-06-02 20:25:45] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 3 ms to minimize.
[2024-06-02 20:25:45] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 3 ms to minimize.
[2024-06-02 20:25:45] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 3 ms to minimize.
[2024-06-02 20:25:45] [INFO ] Deduced a trap composed of 131 places in 273 ms of which 3 ms to minimize.
[2024-06-02 20:25:46] [INFO ] Deduced a trap composed of 118 places in 217 ms of which 3 ms to minimize.
[2024-06-02 20:25:47] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 2 ms to minimize.
[2024-06-02 20:25:47] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 2 ms to minimize.
[2024-06-02 20:25:47] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 2 ms to minimize.
[2024-06-02 20:25:47] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2024-06-02 20:25:48] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 2 ms to minimize.
[2024-06-02 20:25:48] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 2 ms to minimize.
[2024-06-02 20:25:48] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 2 ms to minimize.
[2024-06-02 20:25:49] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 2 ms to minimize.
[2024-06-02 20:25:50] [INFO ] Deduced a trap composed of 122 places in 178 ms of which 3 ms to minimize.
[2024-06-02 20:25:50] [INFO ] Deduced a trap composed of 126 places in 179 ms of which 2 ms to minimize.
[2024-06-02 20:25:50] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:25:50] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:25:54] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 4 ms to minimize.
[2024-06-02 20:25:54] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 2 ms to minimize.
[2024-06-02 20:25:54] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 2 ms to minimize.
[2024-06-02 20:25:56] [INFO ] Deduced a trap composed of 51 places in 300 ms of which 3 ms to minimize.
[2024-06-02 20:25:56] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 3 ms to minimize.
[2024-06-02 20:25:57] [INFO ] Deduced a trap composed of 112 places in 190 ms of which 2 ms to minimize.
[2024-06-02 20:25:58] [INFO ] Deduced a trap composed of 115 places in 161 ms of which 2 ms to minimize.
[2024-06-02 20:25:58] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 2 ms to minimize.
[2024-06-02 20:25:59] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:26:01] [INFO ] Deduced a trap composed of 119 places in 196 ms of which 3 ms to minimize.
[2024-06-02 20:26:01] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 58 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 51/58 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:26:04] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 2 ms to minimize.
[2024-06-02 20:26:04] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 3 ms to minimize.
[2024-06-02 20:26:04] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 2 ms to minimize.
[2024-06-02 20:26:04] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:26:06] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:26:09] [INFO ] Deduced a trap composed of 40 places in 329 ms of which 4 ms to minimize.
[2024-06-02 20:26:10] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 2 ms to minimize.
[2024-06-02 20:26:10] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 2 ms to minimize.
[2024-06-02 20:26:10] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:26:10] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:26:14] [INFO ] Deduced a trap composed of 44 places in 300 ms of which 3 ms to minimize.
[2024-06-02 20:26:15] [INFO ] Deduced a trap composed of 44 places in 304 ms of which 3 ms to minimize.
[2024-06-02 20:26:15] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 4 ms to minimize.
[2024-06-02 20:26:15] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 3 ms to minimize.
[2024-06-02 20:26:16] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:26:20] [INFO ] Deduced a trap composed of 118 places in 290 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 8 (OVERLAPS) 458/648 variables, 190/264 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 407/671 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 671 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 67/67 constraints]
After SMT, in 60495ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60503ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 408/471 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61228 ms. Remains : 190/197 places, 408/471 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-12 finished in 61477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(F(p1)&&X(X(G(p0)))))))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 190 transition count 458
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 190 transition count 458
Applied a total of 14 rules in 6 ms. Remains 190 /197 variables (removed 7) and now considering 458/471 (removed 13) transitions.
// Phase 1: matrix 458 rows 190 cols
[2024-06-02 20:26:31] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 20:26:32] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-02 20:26:32] [INFO ] Invariant cache hit.
[2024-06-02 20:26:32] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-02 20:26:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:26:40] [INFO ] Deduced a trap composed of 15 places in 284 ms of which 3 ms to minimize.
[2024-06-02 20:26:40] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 3 ms to minimize.
[2024-06-02 20:26:40] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 3 ms to minimize.
[2024-06-02 20:26:40] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 3 ms to minimize.
[2024-06-02 20:26:41] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 3 ms to minimize.
[2024-06-02 20:26:41] [INFO ] Deduced a trap composed of 112 places in 212 ms of which 3 ms to minimize.
[2024-06-02 20:26:41] [INFO ] Deduced a trap composed of 95 places in 213 ms of which 3 ms to minimize.
[2024-06-02 20:26:41] [INFO ] Deduced a trap composed of 112 places in 200 ms of which 3 ms to minimize.
[2024-06-02 20:26:42] [INFO ] Deduced a trap composed of 113 places in 252 ms of which 3 ms to minimize.
[2024-06-02 20:26:43] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 3 ms to minimize.
[2024-06-02 20:26:43] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 2 ms to minimize.
[2024-06-02 20:26:44] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 3 ms to minimize.
[2024-06-02 20:26:44] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 2 ms to minimize.
[2024-06-02 20:26:44] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 3 ms to minimize.
[2024-06-02 20:26:44] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 3 ms to minimize.
[2024-06-02 20:26:45] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 3 ms to minimize.
[2024-06-02 20:26:45] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 3 ms to minimize.
[2024-06-02 20:26:45] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 3 ms to minimize.
[2024-06-02 20:26:46] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 3 ms to minimize.
[2024-06-02 20:26:46] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:26:48] [INFO ] Deduced a trap composed of 42 places in 305 ms of which 3 ms to minimize.
[2024-06-02 20:26:48] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 3 ms to minimize.
[2024-06-02 20:26:48] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 3 ms to minimize.
[2024-06-02 20:26:49] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 3 ms to minimize.
[2024-06-02 20:26:49] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 3 ms to minimize.
[2024-06-02 20:26:49] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 3 ms to minimize.
[2024-06-02 20:26:49] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 3 ms to minimize.
[2024-06-02 20:26:50] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 3 ms to minimize.
[2024-06-02 20:26:50] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 2 ms to minimize.
[2024-06-02 20:26:50] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 3 ms to minimize.
[2024-06-02 20:26:51] [INFO ] Deduced a trap composed of 118 places in 264 ms of which 3 ms to minimize.
[2024-06-02 20:26:51] [INFO ] Deduced a trap composed of 21 places in 267 ms of which 3 ms to minimize.
[2024-06-02 20:26:52] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 3 ms to minimize.
[2024-06-02 20:26:52] [INFO ] Deduced a trap composed of 123 places in 236 ms of which 3 ms to minimize.
[2024-06-02 20:26:53] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 4 ms to minimize.
[2024-06-02 20:26:54] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 20:26:57] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 3 ms to minimize.
[2024-06-02 20:26:57] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 2 ms to minimize.
[2024-06-02 20:26:58] [INFO ] Deduced a trap composed of 90 places in 251 ms of which 4 ms to minimize.
[2024-06-02 20:26:59] [INFO ] Deduced a trap composed of 25 places in 301 ms of which 4 ms to minimize.
[2024-06-02 20:26:59] [INFO ] Deduced a trap composed of 43 places in 292 ms of which 2 ms to minimize.
[2024-06-02 20:26:59] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 2 ms to minimize.
[2024-06-02 20:27:00] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 3 ms to minimize.
[2024-06-02 20:27:00] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 2 ms to minimize.
[2024-06-02 20:27:00] [INFO ] Deduced a trap composed of 113 places in 194 ms of which 3 ms to minimize.
[2024-06-02 20:27:01] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 2 ms to minimize.
[2024-06-02 20:27:01] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 3 ms to minimize.
[2024-06-02 20:27:02] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 2 ms to minimize.
[2024-06-02 20:27:02] [INFO ] Deduced a trap composed of 40 places in 261 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 56 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 4 (OVERLAPS) 458/648 variables, 190/246 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 407/653 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 653 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 49/49 constraints]
After SMT, in 60502ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60511ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 408/471 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61296 ms. Remains : 190/197 places, 408/471 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-13
Product exploration explored 100000 steps with 3448 reset in 202 ms.
Product exploration explored 100000 steps with 3447 reset in 390 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (1376 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (299 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (298 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (298 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 163532 steps, run visited all 3 properties in 694 ms. (steps per millisecond=235 )
Probabilistic random walk after 163532 steps, saw 30106 distinct states, run finished after 703 ms. (steps per millisecond=232 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 408/408 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
// Phase 1: matrix 408 rows 190 cols
[2024-06-02 20:27:35] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:27:35] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-02 20:27:35] [INFO ] Invariant cache hit.
[2024-06-02 20:27:36] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2024-06-02 20:27:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:27:40] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 3 ms to minimize.
[2024-06-02 20:27:40] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 3 ms to minimize.
[2024-06-02 20:27:40] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 3 ms to minimize.
[2024-06-02 20:27:40] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:27:40] [INFO ] Deduced a trap composed of 122 places in 197 ms of which 4 ms to minimize.
[2024-06-02 20:27:41] [INFO ] Deduced a trap composed of 112 places in 195 ms of which 3 ms to minimize.
[2024-06-02 20:27:41] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 3 ms to minimize.
[2024-06-02 20:27:41] [INFO ] Deduced a trap composed of 112 places in 193 ms of which 2 ms to minimize.
[2024-06-02 20:27:41] [INFO ] Deduced a trap composed of 112 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:27:41] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 2 ms to minimize.
[2024-06-02 20:27:41] [INFO ] Deduced a trap composed of 114 places in 166 ms of which 2 ms to minimize.
[2024-06-02 20:27:42] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 3 ms to minimize.
[2024-06-02 20:27:42] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:27:42] [INFO ] Deduced a trap composed of 95 places in 197 ms of which 3 ms to minimize.
[2024-06-02 20:27:42] [INFO ] Deduced a trap composed of 113 places in 236 ms of which 3 ms to minimize.
[2024-06-02 20:27:43] [INFO ] Deduced a trap composed of 123 places in 222 ms of which 3 ms to minimize.
[2024-06-02 20:27:43] [INFO ] Deduced a trap composed of 113 places in 233 ms of which 3 ms to minimize.
[2024-06-02 20:27:44] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2024-06-02 20:27:44] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 3 ms to minimize.
[2024-06-02 20:27:44] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:27:45] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 3 ms to minimize.
[2024-06-02 20:27:45] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 3 ms to minimize.
[2024-06-02 20:27:46] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 3 ms to minimize.
[2024-06-02 20:27:46] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 3 ms to minimize.
[2024-06-02 20:27:46] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 3 ms to minimize.
[2024-06-02 20:27:46] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 3 ms to minimize.
[2024-06-02 20:27:47] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 4 ms to minimize.
[2024-06-02 20:27:47] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 2 ms to minimize.
[2024-06-02 20:27:47] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2024-06-02 20:27:47] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 3 ms to minimize.
[2024-06-02 20:27:48] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 3 ms to minimize.
[2024-06-02 20:27:48] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 3 ms to minimize.
[2024-06-02 20:27:48] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 3 ms to minimize.
[2024-06-02 20:27:48] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 3 ms to minimize.
[2024-06-02 20:27:48] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 3 ms to minimize.
[2024-06-02 20:27:49] [INFO ] Deduced a trap composed of 50 places in 237 ms of which 3 ms to minimize.
[2024-06-02 20:27:49] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 3 ms to minimize.
[2024-06-02 20:27:49] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 3 ms to minimize.
[2024-06-02 20:27:49] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 4 ms to minimize.
[2024-06-02 20:27:50] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:27:54] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 3 ms to minimize.
[2024-06-02 20:27:54] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 4 ms to minimize.
[2024-06-02 20:27:54] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 3 ms to minimize.
[2024-06-02 20:27:55] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 3 ms to minimize.
[2024-06-02 20:27:55] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 2 ms to minimize.
[2024-06-02 20:27:55] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
[2024-06-02 20:27:55] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:27:55] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 3 ms to minimize.
[2024-06-02 20:27:56] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-06-02 20:27:56] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:27:56] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 4 ms to minimize.
[2024-06-02 20:27:56] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 3 ms to minimize.
[2024-06-02 20:27:56] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-06-02 20:27:57] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 3 ms to minimize.
[2024-06-02 20:27:57] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 3 ms to minimize.
[2024-06-02 20:27:57] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 3 ms to minimize.
[2024-06-02 20:27:58] [INFO ] Deduced a trap composed of 133 places in 235 ms of which 3 ms to minimize.
[2024-06-02 20:27:58] [INFO ] Deduced a trap composed of 55 places in 222 ms of which 3 ms to minimize.
[2024-06-02 20:27:59] [INFO ] Deduced a trap composed of 51 places in 234 ms of which 4 ms to minimize.
[2024-06-02 20:27:59] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:28:00] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 3 ms to minimize.
[2024-06-02 20:28:00] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 3 ms to minimize.
[2024-06-02 20:28:00] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 3 ms to minimize.
[2024-06-02 20:28:01] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 3 ms to minimize.
[2024-06-02 20:28:01] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 2 ms to minimize.
[2024-06-02 20:28:02] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 3 ms to minimize.
[2024-06-02 20:28:02] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 3 ms to minimize.
[2024-06-02 20:28:03] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 3 ms to minimize.
[2024-06-02 20:28:03] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 3 ms to minimize.
[2024-06-02 20:28:03] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/598 variables, and 77 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:28:09] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:28:10] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 2 ms to minimize.
[2024-06-02 20:28:10] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:28:11] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:28:12] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 3 ms to minimize.
[2024-06-02 20:28:12] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:28:14] [INFO ] Deduced a trap composed of 103 places in 167 ms of which 3 ms to minimize.
[2024-06-02 20:28:15] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:28:19] [INFO ] Deduced a trap composed of 121 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:28:19] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:28:24] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:28:27] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:28:27] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 3 ms to minimize.
[2024-06-02 20:28:27] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 3 ms to minimize.
[2024-06-02 20:28:27] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 9 (OVERLAPS) 408/598 variables, 190/282 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 689 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 85/85 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Finished structural reductions in LTL mode , in 1 iterations and 60831 ms. Remains : 190/190 places, 408/408 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (1376 resets) in 300 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (302 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (297 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (301 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 163532 steps, run visited all 3 properties in 1124 ms. (steps per millisecond=145 )
Probabilistic random walk after 163532 steps, saw 30106 distinct states, run finished after 1124 ms. (steps per millisecond=145 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 3447 reset in 202 ms.
Product exploration explored 100000 steps with 3448 reset in 229 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 408/408 transitions.
Graph (trivial) has 187 edges and 190 vertex of which 9 / 190 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 184 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 28 place count 184 transition count 405
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 184 transition count 405
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 63 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 64 place count 184 transition count 409
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 81 place count 167 transition count 380
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 98 place count 167 transition count 380
Performed 28 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 126 place count 167 transition count 575
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 132 place count 167 transition count 569
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 144 place count 155 transition count 535
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 156 place count 155 transition count 535
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 161 place count 155 transition count 530
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 152 transition count 525
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 152 transition count 525
Deduced a syphon composed of 62 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 200 place count 152 transition count 492
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 203 place count 149 transition count 487
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 149 transition count 487
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 209 place count 149 transition count 487
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 212 place count 146 transition count 484
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 215 place count 146 transition count 484
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 216 place count 146 transition count 499
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 217 place count 145 transition count 497
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 145 transition count 497
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 218 rules in 99 ms. Remains 145 /190 variables (removed 45) and now considering 497/408 (removed -89) transitions.
[2024-06-02 20:28:40] [INFO ] Redundant transitions in 8 ms returned []
Running 496 sub problems to find dead transitions.
[2024-06-02 20:28:40] [INFO ] Flow matrix only has 463 transitions (discarded 34 similar events)
// Phase 1: matrix 463 rows 145 cols
[2024-06-02 20:28:40] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:28:40] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-06-02 20:28:46] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 20:28:46] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-02 20:28:46] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 3 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-02 20:28:46] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 3 ms to minimize.
[2024-06-02 20:28:46] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 3 ms to minimize.
[2024-06-02 20:28:47] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 3 ms to minimize.
[2024-06-02 20:28:47] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-06-02 20:28:47] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 2 ms to minimize.
[2024-06-02 20:28:47] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:28:47] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
[2024-06-02 20:28:48] [INFO ] Deduced a trap composed of 33 places in 247 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-02 20:28:48] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:28:48] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:28:48] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
[2024-06-02 20:28:48] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
[2024-06-02 20:28:48] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-06-02 20:28:48] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:28:49] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 2 ms to minimize.
[2024-06-02 20:28:49] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 1 ms to minimize.
[2024-06-02 20:28:49] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 20/27 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-02 20:28:49] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 3 ms to minimize.
[2024-06-02 20:28:50] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 2 ms to minimize.
[2024-06-02 20:28:50] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 3 ms to minimize.
[2024-06-02 20:28:50] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 3 ms to minimize.
[2024-06-02 20:28:50] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 2 ms to minimize.
[2024-06-02 20:28:51] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:28:51] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 2 ms to minimize.
[2024-06-02 20:28:51] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 2 ms to minimize.
[2024-06-02 20:28:53] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 3 ms to minimize.
[2024-06-02 20:28:54] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 10/37 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-02 20:28:56] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 1 ms to minimize.
[2024-06-02 20:28:56] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 2/39 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-02 20:28:59] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/40 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-02 20:29:01] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 2 ms to minimize.
[2024-06-02 20:29:03] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/42 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/42 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 462/607 variables, 145/187 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 94/281 constraints. Problems are: Problem set: 96 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/608 variables, and 281 constraints, problems are : Problem set: 96 solved, 400 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, ReadFeed: 94/95 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 96 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 1 (OVERLAPS) 60/145 variables, 7/7 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 35/42 constraints. Problems are: Problem set: 96 solved, 400 unsolved
[2024-06-02 20:29:13] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 2 ms to minimize.
[2024-06-02 20:29:13] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 3 ms to minimize.
[2024-06-02 20:29:14] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 3 ms to minimize.
[2024-06-02 20:29:14] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-06-02 20:29:14] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 5/47 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/47 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 462/607 variables, 145/192 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 94/286 constraints. Problems are: Problem set: 96 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 400/686 constraints. Problems are: Problem set: 96 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/608 variables, and 686 constraints, problems are : Problem set: 96 solved, 400 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, ReadFeed: 94/95 constraints, PredecessorRefiner: 400/496 constraints, Known Traps: 40/40 constraints]
After SMT, in 60716ms problems are : Problem set: 96 solved, 400 unsolved
Search for dead transitions found 96 dead transitions in 60724ms
Found 96 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 96 transitions
Dead transitions reduction (with SMT) removed 96 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 145/190 places, 401/408 transitions.
Graph (complete) has 726 edges and 145 vertex of which 86 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.3 ms
Discarding 59 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 23 ms. Remains 86 /145 variables (removed 59) and now considering 401/401 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/190 places, 401/408 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60865 ms. Remains : 86/190 places, 401/408 transitions.
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 408/408 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
// Phase 1: matrix 408 rows 190 cols
[2024-06-02 20:29:40] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:29:41] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-06-02 20:29:41] [INFO ] Invariant cache hit.
[2024-06-02 20:29:41] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2024-06-02 20:29:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:29:47] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 3 ms to minimize.
[2024-06-02 20:29:47] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-06-02 20:29:47] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
[2024-06-02 20:29:47] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-02 20:29:48] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 3 ms to minimize.
[2024-06-02 20:29:48] [INFO ] Deduced a trap composed of 112 places in 199 ms of which 3 ms to minimize.
[2024-06-02 20:29:48] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:29:48] [INFO ] Deduced a trap composed of 112 places in 170 ms of which 3 ms to minimize.
[2024-06-02 20:29:48] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 2 ms to minimize.
[2024-06-02 20:29:48] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:29:48] [INFO ] Deduced a trap composed of 114 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:29:49] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:29:49] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:29:49] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:29:49] [INFO ] Deduced a trap composed of 113 places in 196 ms of which 3 ms to minimize.
[2024-06-02 20:29:50] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 2 ms to minimize.
[2024-06-02 20:29:50] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:29:50] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 3 ms to minimize.
[2024-06-02 20:29:51] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 2 ms to minimize.
[2024-06-02 20:29:51] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:29:52] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:29:52] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:29:52] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
[2024-06-02 20:29:53] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 4 ms to minimize.
[2024-06-02 20:29:53] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2024-06-02 20:29:53] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2024-06-02 20:29:53] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
[2024-06-02 20:29:53] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:29:53] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:29:54] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
[2024-06-02 20:29:54] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:29:54] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:29:54] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
[2024-06-02 20:29:54] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-06-02 20:29:54] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:29:55] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:29:55] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-06-02 20:29:55] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2024-06-02 20:29:55] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-02 20:29:55] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:29:59] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 3 ms to minimize.
[2024-06-02 20:30:00] [INFO ] Deduced a trap composed of 35 places in 255 ms of which 3 ms to minimize.
[2024-06-02 20:30:00] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 3 ms to minimize.
[2024-06-02 20:30:00] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 3 ms to minimize.
[2024-06-02 20:30:00] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 2 ms to minimize.
[2024-06-02 20:30:01] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 4 ms to minimize.
[2024-06-02 20:30:01] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 4 ms to minimize.
[2024-06-02 20:30:01] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 3 ms to minimize.
[2024-06-02 20:30:02] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 3 ms to minimize.
[2024-06-02 20:30:02] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 4 ms to minimize.
[2024-06-02 20:30:02] [INFO ] Deduced a trap composed of 55 places in 235 ms of which 4 ms to minimize.
[2024-06-02 20:30:02] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 3 ms to minimize.
[2024-06-02 20:30:03] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 2 ms to minimize.
[2024-06-02 20:30:03] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 3 ms to minimize.
[2024-06-02 20:30:03] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 4 ms to minimize.
[2024-06-02 20:30:04] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 3 ms to minimize.
[2024-06-02 20:30:04] [INFO ] Deduced a trap composed of 133 places in 215 ms of which 3 ms to minimize.
[2024-06-02 20:30:05] [INFO ] Deduced a trap composed of 55 places in 224 ms of which 3 ms to minimize.
[2024-06-02 20:30:05] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 3 ms to minimize.
[2024-06-02 20:30:05] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:30:06] [INFO ] Deduced a trap composed of 45 places in 265 ms of which 3 ms to minimize.
[2024-06-02 20:30:06] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 3 ms to minimize.
[2024-06-02 20:30:07] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 3 ms to minimize.
[2024-06-02 20:30:07] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 3 ms to minimize.
[2024-06-02 20:30:08] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 3 ms to minimize.
[2024-06-02 20:30:09] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 3 ms to minimize.
[2024-06-02 20:30:09] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 4 ms to minimize.
[2024-06-02 20:30:09] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 2 ms to minimize.
[2024-06-02 20:30:09] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 3 ms to minimize.
[2024-06-02 20:30:10] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/598 variables, and 77 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:30:16] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 3 ms to minimize.
[2024-06-02 20:30:16] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 3 ms to minimize.
[2024-06-02 20:30:17] [INFO ] Deduced a trap composed of 50 places in 179 ms of which 2 ms to minimize.
[2024-06-02 20:30:18] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 3 ms to minimize.
[2024-06-02 20:30:19] [INFO ] Deduced a trap composed of 47 places in 248 ms of which 3 ms to minimize.
[2024-06-02 20:30:19] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:30:22] [INFO ] Deduced a trap composed of 103 places in 230 ms of which 3 ms to minimize.
[2024-06-02 20:30:23] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:30:26] [INFO ] Deduced a trap composed of 121 places in 251 ms of which 4 ms to minimize.
[2024-06-02 20:30:27] [INFO ] Deduced a trap composed of 95 places in 191 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:30:33] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 20:30:36] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 2 ms to minimize.
[2024-06-02 20:30:37] [INFO ] Deduced a trap composed of 29 places in 264 ms of which 3 ms to minimize.
[2024-06-02 20:30:37] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 4 ms to minimize.
[2024-06-02 20:30:37] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/598 variables, and 92 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 0/407 constraints, Known Traps: 85/85 constraints]
After SMT, in 60379ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60390ms
Finished structural reductions in LTL mode , in 1 iterations and 61330 ms. Remains : 190/190 places, 408/408 transitions.
Treatment of property MedleyA-PT-17-LTLFireability-13 finished in 250484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p1)||G(!p2))))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 200 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 190 transition count 438
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 164 transition count 438
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 53 place count 164 transition count 422
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 85 place count 148 transition count 422
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 141 transition count 409
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 141 transition count 409
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 140 transition count 393
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 140 transition count 393
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 145 place count 118 transition count 371
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 117 transition count 359
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 117 transition count 359
Performed 23 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 193 place count 94 transition count 449
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 197 place count 94 transition count 445
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 199 place count 92 transition count 429
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 92 transition count 429
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 209 place count 92 transition count 421
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 213 place count 90 transition count 451
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 228 place count 90 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 236 place count 86 transition count 432
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 86 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 249 place count 86 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 85 transition count 420
Applied a total of 250 rules in 96 ms. Remains 85 /197 variables (removed 112) and now considering 420/471 (removed 51) transitions.
[2024-06-02 20:30:42] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
// Phase 1: matrix 388 rows 85 cols
[2024-06-02 20:30:42] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:30:42] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-02 20:30:42] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2024-06-02 20:30:42] [INFO ] Invariant cache hit.
[2024-06-02 20:30:42] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:30:42] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-06-02 20:30:42] [INFO ] Redundant transitions in 3 ms returned []
Running 411 sub problems to find dead transitions.
[2024-06-02 20:30:43] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2024-06-02 20:30:43] [INFO ] Invariant cache hit.
[2024-06-02 20:30:43] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 20:30:44] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 2 ms to minimize.
[2024-06-02 20:30:44] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:30:45] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:30:45] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 2 ms to minimize.
[2024-06-02 20:30:45] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 2 ms to minimize.
[2024-06-02 20:30:45] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2024-06-02 20:30:45] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:30:45] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:30:46] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 2 ms to minimize.
[2024-06-02 20:30:46] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:30:46] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
[2024-06-02 20:30:46] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (OVERLAPS) 387/472 variables, 85/104 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 78/182 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (OVERLAPS) 1/473 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 8 (OVERLAPS) 0/473 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 411 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 183 constraints, problems are : Problem set: 0 solved, 411 unsolved in 27250 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
At refinement iteration 3 (OVERLAPS) 387/472 variables, 85/104 constraints. Problems are: Problem set: 42 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 78/182 constraints. Problems are: Problem set: 42 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 369/551 constraints. Problems are: Problem set: 42 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/551 constraints. Problems are: Problem set: 42 solved, 369 unsolved
SMT process timed out in 57695ms, After SMT, problems are : Problem set: 42 solved, 369 unsolved
Search for dead transitions found 42 dead transitions in 57699ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 85/197 places, 378/471 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 388
Applied a total of 2 rules in 8 ms. Remains 84 /85 variables (removed 1) and now considering 388/378 (removed -10) transitions.
[2024-06-02 20:31:40] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
// Phase 1: matrix 356 rows 84 cols
[2024-06-02 20:31:40] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:31:40] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-02 20:31:40] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-02 20:31:40] [INFO ] Invariant cache hit.
[2024-06-02 20:31:41] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:31:41] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/197 places, 388/471 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58982 ms. Remains : 84/197 places, 388/471 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-14
Product exploration explored 100000 steps with 18279 reset in 256 ms.
Product exploration explored 100000 steps with 18242 reset in 524 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 170 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (7450 resets) in 668 ms. (59 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (1391 resets) in 441 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1410 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
[2024-06-02 20:31:43] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-02 20:31:43] [INFO ] Invariant cache hit.
[2024-06-02 20:31:43] [INFO ] State equation strengthened by 79 read => feed constraints.
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/263 variables, 31/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 4/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 175/438 variables, 52/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 4/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 74/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/439 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/440 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/440 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 170 constraints, problems are : Problem set: 1 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/263 variables, 31/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 4/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 175/438 variables, 52/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 4/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 74/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/439 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/440 variables, 1/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/440 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 171 constraints, problems are : Problem set: 1 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 645ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 388/388 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 84 transition count 385
Free-agglomeration rule applied 34 times.
Iterating global reduction 1 with 34 rules applied. Total rules applied 37 place count 84 transition count 351
Reduce places removed 34 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 119 place count 50 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 140 place count 50 transition count 282
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 50 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 144 place count 48 transition count 310
Applied a total of 144 rules in 45 ms. Remains 48 /84 variables (removed 36) and now considering 310/388 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 48/84 places, 310/388 transitions.
RANDOM walk for 3102 steps (222 resets) in 22 ms. (134 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p0) p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p1) (OR p1 (NOT p2))))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F p1)]
Knowledge based reduction with 18 factoid took 621 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 388/388 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 388/388 (removed 0) transitions.
[2024-06-02 20:31:44] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-02 20:31:44] [INFO ] Invariant cache hit.
[2024-06-02 20:31:45] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-02 20:31:45] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-02 20:31:45] [INFO ] Invariant cache hit.
[2024-06-02 20:31:45] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:31:45] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2024-06-02 20:31:45] [INFO ] Redundant transitions in 4 ms returned []
Running 379 sub problems to find dead transitions.
[2024-06-02 20:31:45] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-02 20:31:45] [INFO ] Invariant cache hit.
[2024-06-02 20:31:45] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-02 20:31:47] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-06-02 20:31:47] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:31:48] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 2 ms to minimize.
[2024-06-02 20:31:48] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 2 ms to minimize.
[2024-06-02 20:31:48] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 1 ms to minimize.
[2024-06-02 20:31:48] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:31:48] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 2 ms to minimize.
[2024-06-02 20:31:49] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2024-06-02 20:31:49] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:31:49] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-06-02 20:31:49] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2024-06-02 20:31:49] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-06-02 20:31:49] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 1 ms to minimize.
[2024-06-02 20:31:49] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 2 ms to minimize.
[2024-06-02 20:31:50] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:31:50] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 2 ms to minimize.
[2024-06-02 20:31:50] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 2 ms to minimize.
[2024-06-02 20:31:50] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-06-02 20:31:50] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2024-06-02 20:31:50] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-02 20:31:51] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 1 ms to minimize.
[2024-06-02 20:31:51] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 2 ms to minimize.
[2024-06-02 20:31:51] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 2 ms to minimize.
[2024-06-02 20:31:51] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:31:51] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-02 20:31:54] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-02 20:31:55] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (OVERLAPS) 355/439 variables, 84/118 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 78/196 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 8 (OVERLAPS) 1/440 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 197 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (OVERLAPS) 355/439 variables, 84/118 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 78/196 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 379/575 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (OVERLAPS) 1/440 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 576 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 27/27 constraints]
After SMT, in 60585ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60591ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61235 ms. Remains : 84/84 places, 388/388 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 242 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (7436 resets) in 1061 ms. (37 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40002 steps (1418 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1387 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
[2024-06-02 20:32:47] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-02 20:32:47] [INFO ] Invariant cache hit.
[2024-06-02 20:32:47] [INFO ] State equation strengthened by 79 read => feed constraints.
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/31 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/263 variables, 31/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 4/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 175/438 variables, 52/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 4/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 74/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/439 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/440 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/440 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 170 constraints, problems are : Problem set: 1 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 232/263 variables, 31/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 4/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 175/438 variables, 52/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 4/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 74/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/439 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/440 variables, 1/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/440 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 171 constraints, problems are : Problem set: 1 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 525ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 388/388 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 84 transition count 385
Free-agglomeration rule applied 34 times.
Iterating global reduction 1 with 34 rules applied. Total rules applied 37 place count 84 transition count 351
Reduce places removed 34 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 119 place count 50 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 140 place count 50 transition count 282
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 50 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 144 place count 48 transition count 310
Applied a total of 144 rules in 42 ms. Remains 48 /84 variables (removed 36) and now considering 310/388 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 48/84 places, 310/388 transitions.
RANDOM walk for 2506 steps (174 resets) in 14 ms. (167 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p0) p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p1) (OR p1 (NOT p2))))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F p1)]
Knowledge based reduction with 18 factoid took 479 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Product exploration explored 100000 steps with 18185 reset in 408 ms.
Product exploration explored 100000 steps with 18219 reset in 315 ms.
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 388/388 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 388/388 (removed 0) transitions.
[2024-06-02 20:32:49] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-02 20:32:49] [INFO ] Invariant cache hit.
[2024-06-02 20:32:49] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 20:32:49] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-02 20:32:49] [INFO ] Invariant cache hit.
[2024-06-02 20:32:49] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:32:49] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-06-02 20:32:49] [INFO ] Redundant transitions in 3 ms returned []
Running 379 sub problems to find dead transitions.
[2024-06-02 20:32:49] [INFO ] Flow matrix only has 356 transitions (discarded 32 similar events)
[2024-06-02 20:32:49] [INFO ] Invariant cache hit.
[2024-06-02 20:32:49] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-02 20:32:51] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:32:51] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-02 20:32:51] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2024-06-02 20:32:52] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 1 ms to minimize.
[2024-06-02 20:32:52] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 2 ms to minimize.
[2024-06-02 20:32:52] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-02 20:32:52] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:32:52] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2024-06-02 20:32:52] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2024-06-02 20:32:52] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:32:52] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:32:52] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2024-06-02 20:32:53] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 1 ms to minimize.
[2024-06-02 20:32:53] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2024-06-02 20:32:53] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:32:53] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:32:53] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:32:53] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:32:53] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-06-02 20:32:53] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-02 20:32:54] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2024-06-02 20:32:54] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-06-02 20:32:54] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:32:54] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:32:54] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-06-02 20:32:57] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:32:57] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (OVERLAPS) 355/439 variables, 84/118 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 78/196 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 8 (OVERLAPS) 1/440 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 10 (OVERLAPS) 0/440 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 379 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 197 constraints, problems are : Problem set: 0 solved, 379 unsolved in 29489 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (OVERLAPS) 355/439 variables, 84/118 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 78/196 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 379/575 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (OVERLAPS) 1/440 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 576 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 27/27 constraints]
After SMT, in 59850ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 59858ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60275 ms. Remains : 84/84 places, 388/388 transitions.
Treatment of property MedleyA-PT-17-LTLFireability-14 finished in 187284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((F(p1)&&F(G(p2)))))))'
Found a Lengthening insensitive property : MedleyA-PT-17-LTLFireability-10
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 194 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 190 transition count 439
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 165 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 164 transition count 438
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 53 place count 164 transition count 422
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 85 place count 148 transition count 422
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 91 place count 142 transition count 410
Iterating global reduction 3 with 6 rules applied. Total rules applied 97 place count 142 transition count 410
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 141 transition count 394
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 141 transition count 394
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 145 place count 118 transition count 371
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 117 transition count 359
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 117 transition count 359
Performed 22 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 191 place count 95 transition count 442
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 195 place count 95 transition count 438
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 197 place count 93 transition count 422
Iterating global reduction 4 with 2 rules applied. Total rules applied 199 place count 93 transition count 422
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 203 place count 93 transition count 418
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 207 place count 91 transition count 448
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 90 transition count 447
Applied a total of 208 rules in 59 ms. Remains 90 /197 variables (removed 107) and now considering 447/471 (removed 24) transitions.
[2024-06-02 20:33:50] [INFO ] Flow matrix only has 419 transitions (discarded 28 similar events)
// Phase 1: matrix 419 rows 90 cols
[2024-06-02 20:33:50] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:33:50] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-02 20:33:50] [INFO ] Flow matrix only has 419 transitions (discarded 28 similar events)
[2024-06-02 20:33:50] [INFO ] Invariant cache hit.
[2024-06-02 20:33:50] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-02 20:33:50] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Running 438 sub problems to find dead transitions.
[2024-06-02 20:33:50] [INFO ] Flow matrix only has 419 transitions (discarded 28 similar events)
[2024-06-02 20:33:50] [INFO ] Invariant cache hit.
[2024-06-02 20:33:50] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 20:33:53] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 2 ms to minimize.
[2024-06-02 20:33:54] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 2 ms to minimize.
[2024-06-02 20:33:54] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 2 ms to minimize.
[2024-06-02 20:33:54] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 2 ms to minimize.
[2024-06-02 20:33:54] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 2 ms to minimize.
[2024-06-02 20:33:55] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 1 ms to minimize.
[2024-06-02 20:33:55] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 2 ms to minimize.
[2024-06-02 20:33:55] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 2 ms to minimize.
[2024-06-02 20:33:55] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 2 ms to minimize.
[2024-06-02 20:33:55] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 1 ms to minimize.
[2024-06-02 20:33:56] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2024-06-02 20:33:56] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 2 ms to minimize.
[2024-06-02 20:33:56] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 2 ms to minimize.
[2024-06-02 20:33:56] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2024-06-02 20:33:56] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2024-06-02 20:33:57] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 2 ms to minimize.
[2024-06-02 20:33:57] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 20:33:59] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (OVERLAPS) 418/508 variables, 90/115 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 80/195 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 7 (OVERLAPS) 1/509 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 509/509 variables, and 196 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 90/90 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
At refinement iteration 3 (OVERLAPS) 418/508 variables, 90/115 constraints. Problems are: Problem set: 42 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 80/195 constraints. Problems are: Problem set: 42 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 396/591 constraints. Problems are: Problem set: 42 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/591 constraints. Problems are: Problem set: 42 solved, 396 unsolved
SMT process timed out in 60647ms, After SMT, problems are : Problem set: 42 solved, 396 unsolved
Search for dead transitions found 42 dead transitions in 60655ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 90/197 places, 405/471 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 88 transition count 427
Applied a total of 4 rules in 8 ms. Remains 88 /90 variables (removed 2) and now considering 427/405 (removed -22) transitions.
[2024-06-02 20:34:51] [INFO ] Flow matrix only has 399 transitions (discarded 28 similar events)
// Phase 1: matrix 399 rows 88 cols
[2024-06-02 20:34:51] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:34:51] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 20:34:51] [INFO ] Flow matrix only has 399 transitions (discarded 28 similar events)
[2024-06-02 20:34:51] [INFO ] Invariant cache hit.
[2024-06-02 20:34:51] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-02 20:34:52] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 88/197 places, 427/471 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 62076 ms. Remains : 88/197 places, 427/471 transitions.
Running random walk in product with property : MedleyA-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 16270 reset in 267 ms.
Product exploration explored 100000 steps with 16195 reset in 282 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 204 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (6719 resets) in 1117 ms. (35 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1170 resets) in 145 ms. (273 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1165 resets) in 241 ms. (165 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1160 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1172 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1162 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 332665 steps, run visited all 5 properties in 1909 ms. (steps per millisecond=174 )
Probabilistic random walk after 332665 steps, saw 73566 distinct states, run finished after 1910 ms. (steps per millisecond=174 ) properties seen :5
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0))), (F p2)]
Knowledge based reduction with 11 factoid took 355 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 427/427 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 88 transition count 388
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 45 place count 85 transition count 385
Applied a total of 45 rules in 20 ms. Remains 85 /88 variables (removed 3) and now considering 385/427 (removed 42) transitions.
[2024-06-02 20:34:56] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
// Phase 1: matrix 357 rows 85 cols
[2024-06-02 20:34:56] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:34:56] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-02 20:34:56] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
[2024-06-02 20:34:56] [INFO ] Invariant cache hit.
[2024-06-02 20:34:56] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:34:57] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-06-02 20:34:57] [INFO ] Redundant transitions in 5 ms returned []
Running 376 sub problems to find dead transitions.
[2024-06-02 20:34:57] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
[2024-06-02 20:34:57] [INFO ] Invariant cache hit.
[2024-06-02 20:34:57] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 20:34:59] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 1 ms to minimize.
[2024-06-02 20:34:59] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:34:59] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 2 ms to minimize.
[2024-06-02 20:34:59] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 2 ms to minimize.
[2024-06-02 20:34:59] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:34:59] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-06-02 20:34:59] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:35:00] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:35:00] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:35:00] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:35:00] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-06-02 20:35:00] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:35:00] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:35:00] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:35:00] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:35:01] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 20:35:02] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 2 ms to minimize.
[2024-06-02 20:35:02] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 356/441 variables, 85/110 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 78/188 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 7 (OVERLAPS) 1/442 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/442 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 376 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 189 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 20:35:28] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 2 ms to minimize.
[2024-06-02 20:35:28] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 2 ms to minimize.
[2024-06-02 20:35:29] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 2 ms to minimize.
[2024-06-02 20:35:29] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 2 ms to minimize.
[2024-06-02 20:35:29] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 356/441 variables, 85/115 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 78/193 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 376/569 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/442 variables, and 569 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 23/23 constraints]
After SMT, in 60448ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60454ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/88 places, 385/427 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60951 ms. Remains : 85/88 places, 385/427 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 204 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (7443 resets) in 1047 ms. (38 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1398 resets) in 338 ms. (118 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1389 resets) in 305 ms. (130 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1401 resets) in 230 ms. (173 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1387 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1390 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 383345 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :4 out of 5
Probabilistic random walk after 383345 steps, saw 86603 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :4
[2024-06-02 20:36:01] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
[2024-06-02 20:36:01] [INFO ] Invariant cache hit.
[2024-06-02 20:36:01] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 316/363 variables, 47/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/441 variables, 38/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 70/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/442 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/442 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 316/363 variables, 47/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/441 variables, 38/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 70/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:36:02] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:36:02] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/442 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/442 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 985ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 385/385 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 85 transition count 382
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 84 transition count 381
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 83 transition count 386
Free-agglomeration rule applied 31 times.
Iterating global reduction 1 with 31 rules applied. Total rules applied 38 place count 83 transition count 355
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 125 place count 52 transition count 299
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 50 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 156 place count 50 transition count 302
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 50 transition count 330
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 160 place count 48 transition count 330
Applied a total of 160 rules in 49 ms. Remains 48 /85 variables (removed 37) and now considering 330/385 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 48/85 places, 330/385 transitions.
RANDOM walk for 40000 steps (1136 resets) in 298 ms. (133 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31754 steps (232 resets) in 89 ms. (352 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0))), (F p2)]
Knowledge based reduction with 11 factoid took 489 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 18248 reset in 275 ms.
Product exploration explored 100000 steps with 18193 reset in 289 ms.
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 385/385 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 385/385 (removed 0) transitions.
[2024-06-02 20:36:04] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
[2024-06-02 20:36:04] [INFO ] Invariant cache hit.
[2024-06-02 20:36:04] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-02 20:36:04] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
[2024-06-02 20:36:04] [INFO ] Invariant cache hit.
[2024-06-02 20:36:05] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 20:36:05] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-06-02 20:36:05] [INFO ] Redundant transitions in 5 ms returned []
Running 376 sub problems to find dead transitions.
[2024-06-02 20:36:05] [INFO ] Flow matrix only has 357 transitions (discarded 28 similar events)
[2024-06-02 20:36:05] [INFO ] Invariant cache hit.
[2024-06-02 20:36:05] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 20:36:07] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 2 ms to minimize.
[2024-06-02 20:36:07] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 1 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 2 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 2 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-02 20:36:08] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-06-02 20:36:09] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:36:09] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:36:09] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 2 ms to minimize.
[2024-06-02 20:36:09] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:36:09] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2024-06-02 20:36:09] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-06-02 20:36:09] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-06-02 20:36:10] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 20:36:11] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 2 ms to minimize.
[2024-06-02 20:36:12] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 356/441 variables, 85/110 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 78/188 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 7 (OVERLAPS) 1/442 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 9 (OVERLAPS) 0/442 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 376 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 189 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-02 20:36:36] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:36:36] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 2 ms to minimize.
[2024-06-02 20:36:37] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2024-06-02 20:36:37] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 1 ms to minimize.
[2024-06-02 20:36:37] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 356/441 variables, 85/115 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 78/193 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 376/569 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/442 variables, and 569 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 23/23 constraints]
After SMT, in 60557ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60563ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61199 ms. Remains : 85/85 places, 385/385 transitions.
Treatment of property MedleyA-PT-17-LTLFireability-10 finished in 196390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(F(p1)&&X(X(G(p0)))))))'
Found a Lengthening insensitive property : MedleyA-PT-17-LTLFireability-13
Stuttering acceptance computed with spot in 290 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 198 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 190 transition count 438
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 164 transition count 438
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 53 place count 164 transition count 423
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 83 place count 149 transition count 423
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 142 transition count 410
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 142 transition count 410
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 141 transition count 394
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 141 transition count 394
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 145 place count 118 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 118 transition count 370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 117 transition count 358
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 117 transition count 358
Performed 23 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 194 place count 94 transition count 451
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 196 place count 94 transition count 449
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 93 transition count 441
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 93 transition count 441
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 202 place count 93 transition count 437
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 92 transition count 452
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 91 transition count 451
Applied a total of 205 rules in 35 ms. Remains 91 /197 variables (removed 106) and now considering 451/471 (removed 20) transitions.
[2024-06-02 20:37:06] [INFO ] Flow matrix only has 423 transitions (discarded 28 similar events)
// Phase 1: matrix 423 rows 91 cols
[2024-06-02 20:37:06] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:37:06] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 20:37:06] [INFO ] Flow matrix only has 423 transitions (discarded 28 similar events)
[2024-06-02 20:37:06] [INFO ] Invariant cache hit.
[2024-06-02 20:37:06] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-02 20:37:06] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2024-06-02 20:37:06] [INFO ] Flow matrix only has 423 transitions (discarded 28 similar events)
[2024-06-02 20:37:06] [INFO ] Invariant cache hit.
[2024-06-02 20:37:06] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-06-02 20:37:09] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 2 ms to minimize.
[2024-06-02 20:37:09] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 2 ms to minimize.
[2024-06-02 20:37:09] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2024-06-02 20:37:09] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-06-02 20:37:09] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-02 20:37:09] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2024-06-02 20:37:09] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2024-06-02 20:37:10] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 2 ms to minimize.
[2024-06-02 20:37:10] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 2 ms to minimize.
[2024-06-02 20:37:10] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 2 ms to minimize.
[2024-06-02 20:37:10] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 2 ms to minimize.
[2024-06-02 20:37:10] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:37:11] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:37:11] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-06-02 20:37:13] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 2 ms to minimize.
[2024-06-02 20:37:13] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 1 ms to minimize.
[2024-06-02 20:37:13] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 422/513 variables, 91/115 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 80/195 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 7 (OVERLAPS) 1/514 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/514 variables, and 196 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
At refinement iteration 3 (OVERLAPS) 422/513 variables, 91/115 constraints. Problems are: Problem set: 42 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 80/195 constraints. Problems are: Problem set: 42 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 400/595 constraints. Problems are: Problem set: 42 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/514 variables, and 595 constraints, problems are : Problem set: 42 solved, 400 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 80/81 constraints, PredecessorRefiner: 400/442 constraints, Known Traps: 17/17 constraints]
After SMT, in 60540ms problems are : Problem set: 42 solved, 400 unsolved
Search for dead transitions found 42 dead transitions in 60545ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 91/197 places, 409/471 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 429
Applied a total of 4 rules in 10 ms. Remains 89 /91 variables (removed 2) and now considering 429/409 (removed -20) transitions.
[2024-06-02 20:38:07] [INFO ] Flow matrix only has 401 transitions (discarded 28 similar events)
// Phase 1: matrix 401 rows 89 cols
[2024-06-02 20:38:07] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 20:38:07] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-06-02 20:38:07] [INFO ] Flow matrix only has 401 transitions (discarded 28 similar events)
[2024-06-02 20:38:07] [INFO ] Invariant cache hit.
[2024-06-02 20:38:08] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-02 20:38:08] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 89/197 places, 429/471 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 61784 ms. Remains : 89/197 places, 429/471 transitions.
Running random walk in product with property : MedleyA-PT-17-LTLFireability-13
Product exploration explored 100000 steps with 16081 reset in 263 ms.
Product exploration explored 100000 steps with 16193 reset in 277 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (6733 resets) in 365 ms. (109 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1175 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1164 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1170 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 32776 steps, run visited all 3 properties in 344 ms. (steps per millisecond=95 )
Probabilistic random walk after 32776 steps, saw 9454 distinct states, run finished after 345 ms. (steps per millisecond=95 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 429/429 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-02 20:38:10] [INFO ] Flow matrix only has 401 transitions (discarded 28 similar events)
[2024-06-02 20:38:10] [INFO ] Invariant cache hit.
[2024-06-02 20:38:10] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-02 20:38:10] [INFO ] Flow matrix only has 401 transitions (discarded 28 similar events)
[2024-06-02 20:38:10] [INFO ] Invariant cache hit.
[2024-06-02 20:38:10] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-02 20:38:11] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-06-02 20:38:11] [INFO ] Flow matrix only has 401 transitions (discarded 28 similar events)
[2024-06-02 20:38:11] [INFO ] Invariant cache hit.
[2024-06-02 20:38:11] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-02 20:38:13] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:38:13] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:38:14] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:38:14] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 2 ms to minimize.
[2024-06-02 20:38:14] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 1 ms to minimize.
[2024-06-02 20:38:14] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2024-06-02 20:38:14] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-06-02 20:38:14] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2024-06-02 20:38:15] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2024-06-02 20:38:15] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:38:15] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:38:15] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-06-02 20:38:15] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-06-02 20:38:15] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:38:15] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:38:15] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2024-06-02 20:38:16] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2024-06-02 20:38:16] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 2 ms to minimize.
[2024-06-02 20:38:16] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-02 20:38:18] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 2 ms to minimize.
[2024-06-02 20:38:18] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 2 ms to minimize.
[2024-06-02 20:38:19] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-06-02 20:38:19] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:38:19] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-02 20:38:21] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-02 20:38:25] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (OVERLAPS) 400/489 variables, 89/122 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 80/202 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 9 (OVERLAPS) 1/490 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 203 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 400/489 variables, 89/122 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 80/202 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 419/621 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 419 unsolved
SMT process timed out in 60701ms, After SMT, problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60707ms
Finished structural reductions in LTL mode , in 1 iterations and 61405 ms. Remains : 89/89 places, 429/429 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (6677 resets) in 497 ms. (80 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1160 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1188 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1153 resets) in 224 ms. (177 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 32776 steps, run visited all 3 properties in 319 ms. (steps per millisecond=102 )
Probabilistic random walk after 32776 steps, saw 9454 distinct states, run finished after 319 ms. (steps per millisecond=102 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 16196 reset in 230 ms.
Product exploration explored 100000 steps with 16171 reset in 251 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 429/429 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 89 transition count 395
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 37 place count 89 transition count 395
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 37 rules in 16 ms. Remains 89 /89 variables (removed 0) and now considering 395/429 (removed 34) transitions.
[2024-06-02 20:39:14] [INFO ] Redundant transitions in 5 ms returned []
Running 386 sub problems to find dead transitions.
[2024-06-02 20:39:14] [INFO ] Flow matrix only has 367 transitions (discarded 28 similar events)
// Phase 1: matrix 367 rows 89 cols
[2024-06-02 20:39:14] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:39:14] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 3 ms to minimize.
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2024-06-02 20:39:17] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 2 ms to minimize.
[2024-06-02 20:39:18] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-02 20:39:18] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2024-06-02 20:39:18] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2024-06-02 20:39:18] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:39:18] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 1 ms to minimize.
[2024-06-02 20:39:18] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:39:18] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-02 20:39:18] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 1 ms to minimize.
[2024-06-02 20:39:19] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:39:19] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:39:19] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-06-02 20:39:19] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2024-06-02 20:39:19] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-02 20:39:19] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 20/27 constraints. Problems are: Problem set: 3 solved, 383 unsolved
[2024-06-02 20:39:20] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-06-02 20:39:20] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:39:20] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-06-02 20:39:20] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:39:20] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2024-06-02 20:39:20] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 6/33 constraints. Problems are: Problem set: 3 solved, 383 unsolved
[2024-06-02 20:39:22] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 2 ms to minimize.
[2024-06-02 20:39:22] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 1 ms to minimize.
[2024-06-02 20:39:23] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2024-06-02 20:39:23] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 4/37 constraints. Problems are: Problem set: 3 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/37 constraints. Problems are: Problem set: 3 solved, 383 unsolved
At refinement iteration 5 (OVERLAPS) 366/455 variables, 89/126 constraints. Problems are: Problem set: 3 solved, 383 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 78/204 constraints. Problems are: Problem set: 3 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 383 unsolved
At refinement iteration 8 (OVERLAPS) 1/456 variables, 1/205 constraints. Problems are: Problem set: 3 solved, 383 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/205 constraints. Problems are: Problem set: 3 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/456 variables, and 205 constraints, problems are : Problem set: 3 solved, 383 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 3 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 30/34 constraints. Problems are: Problem set: 3 solved, 383 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 383 unsolved
At refinement iteration 3 (OVERLAPS) 3/89 variables, 3/37 constraints. Problems are: Problem set: 3 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/37 constraints. Problems are: Problem set: 3 solved, 383 unsolved
At refinement iteration 5 (OVERLAPS) 366/455 variables, 89/126 constraints. Problems are: Problem set: 3 solved, 383 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 78/204 constraints. Problems are: Problem set: 3 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 383/587 constraints. Problems are: Problem set: 3 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/456 variables, and 587 constraints, problems are : Problem set: 3 solved, 383 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 383/386 constraints, Known Traps: 30/30 constraints]
After SMT, in 60634ms problems are : Problem set: 3 solved, 383 unsolved
Search for dead transitions found 3 dead transitions in 60640ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 89/89 places, 392/429 transitions.
Graph (complete) has 732 edges and 89 vertex of which 86 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 86 /89 variables (removed 3) and now considering 392/392 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/89 places, 392/429 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60681 ms. Remains : 86/89 places, 392/429 transitions.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 429/429 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-02 20:40:15] [INFO ] Flow matrix only has 401 transitions (discarded 28 similar events)
// Phase 1: matrix 401 rows 89 cols
[2024-06-02 20:40:15] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:40:15] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-06-02 20:40:15] [INFO ] Flow matrix only has 401 transitions (discarded 28 similar events)
[2024-06-02 20:40:15] [INFO ] Invariant cache hit.
[2024-06-02 20:40:16] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-02 20:40:16] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-06-02 20:40:16] [INFO ] Flow matrix only has 401 transitions (discarded 28 similar events)
[2024-06-02 20:40:16] [INFO ] Invariant cache hit.
[2024-06-02 20:40:16] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-02 20:40:18] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-06-02 20:40:18] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2024-06-02 20:40:18] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 2 ms to minimize.
[2024-06-02 20:40:19] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 2 ms to minimize.
[2024-06-02 20:40:19] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 2 ms to minimize.
[2024-06-02 20:40:19] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2024-06-02 20:40:19] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:40:19] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 2 ms to minimize.
[2024-06-02 20:40:20] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 2 ms to minimize.
[2024-06-02 20:40:20] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2024-06-02 20:40:20] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2024-06-02 20:40:20] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-06-02 20:40:20] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:40:20] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2024-06-02 20:40:20] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:40:21] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 1 ms to minimize.
[2024-06-02 20:40:21] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-06-02 20:40:21] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 1 ms to minimize.
[2024-06-02 20:40:21] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-02 20:40:23] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 2 ms to minimize.
[2024-06-02 20:40:23] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2024-06-02 20:40:24] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2024-06-02 20:40:24] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2024-06-02 20:40:24] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-02 20:40:26] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-06-02 20:40:30] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (OVERLAPS) 400/489 variables, 89/122 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 80/202 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 419 unsolved
SMT process timed out in 30549ms, After SMT, problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 30555ms
Finished structural reductions in LTL mode , in 1 iterations and 31540 ms. Remains : 89/89 places, 429/429 transitions.
Treatment of property MedleyA-PT-17-LTLFireability-13 finished in 220926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p1)||G(!p2))))))'
[2024-06-02 20:40:47] [INFO ] Flatten gal took : 75 ms
[2024-06-02 20:40:47] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-02 20:40:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 197 places, 471 transitions and 2328 arcs took 11 ms.
Total runtime 1463453 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-17-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-17-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-17-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717360849811

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name MedleyA-PT-17-LTLFireability-10
ltl formula formula --ltl=/tmp/4743/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 197 places, 471 transitions and 2328 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.020 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4743/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4743/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4743/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4743/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 198 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 198, there are 516 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~29 levels ~10000 states ~43344 transitions
pnml2lts-mc( 0/ 4): ~86 levels ~20000 states ~79388 transitions
pnml2lts-mc( 0/ 4): ~86 levels ~40000 states ~165716 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~80!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 36388
pnml2lts-mc( 0/ 4): unique states count: 49128
pnml2lts-mc( 0/ 4): unique transitions count: 207007
pnml2lts-mc( 0/ 4): - self-loop count: 658
pnml2lts-mc( 0/ 4): - claim dead count: 147644
pnml2lts-mc( 0/ 4): - claim found count: 8604
pnml2lts-mc( 0/ 4): - claim success count: 49144
pnml2lts-mc( 0/ 4): - cum. max stack depth: 378
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 49144 states 207055 transitions, fanout: 4.213
pnml2lts-mc( 0/ 4): Total exploration time 1.100 sec (1.100 sec minimum, 1.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 44676, Transitions per second: 188232
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 8.9 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 478 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-17-LTLFireability-13
ltl formula formula --ltl=/tmp/4743/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 197 places, 471 transitions and 2328 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4743/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4743/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4743/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4743/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 199 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 198, there are 496 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~78!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4901
pnml2lts-mc( 0/ 4): unique states count: 6560
pnml2lts-mc( 0/ 4): unique transitions count: 24140
pnml2lts-mc( 0/ 4): - self-loop count: 96
pnml2lts-mc( 0/ 4): - claim dead count: 16158
pnml2lts-mc( 0/ 4): - claim found count: 734
pnml2lts-mc( 0/ 4): - claim success count: 6599
pnml2lts-mc( 0/ 4): - cum. max stack depth: 269
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6599 states 24319 transitions, fanout: 3.685
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 73322, Transitions per second: 270211
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 10.5 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 478 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-17-LTLFireability-14
ltl formula formula --ltl=/tmp/4743/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 197 places, 471 transitions and 2328 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4743/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4743/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4743/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4743/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 198 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 198, there are 485 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~29 levels ~10000 states ~43680 transitions
pnml2lts-mc( 2/ 4): ~99 levels ~20000 states ~82864 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~64!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17293
pnml2lts-mc( 0/ 4): unique states count: 20596
pnml2lts-mc( 0/ 4): unique transitions count: 81688
pnml2lts-mc( 0/ 4): - self-loop count: 272
pnml2lts-mc( 0/ 4): - claim dead count: 58003
pnml2lts-mc( 0/ 4): - claim found count: 2057
pnml2lts-mc( 0/ 4): - claim success count: 20617
pnml2lts-mc( 0/ 4): - cum. max stack depth: 355
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20617 states 81770 transitions, fanout: 3.966
pnml2lts-mc( 0/ 4): Total exploration time 0.320 sec (0.320 sec minimum, 0.320 sec on average)
pnml2lts-mc( 0/ 4): States per second: 64428, Transitions per second: 255531
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 9.3 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 478 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)

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="MedleyA-PT-17"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is MedleyA-PT-17, 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 r579-smll-171734921300132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-17.tgz
mv MedleyA-PT-17 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;