fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r430-smll-171690580700104
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for TokenRing-PT-010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1824.924 262745.00 528850.00 599.70 F 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.r430-smll-171690580700104.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 TokenRing-PT-010, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r430-smll-171690580700104
=====================================================================

--------------------
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 1716984166180

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 12:02:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-29 12:02:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:02:48] [INFO ] Load time of PNML (sax parser for PT used): 289 ms
[2024-05-29 12:02:48] [INFO ] Transformed 121 places.
[2024-05-29 12:02:48] [INFO ] Transformed 1111 transitions.
[2024-05-29 12:02:48] [INFO ] Found NUPN structural information;
[2024-05-29 12:02:48] [INFO ] Parsed PT model containing 121 places and 1111 transitions and 4444 arcs in 472 ms.
Built sparse matrix representations for Structural reductions in 11 ms.29809KB 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 89 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 112 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 33 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
// Phase 1: matrix 1111 rows 121 cols
[2024-05-29 12:02:49] [INFO ] Computed 11 invariants in 29 ms
[2024-05-29 12:02:49] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-29 12:02:49] [INFO ] Invariant cache hit.
[2024-05-29 12:02:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 12:02:50] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
[2024-05-29 12:02:50] [INFO ] Redundant transitions in 79 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-29 12:02:50] [INFO ] Invariant cache hit.
[2024-05-29 12:02:50] [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-05-29 12:02:59] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 32 ms to minimize.
[2024-05-29 12:02:59] [INFO ] Deduced a trap composed of 67 places in 283 ms of which 4 ms to minimize.
[2024-05-29 12:02:59] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 4 ms to minimize.
[2024-05-29 12:03:00] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 3 ms to minimize.
[2024-05-29 12:03:00] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 2 ms to minimize.
[2024-05-29 12:03:00] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 3 ms to minimize.
[2024-05-29 12:03:00] [INFO ] Deduced a trap composed of 66 places in 285 ms of which 3 ms to minimize.
[2024-05-29 12:03:01] [INFO ] Deduced a trap composed of 65 places in 290 ms of which 4 ms to minimize.
[2024-05-29 12:03:01] [INFO ] Deduced a trap composed of 65 places in 290 ms of which 3 ms to minimize.
[2024-05-29 12:03:01] [INFO ] Deduced a trap composed of 67 places in 270 ms of which 3 ms to minimize.
[2024-05-29 12:03:02] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 2 ms to minimize.
[2024-05-29 12:03:02] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 3 ms to minimize.
[2024-05-29 12:03:02] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 3 ms to minimize.
[2024-05-29 12:03:02] [INFO ] Deduced a trap composed of 66 places in 278 ms of which 3 ms to minimize.
[2024-05-29 12:03:03] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 2 ms to minimize.
[2024-05-29 12:03:03] [INFO ] Deduced a trap composed of 62 places in 258 ms of which 3 ms to minimize.
[2024-05-29 12:03:03] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-29 12:03:03] [INFO ] Deduced a trap composed of 63 places in 260 ms of which 3 ms to minimize.
[2024-05-29 12:03:04] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 2 ms to minimize.
[2024-05-29 12:03:04] [INFO ] Deduced a trap composed of 66 places in 232 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-05-29 12:03:05] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 2 ms to minimize.
[2024-05-29 12:03:05] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 2 ms to minimize.
[2024-05-29 12:03:05] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 2 ms to minimize.
[2024-05-29 12:03:06] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 2 ms to minimize.
[2024-05-29 12:03:06] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 2 ms to minimize.
[2024-05-29 12:03:06] [INFO ] Deduced a trap composed of 66 places in 177 ms of which 2 ms to minimize.
[2024-05-29 12:03:06] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 3 ms to minimize.
[2024-05-29 12:03:06] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 2 ms to minimize.
[2024-05-29 12:03:07] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 3 ms to minimize.
[2024-05-29 12:03:07] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-05-29 12:03:07] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 2 ms to minimize.
[2024-05-29 12:03:07] [INFO ] Deduced a trap composed of 68 places in 203 ms of which 5 ms to minimize.
[2024-05-29 12:03:07] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 2 ms to minimize.
[2024-05-29 12:03:08] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 4 ms to minimize.
[2024-05-29 12:03:08] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 2 ms to minimize.
[2024-05-29 12:03:08] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 2 ms to minimize.
[2024-05-29 12:03:08] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 3 ms to minimize.
[2024-05-29 12:03:09] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-05-29 12:03:09] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 3 ms to minimize.
[2024-05-29 12:03:09] [INFO ] Deduced a trap composed of 65 places in 247 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-05-29 12:03:17] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 3 ms to minimize.
[2024-05-29 12:03:17] [INFO ] Deduced a trap composed of 67 places in 239 ms of which 2 ms to minimize.
[2024-05-29 12:03:18] [INFO ] Deduced a trap composed of 68 places in 271 ms of which 2 ms to minimize.
[2024-05-29 12:03:18] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 2 ms to minimize.
[2024-05-29 12:03:18] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 2 ms to minimize.
[2024-05-29 12:03:18] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 2 ms to minimize.
[2024-05-29 12:03:19] [INFO ] Deduced a trap composed of 67 places in 219 ms of which 3 ms to minimize.
[2024-05-29 12:03:19] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 3 ms to minimize.
[2024-05-29 12:03:19] [INFO ] Deduced a trap composed of 67 places in 212 ms of which 3 ms to minimize.
[2024-05-29 12:03:19] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 3 ms to minimize.
[2024-05-29 12:03:20] [INFO ] Deduced a trap composed of 68 places in 265 ms of which 5 ms to minimize.
[2024-05-29 12:03:20] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 2 ms to minimize.
[2024-05-29 12:03:20] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 2 ms to minimize.
[2024-05-29 12:03:21] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 3 ms to minimize.
[2024-05-29 12:03:21] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 2 ms to minimize.
[2024-05-29 12:03:21] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-05-29 12:03:21] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 3 ms to minimize.
[2024-05-29 12:03:22] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 3 ms to minimize.
SMT process timed out in 31782ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31828ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 33256 ms. Remains : 121/121 places, 1111/1111 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3811 ms (no deadlock found). (steps per millisecond=327 )
Random directed walk for 1250000 steps, including 0 resets, run took 3268 ms (no deadlock found). (steps per millisecond=382 )
[2024-05-29 12:03:29] [INFO ] Invariant cache hit.
[2024-05-29 12:03:29] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 11 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 12:03:29] [INFO ] Invariant cache hit.
[2024-05-29 12:03:29] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-29 12:03:29] [INFO ] Invariant cache hit.
[2024-05-29 12:03:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 12:03:31] [INFO ] Implicit Places using invariants and state equation in 2005 ms returned []
Implicit Place search using SMT with State Equation took 2361 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 12:03:31] [INFO ] Invariant cache hit.
[2024-05-29 12:03:31] [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-05-29 12:03:39] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 2 ms to minimize.
[2024-05-29 12:03:39] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 2 ms to minimize.
[2024-05-29 12:03:39] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 2 ms to minimize.
[2024-05-29 12:03:39] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 1 ms to minimize.
[2024-05-29 12:03:39] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 2 ms to minimize.
[2024-05-29 12:03:39] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 2 ms to minimize.
[2024-05-29 12:03:40] [INFO ] Deduced a trap composed of 66 places in 158 ms of which 2 ms to minimize.
[2024-05-29 12:03:40] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
[2024-05-29 12:03:40] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 2 ms to minimize.
[2024-05-29 12:03:40] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 2 ms to minimize.
[2024-05-29 12:03:40] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2024-05-29 12:03:40] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 1 ms to minimize.
[2024-05-29 12:03:41] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 1 ms to minimize.
[2024-05-29 12:03:41] [INFO ] Deduced a trap composed of 66 places in 157 ms of which 1 ms to minimize.
[2024-05-29 12:03:41] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 2 ms to minimize.
[2024-05-29 12:03:41] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 2 ms to minimize.
[2024-05-29 12:03:41] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2024-05-29 12:03:41] [INFO ] Deduced a trap composed of 63 places in 151 ms of which 1 ms to minimize.
[2024-05-29 12:03:42] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 2 ms to minimize.
[2024-05-29 12:03:42] [INFO ] Deduced a trap composed of 66 places in 159 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-05-29 12:03:43] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 2 ms to minimize.
[2024-05-29 12:03:43] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2024-05-29 12:03:43] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 1 ms to minimize.
[2024-05-29 12:03:43] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 1 ms to minimize.
[2024-05-29 12:03:43] [INFO ] Deduced a trap composed of 64 places in 153 ms of which 2 ms to minimize.
[2024-05-29 12:03:43] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 2 ms to minimize.
[2024-05-29 12:03:44] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 2 ms to minimize.
[2024-05-29 12:03:44] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 2 ms to minimize.
[2024-05-29 12:03:44] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 2 ms to minimize.
[2024-05-29 12:03:44] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 2 ms to minimize.
[2024-05-29 12:03:44] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 1 ms to minimize.
[2024-05-29 12:03:44] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 1 ms to minimize.
[2024-05-29 12:03:44] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 2 ms to minimize.
[2024-05-29 12:03:45] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 1 ms to minimize.
[2024-05-29 12:03:45] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 2 ms to minimize.
[2024-05-29 12:03:45] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 1 ms to minimize.
[2024-05-29 12:03:45] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 2 ms to minimize.
[2024-05-29 12:03:45] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-05-29 12:03:45] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 2 ms to minimize.
[2024-05-29 12:03:46] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 12:03:51] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 2 ms to minimize.
[2024-05-29 12:03:51] [INFO ] Deduced a trap composed of 67 places in 162 ms of which 2 ms to minimize.
[2024-05-29 12:03:51] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 2 ms to minimize.
[2024-05-29 12:03:51] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 2 ms to minimize.
[2024-05-29 12:03:52] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 1 ms to minimize.
[2024-05-29 12:03:52] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 2 ms to minimize.
[2024-05-29 12:03:52] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 2 ms to minimize.
[2024-05-29 12:03:52] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 2 ms to minimize.
[2024-05-29 12:03:52] [INFO ] Deduced a trap composed of 67 places in 154 ms of which 2 ms to minimize.
[2024-05-29 12:03:52] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 1 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 2 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 2 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 2 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 2 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 2 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 2 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2024-05-29 12:03:54] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
[2024-05-29 12:03:54] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 1 ms to minimize.
[2024-05-29 12:03:54] [INFO ] Deduced a trap composed of 66 places in 156 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-05-29 12:03:55] [INFO ] Deduced a trap composed of 68 places in 180 ms of which 2 ms to minimize.
[2024-05-29 12:03:56] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 1 ms to minimize.
[2024-05-29 12:03:56] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 2 ms to minimize.
[2024-05-29 12:03:56] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 2 ms to minimize.
[2024-05-29 12:03:56] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 2 ms to minimize.
[2024-05-29 12:03:56] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 1 ms to minimize.
[2024-05-29 12:03:56] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2024-05-29 12:03:56] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 2 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 2 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 1 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 1 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 2 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 2 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 1 ms to minimize.
[2024-05-29 12:03:58] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 12:03:58] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 2 ms to minimize.
[2024-05-29 12:03:58] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 2 ms to minimize.
[2024-05-29 12:03:58] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 1 ms to minimize.
[2024-05-29 12:03:58] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 2 ms to minimize.
[2024-05-29 12:03:59] [INFO ] Deduced a trap composed of 63 places in 149 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
[2024-05-29 12:04:00] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 1 ms to minimize.
[2024-05-29 12:04:00] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 1 ms to minimize.
[2024-05-29 12:04:01] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 1 ms to minimize.
[2024-05-29 12:04:01] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 2 ms to minimize.
[2024-05-29 12:04:01] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 2 ms to minimize.
[2024-05-29 12:04:01] [INFO ] Deduced a trap composed of 68 places in 144 ms of which 2 ms to minimize.
[2024-05-29 12:04:01] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 1 ms to minimize.
[2024-05-29 12:04:01] [INFO ] Deduced a trap composed of 68 places in 154 ms of which 2 ms to minimize.
[2024-05-29 12:04:01] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 2 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 2 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 1 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 2 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 1 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 2 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 2 ms to minimize.
[2024-05-29 12:04:03] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 2 ms to minimize.
[2024-05-29 12:04:03] [INFO ] Deduced a trap composed of 69 places in 150 ms of which 2 ms to minimize.
SMT process timed out in 31347ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31371ms
Finished structural reductions in LIVENESS mode , in 1 iterations and 33750 ms. Remains : 121/121 places, 1111/1111 transitions.
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 6684 ms. (5 steps per ms) remains 856/1101 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 856/856 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 856/856 properties
[2024-05-29 12:04:05] [INFO ] Invariant cache hit.
[2024-05-29 12:04:05] [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, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 856 unsolved
[2024-05-29 12:04:10] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 2 ms to minimize.
[2024-05-29 12:04:10] [INFO ] Deduced a trap composed of 63 places in 150 ms of which 2 ms to minimize.
[2024-05-29 12:04:10] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 1 ms to minimize.
[2024-05-29 12:04:11] [INFO ] Deduced a trap composed of 63 places in 194 ms of which 1 ms to minimize.
SMT process timed out in 5863ms, After SMT, problems are : Problem set: 0 solved, 856 unsolved
Fused 856 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 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 29 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 29 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 1759870 steps (4 resets) in 120004 ms. (14 steps per ms) remains 835/856 properties
BEST_FIRST walk for 4000 steps (8 resets) in 259 ms. (15 steps per ms) remains 819/835 properties
BEST_FIRST walk for 4000 steps (8 resets) in 214 ms. (18 steps per ms) remains 803/819 properties
BEST_FIRST walk for 4000 steps (8 resets) in 191 ms. (20 steps per ms) remains 803/803 properties
BEST_FIRST walk for 4000 steps (8 resets) in 188 ms. (21 steps per ms) remains 793/803 properties
BEST_FIRST walk for 4000 steps (8 resets) in 196 ms. (20 steps per ms) remains 790/793 properties
BEST_FIRST walk for 4000 steps (8 resets) in 226 ms. (17 steps per ms) remains 787/790 properties
BEST_FIRST walk for 4000 steps (8 resets) in 193 ms. (20 steps per ms) remains 786/787 properties
BEST_FIRST walk for 4000 steps (8 resets) in 195 ms. (20 steps per ms) remains 783/786 properties
BEST_FIRST walk for 4000 steps (8 resets) in 189 ms. (21 steps per ms) remains 783/783 properties
BEST_FIRST walk for 4000 steps (8 resets) in 194 ms. (20 steps per ms) remains 781/783 properties
BEST_FIRST walk for 4000 steps (8 resets) in 190 ms. (20 steps per ms) remains 777/781 properties
BEST_FIRST walk for 4000 steps (8 resets) in 233 ms. (17 steps per ms) remains 776/777 properties
BEST_FIRST walk for 4000 steps (8 resets) in 302 ms. (13 steps per ms) remains 774/776 properties
BEST_FIRST walk for 4000 steps (8 resets) in 397 ms. (10 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 378 ms. (10 steps per ms) remains 773/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 297 ms. (13 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4000 steps (8 resets) in 308 ms. (12 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4000 steps (8 resets) in 299 ms. (13 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4000 steps (8 resets) in 369 ms. (10 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4000 steps (8 resets) in 308 ms. (12 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4000 steps (8 resets) in 251 ms. (15 steps per ms) remains 772/773 properties
BEST_FIRST walk for 4000 steps (8 resets) in 256 ms. (15 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 240 ms. (16 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 245 ms. (16 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 227 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 237 ms. (16 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 247 ms. (16 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 229 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 230 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 219 ms. (18 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 177 ms. (22 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 197 ms. (20 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 176 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 182 ms. (21 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 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 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 182 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 172 ms. (23 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 176 ms. (22 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 177 ms. (22 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 174 ms. (22 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 192 ms. (20 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 188 ms. (21 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 178 ms. (22 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 188 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 190 ms. (20 steps per ms) remains 771/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 188 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 169 ms. (23 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 184 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 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 173 ms. (22 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 177 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 181 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 171 ms. (23 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 181 ms. (21 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 170 ms. (23 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 172 ms. (23 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 191 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 171 ms. (23 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 167 ms. (23 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 246 ms. (16 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 263 ms. (15 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 293 ms. (13 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 264 ms. (15 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 279 ms. (14 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 258 ms. (15 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 261 ms. (15 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 196 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 200 ms. (19 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 195 ms. (20 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 200 ms. (19 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 187 ms. (21 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 191 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 182 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 178 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 178 ms. (22 steps per ms) remains 771/771 properties
[2024-05-29 12:04:47] [INFO ] Invariant cache hit.
[2024-05-29 12:04:47] [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-05-29 12:05:04] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 2 ms to minimize.
[2024-05-29 12:05:04] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 3 ms to minimize.
[2024-05-29 12:05:05] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 2 ms to minimize.
[2024-05-29 12:05:05] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 3 ms to minimize.
[2024-05-29 12:05:05] [INFO ] Deduced a trap composed of 66 places in 263 ms of which 3 ms to minimize.
[2024-05-29 12:05:05] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 2 ms to minimize.
[2024-05-29 12:05:06] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 3 ms to minimize.
[2024-05-29 12:05:06] [INFO ] Deduced a trap composed of 63 places in 228 ms of which 3 ms to minimize.
[2024-05-29 12:05:06] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 2 ms to minimize.
[2024-05-29 12:05:06] [INFO ] Deduced a trap composed of 63 places in 234 ms of which 2 ms to minimize.
[2024-05-29 12:05:07] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 2 ms to minimize.
[2024-05-29 12:05:07] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 3 ms to minimize.
[2024-05-29 12:05:07] [INFO ] Deduced a trap composed of 68 places in 210 ms of which 3 ms to minimize.
[2024-05-29 12:05:07] [INFO ] Deduced a trap composed of 68 places in 214 ms of which 2 ms to minimize.
[2024-05-29 12:05:08] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 2 ms to minimize.
[2024-05-29 12:05:08] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 3 ms to minimize.
[2024-05-29 12:05:08] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 2 ms to minimize.
[2024-05-29 12:05:08] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 2 ms to minimize.
[2024-05-29 12:05:09] [INFO ] Deduced a trap composed of 68 places in 216 ms of which 1 ms to minimize.
[2024-05-29 12:05:09] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-05-29 12:05:10] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 2 ms to minimize.
[2024-05-29 12:05:10] [INFO ] Deduced a trap composed of 63 places in 220 ms of which 2 ms to minimize.
[2024-05-29 12:05:10] [INFO ] Deduced a trap composed of 63 places in 256 ms of which 2 ms to minimize.
[2024-05-29 12:05:11] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 2 ms to minimize.
[2024-05-29 12:05:11] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 2 ms to minimize.
[2024-05-29 12:05:11] [INFO ] Deduced a trap composed of 67 places in 203 ms of which 1 ms to minimize.
[2024-05-29 12:05:11] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 1 ms to minimize.
[2024-05-29 12:05:11] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 3 ms to minimize.
[2024-05-29 12:05:12] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 5 ms to minimize.
[2024-05-29 12:05:12] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 2 ms to minimize.
[2024-05-29 12:05:12] [INFO ] Deduced a trap composed of 67 places in 226 ms of which 3 ms to minimize.
[2024-05-29 12:05:12] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 2 ms to minimize.
[2024-05-29 12:05:13] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 2 ms to minimize.
[2024-05-29 12:05:13] [INFO ] Deduced a trap composed of 66 places in 186 ms of which 1 ms to minimize.
[2024-05-29 12:05:13] [INFO ] Deduced a trap composed of 66 places in 190 ms of which 2 ms to minimize.
[2024-05-29 12:05:13] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 2 ms to minimize.
[2024-05-29 12:05:13] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 2 ms to minimize.
[2024-05-29 12:05:14] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 2 ms to minimize.
[2024-05-29 12:05:14] [INFO ] Deduced a trap composed of 68 places in 188 ms of which 2 ms to minimize.
[2024-05-29 12:05:14] [INFO ] Deduced a trap composed of 70 places in 188 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-05-29 12:05:19] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 2 ms to minimize.
[2024-05-29 12:05:19] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 2 ms to minimize.
[2024-05-29 12:05:19] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 1 ms to minimize.
[2024-05-29 12:05:19] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 2 ms to minimize.
[2024-05-29 12:05:19] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 2 ms to minimize.
[2024-05-29 12:05:19] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 2 ms to minimize.
[2024-05-29 12:05:20] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 2 ms to minimize.
[2024-05-29 12:05:20] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 2 ms to minimize.
[2024-05-29 12:05:20] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 2 ms to minimize.
[2024-05-29 12:05:20] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 3 ms to minimize.
[2024-05-29 12:05:21] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 2 ms to minimize.
[2024-05-29 12:05:21] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 3 ms to minimize.
[2024-05-29 12:05:21] [INFO ] Deduced a trap composed of 67 places in 239 ms of which 3 ms to minimize.
[2024-05-29 12:05:21] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 2 ms to minimize.
[2024-05-29 12:05:22] [INFO ] Deduced a trap composed of 67 places in 232 ms of which 2 ms to minimize.
[2024-05-29 12:05:22] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 3 ms to minimize.
[2024-05-29 12:05:22] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 3 ms to minimize.
[2024-05-29 12:05:22] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 2 ms to minimize.
[2024-05-29 12:05:23] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 2 ms to minimize.
[2024-05-29 12:05:23] [INFO ] Deduced a trap composed of 65 places in 313 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-05-29 12:05:26] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 2 ms to minimize.
[2024-05-29 12:05:26] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 3 ms to minimize.
[2024-05-29 12:05:27] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 2 ms to minimize.
[2024-05-29 12:05:27] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 2 ms to minimize.
[2024-05-29 12:05:27] [INFO ] Deduced a trap composed of 68 places in 251 ms of which 2 ms to minimize.
[2024-05-29 12:05:27] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 2 ms to minimize.
[2024-05-29 12:05:28] [INFO ] Deduced a trap composed of 63 places in 245 ms of which 2 ms to minimize.
[2024-05-29 12:05:28] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 3 ms to minimize.
[2024-05-29 12:05:28] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 3 ms to minimize.
[2024-05-29 12:05:28] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 3 ms to minimize.
[2024-05-29 12:05:29] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2024-05-29 12:05:29] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 2 ms to minimize.
[2024-05-29 12:05:29] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 4 ms to minimize.
[2024-05-29 12:05:29] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 2 ms to minimize.
[2024-05-29 12:05:30] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 2 ms to minimize.
[2024-05-29 12:05:30] [INFO ] Deduced a trap composed of 67 places in 232 ms of which 2 ms to minimize.
[2024-05-29 12:05:30] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 2 ms to minimize.
[2024-05-29 12:05:30] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 3 ms to minimize.
[2024-05-29 12:05:31] [INFO ] Deduced a trap composed of 66 places in 224 ms of which 2 ms to minimize.
[2024-05-29 12:05:31] [INFO ] Deduced a trap composed of 66 places in 244 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 212 constraints, problems are : Problem set: 0 solved, 771 unsolved in 45065 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: 771/771 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 771 unsolved
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, 16/145 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 4 (OVERLAPS) 2/121 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 64/212 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-05-29 12:05:49] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 2 ms to minimize.
[2024-05-29 12:05:49] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 2 ms to minimize.
[2024-05-29 12:05:50] [INFO ] Deduced a trap composed of 62 places in 151 ms of which 2 ms to minimize.
[2024-05-29 12:05:50] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 2 ms to minimize.
[2024-05-29 12:05:50] [INFO ] Deduced a trap composed of 64 places in 153 ms of which 1 ms to minimize.
[2024-05-29 12:05:50] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 2 ms to minimize.
[2024-05-29 12:05:50] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 2 ms to minimize.
[2024-05-29 12:05:50] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 2 ms to minimize.
[2024-05-29 12:05:50] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 1 ms to minimize.
[2024-05-29 12:05:51] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 3 ms to minimize.
[2024-05-29 12:05:51] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 1 ms to minimize.
[2024-05-29 12:05:51] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 2 ms to minimize.
[2024-05-29 12:05:51] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 2 ms to minimize.
[2024-05-29 12:05:52] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 1 ms to minimize.
[2024-05-29 12:05:52] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 2 ms to minimize.
[2024-05-29 12:05:52] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 1 ms to minimize.
[2024-05-29 12:05:52] [INFO ] Deduced a trap composed of 66 places in 143 ms of which 2 ms to minimize.
[2024-05-29 12:05:52] [INFO ] Deduced a trap composed of 68 places in 152 ms of which 1 ms to minimize.
[2024-05-29 12:05:53] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 3 ms to minimize.
[2024-05-29 12:05:53] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-05-29 12:05:55] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2024-05-29 12:05:55] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 1 ms to minimize.
[2024-05-29 12:05:55] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 1 ms to minimize.
[2024-05-29 12:05:55] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2024-05-29 12:05:56] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 2 ms to minimize.
[2024-05-29 12:05:56] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 1 ms to minimize.
[2024-05-29 12:05:56] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 2 ms to minimize.
[2024-05-29 12:05:56] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 2 ms to minimize.
[2024-05-29 12:05:56] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 2 ms to minimize.
[2024-05-29 12:05:56] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 1 ms to minimize.
[2024-05-29 12:05:57] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 1 ms to minimize.
[2024-05-29 12:05:57] [INFO ] Deduced a trap composed of 65 places in 147 ms of which 2 ms to minimize.
[2024-05-29 12:05:57] [INFO ] Deduced a trap composed of 65 places in 147 ms of which 2 ms to minimize.
[2024-05-29 12:05:57] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 2 ms to minimize.
[2024-05-29 12:05:57] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 1 ms to minimize.
[2024-05-29 12:05:57] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 2 ms to minimize.
[2024-05-29 12:05:57] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2024-05-29 12:05:58] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 2 ms to minimize.
[2024-05-29 12:05:58] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 1 ms to minimize.
[2024-05-29 12:05:58] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-05-29 12:06:01] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 1 ms to minimize.
[2024-05-29 12:06:01] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 1 ms to minimize.
[2024-05-29 12:06:01] [INFO ] Deduced a trap composed of 68 places in 142 ms of which 2 ms to minimize.
[2024-05-29 12:06:01] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 1 ms to minimize.
[2024-05-29 12:06:01] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2024-05-29 12:06:02] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 2 ms to minimize.
[2024-05-29 12:06:02] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 2 ms to minimize.
[2024-05-29 12:06:02] [INFO ] Deduced a trap composed of 62 places in 176 ms of which 2 ms to minimize.
[2024-05-29 12:06:02] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 1 ms to minimize.
[2024-05-29 12:06:02] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 2 ms to minimize.
[2024-05-29 12:06:02] [INFO ] Deduced a trap composed of 66 places in 174 ms of which 2 ms to minimize.
[2024-05-29 12:06:03] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 2 ms to minimize.
[2024-05-29 12:06:03] [INFO ] Deduced a trap composed of 64 places in 190 ms of which 2 ms to minimize.
[2024-05-29 12:06:03] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 3 ms to minimize.
[2024-05-29 12:06:03] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 3 ms to minimize.
[2024-05-29 12:06:04] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 3 ms to minimize.
[2024-05-29 12:06:04] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-05-29 12:06:04] [INFO ] Deduced a trap composed of 67 places in 198 ms of which 2 ms to minimize.
[2024-05-29 12:06:05] [INFO ] Deduced a trap composed of 67 places in 212 ms of which 4 ms to minimize.
[2024-05-29 12:06:05] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-05-29 12:06:09] [INFO ] Deduced a trap composed of 66 places in 149 ms of which 2 ms to minimize.
[2024-05-29 12:06:10] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 2 ms to minimize.
[2024-05-29 12:06:10] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 2 ms to minimize.
[2024-05-29 12:06:10] [INFO ] Deduced a trap composed of 61 places in 232 ms of which 2 ms to minimize.
[2024-05-29 12:06:10] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 2 ms to minimize.
[2024-05-29 12:06:11] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 3 ms to minimize.
[2024-05-29 12:06:11] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 2 ms to minimize.
[2024-05-29 12:06:11] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-05-29 12:06:11] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 3 ms to minimize.
[2024-05-29 12:06:12] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 3 ms to minimize.
[2024-05-29 12:06:12] [INFO ] Deduced a trap composed of 66 places in 264 ms of which 2 ms to minimize.
[2024-05-29 12:06:12] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 2 ms to minimize.
[2024-05-29 12:06:13] [INFO ] Deduced a trap composed of 63 places in 250 ms of which 2 ms to minimize.
[2024-05-29 12:06:13] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 3 ms to minimize.
[2024-05-29 12:06:13] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 2 ms to minimize.
[2024-05-29 12:06:13] [INFO ] Deduced a trap composed of 65 places in 334 ms of which 2 ms to minimize.
[2024-05-29 12:06:14] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 2 ms to minimize.
[2024-05-29 12:06:14] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 2 ms to minimize.
[2024-05-29 12:06:14] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 2 ms to minimize.
[2024-05-29 12:06:15] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 771 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/1232 variables, and 292 constraints, problems are : Problem set: 0 solved, 771 unsolved in 45030 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/771 constraints, Known Traps: 160/160 constraints]
After SMT, in 90768ms problems are : Problem set: 0 solved, 771 unsolved
Skipping Parikh replay, no witness traces provided.
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 26 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 27 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 1918677 steps (4 resets) in 120004 ms. (15 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 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 212 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 279 ms. (14 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 303 ms. (13 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 368 ms. (10 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 305 ms. (13 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 258 ms. (15 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 319 ms. (12 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 416 ms. (9 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 403 ms. (9 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 340 ms. (11 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 401 ms. (9 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 286 ms. (13 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 278 ms. (14 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 288 ms. (13 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 398 ms. (10 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 356 ms. (11 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 246 ms. (16 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 278 ms. (14 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 286 ms. (13 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 259 ms. (15 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 235 ms. (16 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 312 ms. (12 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 352 ms. (11 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 368 ms. (10 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 328 ms. (12 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 432 ms. (9 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 383 ms. (10 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 322 ms. (12 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 321 ms. (12 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 319 ms. (12 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 373 ms. (10 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 295 ms. (13 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 386 ms. (10 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 385 ms. (10 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 314 ms. (12 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 322 ms. (12 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 300 ms. (13 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 291 ms. (13 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 439 ms. (9 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 372 ms. (10 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 295 ms. (13 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 307 ms. (12 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 324 ms. (12 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 289 ms. (13 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 337 ms. (11 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 421 ms. (9 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 292 ms. (13 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 7772 ms. (steps per millisecond=45 ) 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 7923 ms. (steps per millisecond=44 ) properties seen :0
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 260886 ms.
ITS solved all properties within timeout

BK_STOP 1716984428925

--------------------
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="greatspnxred"
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 greatspnxred"
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 r430-smll-171690580700104"
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 ;