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.r542-smll-171690581300104.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is TokenRing-PT-010, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r542-smll-171690581300104
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 125K Apr 11 19:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 687K Apr 11 19:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 900K Apr 11 19:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 11 19:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 57K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 436K Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 212K Apr 11 19:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 19:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 11 19:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.6M Apr 11 19:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 519K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1717251140395

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=TokenRing-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:12:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 14:12:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:12:23] [INFO ] Load time of PNML (sax parser for PT used): 338 ms
[2024-06-01 14:12:23] [INFO ] Transformed 121 places.
[2024-06-01 14:12:23] [INFO ] Transformed 1111 transitions.
[2024-06-01 14:12:23] [INFO ] Found NUPN structural information;
[2024-06-01 14:12:23] [INFO ] Parsed PT model containing 121 places and 1111 transitions and 4444 arcs in 573 ms.
Built sparse matrix representations for Structural reductions in 14 ms.30395KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 151 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 177 ms. Remains : 121/121 places, 1111/1111 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 37 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
// Phase 1: matrix 1111 rows 121 cols
[2024-06-01 14:12:23] [INFO ] Computed 11 invariants in 30 ms
[2024-06-01 14:12:24] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-06-01 14:12:24] [INFO ] Invariant cache hit.
[2024-06-01 14:12:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 14:12:24] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1453 ms to find 0 implicit places.
[2024-06-01 14:12:25] [INFO ] Redundant transitions in 99 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-06-01 14:12:25] [INFO ] Invariant cache hit.
[2024-06-01 14:12:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:12:33] [INFO ] Deduced a trap composed of 66 places in 322 ms of which 23 ms to minimize.
[2024-06-01 14:12:33] [INFO ] Deduced a trap composed of 67 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:12:33] [INFO ] Deduced a trap composed of 66 places in 467 ms of which 3 ms to minimize.
[2024-06-01 14:12:34] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:12:34] [INFO ] Deduced a trap composed of 66 places in 312 ms of which 3 ms to minimize.
[2024-06-01 14:12:34] [INFO ] Deduced a trap composed of 65 places in 503 ms of which 3 ms to minimize.
[2024-06-01 14:12:35] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 4 ms to minimize.
[2024-06-01 14:12:35] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:12:35] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 4 ms to minimize.
[2024-06-01 14:12:35] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 1 ms to minimize.
[2024-06-01 14:12:35] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:12:35] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:12:35] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 1 ms to minimize.
[2024-06-01 14:12:36] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:12:36] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:12:36] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:12:36] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 1 ms to minimize.
[2024-06-01 14:12:36] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:12:36] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 1 ms to minimize.
[2024-06-01 14:12:37] [INFO ] Deduced a trap composed of 66 places in 187 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:12:38] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:12:38] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:12:38] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:12:38] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:12:38] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:12:38] [INFO ] Deduced a trap composed of 66 places in 212 ms of which 1 ms to minimize.
[2024-06-01 14:12:39] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:12:39] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:12:39] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:12:39] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:12:39] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 1 ms to minimize.
[2024-06-01 14:12:39] [INFO ] Deduced a trap composed of 68 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:12:40] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 1 ms to minimize.
[2024-06-01 14:12:40] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 3 ms to minimize.
[2024-06-01 14:12:40] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 2 ms to minimize.
[2024-06-01 14:12:40] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:12:40] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:12:40] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:12:41] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:12:41] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 2 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 68 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 3 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 67 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 2 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 68 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 64 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 1 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 2 ms to minimize.
[2024-06-01 14:12:52] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:12:52] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:12:52] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:12:52] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:12:54] [INFO ] Deduced a trap composed of 68 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:12:54] [INFO ] Deduced a trap composed of 66 places in 203 ms of which 2 ms to minimize.
[2024-06-01 14:12:54] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:12:54] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 5 ms to minimize.
[2024-06-01 14:12:54] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:12:55] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:12:55] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 3 ms to minimize.
[2024-06-01 14:12:55] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 2 ms to minimize.
[2024-06-01 14:12:55] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:12:56] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 2 ms to minimize.
[2024-06-01 14:12:56] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 2 ms to minimize.
[2024-06-01 14:12:56] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:12:56] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 2 ms to minimize.
SMT process timed out in 31654ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31701ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 33326 ms. Remains : 121/121 places, 1111/1111 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3611 ms (no deadlock found). (steps per millisecond=346 )
Random directed walk for 1250000 steps, including 0 resets, run took 3327 ms (no deadlock found). (steps per millisecond=375 )
[2024-06-01 14:13:03] [INFO ] Invariant cache hit.
[2024-06-01 14:13:04] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 10 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-06-01 14:13:04] [INFO ] Invariant cache hit.
[2024-06-01 14:13:04] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-06-01 14:13:04] [INFO ] Invariant cache hit.
[2024-06-01 14:13:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 14:13:06] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 1933 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-06-01 14:13:06] [INFO ] Invariant cache hit.
[2024-06-01 14:13:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:13:12] [INFO ] Deduced a trap composed of 66 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:13:12] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:13:12] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:13:13] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:13:13] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:13:13] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:13:13] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:13:13] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:13:14] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:13:14] [INFO ] Deduced a trap composed of 67 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:13:14] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:13:14] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:13:14] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 2 ms to minimize.
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 1 ms to minimize.
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 1 ms to minimize.
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 63 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:13:16] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:13:17] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:13:17] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 3 ms to minimize.
[2024-06-01 14:13:17] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:13:17] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:13:17] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:13:18] [INFO ] Deduced a trap composed of 66 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:13:18] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:13:18] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 1 ms to minimize.
[2024-06-01 14:13:18] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:13:18] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:13:19] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 2 ms to minimize.
[2024-06-01 14:13:19] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:13:19] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:13:19] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:13:19] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:13:20] [INFO ] Deduced a trap composed of 64 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:13:20] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 2 ms to minimize.
[2024-06-01 14:13:20] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 1 ms to minimize.
[2024-06-01 14:13:20] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:13:20] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 1 ms to minimize.
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 68 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 67 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 67 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:13:29] [INFO ] Deduced a trap composed of 68 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:13:29] [INFO ] Deduced a trap composed of 67 places in 232 ms of which 2 ms to minimize.
[2024-06-01 14:13:29] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 1 ms to minimize.
[2024-06-01 14:13:29] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:13:30] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:13:30] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:13:30] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 2 ms to minimize.
[2024-06-01 14:13:30] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:13:30] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 1 ms to minimize.
[2024-06-01 14:13:31] [INFO ] Deduced a trap composed of 66 places in 170 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:13:32] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:13:32] [INFO ] Deduced a trap composed of 66 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:13:33] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 3 ms to minimize.
[2024-06-01 14:13:33] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:13:33] [INFO ] Deduced a trap composed of 64 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:13:33] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 2 ms to minimize.
[2024-06-01 14:13:33] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 3 ms to minimize.
[2024-06-01 14:13:34] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:13:34] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:13:34] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 4 ms to minimize.
[2024-06-01 14:13:34] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:13:34] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:13:35] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:13:35] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 2 ms to minimize.
[2024-06-01 14:13:35] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:13:35] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 1 ms to minimize.
[2024-06-01 14:13:36] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:13:36] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:13:36] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 1 ms to minimize.
[2024-06-01 14:13:36] [INFO ] Deduced a trap composed of 63 places in 232 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 212 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30072 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 80/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:13:39] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:13:40] [INFO ] Deduced a trap composed of 66 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:13:40] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:13:40] [INFO ] Deduced a trap composed of 67 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:13:40] [INFO ] Deduced a trap composed of 63 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:13:40] [INFO ] Deduced a trap composed of 66 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:13:41] [INFO ] Deduced a trap composed of 67 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:13:41] [INFO ] Deduced a trap composed of 63 places in 199 ms of which 3 ms to minimize.
[2024-06-01 14:13:41] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:13:41] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:13:41] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 1 ms to minimize.
[2024-06-01 14:13:41] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:13:42] [INFO ] Deduced a trap composed of 68 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:13:42] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:13:42] [INFO ] Deduced a trap composed of 68 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:13:42] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 2 ms to minimize.
[2024-06-01 14:13:43] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 2 ms to minimize.
[2024-06-01 14:13:43] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 1 ms to minimize.
[2024-06-01 14:13:43] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:13:43] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:13:45] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 2 ms to minimize.
[2024-06-01 14:13:45] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:13:46] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 2 ms to minimize.
[2024-06-01 14:13:46] [INFO ] Deduced a trap composed of 64 places in 211 ms of which 2 ms to minimize.
[2024-06-01 14:13:46] [INFO ] Deduced a trap composed of 63 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:13:46] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:13:47] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:13:47] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 2 ms to minimize.
[2024-06-01 14:13:47] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:13:47] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:13:47] [INFO ] Deduced a trap composed of 68 places in 238 ms of which 2 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 2 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 66 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 64 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:13:49] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:13:49] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:13:49] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:13:49] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:13:52] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:13:52] [INFO ] Deduced a trap composed of 64 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:13:52] [INFO ] Deduced a trap composed of 64 places in 161 ms of which 1 ms to minimize.
[2024-06-01 14:13:52] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:13:52] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 1 ms to minimize.
[2024-06-01 14:13:53] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:13:53] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:13:53] [INFO ] Deduced a trap composed of 68 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:13:53] [INFO ] Deduced a trap composed of 69 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:13:54] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:13:54] [INFO ] Deduced a trap composed of 68 places in 189 ms of which 3 ms to minimize.
[2024-06-01 14:13:54] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:13:54] [INFO ] Deduced a trap composed of 67 places in 264 ms of which 2 ms to minimize.
[2024-06-01 14:13:55] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:13:55] [INFO ] Deduced a trap composed of 62 places in 246 ms of which 2 ms to minimize.
[2024-06-01 14:13:55] [INFO ] Deduced a trap composed of 64 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:13:55] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:13:55] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:13:56] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:13:56] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:13:58] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:13:59] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 2 ms to minimize.
[2024-06-01 14:13:59] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 2 ms to minimize.
[2024-06-01 14:13:59] [INFO ] Deduced a trap composed of 67 places in 241 ms of which 2 ms to minimize.
[2024-06-01 14:13:59] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 2 ms to minimize.
[2024-06-01 14:14:00] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:14:00] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:14:00] [INFO ] Deduced a trap composed of 67 places in 161 ms of which 1 ms to minimize.
[2024-06-01 14:14:00] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:14:01] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-06-01 14:14:01] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:14:01] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:14:01] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:14:01] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 2 ms to minimize.
[2024-06-01 14:14:02] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:14:02] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 2 ms to minimize.
[2024-06-01 14:14:02] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:14:02] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 2 ms to minimize.
[2024-06-01 14:14:03] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:14:03] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:14:06] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 2 ms to minimize.
[2024-06-01 14:14:06] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:14:06] [INFO ] Deduced a trap composed of 62 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:14:06] [INFO ] Deduced a trap composed of 63 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:14:06] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/1232 variables, and 297 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30040 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 165/165 constraints]
After SMT, in 60919ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 60935ms
Finished structural reductions in LIVENESS mode , in 1 iterations and 62882 ms. Remains : 121/121 places, 1111/1111 transitions.
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 7044 ms. (5 steps per ms) remains 872/1101 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 871/872 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 871/871 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 871/871 properties
[2024-06-01 14:14:09] [INFO ] Invariant cache hit.
[2024-06-01 14:14:09] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 871 unsolved
[2024-06-01 14:14:14] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:14:14] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 2 ms to minimize.
[2024-06-01 14:14:14] [INFO ] Deduced a trap composed of 64 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:14:14] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 2 ms to minimize.
[2024-06-01 14:14:15] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 3 ms to minimize.
SMT process timed out in 5978ms, After SMT, problems are : Problem set: 0 solved, 871 unsolved
Fused 871 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 121 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 21 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 1693020 steps (4 resets) in 120004 ms. (14 steps per ms) remains 826/871 properties
BEST_FIRST walk for 4000 steps (8 resets) in 264 ms. (15 steps per ms) remains 812/826 properties
BEST_FIRST walk for 4000 steps (8 resets) in 214 ms. (18 steps per ms) remains 798/812 properties
BEST_FIRST walk for 4000 steps (8 resets) in 231 ms. (17 steps per ms) remains 795/798 properties
BEST_FIRST walk for 4000 steps (8 resets) in 186 ms. (21 steps per ms) remains 793/795 properties
BEST_FIRST walk for 4000 steps (8 resets) in 188 ms. (21 steps per ms) remains 789/793 properties
BEST_FIRST walk for 4000 steps (8 resets) in 233 ms. (17 steps per ms) remains 786/789 properties
BEST_FIRST walk for 4000 steps (8 resets) in 188 ms. (21 steps per ms) remains 782/786 properties
BEST_FIRST walk for 4000 steps (8 resets) in 187 ms. (21 steps per ms) remains 780/782 properties
BEST_FIRST walk for 4000 steps (8 resets) in 190 ms. (20 steps per ms) remains 780/780 properties
BEST_FIRST walk for 4000 steps (8 resets) in 189 ms. (21 steps per ms) remains 779/780 properties
BEST_FIRST walk for 4000 steps (8 resets) in 213 ms. (18 steps per ms) remains 777/779 properties
BEST_FIRST walk for 4000 steps (8 resets) in 232 ms. (17 steps per ms) remains 777/777 properties
BEST_FIRST walk for 4000 steps (8 resets) in 299 ms. (13 steps per ms) remains 776/777 properties
BEST_FIRST walk for 4000 steps (8 resets) in 333 ms. (11 steps per ms) remains 775/776 properties
BEST_FIRST walk for 4000 steps (8 resets) in 304 ms. (13 steps per ms) remains 775/775 properties
BEST_FIRST walk for 4000 steps (8 resets) in 220 ms. (18 steps per ms) remains 774/775 properties
BEST_FIRST walk for 4000 steps (8 resets) in 282 ms. (14 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 274 ms. (14 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 265 ms. (15 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 348 ms. (11 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 343 ms. (11 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 364 ms. (10 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 239 ms. (16 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 215 ms. (18 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 206 ms. (19 steps per ms) remains 773/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 211 ms. (18 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4000 steps (8 resets) in 223 ms. (17 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4000 steps (8 resets) in 185 ms. (21 steps per ms) remains 772/773 properties
BEST_FIRST walk for 4000 steps (8 resets) in 181 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 186 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 175 ms. (22 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 174 ms. (22 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 180 ms. (22 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 179 ms. (22 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 184 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 181 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 182 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 216 ms. (18 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 225 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 224 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 216 ms. (18 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 225 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 223 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 218 ms. (18 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 222 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 191 ms. (20 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 184 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 182 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 186 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 182 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 185 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 176 ms. (22 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 183 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 181 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 189 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 192 ms. (20 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 184 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 184 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 178 ms. (22 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 181 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 182 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 186 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 180 ms. (22 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 180 ms. (22 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 189 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 181 ms. (21 steps per ms) remains 771/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 196 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 184 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 199 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 193 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 194 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 190 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 191 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 216 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 195 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 236 ms. (16 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 221 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 222 ms. (17 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 230 ms. (17 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 224 ms. (17 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 242 ms. (16 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 218 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 185 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 202 ms. (19 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 179 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 192 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 186 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 177 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 181 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 182 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 179 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 206 ms. (19 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 225 ms. (17 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 220 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 233 ms. (17 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 222 ms. (17 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 213 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 222 ms. (17 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 216 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 177 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 185 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 183 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 177 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 183 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 184 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 186 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 179 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 183 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 193 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 184 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 180 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 186 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 187 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 187 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 177 ms. (22 steps per ms) remains 771/771 properties
[2024-06-01 14:14:52] [INFO ] Invariant cache hit.
[2024-06-01 14:14:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 10/129 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 3 (OVERLAPS) 2/121 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-06-01 14:15:08] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:15:08] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:15:08] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:15:08] [INFO ] Deduced a trap composed of 67 places in 262 ms of which 2 ms to minimize.
[2024-06-01 14:15:08] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:15:09] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:15:09] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 3 ms to minimize.
[2024-06-01 14:15:09] [INFO ] Deduced a trap composed of 63 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:15:09] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:15:10] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:15:10] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:15:10] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 2 ms to minimize.
[2024-06-01 14:15:10] [INFO ] Deduced a trap composed of 68 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:15:11] [INFO ] Deduced a trap composed of 68 places in 229 ms of which 4 ms to minimize.
[2024-06-01 14:15:11] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:15:11] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:15:11] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:15:12] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:15:12] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:15:12] [INFO ] Deduced a trap composed of 68 places in 191 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-06-01 14:15:13] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 3 ms to minimize.
[2024-06-01 14:15:13] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 1 ms to minimize.
[2024-06-01 14:15:13] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:15:14] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:15:14] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 2 ms to minimize.
[2024-06-01 14:15:14] [INFO ] Deduced a trap composed of 67 places in 232 ms of which 2 ms to minimize.
[2024-06-01 14:15:14] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:15:15] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 1 ms to minimize.
[2024-06-01 14:15:15] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:15:15] [INFO ] Deduced a trap composed of 63 places in 167 ms of which 1 ms to minimize.
[2024-06-01 14:15:15] [INFO ] Deduced a trap composed of 67 places in 164 ms of which 1 ms to minimize.
[2024-06-01 14:15:15] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:15:16] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:15:16] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 1 ms to minimize.
[2024-06-01 14:15:16] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:15:16] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 1 ms to minimize.
[2024-06-01 14:15:16] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 1 ms to minimize.
[2024-06-01 14:15:16] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 2 ms to minimize.
[2024-06-01 14:15:17] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:15:17] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-06-01 14:15:22] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:15:22] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:15:22] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:15:22] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:15:22] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:15:23] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:15:23] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:15:23] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 2 ms to minimize.
[2024-06-01 14:15:23] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:15:23] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:15:24] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:15:24] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:15:24] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 1 ms to minimize.
[2024-06-01 14:15:24] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:15:25] [INFO ] Deduced a trap composed of 67 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:15:25] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 1 ms to minimize.
[2024-06-01 14:15:25] [INFO ] Deduced a trap composed of 67 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:15:25] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-06-01 14:15:25] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:15:26] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-06-01 14:15:27] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:15:28] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:15:28] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 1 ms to minimize.
[2024-06-01 14:15:28] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 1 ms to minimize.
[2024-06-01 14:15:28] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:15:28] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:15:28] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:15:29] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:15:29] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 1 ms to minimize.
[2024-06-01 14:15:29] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:15:29] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:15:29] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:15:29] [INFO ] Deduced a trap composed of 69 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:15:30] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:15:30] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:15:30] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:15:30] [INFO ] Deduced a trap composed of 66 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:15:30] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 1 ms to minimize.
[2024-06-01 14:15:31] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 1 ms to minimize.
[2024-06-01 14:15:31] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-06-01 14:15:33] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 1 ms to minimize.
[2024-06-01 14:15:33] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 1 ms to minimize.
[2024-06-01 14:15:34] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 2 ms to minimize.
[2024-06-01 14:15:34] [INFO ] Deduced a trap composed of 66 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:15:34] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 2 ms to minimize.
[2024-06-01 14:15:34] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 2 ms to minimize.
[2024-06-01 14:15:35] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:15:35] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:15:35] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:15:35] [INFO ] Deduced a trap composed of 66 places in 182 ms of which 1 ms to minimize.
[2024-06-01 14:15:36] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:15:36] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:15:36] [INFO ] Deduced a trap composed of 67 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:15:36] [INFO ] Deduced a trap composed of 67 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:15:36] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:15:37] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:15:37] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 2 ms to minimize.
[2024-06-01 14:15:37] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:15:37] [INFO ] Deduced a trap composed of 67 places in 171 ms of which 2 ms to minimize.
SMT process timed out in 45591ms, After SMT, problems are : Problem set: 0 solved, 771 unsolved
Fused 771 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 119 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 34 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 1862500 steps (4 resets) in 120004 ms. (15 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 180 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 175 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 184 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 184 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 178 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 182 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 176 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 173 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 182 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 175 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 181 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 175 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 197 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 225 ms. (17 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 220 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 222 ms. (17 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 219 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 213 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 224 ms. (17 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 223 ms. (17 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 196 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 176 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 181 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 175 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 183 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 187 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 182 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 180 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 185 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 178 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 176 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 182 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 176 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 174 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 183 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 179 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 178 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 185 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 183 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 185 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 189 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 192 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 183 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 187 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 176 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 182 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 183 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 179 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 175 ms. (22 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 180 ms. (22 steps per ms) remains 771/771 properties
Probably explored full state space saw : 58904 states, properties seen :0
Probabilistic random walk after 352949 steps, saw 58904 distinct states, run finished after 7315 ms. (steps per millisecond=48 ) properties seen :0
Explored full state space saw : 58905 states, properties seen :0
Exhaustive walk after 352955 steps, saw 58905 distinct states, run finished after 6990 ms. (steps per millisecond=50 ) properties seen :0
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 242091 ms.
ITS solved all properties within timeout

BK_STOP 1717251384587

--------------------
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 Liveness -timeout 180 -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="TokenRing-PT-010"
export BK_EXAMINATION="Liveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is TokenRing-PT-010, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r542-smll-171690581300104"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-010.tgz
mv TokenRing-PT-010 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;