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-171690580700102.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 QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r430-smll-171690580700102
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1716984086551

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
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:01:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-29 12:01:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:01:29] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2024-05-29 12:01:29] [INFO ] Transformed 121 places.
[2024-05-29 12:01:29] [INFO ] Transformed 1111 transitions.
[2024-05-29 12:01:29] [INFO ] Found NUPN structural information;
[2024-05-29 12:01:29] [INFO ] Parsed PT model containing 121 places and 1111 transitions and 4444 arcs in 571 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 50 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:01:30] [INFO ] Computed 11 invariants in 47 ms
[2024-05-29 12:01:30] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-29 12:01:30] [INFO ] Invariant cache hit.
[2024-05-29 12:01:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 12:01:32] [INFO ] Implicit Places using invariants and state equation in 2202 ms returned []
Implicit Place search using SMT with State Equation took 2927 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 12:01:33] [INFO ] Invariant cache hit.
[2024-05-29 12:01:33] [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:01:42] [INFO ] Deduced a trap composed of 66 places in 291 ms of which 33 ms to minimize.
[2024-05-29 12:01:42] [INFO ] Deduced a trap composed of 67 places in 284 ms of which 3 ms to minimize.
[2024-05-29 12:01:42] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 4 ms to minimize.
[2024-05-29 12:01:42] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 3 ms to minimize.
[2024-05-29 12:01:43] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 2 ms to minimize.
[2024-05-29 12:01:43] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 2 ms to minimize.
[2024-05-29 12:01:43] [INFO ] Deduced a trap composed of 66 places in 220 ms of which 2 ms to minimize.
[2024-05-29 12:01:43] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 2 ms to minimize.
[2024-05-29 12:01:44] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 5 ms to minimize.
[2024-05-29 12:01:44] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 2 ms to minimize.
[2024-05-29 12:01:44] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 3 ms to minimize.
[2024-05-29 12:01:44] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 2 ms to minimize.
[2024-05-29 12:01:45] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 2 ms to minimize.
[2024-05-29 12:01:45] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 1 ms to minimize.
[2024-05-29 12:01:45] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 3 ms to minimize.
[2024-05-29 12:01:45] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 3 ms to minimize.
[2024-05-29 12:01:45] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 2 ms to minimize.
[2024-05-29 12:01:46] [INFO ] Deduced a trap composed of 63 places in 280 ms of which 3 ms to minimize.
[2024-05-29 12:01:46] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 2 ms to minimize.
[2024-05-29 12:01:46] [INFO ] Deduced a trap composed of 66 places in 179 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:01:47] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 3 ms to minimize.
[2024-05-29 12:01:48] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-05-29 12:01:48] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 2 ms to minimize.
[2024-05-29 12:01:48] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 3 ms to minimize.
[2024-05-29 12:01:49] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 3 ms to minimize.
[2024-05-29 12:01:49] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 2 ms to minimize.
[2024-05-29 12:01:49] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 3 ms to minimize.
[2024-05-29 12:01:49] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 2 ms to minimize.
[2024-05-29 12:01:50] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 3 ms to minimize.
[2024-05-29 12:01:50] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 3 ms to minimize.
[2024-05-29 12:01:50] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 2 ms to minimize.
[2024-05-29 12:01:50] [INFO ] Deduced a trap composed of 68 places in 242 ms of which 3 ms to minimize.
[2024-05-29 12:01:51] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 2 ms to minimize.
[2024-05-29 12:01:51] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 3 ms to minimize.
[2024-05-29 12:01:51] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 3 ms to minimize.
[2024-05-29 12:01:51] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 2 ms to minimize.
[2024-05-29 12:01:51] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 2 ms to minimize.
[2024-05-29 12:01:52] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 2 ms to minimize.
[2024-05-29 12:01:52] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 3 ms to minimize.
[2024-05-29 12:01:52] [INFO ] Deduced a trap composed of 65 places in 217 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:02:00] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 2 ms to minimize.
[2024-05-29 12:02:00] [INFO ] Deduced a trap composed of 67 places in 287 ms of which 2 ms to minimize.
[2024-05-29 12:02:00] [INFO ] Deduced a trap composed of 68 places in 252 ms of which 2 ms to minimize.
[2024-05-29 12:02:01] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 3 ms to minimize.
[2024-05-29 12:02:01] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 2 ms to minimize.
[2024-05-29 12:02:01] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 2 ms to minimize.
[2024-05-29 12:02:01] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 3 ms to minimize.
[2024-05-29 12:02:02] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 3 ms to minimize.
[2024-05-29 12:02:02] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 3 ms to minimize.
[2024-05-29 12:02:02] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 2 ms to minimize.
[2024-05-29 12:02:03] [INFO ] Deduced a trap composed of 68 places in 257 ms of which 2 ms to minimize.
[2024-05-29 12:02:03] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 3 ms to minimize.
[2024-05-29 12:02:03] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 2 ms to minimize.
[2024-05-29 12:02:03] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 3 ms to minimize.
[2024-05-29 12:02:04] [INFO ] Deduced a trap composed of 67 places in 264 ms of which 2 ms to minimize.
[2024-05-29 12:02:04] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-05-29 12:02:04] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 4 ms to minimize.
[2024-05-29 12:02:04] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 2 ms to minimize.
SMT process timed out in 31873ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31957ms
Finished structural reductions in LIVENESS mode , in 1 iterations and 35022 ms. Remains : 121/121 places, 1111/1111 transitions.
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 7974 ms. (5 steps per ms) remains 862/1101 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 862/862 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 862/862 properties
[2024-05-29 12:02:07] [INFO ] Invariant cache hit.
[2024-05-29 12:02:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 862 unsolved
SMT process timed out in 6083ms, After SMT, problems are : Problem set: 0 solved, 862 unsolved
Skipping Parikh replay, no witness traces provided.
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 76 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 76 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 1813206 steps (4 resets) in 120004 ms. (15 steps per ms) remains 830/862 properties
BEST_FIRST walk for 4000 steps (8 resets) in 274 ms. (14 steps per ms) remains 820/830 properties
BEST_FIRST walk for 4000 steps (8 resets) in 226 ms. (17 steps per ms) remains 808/820 properties
BEST_FIRST walk for 4000 steps (8 resets) in 303 ms. (13 steps per ms) remains 807/808 properties
BEST_FIRST walk for 4000 steps (8 resets) in 267 ms. (14 steps per ms) remains 794/807 properties
BEST_FIRST walk for 4000 steps (8 resets) in 217 ms. (18 steps per ms) remains 788/794 properties
BEST_FIRST walk for 4000 steps (8 resets) in 222 ms. (17 steps per ms) remains 787/788 properties
BEST_FIRST walk for 4000 steps (8 resets) in 229 ms. (17 steps per ms) remains 786/787 properties
BEST_FIRST walk for 4000 steps (8 resets) in 220 ms. (18 steps per ms) remains 785/786 properties
BEST_FIRST walk for 4000 steps (8 resets) in 228 ms. (17 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4000 steps (8 resets) in 228 ms. (17 steps per ms) remains 784/785 properties
BEST_FIRST walk for 4000 steps (8 resets) in 219 ms. (18 steps per ms) remains 784/784 properties
BEST_FIRST walk for 4000 steps (8 resets) in 219 ms. (18 steps per ms) remains 784/784 properties
BEST_FIRST walk for 4000 steps (8 resets) in 276 ms. (14 steps per ms) remains 784/784 properties
BEST_FIRST walk for 4000 steps (8 resets) in 272 ms. (14 steps per ms) remains 782/784 properties
BEST_FIRST walk for 4000 steps (8 resets) in 295 ms. (13 steps per ms) remains 782/782 properties
BEST_FIRST walk for 4000 steps (8 resets) in 266 ms. (14 steps per ms) remains 780/782 properties
BEST_FIRST walk for 4000 steps (8 resets) in 254 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 4000 steps (8 resets) in 277 ms. (14 steps per ms) remains 779/780 properties
BEST_FIRST walk for 4000 steps (8 resets) in 280 ms. (14 steps per ms) remains 779/779 properties
BEST_FIRST walk for 4000 steps (8 resets) in 256 ms. (15 steps per ms) remains 779/779 properties
BEST_FIRST walk for 4000 steps (8 resets) in 331 ms. (12 steps per ms) remains 777/779 properties
BEST_FIRST walk for 4000 steps (8 resets) in 360 ms. (11 steps per ms) remains 777/777 properties
BEST_FIRST walk for 4000 steps (8 resets) in 402 ms. (9 steps per ms) remains 777/777 properties
BEST_FIRST walk for 4000 steps (8 resets) in 358 ms. (11 steps per ms) remains 777/777 properties
BEST_FIRST walk for 4000 steps (8 resets) in 260 ms. (15 steps per ms) remains 773/777 properties
BEST_FIRST walk for 4000 steps (8 resets) in 214 ms. (18 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4000 steps (8 resets) in 216 ms. (18 steps per ms) remains 772/773 properties
BEST_FIRST walk for 4000 steps (8 resets) in 207 ms. (19 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 208 ms. (19 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 199 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 191 ms. (20 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 180 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 191 ms. (20 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 186 ms. (21 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 195 ms. (20 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 210 ms. (18 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 230 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 226 ms. (17 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 233 ms. (17 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 217 ms. (18 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 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 181 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 771/772 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 178 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 188 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 188 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 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 186 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 177 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 184 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 178 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 183 ms. (21 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 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 181 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 203 ms. (19 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 181 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 214 ms. (18 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 225 ms. (17 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 227 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 250 ms. (15 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 236 ms. (16 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 214 ms. (18 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 220 ms. (18 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 221 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 215 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 171 ms. (23 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
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 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 183 ms. (21 steps per ms) remains 771/771 properties
[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/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:03:07] [INFO ] Deduced a trap composed of 66 places in 212 ms of which 3 ms to minimize.
[2024-05-29 12:03:08] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 2 ms to minimize.
[2024-05-29 12:03:08] [INFO ] Deduced a trap composed of 63 places in 227 ms of which 3 ms to minimize.
[2024-05-29 12:03:08] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 2 ms to minimize.
[2024-05-29 12:03:08] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 3 ms to minimize.
[2024-05-29 12:03:09] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 4 ms to minimize.
[2024-05-29 12:03:09] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 2 ms to minimize.
[2024-05-29 12:03:09] [INFO ] Deduced a trap composed of 63 places in 177 ms of which 1 ms to minimize.
[2024-05-29 12:03:09] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 2 ms to minimize.
[2024-05-29 12:03:09] [INFO ] Deduced a trap composed of 63 places in 176 ms of which 2 ms to minimize.
[2024-05-29 12:03:10] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 2 ms to minimize.
[2024-05-29 12:03:10] [INFO ] Deduced a trap composed of 66 places in 203 ms of which 2 ms to minimize.
[2024-05-29 12:03:10] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 3 ms to minimize.
[2024-05-29 12:03:10] [INFO ] Deduced a trap composed of 68 places in 259 ms of which 2 ms to minimize.
[2024-05-29 12:03:11] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 3 ms to minimize.
[2024-05-29 12:03:11] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 2 ms to minimize.
[2024-05-29 12:03:11] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 12:03:12] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 3 ms to minimize.
[2024-05-29 12:03:12] [INFO ] Deduced a trap composed of 68 places in 237 ms of which 2 ms to minimize.
[2024-05-29 12:03:12] [INFO ] Deduced a trap composed of 68 places in 234 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:03:13] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-05-29 12:03:14] [INFO ] Deduced a trap composed of 63 places in 259 ms of which 3 ms to minimize.
[2024-05-29 12:03:14] [INFO ] Deduced a trap composed of 63 places in 202 ms of which 2 ms to minimize.
[2024-05-29 12:03:14] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 2 ms to minimize.
[2024-05-29 12:03:14] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 2 ms to minimize.
[2024-05-29 12:03:15] [INFO ] Deduced a trap composed of 67 places in 281 ms of which 3 ms to minimize.
[2024-05-29 12:03:15] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 3 ms to minimize.
[2024-05-29 12:03:15] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 12:03:16] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 3 ms to minimize.
[2024-05-29 12:03:16] [INFO ] Deduced a trap composed of 63 places in 258 ms of which 2 ms to minimize.
[2024-05-29 12:03:16] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 3 ms to minimize.
[2024-05-29 12:03:16] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 2 ms to minimize.
[2024-05-29 12:03:17] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 3 ms to minimize.
[2024-05-29 12:03:17] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 5 ms to minimize.
[2024-05-29 12:03:17] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 2 ms to minimize.
[2024-05-29 12:03:17] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 3 ms to minimize.
[2024-05-29 12:03:18] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 3 ms to minimize.
[2024-05-29 12:03:18] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 2 ms to minimize.
[2024-05-29 12:03:18] [INFO ] Deduced a trap composed of 68 places in 252 ms of which 2 ms to minimize.
[2024-05-29 12:03:18] [INFO ] Deduced a trap composed of 70 places in 229 ms of which 4 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:03:24] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 2 ms to minimize.
[2024-05-29 12:03:24] [INFO ] Deduced a trap composed of 63 places in 151 ms of which 2 ms to minimize.
[2024-05-29 12:03:25] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 3 ms to minimize.
[2024-05-29 12:03:25] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 2 ms to minimize.
[2024-05-29 12:03:25] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 1 ms to minimize.
[2024-05-29 12:03:25] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 2 ms to minimize.
[2024-05-29 12:03:25] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 2 ms to minimize.
[2024-05-29 12:03:26] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 1 ms to minimize.
[2024-05-29 12:03:26] [INFO ] Deduced a trap composed of 66 places in 157 ms of which 2 ms to minimize.
[2024-05-29 12:03:26] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 3 ms to minimize.
[2024-05-29 12:03:26] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 3 ms to minimize.
[2024-05-29 12:03:26] [INFO ] Deduced a trap composed of 67 places in 224 ms of which 2 ms to minimize.
[2024-05-29 12:03:27] [INFO ] Deduced a trap composed of 67 places in 194 ms of which 2 ms to minimize.
[2024-05-29 12:03:27] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 3 ms to minimize.
[2024-05-29 12:03:27] [INFO ] Deduced a trap composed of 67 places in 195 ms of which 2 ms to minimize.
[2024-05-29 12:03:27] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 3 ms to minimize.
[2024-05-29 12:03:28] [INFO ] Deduced a trap composed of 67 places in 203 ms of which 3 ms to minimize.
[2024-05-29 12:03:28] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 3 ms to minimize.
[2024-05-29 12:03:28] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 2 ms to minimize.
[2024-05-29 12:03:28] [INFO ] Deduced a trap composed of 65 places in 204 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:03:31] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 2 ms to minimize.
[2024-05-29 12:03:31] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 3 ms to minimize.
[2024-05-29 12:03:31] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 2 ms to minimize.
[2024-05-29 12:03:32] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 3 ms to minimize.
[2024-05-29 12:03:32] [INFO ] Deduced a trap composed of 68 places in 241 ms of which 2 ms to minimize.
[2024-05-29 12:03:32] [INFO ] Deduced a trap composed of 64 places in 217 ms of which 2 ms to minimize.
[2024-05-29 12:03:32] [INFO ] Deduced a trap composed of 63 places in 239 ms of which 2 ms to minimize.
[2024-05-29 12:03:32] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 1 ms to minimize.
[2024-05-29 12:03:33] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 2 ms to minimize.
[2024-05-29 12:03:33] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 3 ms to minimize.
[2024-05-29 12:03:33] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 2 ms to minimize.
[2024-05-29 12:03:33] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 3 ms to minimize.
[2024-05-29 12:03:34] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 2 ms to minimize.
[2024-05-29 12:03:34] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 2 ms to minimize.
[2024-05-29 12:03:34] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 3 ms to minimize.
[2024-05-29 12:03:34] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 3 ms to minimize.
[2024-05-29 12:03:35] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 3 ms to minimize.
[2024-05-29 12:03:35] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 3 ms to minimize.
[2024-05-29 12:03:35] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 2 ms to minimize.
[2024-05-29 12:03:35] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 2 ms to minimize.
SMT process timed out in 45723ms, After SMT, problems are : Problem set: 0 solved, 771 unsolved
Fused 771 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 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 45 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 45 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 1960726 steps (4 resets) in 120004 ms. (16 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 180 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 172 ms. (23 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 168 ms. (23 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 217 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 217 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 212 ms. (18 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 219 ms. (18 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 172 ms. (23 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 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 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 168 ms. (23 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 174 ms. (22 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 231 ms. (17 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 217 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 227 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 219 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 215 ms. (18 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 209 ms. (19 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 210 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 215 ms. (18 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 209 ms. (19 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 209 ms. (19 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 215 ms. (18 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 210 ms. (18 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 180 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 183 ms. (21 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 174 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 170 ms. (23 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
Probably explored full state space saw : 58904 states, properties seen :0
Probabilistic random walk after 352949 steps, saw 58904 distinct states, run finished after 7644 ms. (steps per millisecond=46 ) 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 7204 ms. (steps per millisecond=48 ) properties seen :0
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK EXHAUSTIVE_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 174366 ms.
ITS solved all properties within timeout

BK_STOP 1716984263711

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