About the Execution of GreatSPN+red for MedleyA-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1083.403 | 889034.00 | 1030076.00 | 2574.60 | FTFFFFTFFFFFFFTF | normal |
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.r575-smll-171734919700140.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 greatspnxred
Input is MedleyA-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919700140
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 158K 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-18-LTLFireability-00
FORMULA_NAME MedleyA-PT-18-LTLFireability-01
FORMULA_NAME MedleyA-PT-18-LTLFireability-02
FORMULA_NAME MedleyA-PT-18-LTLFireability-03
FORMULA_NAME MedleyA-PT-18-LTLFireability-04
FORMULA_NAME MedleyA-PT-18-LTLFireability-05
FORMULA_NAME MedleyA-PT-18-LTLFireability-06
FORMULA_NAME MedleyA-PT-18-LTLFireability-07
FORMULA_NAME MedleyA-PT-18-LTLFireability-08
FORMULA_NAME MedleyA-PT-18-LTLFireability-09
FORMULA_NAME MedleyA-PT-18-LTLFireability-10
FORMULA_NAME MedleyA-PT-18-LTLFireability-11
FORMULA_NAME MedleyA-PT-18-LTLFireability-12
FORMULA_NAME MedleyA-PT-18-LTLFireability-13
FORMULA_NAME MedleyA-PT-18-LTLFireability-14
FORMULA_NAME MedleyA-PT-18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717369731230
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:08:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 23:08:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:08:54] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-06-02 23:08:54] [INFO ] Transformed 252 places.
[2024-06-02 23:08:54] [INFO ] Transformed 543 transitions.
[2024-06-02 23:08:54] [INFO ] Found NUPN structural information;
[2024-06-02 23:08:54] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-18-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 212 transition count 475
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 212 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 211 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 211 transition count 474
Applied a total of 82 rules in 200 ms. Remains 211 /252 variables (removed 41) and now considering 474/541 (removed 67) transitions.
// Phase 1: matrix 474 rows 211 cols
[2024-06-02 23:08:54] [INFO ] Computed 7 invariants in 44 ms
[2024-06-02 23:08:55] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-06-02 23:08:55] [INFO ] Invariant cache hit.
[2024-06-02 23:08:55] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-06-02 23:08:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:09:04] [INFO ] Deduced a trap composed of 17 places in 327 ms of which 38 ms to minimize.
[2024-06-02 23:09:04] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 4 ms to minimize.
[2024-06-02 23:09:05] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 4 ms to minimize.
[2024-06-02 23:09:05] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 3 ms to minimize.
[2024-06-02 23:09:05] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 4 ms to minimize.
[2024-06-02 23:09:05] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:09:06] [INFO ] Deduced a trap composed of 128 places in 232 ms of which 3 ms to minimize.
[2024-06-02 23:09:06] [INFO ] Deduced a trap composed of 136 places in 279 ms of which 5 ms to minimize.
[2024-06-02 23:09:06] [INFO ] Deduced a trap composed of 140 places in 274 ms of which 3 ms to minimize.
[2024-06-02 23:09:06] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:09:07] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:09:07] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 2 ms to minimize.
[2024-06-02 23:09:07] [INFO ] Deduced a trap composed of 96 places in 199 ms of which 3 ms to minimize.
[2024-06-02 23:09:07] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 4 ms to minimize.
[2024-06-02 23:09:08] [INFO ] Deduced a trap composed of 115 places in 157 ms of which 3 ms to minimize.
[2024-06-02 23:09:08] [INFO ] Deduced a trap composed of 109 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:09:09] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:09:09] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 2 ms to minimize.
[2024-06-02 23:09:09] [INFO ] Deduced a trap composed of 142 places in 148 ms of which 2 ms to minimize.
[2024-06-02 23:09:09] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:09:10] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:09:11] [INFO ] Deduced a trap composed of 141 places in 270 ms of which 4 ms to minimize.
[2024-06-02 23:09:12] [INFO ] Deduced a trap composed of 141 places in 274 ms of which 4 ms to minimize.
[2024-06-02 23:09:12] [INFO ] Deduced a trap composed of 27 places in 289 ms of which 3 ms to minimize.
[2024-06-02 23:09:12] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 4 ms to minimize.
[2024-06-02 23:09:13] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 3 ms to minimize.
[2024-06-02 23:09:13] [INFO ] Deduced a trap composed of 34 places in 247 ms of which 4 ms to minimize.
[2024-06-02 23:09:13] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 4 ms to minimize.
[2024-06-02 23:09:13] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 4 ms to minimize.
[2024-06-02 23:09:14] [INFO ] Deduced a trap composed of 39 places in 302 ms of which 3 ms to minimize.
[2024-06-02 23:09:14] [INFO ] Deduced a trap composed of 25 places in 302 ms of which 3 ms to minimize.
[2024-06-02 23:09:14] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 2 ms to minimize.
[2024-06-02 23:09:15] [INFO ] Deduced a trap composed of 42 places in 296 ms of which 4 ms to minimize.
[2024-06-02 23:09:15] [INFO ] Deduced a trap composed of 47 places in 286 ms of which 4 ms to minimize.
[2024-06-02 23:09:15] [INFO ] Deduced a trap composed of 35 places in 295 ms of which 4 ms to minimize.
[2024-06-02 23:09:16] [INFO ] Deduced a trap composed of 45 places in 300 ms of which 4 ms to minimize.
[2024-06-02 23:09:16] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 4 ms to minimize.
[2024-06-02 23:09:16] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 3 ms to minimize.
[2024-06-02 23:09:17] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 3 ms to minimize.
[2024-06-02 23:09:17] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:09:22] [INFO ] Deduced a trap composed of 26 places in 299 ms of which 3 ms to minimize.
[2024-06-02 23:09:23] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 3 ms to minimize.
[2024-06-02 23:09:23] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 4 ms to minimize.
[2024-06-02 23:09:23] [INFO ] Deduced a trap composed of 145 places in 255 ms of which 3 ms to minimize.
[2024-06-02 23:09:24] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 3 ms to minimize.
[2024-06-02 23:09:24] [INFO ] Deduced a trap composed of 38 places in 256 ms of which 4 ms to minimize.
[2024-06-02 23:09:25] [INFO ] Deduced a trap composed of 138 places in 298 ms of which 4 ms to minimize.
[2024-06-02 23:09:25] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 4 ms to minimize.
[2024-06-02 23:09:25] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 4 ms to minimize.
[2024-06-02 23:09:26] [INFO ] Deduced a trap composed of 140 places in 292 ms of which 3 ms to minimize.
(s90 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.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 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 211/685 variables, and 57 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/211 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:09:33] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 4 ms to minimize.
[2024-06-02 23:09:33] [INFO ] Deduced a trap composed of 34 places in 284 ms of which 4 ms to minimize.
[2024-06-02 23:09:33] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 4 ms to minimize.
[2024-06-02 23:09:34] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 3 ms to minimize.
[2024-06-02 23:09:34] [INFO ] Deduced a trap composed of 42 places in 278 ms of which 4 ms to minimize.
[2024-06-02 23:09:34] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 3 ms to minimize.
[2024-06-02 23:09:34] [INFO ] Deduced a trap composed of 30 places in 275 ms of which 3 ms to minimize.
[2024-06-02 23:09:35] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 3 ms to minimize.
[2024-06-02 23:09:35] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 4 ms to minimize.
[2024-06-02 23:09:36] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 4 ms to minimize.
[2024-06-02 23:09:36] [INFO ] Deduced a trap composed of 30 places in 287 ms of which 3 ms to minimize.
[2024-06-02 23:09:36] [INFO ] Deduced a trap composed of 26 places in 287 ms of which 3 ms to minimize.
[2024-06-02 23:09:37] [INFO ] Deduced a trap composed of 32 places in 309 ms of which 4 ms to minimize.
[2024-06-02 23:09:37] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 3 ms to minimize.
[2024-06-02 23:09:37] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 3 ms to minimize.
[2024-06-02 23:09:37] [INFO ] Deduced a trap composed of 42 places in 232 ms of which 3 ms to minimize.
[2024-06-02 23:09:39] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 3 ms to minimize.
[2024-06-02 23:09:39] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:09:43] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 3 ms to minimize.
[2024-06-02 23:09:43] [INFO ] Deduced a trap composed of 29 places in 291 ms of which 4 ms to minimize.
[2024-06-02 23:09:43] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 3 ms to minimize.
[2024-06-02 23:09:44] [INFO ] Deduced a trap composed of 29 places in 285 ms of which 4 ms to minimize.
[2024-06-02 23:09:44] [INFO ] Deduced a trap composed of 41 places in 268 ms of which 3 ms to minimize.
[2024-06-02 23:09:44] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 4 ms to minimize.
[2024-06-02 23:09:45] [INFO ] Deduced a trap composed of 102 places in 262 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:09:49] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 3 ms to minimize.
[2024-06-02 23:09:49] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 2 ms to minimize.
[2024-06-02 23:09:50] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 3 ms to minimize.
[2024-06-02 23:09:51] [INFO ] Deduced a trap composed of 26 places in 293 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 23:09:54] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 3 ms to minimize.
[2024-06-02 23:09:56] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 4 ms to minimize.
[2024-06-02 23:09:56] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 3 ms to minimize.
[2024-06-02 23:09:56] [INFO ] Deduced a trap composed of 149 places in 300 ms of which 3 ms to minimize.
[2024-06-02 23:09:57] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 3 ms to minimize.
SMT process timed out in 61246ms, After SMT, problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 61305ms
Starting structural reductions in LTL mode, iteration 1 : 211/252 places, 474/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62734 ms. Remains : 211/252 places, 474/541 transitions.
Support contains 54 out of 211 places after structural reductions.
[2024-06-02 23:09:57] [INFO ] Flatten gal took : 171 ms
[2024-06-02 23:09:57] [INFO ] Flatten gal took : 98 ms
[2024-06-02 23:09:58] [INFO ] Input system was already deterministic with 474 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (1533 resets) in 2251 ms. (17 steps per ms) remains 28/33 properties
BEST_FIRST walk for 4004 steps (33 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (36 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (33 resets) in 49 ms. (80 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (35 resets) in 53 ms. (74 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (32 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (31 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (32 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (32 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (33 resets) in 40 ms. (97 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (33 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (32 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (35 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (35 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (34 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (31 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (31 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (35 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (32 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (32 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (33 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (33 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (34 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
[2024-06-02 23:09:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 162/211 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-06-02 23:09:59] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 48 places in 242 ms of which 3 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 2 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:10:00] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 6/13 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 474/685 variables, 211/224 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/685 variables, 0/224 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 0/685 variables, 0/224 constraints. Problems are: Problem set: 2 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 685/685 variables, and 224 constraints, problems are : Problem set: 2 solved, 26 unsolved in 2203 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 2 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 165/211 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 6/13 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-06-02 23:10:01] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 2 ms to minimize.
[2024-06-02 23:10:01] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:10:02] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 2 ms to minimize.
[2024-06-02 23:10:02] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:10:02] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-06-02 23:10:02] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 6/19 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-06-02 23:10:03] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 1/20 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 26 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 6 (OVERLAPS) 474/685 variables, 211/231 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/685 variables, 23/254 constraints. Problems are: Problem set: 5 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 685/685 variables, and 254 constraints, problems are : Problem set: 5 solved, 23 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 23/28 constraints, Known Traps: 13/13 constraints]
After SMT, in 7295ms problems are : Problem set: 5 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 474/474 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 211 transition count 439
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 74 place count 176 transition count 435
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 79 place count 174 transition count 432
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 82 place count 171 transition count 432
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 82 place count 171 transition count 425
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 96 place count 164 transition count 425
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 103 place count 157 transition count 414
Iterating global reduction 4 with 7 rules applied. Total rules applied 110 place count 157 transition count 414
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 110 place count 157 transition count 413
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 156 transition count 413
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 4 with 46 rules applied. Total rules applied 158 place count 133 transition count 390
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 161 place count 130 transition count 384
Iterating global reduction 4 with 3 rules applied. Total rules applied 164 place count 130 transition count 384
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 129 transition count 382
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 129 transition count 382
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
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 170 place count 127 transition count 386
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 182 place count 127 transition count 374
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 186 place count 123 transition count 370
Iterating global reduction 4 with 4 rules applied. Total rules applied 190 place count 123 transition count 370
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 4 with 4 rules applied. Total rules applied 194 place count 121 transition count 368
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 195 place count 120 transition count 364
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 120 transition count 364
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 202 place count 117 transition count 403
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 216 place count 117 transition count 389
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 230 place count 103 transition count 389
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 103 transition count 391
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 232 place count 102 transition count 391
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 102 transition count 391
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 235 place count 101 transition count 389
Iterating global reduction 6 with 1 rules applied. Total rules applied 236 place count 101 transition count 389
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 237 place count 100 transition count 387
Iterating global reduction 6 with 1 rules applied. Total rules applied 238 place count 100 transition count 387
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 239 place count 99 transition count 386
Applied a total of 239 rules in 327 ms. Remains 99 /211 variables (removed 112) and now considering 386/474 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 99/211 places, 386/474 transitions.
RANDOM walk for 40000 steps (3300 resets) in 970 ms. (41 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (68 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (68 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (67 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (67 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (62 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (68 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (62 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (68 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (67 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (64 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (72 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (67 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (68 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (66 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (61 resets) in 13 ms. (285 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (60 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (67 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (65 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (65 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (67 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (70 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (64 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (67 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 521744 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :15 out of 22
Probabilistic random walk after 521744 steps, saw 83582 distinct states, run finished after 3016 ms. (steps per millisecond=172 ) properties seen :15
[2024-06-02 23:10:10] [INFO ] Flow matrix only has 368 transitions (discarded 18 similar events)
// Phase 1: matrix 368 rows 99 cols
[2024-06-02 23:10:10] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:10:10] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 79/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 23:10:10] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 368/467 variables, 99/107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 14/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/467 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 121 constraints, problems are : Problem set: 0 solved, 7 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 79/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 23:10:11] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 368/467 variables, 99/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 14/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 7/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 23:10:13] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:10:13] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2024-06-02 23:10:14] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/467 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 132 constraints, problems are : Problem set: 0 solved, 7 unsolved in 8240 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 8833ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 37330 ms.
Support contains 20 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 386/386 transitions.
Graph (trivial) has 56 edges and 99 vertex of which 4 / 99 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 97 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 95 transition count 380
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 5 place count 95 transition count 375
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 15 place count 90 transition count 375
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 86 transition count 367
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 86 transition count 367
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 27 place count 84 transition count 365
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 37 place count 79 transition count 382
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 65 place count 79 transition count 354
Free-agglomeration rule applied 12 times with reduction of 6 identical transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 77 place count 79 transition count 336
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 111 place count 67 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 66 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 66 transition count 313
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 66 transition count 329
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 127 place count 64 transition count 326
Applied a total of 127 rules in 94 ms. Remains 64 /99 variables (removed 35) and now considering 326/386 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 64/99 places, 326/386 transitions.
RANDOM walk for 40000 steps (4475 resets) in 732 ms. (54 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1424 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1174 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1481 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1227 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1214 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1177 resets) in 41 ms. (952 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (35 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 497222 steps, run visited all 7 properties in 1351 ms. (steps per millisecond=368 )
Probabilistic random walk after 497222 steps, saw 100239 distinct states, run finished after 1355 ms. (steps per millisecond=366 ) properties seen :7
FORMULA MedleyA-PT-18-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA MedleyA-PT-18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 16 stable transitions
FORMULA MedleyA-PT-18-LTLFireability-11 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(((G(p0) U (p0&&G(p1)))||(F(p3)&&p2))))'
Support contains 7 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Graph (trivial) has 207 edges and 211 vertex of which 13 / 211 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 200 transition count 421
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 158 transition count 417
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 156 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 155 transition count 416
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 93 place count 155 transition count 405
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 115 place count 144 transition count 405
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 126 place count 133 transition count 386
Iterating global reduction 4 with 11 rules applied. Total rules applied 137 place count 133 transition count 386
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 191 place count 106 transition count 359
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 197 place count 106 transition count 353
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 203 place count 100 transition count 317
Iterating global reduction 5 with 6 rules applied. Total rules applied 209 place count 100 transition count 317
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 213 place count 96 transition count 305
Iterating global reduction 5 with 4 rules applied. Total rules applied 217 place count 96 transition count 305
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 245 place count 82 transition count 369
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 249 place count 82 transition count 365
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 6 with 4 rules applied. Total rules applied 253 place count 80 transition count 395
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 265 place count 80 transition count 383
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 6 with 4 rules applied. Total rules applied 269 place count 78 transition count 381
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 270 place count 77 transition count 380
Applied a total of 270 rules in 147 ms. Remains 77 /211 variables (removed 134) and now considering 380/474 (removed 94) transitions.
[2024-06-02 23:10:59] [INFO ] Flow matrix only has 356 transitions (discarded 24 similar events)
// Phase 1: matrix 356 rows 77 cols
[2024-06-02 23:10:59] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:10:59] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-02 23:10:59] [INFO ] Flow matrix only has 356 transitions (discarded 24 similar events)
[2024-06-02 23:10:59] [INFO ] Invariant cache hit.
[2024-06-02 23:10:59] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-06-02 23:10:59] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-06-02 23:10:59] [INFO ] Redundant transitions in 42 ms returned []
Running 375 sub problems to find dead transitions.
[2024-06-02 23:10:59] [INFO ] Flow matrix only has 356 transitions (discarded 24 similar events)
[2024-06-02 23:10:59] [INFO ] Invariant cache hit.
[2024-06-02 23:10:59] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 23:11:02] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2024-06-02 23:11:02] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:11:02] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:11:02] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (OVERLAPS) 3/77 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 23:11:06] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:11:06] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:11:06] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:11:06] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2024-06-02 23:11:06] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2024-06-02 23:11:07] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 2 ms to minimize.
[2024-06-02 23:11:07] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2024-06-02 23:11:07] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 1 ms to minimize.
[2024-06-02 23:11:07] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:11:07] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2024-06-02 23:11:07] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:11:08] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 2 ms to minimize.
[2024-06-02 23:11:08] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 2 ms to minimize.
[2024-06-02 23:11:08] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2024-06-02 23:11:08] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-06-02 23:11:08] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 2 ms to minimize.
[2024-06-02 23:11:08] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 3 ms to minimize.
[2024-06-02 23:11:09] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 2 ms to minimize.
[2024-06-02 23:11:09] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 2 ms to minimize.
[2024-06-02 23:11:09] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 23:11:09] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2024-06-02 23:11:10] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (OVERLAPS) 355/432 variables, 77/110 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 79/189 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 10 (OVERLAPS) 1/433 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/433 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/433 variables, and 190 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (OVERLAPS) 3/77 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 23:11:33] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 7 (OVERLAPS) 355/432 variables, 77/111 constraints. Problems are: Problem set: 42 solved, 333 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 79/190 constraints. Problems are: Problem set: 42 solved, 333 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 333/523 constraints. Problems are: Problem set: 42 solved, 333 unsolved
[2024-06-02 23:11:45] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 1/524 constraints. Problems are: Problem set: 42 solved, 333 unsolved
[2024-06-02 23:11:52] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/433 variables, and 525 constraints, problems are : Problem set: 42 solved, 333 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 79/80 constraints, PredecessorRefiner: 333/375 constraints, Known Traps: 29/29 constraints]
After SMT, in 60827ms problems are : Problem set: 42 solved, 333 unsolved
Search for dead transitions found 42 dead transitions in 60837ms
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 : 77/211 places, 338/474 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 76 transition count 348
Applied a total of 2 rules in 20 ms. Remains 76 /77 variables (removed 1) and now considering 348/338 (removed -10) transitions.
[2024-06-02 23:12:00] [INFO ] Flow matrix only has 324 transitions (discarded 24 similar events)
// Phase 1: matrix 324 rows 76 cols
[2024-06-02 23:12:00] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:12:00] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 23:12:00] [INFO ] Flow matrix only has 324 transitions (discarded 24 similar events)
[2024-06-02 23:12:00] [INFO ] Invariant cache hit.
[2024-06-02 23:12:01] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-06-02 23:12:01] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/211 places, 348/474 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62105 ms. Remains : 76/211 places, 348/474 transitions.
Stuttering acceptance computed with spot in 361 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-02
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 10 ms.
FORMULA MedleyA-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-02 finished in 62591 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)))'
Support contains 9 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 201 transition count 458
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 201 transition count 458
Applied a total of 20 rules in 7 ms. Remains 201 /211 variables (removed 10) and now considering 458/474 (removed 16) transitions.
// Phase 1: matrix 458 rows 201 cols
[2024-06-02 23:12:01] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:12:01] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 23:12:01] [INFO ] Invariant cache hit.
[2024-06-02 23:12:02] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-02 23:12:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:12:09] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 3 ms to minimize.
[2024-06-02 23:12:09] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 3 ms to minimize.
[2024-06-02 23:12:09] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:12:09] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 3 ms to minimize.
[2024-06-02 23:12:09] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 3 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 3 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 3 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 3 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 3 ms to minimize.
[2024-06-02 23:12:11] [INFO ] Deduced a trap composed of 40 places in 262 ms of which 3 ms to minimize.
[2024-06-02 23:12:11] [INFO ] Deduced a trap composed of 125 places in 186 ms of which 3 ms to minimize.
[2024-06-02 23:12:11] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 4 ms to minimize.
[2024-06-02 23:12:11] [INFO ] Deduced a trap composed of 125 places in 192 ms of which 3 ms to minimize.
[2024-06-02 23:12:12] [INFO ] Deduced a trap composed of 125 places in 225 ms of which 3 ms to minimize.
[2024-06-02 23:12:12] [INFO ] Deduced a trap composed of 125 places in 309 ms of which 3 ms to minimize.
[2024-06-02 23:12:12] [INFO ] Deduced a trap composed of 36 places in 286 ms of which 3 ms to minimize.
[2024-06-02 23:12:13] [INFO ] Deduced a trap composed of 36 places in 267 ms of which 4 ms to minimize.
[2024-06-02 23:12:13] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 3 ms to minimize.
[2024-06-02 23:12:14] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 3 ms to minimize.
[2024-06-02 23:12:15] [INFO ] Deduced a trap composed of 28 places in 308 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:12:15] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:12:15] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:12:15] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2024-06-02 23:12:17] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 3 ms to minimize.
[2024-06-02 23:12:17] [INFO ] Deduced a trap composed of 22 places in 298 ms of which 3 ms to minimize.
[2024-06-02 23:12:18] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 4 ms to minimize.
[2024-06-02 23:12:18] [INFO ] Deduced a trap composed of 22 places in 281 ms of which 4 ms to minimize.
[2024-06-02 23:12:18] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 3 ms to minimize.
[2024-06-02 23:12:19] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 4 ms to minimize.
[2024-06-02 23:12:19] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 3 ms to minimize.
[2024-06-02 23:12:19] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 4 ms to minimize.
[2024-06-02 23:12:19] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 4 ms to minimize.
[2024-06-02 23:12:20] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 3 ms to minimize.
[2024-06-02 23:12:20] [INFO ] Deduced a trap composed of 38 places in 292 ms of which 4 ms to minimize.
[2024-06-02 23:12:20] [INFO ] Deduced a trap composed of 38 places in 292 ms of which 4 ms to minimize.
[2024-06-02 23:12:21] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 3 ms to minimize.
[2024-06-02 23:12:21] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 3 ms to minimize.
[2024-06-02 23:12:21] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 4 ms to minimize.
[2024-06-02 23:12:22] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 3 ms to minimize.
[2024-06-02 23:12:22] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:12:26] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 4 ms to minimize.
[2024-06-02 23:12:26] [INFO ] Deduced a trap composed of 31 places in 282 ms of which 4 ms to minimize.
[2024-06-02 23:12:26] [INFO ] Deduced a trap composed of 29 places in 277 ms of which 3 ms to minimize.
[2024-06-02 23:12:26] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 3 ms to minimize.
[2024-06-02 23:12:27] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 3 ms to minimize.
[2024-06-02 23:12:27] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 4 ms to minimize.
[2024-06-02 23:12:27] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 4 ms to minimize.
[2024-06-02 23:12:28] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 4 ms to minimize.
[2024-06-02 23:12:28] [INFO ] Deduced a trap composed of 30 places in 270 ms of which 3 ms to minimize.
[2024-06-02 23:12:28] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 3 ms to minimize.
[2024-06-02 23:12:28] [INFO ] Deduced a trap composed of 30 places in 286 ms of which 3 ms to minimize.
[2024-06-02 23:12:29] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 3 ms to minimize.
[2024-06-02 23:12:30] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 3 ms to minimize.
[2024-06-02 23:12:30] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 4 ms to minimize.
[2024-06-02 23:12:30] [INFO ] Deduced a trap composed of 29 places in 300 ms of which 4 ms to minimize.
[2024-06-02 23:12:31] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 3 ms to minimize.
[2024-06-02 23:12:32] [INFO ] Deduced a trap composed of 41 places in 294 ms of which 4 ms to minimize.
[2024-06-02 23:12:32] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 3 ms to minimize.
[2024-06-02 23:12:32] [INFO ] Deduced a trap composed of 41 places in 286 ms of which 4 ms to minimize.
SMT process timed out in 30470ms, After SMT, problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 30477ms
Starting structural reductions in LTL mode, iteration 1 : 201/211 places, 458/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31119 ms. Remains : 201/211 places, 458/474 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-04
Entered a terminal (fully accepting) state of product in 67051 steps with 2574 reset in 611 ms.
FORMULA MedleyA-PT-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-04 finished in 31872 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) U (G(p1)&&X(p2))) U (G((X(p0) U (G(p1)&&X(p2))))||(p2&&(X(p0) U (G(p1)&&X(p2)))))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 202 transition count 459
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 202 transition count 459
Applied a total of 18 rules in 8 ms. Remains 202 /211 variables (removed 9) and now considering 459/474 (removed 15) transitions.
// Phase 1: matrix 459 rows 202 cols
[2024-06-02 23:12:33] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:12:33] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-06-02 23:12:33] [INFO ] Invariant cache hit.
[2024-06-02 23:12:34] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2024-06-02 23:12:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 23:12:41] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 3 ms to minimize.
[2024-06-02 23:12:41] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 2 ms to minimize.
[2024-06-02 23:12:41] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 2 ms to minimize.
[2024-06-02 23:12:42] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 2 ms to minimize.
[2024-06-02 23:12:42] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 2 ms to minimize.
[2024-06-02 23:12:42] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 3 ms to minimize.
[2024-06-02 23:12:42] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 3 ms to minimize.
[2024-06-02 23:12:43] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 3 ms to minimize.
[2024-06-02 23:12:43] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 2 ms to minimize.
[2024-06-02 23:12:43] [INFO ] Deduced a trap composed of 125 places in 262 ms of which 4 ms to minimize.
[2024-06-02 23:12:43] [INFO ] Deduced a trap composed of 20 places in 292 ms of which 4 ms to minimize.
[2024-06-02 23:12:44] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 3 ms to minimize.
[2024-06-02 23:12:44] [INFO ] Deduced a trap composed of 125 places in 280 ms of which 4 ms to minimize.
[2024-06-02 23:12:44] [INFO ] Deduced a trap composed of 126 places in 271 ms of which 3 ms to minimize.
[2024-06-02 23:12:45] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 3 ms to minimize.
[2024-06-02 23:12:45] [INFO ] Deduced a trap composed of 135 places in 250 ms of which 4 ms to minimize.
[2024-06-02 23:12:46] [INFO ] Deduced a trap composed of 135 places in 263 ms of which 3 ms to minimize.
[2024-06-02 23:12:47] [INFO ] Deduced a trap composed of 28 places in 308 ms of which 3 ms to minimize.
[2024-06-02 23:12:47] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 3 ms to minimize.
[2024-06-02 23:12:47] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 23:12:48] [INFO ] Deduced a trap composed of 125 places in 213 ms of which 3 ms to minimize.
[2024-06-02 23:12:49] [INFO ] Deduced a trap composed of 30 places in 288 ms of which 4 ms to minimize.
[2024-06-02 23:12:50] [INFO ] Deduced a trap composed of 33 places in 280 ms of which 3 ms to minimize.
[2024-06-02 23:12:50] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 3 ms to minimize.
[2024-06-02 23:12:50] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 4 ms to minimize.
[2024-06-02 23:12:51] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 4 ms to minimize.
[2024-06-02 23:12:51] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 4 ms to minimize.
[2024-06-02 23:12:51] [INFO ] Deduced a trap composed of 31 places in 275 ms of which 3 ms to minimize.
[2024-06-02 23:12:51] [INFO ] Deduced a trap composed of 31 places in 293 ms of which 4 ms to minimize.
[2024-06-02 23:12:52] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 4 ms to minimize.
[2024-06-02 23:12:52] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 3 ms to minimize.
[2024-06-02 23:12:52] [INFO ] Deduced a trap composed of 130 places in 282 ms of which 4 ms to minimize.
[2024-06-02 23:12:53] [INFO ] Deduced a trap composed of 41 places in 277 ms of which 4 ms to minimize.
[2024-06-02 23:12:53] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 2 ms to minimize.
[2024-06-02 23:12:53] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 3 ms to minimize.
[2024-06-02 23:12:54] [INFO ] Deduced a trap composed of 29 places in 285 ms of which 4 ms to minimize.
[2024-06-02 23:12:54] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 3 ms to minimize.
[2024-06-02 23:12:54] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 4 ms to minimize.
[2024-06-02 23:12:55] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 3 ms to minimize.
[2024-06-02 23:12:55] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 23:12:59] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 4 ms to minimize.
[2024-06-02 23:13:00] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 3 ms to minimize.
[2024-06-02 23:13:01] [INFO ] Deduced a trap composed of 35 places in 277 ms of which 4 ms to minimize.
[2024-06-02 23:13:01] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 4 ms to minimize.
[2024-06-02 23:13:01] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 2 ms to minimize.
[2024-06-02 23:13:01] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 4 ms to minimize.
[2024-06-02 23:13:02] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 4 ms to minimize.
[2024-06-02 23:13:02] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 3 ms to minimize.
[2024-06-02 23:13:02] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 3 ms to minimize.
[2024-06-02 23:13:03] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 4 ms to minimize.
[2024-06-02 23:13:03] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 3 ms to minimize.
[2024-06-02 23:13:03] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 3 ms to minimize.
[2024-06-02 23:13:04] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 3 ms to minimize.
[2024-06-02 23:13:04] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 4 ms to minimize.
[2024-06-02 23:13:04] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 4 ms to minimize.
[2024-06-02 23:13:04] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 3 ms to minimize.
SMT process timed out in 30653ms, After SMT, problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 30662ms
Starting structural reductions in LTL mode, iteration 1 : 202/211 places, 459/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31383 ms. Remains : 202/211 places, 459/474 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p2), true, (NOT p1)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-05 finished in 31790 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)||F(p1))))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 201 transition count 458
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 201 transition count 458
Applied a total of 20 rules in 7 ms. Remains 201 /211 variables (removed 10) and now considering 458/474 (removed 16) transitions.
// Phase 1: matrix 458 rows 201 cols
[2024-06-02 23:13:05] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:13:05] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-02 23:13:05] [INFO ] Invariant cache hit.
[2024-06-02 23:13:05] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-02 23:13:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:13:13] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 3 ms to minimize.
[2024-06-02 23:13:13] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 3 ms to minimize.
[2024-06-02 23:13:13] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 4 ms to minimize.
[2024-06-02 23:13:14] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 3 ms to minimize.
[2024-06-02 23:13:14] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 3 ms to minimize.
[2024-06-02 23:13:14] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 3 ms to minimize.
[2024-06-02 23:13:14] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 3 ms to minimize.
[2024-06-02 23:13:15] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 3 ms to minimize.
[2024-06-02 23:13:15] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 3 ms to minimize.
[2024-06-02 23:13:15] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 6 ms to minimize.
[2024-06-02 23:13:15] [INFO ] Deduced a trap composed of 125 places in 191 ms of which 3 ms to minimize.
[2024-06-02 23:13:16] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 3 ms to minimize.
[2024-06-02 23:13:16] [INFO ] Deduced a trap composed of 125 places in 195 ms of which 3 ms to minimize.
[2024-06-02 23:13:16] [INFO ] Deduced a trap composed of 125 places in 221 ms of which 4 ms to minimize.
[2024-06-02 23:13:16] [INFO ] Deduced a trap composed of 125 places in 297 ms of which 3 ms to minimize.
[2024-06-02 23:13:17] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 3 ms to minimize.
[2024-06-02 23:13:17] [INFO ] Deduced a trap composed of 36 places in 275 ms of which 3 ms to minimize.
[2024-06-02 23:13:18] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 2 ms to minimize.
[2024-06-02 23:13:19] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 4 ms to minimize.
[2024-06-02 23:13:19] [INFO ] Deduced a trap composed of 28 places in 275 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:13:20] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:13:20] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:13:20] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:13:21] [INFO ] Deduced a trap composed of 26 places in 270 ms of which 3 ms to minimize.
[2024-06-02 23:13:22] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 3 ms to minimize.
[2024-06-02 23:13:22] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 3 ms to minimize.
[2024-06-02 23:13:22] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 4 ms to minimize.
[2024-06-02 23:13:23] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 3 ms to minimize.
[2024-06-02 23:13:23] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 3 ms to minimize.
[2024-06-02 23:13:23] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 3 ms to minimize.
[2024-06-02 23:13:23] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 4 ms to minimize.
[2024-06-02 23:13:24] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 3 ms to minimize.
[2024-06-02 23:13:24] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 3 ms to minimize.
[2024-06-02 23:13:24] [INFO ] Deduced a trap composed of 38 places in 272 ms of which 4 ms to minimize.
[2024-06-02 23:13:25] [INFO ] Deduced a trap composed of 38 places in 289 ms of which 4 ms to minimize.
[2024-06-02 23:13:25] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 3 ms to minimize.
[2024-06-02 23:13:25] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 3 ms to minimize.
[2024-06-02 23:13:25] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 4 ms to minimize.
[2024-06-02 23:13:26] [INFO ] Deduced a trap composed of 37 places in 291 ms of which 4 ms to minimize.
[2024-06-02 23:13:26] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:13:30] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 4 ms to minimize.
[2024-06-02 23:13:30] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 3 ms to minimize.
[2024-06-02 23:13:30] [INFO ] Deduced a trap composed of 29 places in 274 ms of which 3 ms to minimize.
[2024-06-02 23:13:31] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 3 ms to minimize.
[2024-06-02 23:13:31] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 4 ms to minimize.
[2024-06-02 23:13:31] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 3 ms to minimize.
[2024-06-02 23:13:32] [INFO ] Deduced a trap composed of 31 places in 282 ms of which 4 ms to minimize.
[2024-06-02 23:13:32] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 3 ms to minimize.
[2024-06-02 23:13:32] [INFO ] Deduced a trap composed of 30 places in 260 ms of which 3 ms to minimize.
[2024-06-02 23:13:32] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 3 ms to minimize.
[2024-06-02 23:13:33] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 3 ms to minimize.
[2024-06-02 23:13:33] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 4 ms to minimize.
[2024-06-02 23:13:34] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 3 ms to minimize.
[2024-06-02 23:13:34] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 3 ms to minimize.
[2024-06-02 23:13:34] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 3 ms to minimize.
[2024-06-02 23:13:35] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 3 ms to minimize.
[2024-06-02 23:13:36] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 4 ms to minimize.
[2024-06-02 23:13:36] [INFO ] Deduced a trap composed of 24 places in 256 ms of which 3 ms to minimize.
[2024-06-02 23:13:36] [INFO ] Deduced a trap composed of 41 places in 272 ms of which 3 ms to minimize.
SMT process timed out in 30812ms, After SMT, problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 30821ms
Starting structural reductions in LTL mode, iteration 1 : 201/211 places, 458/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31517 ms. Remains : 201/211 places, 458/474 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 497 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-18-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-18-LTLFireability-06 finished in 32500 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&&X(X(X(F(p1))))))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 202 transition count 459
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 202 transition count 459
Applied a total of 18 rules in 4 ms. Remains 202 /211 variables (removed 9) and now considering 459/474 (removed 15) transitions.
// Phase 1: matrix 459 rows 202 cols
[2024-06-02 23:13:37] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:13:37] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 23:13:37] [INFO ] Invariant cache hit.
[2024-06-02 23:13:38] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2024-06-02 23:13:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 23:13:45] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 3 ms to minimize.
[2024-06-02 23:13:45] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 3 ms to minimize.
[2024-06-02 23:13:45] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 2 ms to minimize.
[2024-06-02 23:13:46] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 2 ms to minimize.
[2024-06-02 23:13:46] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 1 ms to minimize.
[2024-06-02 23:13:46] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 1 ms to minimize.
[2024-06-02 23:13:46] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2024-06-02 23:13:46] [INFO ] Deduced a trap composed of 125 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:13:47] [INFO ] Deduced a trap composed of 125 places in 180 ms of which 3 ms to minimize.
[2024-06-02 23:13:47] [INFO ] Deduced a trap composed of 125 places in 214 ms of which 3 ms to minimize.
[2024-06-02 23:13:47] [INFO ] Deduced a trap composed of 111 places in 213 ms of which 3 ms to minimize.
[2024-06-02 23:13:48] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 4 ms to minimize.
[2024-06-02 23:13:49] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 3 ms to minimize.
[2024-06-02 23:13:49] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 4 ms to minimize.
[2024-06-02 23:13:49] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 4 ms to minimize.
[2024-06-02 23:13:50] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 3 ms to minimize.
[2024-06-02 23:13:50] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 4 ms to minimize.
[2024-06-02 23:13:50] [INFO ] Deduced a trap composed of 25 places in 296 ms of which 4 ms to minimize.
[2024-06-02 23:13:51] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 3 ms to minimize.
[2024-06-02 23:13:51] [INFO ] Deduced a trap composed of 40 places in 271 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 23:13:51] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:13:52] [INFO ] Deduced a trap composed of 134 places in 274 ms of which 3 ms to minimize.
[2024-06-02 23:13:53] [INFO ] Deduced a trap composed of 141 places in 263 ms of which 3 ms to minimize.
[2024-06-02 23:13:54] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 3 ms to minimize.
[2024-06-02 23:13:54] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 4 ms to minimize.
[2024-06-02 23:13:54] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-06-02 23:13:54] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 3 ms to minimize.
[2024-06-02 23:13:55] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 3 ms to minimize.
[2024-06-02 23:13:55] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 3 ms to minimize.
[2024-06-02 23:13:55] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 3 ms to minimize.
[2024-06-02 23:13:56] [INFO ] Deduced a trap composed of 39 places in 283 ms of which 4 ms to minimize.
[2024-06-02 23:13:56] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 2 ms to minimize.
[2024-06-02 23:13:56] [INFO ] Deduced a trap composed of 138 places in 223 ms of which 3 ms to minimize.
[2024-06-02 23:13:57] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 3 ms to minimize.
[2024-06-02 23:13:58] [INFO ] Deduced a trap composed of 139 places in 240 ms of which 3 ms to minimize.
[2024-06-02 23:13:58] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 3 ms to minimize.
[2024-06-02 23:13:59] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 3 ms to minimize.
[2024-06-02 23:13:59] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 3 ms to minimize.
[2024-06-02 23:13:59] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 3 ms to minimize.
[2024-06-02 23:14:00] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 23:14:03] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 4 ms to minimize.
[2024-06-02 23:14:04] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 3 ms to minimize.
[2024-06-02 23:14:05] [INFO ] Deduced a trap composed of 137 places in 252 ms of which 3 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 3 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 4 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 137 places in 230 ms of which 3 ms to minimize.
[2024-06-02 23:14:07] [INFO ] Deduced a trap composed of 41 places in 280 ms of which 3 ms to minimize.
[2024-06-02 23:14:07] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 3 ms to minimize.
[2024-06-02 23:14:07] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/661 variables, and 56 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 23:14:13] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 3 ms to minimize.
[2024-06-02 23:14:14] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 4 ms to minimize.
[2024-06-02 23:14:14] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 3 ms to minimize.
[2024-06-02 23:14:15] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 3 ms to minimize.
[2024-06-02 23:14:15] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 3 ms to minimize.
[2024-06-02 23:14:15] [INFO ] Deduced a trap composed of 43 places in 254 ms of which 3 ms to minimize.
[2024-06-02 23:14:16] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 4 ms to minimize.
[2024-06-02 23:14:16] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 3 ms to minimize.
[2024-06-02 23:14:16] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 3 ms to minimize.
[2024-06-02 23:14:16] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 3 ms to minimize.
[2024-06-02 23:14:17] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 3 ms to minimize.
[2024-06-02 23:14:17] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 3 ms to minimize.
[2024-06-02 23:14:18] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 3 ms to minimize.
[2024-06-02 23:14:18] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 3 ms to minimize.
[2024-06-02 23:14:20] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 3 ms to minimize.
[2024-06-02 23:14:20] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 23:14:23] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 2 ms to minimize.
[2024-06-02 23:14:23] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 3 ms to minimize.
[2024-06-02 23:14:23] [INFO ] Deduced a trap composed of 40 places in 257 ms of which 3 ms to minimize.
[2024-06-02 23:14:23] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 4 ms to minimize.
[2024-06-02 23:14:24] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 3 ms to minimize.
[2024-06-02 23:14:24] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 3 ms to minimize.
[2024-06-02 23:14:25] [INFO ] Deduced a trap composed of 43 places in 267 ms of which 5 ms to minimize.
[2024-06-02 23:14:25] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 3 ms to minimize.
[2024-06-02 23:14:25] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 3 ms to minimize.
[2024-06-02 23:14:26] [INFO ] Deduced a trap composed of 27 places in 254 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 141 places in 263 ms of which 3 ms to minimize.
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 3 ms to minimize.
[2024-06-02 23:14:31] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 458 unsolved
[2024-06-02 23:14:35] [INFO ] Deduced a trap composed of 27 places in 300 ms of which 3 ms to minimize.
[2024-06-02 23:14:36] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 3 ms to minimize.
[2024-06-02 23:14:36] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 3 ms to minimize.
[2024-06-02 23:14:36] [INFO ] Deduced a trap composed of 113 places in 293 ms of which 4 ms to minimize.
[2024-06-02 23:14:37] [INFO ] Deduced a trap composed of 108 places in 246 ms of which 3 ms to minimize.
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 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(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 1)
(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 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 202/661 variables, and 90 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 0/458 constraints, Known Traps: 83/83 constraints]
After SMT, in 60491ms problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 60499ms
Starting structural reductions in LTL mode, iteration 1 : 202/211 places, 459/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60965 ms. Remains : 202/211 places, 459/474 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-07
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-07 finished in 61233 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(F(p0)))'
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Graph (trivial) has 222 edges and 211 vertex of which 13 / 211 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 200 transition count 419
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 93 place count 156 transition count 415
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 154 transition count 415
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 95 place count 154 transition count 405
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 115 place count 144 transition count 405
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 125 place count 134 transition count 387
Iterating global reduction 3 with 10 rules applied. Total rules applied 135 place count 134 transition count 387
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 195 place count 104 transition count 357
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 201 place count 104 transition count 351
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 207 place count 98 transition count 315
Iterating global reduction 4 with 6 rules applied. Total rules applied 213 place count 98 transition count 315
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 217 place count 94 transition count 303
Iterating global reduction 4 with 4 rules applied. Total rules applied 221 place count 94 transition count 303
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 251 place count 79 transition count 367
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 255 place count 79 transition count 363
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 259 place count 77 transition count 393
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 285 place count 77 transition count 367
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 293 place count 73 transition count 363
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 294 place count 72 transition count 362
Applied a total of 294 rules in 112 ms. Remains 72 /211 variables (removed 139) and now considering 362/474 (removed 112) transitions.
[2024-06-02 23:14:39] [INFO ] Flow matrix only has 338 transitions (discarded 24 similar events)
// Phase 1: matrix 338 rows 72 cols
[2024-06-02 23:14:39] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:14:39] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 23:14:39] [INFO ] Flow matrix only has 338 transitions (discarded 24 similar events)
[2024-06-02 23:14:39] [INFO ] Invariant cache hit.
[2024-06-02 23:14:39] [INFO ] State equation strengthened by 121 read => feed constraints.
[2024-06-02 23:14:39] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-06-02 23:14:39] [INFO ] Redundant transitions in 10 ms returned []
Running 358 sub problems to find dead transitions.
[2024-06-02 23:14:39] [INFO ] Flow matrix only has 338 transitions (discarded 24 similar events)
[2024-06-02 23:14:39] [INFO ] Invariant cache hit.
[2024-06-02 23:14:39] [INFO ] State equation strengthened by 121 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-02 23:14:41] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2024-06-02 23:14:41] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:14:42] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2024-06-02 23:14:42] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:14:42] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:14:42] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:14:42] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:14:42] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-02 23:14:44] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (OVERLAPS) 1/72 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-02 23:14:49] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:14:49] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:14:49] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2024-06-02 23:14:49] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 2 ms to minimize.
[2024-06-02 23:14:49] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 2 ms to minimize.
[2024-06-02 23:14:50] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-06-02 23:14:50] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 2 ms to minimize.
[2024-06-02 23:14:50] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (OVERLAPS) 337/409 variables, 72/96 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 120/216 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 10 (OVERLAPS) 1/410 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/410 variables, and 217 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 121/121 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (OVERLAPS) 1/72 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-02 23:15:12] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
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 TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 7 (OVERLAPS) 337/409 variables, 72/97 constraints. Problems are: Problem set: 42 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 120/217 constraints. Problems are: Problem set: 42 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 316/533 constraints. Problems are: Problem set: 42 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/410 variables, and 533 constraints, problems are : Problem set: 42 solved, 316 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 120/121 constraints, PredecessorRefiner: 316/358 constraints, Known Traps: 18/18 constraints]
After SMT, in 60667ms problems are : Problem set: 42 solved, 316 unsolved
Search for dead transitions found 42 dead transitions in 60674ms
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 : 72/211 places, 320/474 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 71 transition count 330
Applied a total of 2 rules in 9 ms. Remains 71 /72 variables (removed 1) and now considering 330/320 (removed -10) transitions.
[2024-06-02 23:15:40] [INFO ] Flow matrix only has 306 transitions (discarded 24 similar events)
// Phase 1: matrix 306 rows 71 cols
[2024-06-02 23:15:40] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:15:40] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 23:15:40] [INFO ] Flow matrix only has 306 transitions (discarded 24 similar events)
[2024-06-02 23:15:40] [INFO ] Invariant cache hit.
[2024-06-02 23:15:40] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-02 23:15:40] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/211 places, 330/474 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61695 ms. Remains : 71/211 places, 330/474 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-08
Stuttering criterion allowed to conclude after 12 steps with 2 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-08 finished in 61811 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 12 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 201 transition count 458
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 201 transition count 458
Applied a total of 20 rules in 6 ms. Remains 201 /211 variables (removed 10) and now considering 458/474 (removed 16) transitions.
// Phase 1: matrix 458 rows 201 cols
[2024-06-02 23:15:40] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:15:41] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-02 23:15:41] [INFO ] Invariant cache hit.
[2024-06-02 23:15:41] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-02 23:15:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:15:49] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 2 ms to minimize.
[2024-06-02 23:15:49] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 3 ms to minimize.
[2024-06-02 23:15:49] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:15:49] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 3 ms to minimize.
[2024-06-02 23:15:49] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 3 ms to minimize.
[2024-06-02 23:15:50] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 3 ms to minimize.
[2024-06-02 23:15:50] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 3 ms to minimize.
[2024-06-02 23:15:50] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 3 ms to minimize.
[2024-06-02 23:15:50] [INFO ] Deduced a trap composed of 35 places in 282 ms of which 3 ms to minimize.
[2024-06-02 23:15:51] [INFO ] Deduced a trap composed of 40 places in 284 ms of which 4 ms to minimize.
[2024-06-02 23:15:51] [INFO ] Deduced a trap composed of 125 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:15:51] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 4 ms to minimize.
[2024-06-02 23:15:51] [INFO ] Deduced a trap composed of 125 places in 179 ms of which 3 ms to minimize.
[2024-06-02 23:15:52] [INFO ] Deduced a trap composed of 125 places in 215 ms of which 3 ms to minimize.
[2024-06-02 23:15:52] [INFO ] Deduced a trap composed of 125 places in 299 ms of which 3 ms to minimize.
[2024-06-02 23:15:52] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 4 ms to minimize.
[2024-06-02 23:15:53] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 4 ms to minimize.
[2024-06-02 23:15:53] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 3 ms to minimize.
[2024-06-02 23:15:54] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 3 ms to minimize.
[2024-06-02 23:15:55] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:15:55] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:15:55] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:15:55] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:15:57] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 3 ms to minimize.
[2024-06-02 23:15:57] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 4 ms to minimize.
[2024-06-02 23:15:57] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 3 ms to minimize.
[2024-06-02 23:15:58] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 3 ms to minimize.
[2024-06-02 23:15:58] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 4 ms to minimize.
[2024-06-02 23:15:58] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 4 ms to minimize.
[2024-06-02 23:15:59] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 4 ms to minimize.
[2024-06-02 23:15:59] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 4 ms to minimize.
[2024-06-02 23:15:59] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 3 ms to minimize.
[2024-06-02 23:16:00] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 3 ms to minimize.
[2024-06-02 23:16:00] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 3 ms to minimize.
[2024-06-02 23:16:00] [INFO ] Deduced a trap composed of 38 places in 286 ms of which 4 ms to minimize.
[2024-06-02 23:16:00] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 3 ms to minimize.
[2024-06-02 23:16:01] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 3 ms to minimize.
[2024-06-02 23:16:01] [INFO ] Deduced a trap composed of 22 places in 255 ms of which 3 ms to minimize.
[2024-06-02 23:16:01] [INFO ] Deduced a trap composed of 37 places in 298 ms of which 4 ms to minimize.
[2024-06-02 23:16:02] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:16:05] [INFO ] Deduced a trap composed of 32 places in 307 ms of which 4 ms to minimize.
[2024-06-02 23:16:06] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 4 ms to minimize.
[2024-06-02 23:16:06] [INFO ] Deduced a trap composed of 29 places in 258 ms of which 3 ms to minimize.
[2024-06-02 23:16:06] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 3 ms to minimize.
[2024-06-02 23:16:07] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 3 ms to minimize.
[2024-06-02 23:16:07] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 3 ms to minimize.
[2024-06-02 23:16:07] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 4 ms to minimize.
[2024-06-02 23:16:07] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 3 ms to minimize.
[2024-06-02 23:16:08] [INFO ] Deduced a trap composed of 30 places in 292 ms of which 3 ms to minimize.
[2024-06-02 23:16:08] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 4 ms to minimize.
[2024-06-02 23:16:08] [INFO ] Deduced a trap composed of 30 places in 275 ms of which 4 ms to minimize.
[2024-06-02 23:16:09] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 4 ms to minimize.
[2024-06-02 23:16:09] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 4 ms to minimize.
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 4 ms to minimize.
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 29 places in 271 ms of which 4 ms to minimize.
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 3 ms to minimize.
[2024-06-02 23:16:11] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 3 ms to minimize.
[2024-06-02 23:16:11] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/659 variables, and 65 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 58/65 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-02 23:16:18] [INFO ] Deduced a trap composed of 145 places in 286 ms of which 4 ms to minimize.
[2024-06-02 23:16:18] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 3 ms to minimize.
[2024-06-02 23:16:18] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 3 ms to minimize.
[2024-06-02 23:16:19] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 3 ms to minimize.
[2024-06-02 23:16:19] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 4 ms to minimize.
[2024-06-02 23:16:19] [INFO ] Deduced a trap composed of 135 places in 275 ms of which 4 ms to minimize.
[2024-06-02 23:16:19] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 3 ms to minimize.
[2024-06-02 23:16:20] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 4 ms to minimize.
[2024-06-02 23:16:21] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 3 ms to minimize.
[2024-06-02 23:16:21] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 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 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 TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 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 TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 5 (OVERLAPS) 458/659 variables, 201/276 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 407/683 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/659 variables, and 683 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 68/68 constraints]
After SMT, in 60613ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60622ms
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 : 201/211 places, 408/474 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61272 ms. Remains : 201/211 places, 408/474 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-09
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-09 finished in 61358 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 G(p1))||G(F(p2))))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Graph (trivial) has 216 edges and 211 vertex of which 13 / 211 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 200 transition count 421
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 158 transition count 417
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 156 transition count 417
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 91 place count 156 transition count 408
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 109 place count 147 transition count 408
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 119 place count 137 transition count 391
Iterating global reduction 3 with 10 rules applied. Total rules applied 129 place count 137 transition count 391
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 189 place count 107 transition count 361
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 195 place count 107 transition count 355
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 201 place count 101 transition count 319
Iterating global reduction 4 with 6 rules applied. Total rules applied 207 place count 101 transition count 319
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 210 place count 98 transition count 311
Iterating global reduction 4 with 3 rules applied. Total rules applied 213 place count 98 transition count 311
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 243 place count 83 transition count 379
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 246 place count 83 transition count 376
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 248 place count 82 transition count 391
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 270 place count 82 transition count 369
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 278 place count 78 transition count 365
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 279 place count 77 transition count 364
Applied a total of 279 rules in 110 ms. Remains 77 /211 variables (removed 134) and now considering 364/474 (removed 110) transitions.
[2024-06-02 23:16:42] [INFO ] Flow matrix only has 344 transitions (discarded 20 similar events)
// Phase 1: matrix 344 rows 77 cols
[2024-06-02 23:16:42] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:16:42] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 23:16:42] [INFO ] Flow matrix only has 344 transitions (discarded 20 similar events)
[2024-06-02 23:16:42] [INFO ] Invariant cache hit.
[2024-06-02 23:16:42] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-02 23:16:42] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-06-02 23:16:42] [INFO ] Redundant transitions in 25 ms returned []
Running 359 sub problems to find dead transitions.
[2024-06-02 23:16:42] [INFO ] Flow matrix only has 344 transitions (discarded 20 similar events)
[2024-06-02 23:16:42] [INFO ] Invariant cache hit.
[2024-06-02 23:16:42] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 23:16:44] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:16:44] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 2 ms to minimize.
[2024-06-02 23:16:44] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:16:45] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 2 ms to minimize.
[2024-06-02 23:16:45] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2024-06-02 23:16:45] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 2 ms to minimize.
[2024-06-02 23:16:45] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:16:45] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-06-02 23:16:45] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 2 ms to minimize.
[2024-06-02 23:16:45] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:16:46] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:16:46] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-02 23:16:46] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2024-06-02 23:16:46] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2024-06-02 23:16:46] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:16:46] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:16:46] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 2 ms to minimize.
[2024-06-02 23:16:46] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2024-06-02 23:16:47] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2024-06-02 23:16:47] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 23:16:47] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (OVERLAPS) 343/420 variables, 77/105 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 75/180 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (OVERLAPS) 1/421 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 9 (OVERLAPS) 0/421 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 359 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 181 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 23:17:13] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:17:13] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 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 TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 4 (OVERLAPS) 343/420 variables, 77/107 constraints. Problems are: Problem set: 42 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 75/182 constraints. Problems are: Problem set: 42 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 317/499 constraints. Problems are: Problem set: 42 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/499 constraints. Problems are: Problem set: 42 solved, 317 unsolved
At refinement iteration 8 (OVERLAPS) 1/421 variables, 1/500 constraints. Problems are: Problem set: 42 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 500 constraints, problems are : Problem set: 42 solved, 317 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 317/359 constraints, Known Traps: 23/23 constraints]
After SMT, in 60373ms problems are : Problem set: 42 solved, 317 unsolved
Search for dead transitions found 42 dead transitions in 60379ms
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 : 77/211 places, 322/474 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 74 transition count 356
Applied a total of 6 rules in 10 ms. Remains 74 /77 variables (removed 3) and now considering 356/322 (removed -34) transitions.
[2024-06-02 23:17:43] [INFO ] Flow matrix only has 326 transitions (discarded 30 similar events)
// Phase 1: matrix 326 rows 74 cols
[2024-06-02 23:17:43] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:17:43] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 23:17:43] [INFO ] Flow matrix only has 326 transitions (discarded 30 similar events)
[2024-06-02 23:17:43] [INFO ] Invariant cache hit.
[2024-06-02 23:17:43] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-02 23:17:43] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/211 places, 356/474 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61457 ms. Remains : 74/211 places, 356/474 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-10
Product exploration explored 100000 steps with 16641 reset in 347 ms.
Product exploration explored 100000 steps with 16657 reset in 379 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 (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 152 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (6851 resets) in 506 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1970 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 994609 steps, run visited all 1 properties in 1893 ms. (steps per millisecond=525 )
Probabilistic random walk after 994609 steps, saw 191997 distinct states, run finished after 1894 ms. (steps per millisecond=525 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 22 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p2)]
Support contains 3 out of 74 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 356/356 transitions.
Applied a total of 0 rules in 9 ms. Remains 74 /74 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-02 23:17:47] [INFO ] Flow matrix only has 326 transitions (discarded 30 similar events)
[2024-06-02 23:17:47] [INFO ] Invariant cache hit.
[2024-06-02 23:17:47] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-02 23:17:47] [INFO ] Flow matrix only has 326 transitions (discarded 30 similar events)
[2024-06-02 23:17:47] [INFO ] Invariant cache hit.
[2024-06-02 23:17:47] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-02 23:17:47] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2024-06-02 23:17:47] [INFO ] Redundant transitions in 4 ms returned []
Running 351 sub problems to find dead transitions.
[2024-06-02 23:17:47] [INFO ] Flow matrix only has 326 transitions (discarded 30 similar events)
[2024-06-02 23:17:47] [INFO ] Invariant cache hit.
[2024-06-02 23:17:47] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-02 23:17:50] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 1 ms to minimize.
[2024-06-02 23:17:50] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:17:50] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:17:50] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2024-06-02 23:17:50] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2024-06-02 23:17:50] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:17:51] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:17:51] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:17:51] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-06-02 23:17:51] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:17:51] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2024-06-02 23:17:51] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 2 ms to minimize.
[2024-06-02 23:17:51] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-06-02 23:17:52] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:17:52] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 4 ms to minimize.
[2024-06-02 23:17:52] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-02 23:17:52] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:17:52] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:17:52] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:17:52] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-02 23:17:53] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 1 ms to minimize.
[2024-06-02 23:17:53] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-02 23:17: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/74 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (OVERLAPS) 325/399 variables, 74/104 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 75/179 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 180 constraints, problems are : Problem set: 0 solved, 351 unsolved in 29367 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 74/74 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (OVERLAPS) 325/399 variables, 74/104 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 75/179 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 351/530 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/400 variables, and 531 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 74/74 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 23/23 constraints]
After SMT, in 60033ms problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60591 ms. Remains : 74/74 places, 356/356 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 : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (6909 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2014 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 994609 steps, run visited all 1 properties in 2147 ms. (steps per millisecond=463 )
Probabilistic random walk after 994609 steps, saw 191997 distinct states, run finished after 2147 ms. (steps per millisecond=463 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 16485 reset in 165 ms.
Product exploration explored 100000 steps with 16652 reset in 597 ms.
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 356/356 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 74 transition count 354
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 72 transition count 354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 71 transition count 352
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 71 transition count 352
Applied a total of 6 rules in 8 ms. Remains 71 /74 variables (removed 3) and now considering 352/356 (removed 4) transitions.
[2024-06-02 23:18:51] [INFO ] Flow matrix only has 318 transitions (discarded 34 similar events)
// Phase 1: matrix 318 rows 71 cols
[2024-06-02 23:18:51] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:18:51] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 23:18:51] [INFO ] Flow matrix only has 318 transitions (discarded 34 similar events)
[2024-06-02 23:18:51] [INFO ] Invariant cache hit.
[2024-06-02 23:18:51] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-02 23:18:51] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-06-02 23:18:51] [INFO ] Redundant transitions in 2 ms returned []
Running 347 sub problems to find dead transitions.
[2024-06-02 23:18:51] [INFO ] Flow matrix only has 318 transitions (discarded 34 similar events)
[2024-06-02 23:18:51] [INFO ] Invariant cache hit.
[2024-06-02 23:18:51] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-02 23:18:53] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2024-06-02 23:18:53] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:18:53] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:18:53] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:18:53] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 2 ms to minimize.
[2024-06-02 23:18:54] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2024-06-02 23:18:55] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:18:55] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:18:55] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:18:55] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:18:55] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:18:56] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:18:56] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-02 23:18:56] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (OVERLAPS) 317/388 variables, 71/99 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 75/174 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 347 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/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 175 constraints, problems are : Problem set: 0 solved, 347 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 71/71 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (OVERLAPS) 317/388 variables, 71/99 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 75/174 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/389 variables, and 521 constraints, problems are : Problem set: 0 solved, 347 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 71/71 constraints, ReadFeed: 75/76 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 21/21 constraints]
After SMT, in 60472ms problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 60475ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/74 places, 352/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60831 ms. Remains : 71/74 places, 352/356 transitions.
Treatment of property MedleyA-PT-18-LTLFireability-10 finished in 190116 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)||X(X(G(p1))))))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 202 transition count 460
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 202 transition count 460
Applied a total of 18 rules in 3 ms. Remains 202 /211 variables (removed 9) and now considering 460/474 (removed 14) transitions.
// Phase 1: matrix 460 rows 202 cols
[2024-06-02 23:19:52] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:19:52] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 23:19:52] [INFO ] Invariant cache hit.
[2024-06-02 23:19:52] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-02 23:19:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 23:20:00] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 3 ms to minimize.
[2024-06-02 23:20:00] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 3 ms to minimize.
[2024-06-02 23:20:00] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2024-06-02 23:20:00] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 2 ms to minimize.
[2024-06-02 23:20:00] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 2 ms to minimize.
[2024-06-02 23:20:01] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 3 ms to minimize.
[2024-06-02 23:20:01] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 2 ms to minimize.
[2024-06-02 23:20:01] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 2 ms to minimize.
[2024-06-02 23:20:01] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:20:02] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 3 ms to minimize.
[2024-06-02 23:20:02] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 3 ms to minimize.
[2024-06-02 23:20:02] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 3 ms to minimize.
[2024-06-02 23:20:02] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 3 ms to minimize.
[2024-06-02 23:20:03] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 3 ms to minimize.
[2024-06-02 23:20:03] [INFO ] Deduced a trap composed of 126 places in 184 ms of which 3 ms to minimize.
[2024-06-02 23:20:03] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 3 ms to minimize.
[2024-06-02 23:20:03] [INFO ] Deduced a trap composed of 126 places in 206 ms of which 3 ms to minimize.
[2024-06-02 23:20:04] [INFO ] Deduced a trap composed of 126 places in 221 ms of which 4 ms to minimize.
[2024-06-02 23:20:04] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 3 ms to minimize.
[2024-06-02 23:20:05] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 23:20:07] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 3 ms to minimize.
[2024-06-02 23:20:08] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 2 ms to minimize.
[2024-06-02 23:20:08] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
[2024-06-02 23:20:08] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 3 ms to minimize.
[2024-06-02 23:20:08] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 3 ms to minimize.
[2024-06-02 23:20:09] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 3 ms to minimize.
[2024-06-02 23:20:09] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 3 ms to minimize.
[2024-06-02 23:20:09] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 3 ms to minimize.
[2024-06-02 23:20:09] [INFO ] Deduced a trap composed of 35 places in 282 ms of which 3 ms to minimize.
[2024-06-02 23:20:10] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 4 ms to minimize.
[2024-06-02 23:20:10] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 3 ms to minimize.
[2024-06-02 23:20:10] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 3 ms to minimize.
[2024-06-02 23:20:11] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 4 ms to minimize.
[2024-06-02 23:20:11] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 3 ms to minimize.
[2024-06-02 23:20:11] [INFO ] Deduced a trap composed of 22 places in 276 ms of which 4 ms to minimize.
[2024-06-02 23:20:12] [INFO ] Deduced a trap composed of 31 places in 281 ms of which 3 ms to minimize.
[2024-06-02 23:20:12] [INFO ] Deduced a trap composed of 34 places in 277 ms of which 3 ms to minimize.
[2024-06-02 23:20:12] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 3 ms to minimize.
[2024-06-02 23:20:12] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 3 ms to minimize.
[2024-06-02 23:20:13] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 23:20:17] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 4 ms to minimize.
[2024-06-02 23:20:17] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 3 ms to minimize.
[2024-06-02 23:20:17] [INFO ] Deduced a trap composed of 142 places in 282 ms of which 3 ms to minimize.
[2024-06-02 23:20:17] [INFO ] Deduced a trap composed of 27 places in 283 ms of which 3 ms to minimize.
[2024-06-02 23:20:18] [INFO ] Deduced a trap composed of 37 places in 286 ms of which 3 ms to minimize.
[2024-06-02 23:20:19] [INFO ] Deduced a trap composed of 37 places in 290 ms of which 3 ms to minimize.
[2024-06-02 23:20:20] [INFO ] Deduced a trap composed of 44 places in 272 ms of which 3 ms to minimize.
[2024-06-02 23:20:20] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 4 ms to minimize.
[2024-06-02 23:20:20] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 3 ms to minimize.
[2024-06-02 23:20:20] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 3 ms to minimize.
[2024-06-02 23:20:21] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 4 ms to minimize.
[2024-06-02 23:20:21] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 4 ms to minimize.
[2024-06-02 23:20:22] [INFO ] Deduced a trap composed of 30 places in 287 ms of which 3 ms to minimize.
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 202/662 variables, and 60 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 23:20:27] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 3 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 4 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 4 ms to minimize.
[2024-06-02 23:20:29] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 3 ms to minimize.
[2024-06-02 23:20:30] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 2 ms to minimize.
[2024-06-02 23:20:30] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 4 ms to minimize.
[2024-06-02 23:20:31] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 3 ms to minimize.
[2024-06-02 23:20:32] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 3 ms to minimize.
[2024-06-02 23:20:32] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 3 ms to minimize.
[2024-06-02 23:20:33] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 4 ms to minimize.
[2024-06-02 23:20:33] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 23:20:35] [INFO ] Deduced a trap composed of 139 places in 290 ms of which 3 ms to minimize.
[2024-06-02 23:20:36] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 23:20:40] [INFO ] Deduced a trap composed of 135 places in 263 ms of which 3 ms to minimize.
[2024-06-02 23:20:41] [INFO ] Deduced a trap composed of 138 places in 262 ms of which 4 ms to minimize.
[2024-06-02 23:20:42] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 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 TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 7 (OVERLAPS) 460/662 variables, 202/278 constraints. Problems are: Problem set: 50 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 409/687 constraints. Problems are: Problem set: 50 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/662 variables, and 687 constraints, problems are : Problem set: 50 solved, 409 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 409/459 constraints, Known Traps: 69/69 constraints]
After SMT, in 60372ms problems are : Problem set: 50 solved, 409 unsolved
Search for dead transitions found 50 dead transitions in 60377ms
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 : 202/211 places, 410/474 transitions.
Applied a total of 0 rules in 2 ms. Remains 202 /202 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60843 ms. Remains : 202/211 places, 410/474 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-13
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-13 finished in 61036 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(p1)||G(F(p2)))))'
Support contains 6 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 202 transition count 460
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 202 transition count 460
Applied a total of 18 rules in 4 ms. Remains 202 /211 variables (removed 9) and now considering 460/474 (removed 14) transitions.
// Phase 1: matrix 460 rows 202 cols
[2024-06-02 23:20:53] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:20:53] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-02 23:20:53] [INFO ] Invariant cache hit.
[2024-06-02 23:20:53] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-02 23:20:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 3 ms to minimize.
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 3 ms to minimize.
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 3 ms to minimize.
[2024-06-02 23:21:02] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:21:02] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 3 ms to minimize.
[2024-06-02 23:21:02] [INFO ] Deduced a trap composed of 38 places in 268 ms of which 3 ms to minimize.
[2024-06-02 23:21:02] [INFO ] Deduced a trap composed of 49 places in 251 ms of which 3 ms to minimize.
[2024-06-02 23:21:03] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 3 ms to minimize.
[2024-06-02 23:21:03] [INFO ] Deduced a trap composed of 125 places in 206 ms of which 3 ms to minimize.
[2024-06-02 23:21:03] [INFO ] Deduced a trap composed of 90 places in 214 ms of which 3 ms to minimize.
[2024-06-02 23:21:04] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 4 ms to minimize.
[2024-06-02 23:21:04] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 4 ms to minimize.
[2024-06-02 23:21:05] [INFO ] Deduced a trap composed of 36 places in 283 ms of which 4 ms to minimize.
[2024-06-02 23:21:06] [INFO ] Deduced a trap composed of 125 places in 206 ms of which 3 ms to minimize.
[2024-06-02 23:21:06] [INFO ] Deduced a trap composed of 127 places in 212 ms of which 3 ms to minimize.
[2024-06-02 23:21:06] [INFO ] Deduced a trap composed of 125 places in 214 ms of which 4 ms to minimize.
[2024-06-02 23:21:06] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 3 ms to minimize.
[2024-06-02 23:21:07] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 23:21:07] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:21:07] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-06-02 23:21:07] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 4 ms to minimize.
[2024-06-02 23:21:08] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 3 ms to minimize.
[2024-06-02 23:21:09] [INFO ] Deduced a trap composed of 26 places in 270 ms of which 4 ms to minimize.
[2024-06-02 23:21:10] [INFO ] Deduced a trap composed of 27 places in 251 ms of which 3 ms to minimize.
[2024-06-02 23:21:10] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 4 ms to minimize.
[2024-06-02 23:21:10] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 4 ms to minimize.
[2024-06-02 23:21:11] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 3 ms to minimize.
[2024-06-02 23:21:11] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 4 ms to minimize.
[2024-06-02 23:21:11] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 4 ms to minimize.
[2024-06-02 23:21:11] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 3 ms to minimize.
[2024-06-02 23:21:12] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 4 ms to minimize.
[2024-06-02 23:21:12] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 4 ms to minimize.
[2024-06-02 23:21:12] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 4 ms to minimize.
[2024-06-02 23:21:13] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 3 ms to minimize.
[2024-06-02 23:21:13] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 4 ms to minimize.
[2024-06-02 23:21:13] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 4 ms to minimize.
[2024-06-02 23:21:14] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 4 ms to minimize.
[2024-06-02 23:21:14] [INFO ] Deduced a trap composed of 31 places in 274 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 23:21:18] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 4 ms to minimize.
[2024-06-02 23:21:18] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 3 ms to minimize.
[2024-06-02 23:21:18] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 4 ms to minimize.
[2024-06-02 23:21:20] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 3 ms to minimize.
[2024-06-02 23:21:20] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 3 ms to minimize.
[2024-06-02 23:21:21] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 4 ms to minimize.
[2024-06-02 23:21:21] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 3 ms to minimize.
[2024-06-02 23:21:21] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 2 ms to minimize.
[2024-06-02 23:21:22] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 3 ms to minimize.
[2024-06-02 23:21:22] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 4 ms to minimize.
[2024-06-02 23:21:23] [INFO ] Deduced a trap composed of 38 places in 253 ms of which 3 ms to minimize.
[2024-06-02 23:21:23] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 3 ms to minimize.
[2024-06-02 23:21:24] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 3 ms to minimize.
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 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/662 variables, and 60 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 23:21:28] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 3 ms to minimize.
[2024-06-02 23:21:28] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 3 ms to minimize.
[2024-06-02 23:21:30] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 4 ms to minimize.
[2024-06-02 23:21:30] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 4 ms to minimize.
[2024-06-02 23:21:31] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 3 ms to minimize.
[2024-06-02 23:21:31] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 4 ms to minimize.
[2024-06-02 23:21:31] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 3 ms to minimize.
[2024-06-02 23:21:32] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 23:21:36] [INFO ] Deduced a trap composed of 34 places in 303 ms of which 4 ms to minimize.
[2024-06-02 23:21:37] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 3 ms to minimize.
[2024-06-02 23:21:37] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 23:21:42] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 3 ms to minimize.
[2024-06-02 23:21:42] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 23:21:47] [INFO ] Deduced a trap composed of 138 places in 259 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 202/662 variables, and 74 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 0/459 constraints, Known Traps: 67/67 constraints]
After SMT, in 60469ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60476ms
Starting structural reductions in LTL mode, iteration 1 : 202/211 places, 460/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60980 ms. Remains : 202/211 places, 460/474 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 22 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-18-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-18-LTLFireability-14 finished in 61635 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&&G(!p1)))||G(p0)))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Graph (trivial) has 219 edges and 211 vertex of which 9 / 211 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 203 transition count 422
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 93 place count 159 transition count 418
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 96 place count 157 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 156 transition count 417
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 97 place count 156 transition count 406
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 119 place count 145 transition count 406
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 130 place count 134 transition count 387
Iterating global reduction 4 with 11 rules applied. Total rules applied 141 place count 134 transition count 387
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 199 place count 105 transition count 358
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 205 place count 105 transition count 352
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 211 place count 99 transition count 316
Iterating global reduction 5 with 6 rules applied. Total rules applied 217 place count 99 transition count 316
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 221 place count 95 transition count 304
Iterating global reduction 5 with 4 rules applied. Total rules applied 225 place count 95 transition count 304
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 257 place count 79 transition count 388
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 268 place count 79 transition count 377
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 6 with 2 rules applied. Total rules applied 270 place count 78 transition count 392
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 274 place count 78 transition count 388
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 6 with 8 rules applied. Total rules applied 282 place count 74 transition count 384
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 283 place count 73 transition count 383
Applied a total of 283 rules in 76 ms. Remains 73 /211 variables (removed 138) and now considering 383/474 (removed 91) transitions.
[2024-06-02 23:21:55] [INFO ] Flow matrix only has 360 transitions (discarded 23 similar events)
// Phase 1: matrix 360 rows 73 cols
[2024-06-02 23:21:55] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:21:55] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 23:21:55] [INFO ] Flow matrix only has 360 transitions (discarded 23 similar events)
[2024-06-02 23:21:55] [INFO ] Invariant cache hit.
[2024-06-02 23:21:55] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-06-02 23:21:55] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-06-02 23:21:55] [INFO ] Redundant transitions in 5 ms returned []
Running 378 sub problems to find dead transitions.
[2024-06-02 23:21:55] [INFO ] Flow matrix only has 360 transitions (discarded 23 similar events)
[2024-06-02 23:21:55] [INFO ] Invariant cache hit.
[2024-06-02 23:21:55] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 23:21:57] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 2 ms to minimize.
[2024-06-02 23:21:57] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 2 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 2 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 2 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-06-02 23:21:59] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-06-02 23:21:59] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-06-02 23:21:59] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (OVERLAPS) 359/432 variables, 73/92 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 76/168 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (OVERLAPS) 1/433 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (OVERLAPS) 0/433 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 378 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 169 constraints, problems are : Problem set: 0 solved, 378 unsolved in 25451 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 73/73 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
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 TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 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 TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 3 (OVERLAPS) 359/432 variables, 73/92 constraints. Problems are: Problem set: 42 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 76/168 constraints. Problems are: Problem set: 42 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 336/504 constraints. Problems are: Problem set: 42 solved, 336 unsolved
[2024-06-02 23:22:32] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 1/505 constraints. Problems are: Problem set: 42 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/505 constraints. Problems are: Problem set: 42 solved, 336 unsolved
At refinement iteration 8 (OVERLAPS) 1/433 variables, 1/506 constraints. Problems are: Problem set: 42 solved, 336 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 433/433 variables, and 506 constraints, problems are : Problem set: 42 solved, 336 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 73/73 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 336/378 constraints, Known Traps: 13/13 constraints]
After SMT, in 55944ms problems are : Problem set: 42 solved, 336 unsolved
Search for dead transitions found 42 dead transitions in 55954ms
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 : 73/211 places, 341/474 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 71 transition count 363
Applied a total of 4 rules in 14 ms. Remains 71 /73 variables (removed 2) and now considering 363/341 (removed -22) transitions.
[2024-06-02 23:22:51] [INFO ] Flow matrix only has 334 transitions (discarded 29 similar events)
// Phase 1: matrix 334 rows 71 cols
[2024-06-02 23:22:51] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:22:51] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-02 23:22:51] [INFO ] Flow matrix only has 334 transitions (discarded 29 similar events)
[2024-06-02 23:22:51] [INFO ] Invariant cache hit.
[2024-06-02 23:22:51] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-06-02 23:22:52] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/211 places, 363/474 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57058 ms. Remains : 71/211 places, 363/474 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (OR (NOT p0) p1), (AND (NOT p0) p1), p1]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-15
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-15 finished in 57273 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 G(p1))||G(F(p2))))'
[2024-06-02 23:22:52] [INFO ] Flatten gal took : 78 ms
[2024-06-02 23:22:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-02 23:22:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 211 places, 474 transitions and 2298 arcs took 15 ms.
Total runtime 839154 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MedleyA-PT-18
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 211
TRANSITIONS: 474
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.027s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 3262
MODEL NAME: /home/mcc/execution/412/model
211 places, 474 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-18-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717370620264
--------------------
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
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-18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MedleyA-PT-18, 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 r575-smll-171734919700140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-18.tgz
mv MedleyA-PT-18 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 '
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 ;