Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r252-tall-174915605600214.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
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 r252-tall-174915605600214
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 169K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 891K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 345K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 65K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 240K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 318K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 947K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 402K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.2M May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.8M May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 519K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1749200506161

Invoking MCC driver with
BK_TOOL=gold2024
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
[2025-06-06 09:01:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-06 09:01:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 09:01:47] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2025-06-06 09:01:47] [INFO ] Transformed 121 places.
[2025-06-06 09:01:47] [INFO ] Transformed 1111 transitions.
[2025-06-06 09:01:47] [INFO ] Found NUPN structural information;
[2025-06-06 09:01:47] [INFO ] Parsed PT model containing 121 places and 1111 transitions and 4444 arcs in 226 ms.
Built sparse matrix representations for Structural reductions in 9 ms.30778KB 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 65 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 80 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 26 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
// Phase 1: matrix 1111 rows 121 cols
[2025-06-06 09:01:47] [INFO ] Computed 11 invariants in 23 ms
[2025-06-06 09:01:48] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-06-06 09:01:48] [INFO ] Invariant cache hit.
[2025-06-06 09:01:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-06 09:01:48] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2025-06-06 09:01:48] [INFO ] Redundant transitions in 66 ms returned []
Running 1101 sub problems to find dead transitions.
[2025-06-06 09:01:48] [INFO ] Invariant cache hit.
[2025-06-06 09:01:48] [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
[2025-06-06 09:01:52] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 19 ms to minimize.
[2025-06-06 09:01:53] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2025-06-06 09:01:53] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:01:53] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:01:53] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2025-06-06 09:01:53] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:01:53] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 1 ms to minimize.
[2025-06-06 09:01:53] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:01:53] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:01:53] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 4 ms to minimize.
[2025-06-06 09:01:53] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2025-06-06 09:01:54] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:01:55] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:01:56] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:01:56] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:01:56] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:01:56] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:01:56] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:01:56] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:01:56] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:01:56] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:01:56] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:01:56] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:01:56] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:01:57] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:01:57] [INFO ] Deduced a trap composed of 65 places in 89 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
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 1 ms to minimize.
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:01] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:02] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2025-06-06 09:02:02] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:02] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:02] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:02] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:02] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:02] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:02] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:02] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:03] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:02:03] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:03] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:02:04] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:04] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:04] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:02:04] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:02:04] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:04] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:02:04] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:04] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:04] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:05] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:05] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2025-06-06 09:02:05] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:05] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:05] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:05] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:05] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:05] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:02:05] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:02:06] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:06] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:07] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:07] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:07] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:07] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:07] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:07] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:07] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2025-06-06 09:02:07] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:02:07] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:07] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:08] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:02:08] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:08] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:02:08] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:08] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 1 ms to minimize.
[2025-06-06 09:02:08] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2025-06-06 09:02:08] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:08] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:02:14] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
[2025-06-06 09:02:14] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:14] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:02:14] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:02:14] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:14] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:14] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:15] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:02:15] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:15] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:15] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 1 ms to minimize.
[2025-06-06 09:02:15] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:15] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2025-06-06 09:02:15] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:15] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:02:15] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:02:16] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:16] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:16] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:16] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:02:17] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2025-06-06 09:02:18] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:18] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:02:18] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:18] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:18] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:18] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:18] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:18] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:18] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:02:19] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:19] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:02:19] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:19] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:19] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:02:19] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:02:19] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:19] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
SMT process timed out in 31089ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31115ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 31885 ms. Remains : 121/121 places, 1111/1111 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2447 ms (no deadlock found). (steps per millisecond=510 )
Random directed walk for 1250000 steps, including 0 resets, run took 2307 ms (no deadlock found). (steps per millisecond=541 )
[2025-06-06 09:02:24] [INFO ] Invariant cache hit.
[2025-06-06 09:02:24] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 6 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2025-06-06 09:02:24] [INFO ] Invariant cache hit.
[2025-06-06 09:02:24] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-06 09:02:24] [INFO ] Invariant cache hit.
[2025-06-06 09:02:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2025-06-06 09:02:25] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2025-06-06 09:02:25] [INFO ] Invariant cache hit.
[2025-06-06 09:02:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:02:29] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:29] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:29] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:29] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:29] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 3 ms to minimize.
[2025-06-06 09:02:29] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:30] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 1 ms to minimize.
[2025-06-06 09:02:30] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:30] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:30] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:30] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:30] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:30] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:30] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:30] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:30] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:31] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:31] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:31] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:31] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:02:31] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:02:31] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:32] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:32] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:32] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:32] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:32] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:32] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:32] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2025-06-06 09:02:32] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:32] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:32] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2025-06-06 09:02:32] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:02:33] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:33] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:33] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:33] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:33] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:33] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:33] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:02:37] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:37] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2025-06-06 09:02:37] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
[2025-06-06 09:02:37] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:02:37] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:02:37] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:02:38] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:02:38] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:02:38] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:38] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 1 ms to minimize.
[2025-06-06 09:02:38] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:38] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2025-06-06 09:02:38] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:38] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:38] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:38] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:39] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:02:39] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:39] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:39] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:02:40] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:40] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:40] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:40] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:02:40] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:40] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 0 ms to minimize.
[2025-06-06 09:02:40] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:40] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:41] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:41] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:41] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:41] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:41] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:02:41] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:41] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:02:41] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:02:41] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:41] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:42] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:42] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:02:43] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:43] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:43] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:43] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:43] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:43] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:43] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:43] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:44] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 0 ms to minimize.
[2025-06-06 09:02:44] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:44] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:02:44] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:44] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:02:44] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2025-06-06 09:02:44] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:44] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:44] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:02:44] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:45] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:02:45] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:02:50] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:50] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:50] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:02:50] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:50] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:51] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:51] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:02:51] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:02:51] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:51] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:51] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:51] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:51] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 1 ms to minimize.
[2025-06-06 09:02:51] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:51] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:52] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:02:52] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2025-06-06 09:02:52] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 4 ms to minimize.
[2025-06-06 09:02:52] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:52] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:02:53] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:53] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:54] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:54] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:54] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:02:54] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:02:54] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:54] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:54] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:02:54] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:54] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:54] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:55] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2025-06-06 09:02:55] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:55] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:55] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:55] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:02:55] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:02:55] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:02:55] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 272 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30043 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 140/272 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:02:58] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:02:58] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 0 ms to minimize.
[2025-06-06 09:02:58] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:02:59] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 0 ms to minimize.
[2025-06-06 09:02:59] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:02:59] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 0 ms to minimize.
[2025-06-06 09:02:59] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 3 ms to minimize.
[2025-06-06 09:02:59] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:02:59] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:02:59] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:02:59] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:02:59] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:03:00] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:03:00] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:00] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:03:00] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2025-06-06 09:03:00] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:03:00] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:03:00] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:03:00] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:03:02] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:03:02] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2025-06-06 09:03:02] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:03:02] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:03:03] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:03:03] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:03] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:03:03] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:03] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:03:03] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:03:03] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:03:03] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:03] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:03:03] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:03:04] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:04] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:04] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 0 ms to minimize.
[2025-06-06 09:03:04] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 0 ms to minimize.
[2025-06-06 09:03:04] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:03:04] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/312 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:03:06] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 1 ms to minimize.
[2025-06-06 09:03:06] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2025-06-06 09:03:06] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 0 ms to minimize.
[2025-06-06 09:03:07] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:03:07] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:07] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:07] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:03:07] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2025-06-06 09:03:07] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:07] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:03:07] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 1 ms to minimize.
[2025-06-06 09:03:07] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:03:07] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:08] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 0 ms to minimize.
[2025-06-06 09:03:08] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:03:08] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 0 ms to minimize.
[2025-06-06 09:03:08] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:03:08] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:08] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 0 ms to minimize.
[2025-06-06 09:03:08] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/332 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:03:11] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 0 ms to minimize.
[2025-06-06 09:03:11] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:03:11] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 0 ms to minimize.
[2025-06-06 09:03:11] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:11] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:03:11] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:11] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:03:11] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:03:11] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:11] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:03:12] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:03:12] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:03:12] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 0 ms to minimize.
[2025-06-06 09:03:12] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:03:12] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 0 ms to minimize.
[2025-06-06 09:03:12] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:03:12] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:03:12] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:03:12] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:03:13] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/352 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:03:15] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:03:15] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:03:15] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:03:15] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:03:16] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:03:16] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 1 ms to minimize.
[2025-06-06 09:03:16] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:03:16] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:03:16] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:03:16] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:03:16] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:03:16] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:03:16] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:03:17] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:03:17] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:17] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:03:17] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2025-06-06 09:03:17] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:17] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2025-06-06 09:03:17] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:03:20] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:21] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:03:21] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:03:21] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:03:21] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:03:21] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:03:21] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:03:21] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:22] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:03:22] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:03:22] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:03:22] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:22] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:22] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:03:22] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:22] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:03:22] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:23] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:03:23] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:03:23] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2025-06-06 09:03:26] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:26] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/1232 variables, and 394 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30023 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 262/262 constraints]
After SMT, in 60755ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 60767ms
Finished structural reductions in LIVENESS mode , in 1 iterations and 61820 ms. Remains : 121/121 places, 1111/1111 transitions.
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 4171 ms. (9 steps per ms) remains 866/1101 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 866/866 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 866/866 properties
[2025-06-06 09:03:27] [INFO ] Invariant cache hit.
[2025-06-06 09:03:27] [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, 866 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 866 unsolved
[2025-06-06 09:03:30] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2025-06-06 09:03:30] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2025-06-06 09:03:31] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:03:31] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:03:31] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:31] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:03:31] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:03:31] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:31] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:03:31] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 0 ms to minimize.
[2025-06-06 09:03:31] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:03:31] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:03:31] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:03:32] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:03:32] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:03:32] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 0 ms to minimize.
[2025-06-06 09:03:32] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:32] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:03:32] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:03:32] [INFO ] Deduced a trap composed of 65 places in 88 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, 866 unsolved
[2025-06-06 09:03:32] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:03:33] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:03:33] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:03:33] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:03:33] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 0 ms to minimize.
[2025-06-06 09:03:33] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
SMT process timed out in 5688ms, After SMT, problems are : Problem set: 0 solved, 866 unsolved
Fused 866 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 14 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 16 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 2263575 steps (4 resets) in 120004 ms. (18 steps per ms) remains 827/866 properties
BEST_FIRST walk for 4000 steps (8 resets) in 151 ms. (26 steps per ms) remains 814/827 properties
BEST_FIRST walk for 4000 steps (8 resets) in 154 ms. (25 steps per ms) remains 797/814 properties
BEST_FIRST walk for 4000 steps (8 resets) in 219 ms. (18 steps per ms) remains 793/797 properties
BEST_FIRST walk for 4000 steps (8 resets) in 168 ms. (23 steps per ms) remains 790/793 properties
BEST_FIRST walk for 4000 steps (8 resets) in 206 ms. (19 steps per ms) remains 785/790 properties
BEST_FIRST walk for 4000 steps (8 resets) in 177 ms. (22 steps per ms) remains 783/785 properties
BEST_FIRST walk for 4000 steps (8 resets) in 148 ms. (26 steps per ms) remains 781/783 properties
BEST_FIRST walk for 4000 steps (8 resets) in 148 ms. (26 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4000 steps (8 resets) in 153 ms. (25 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4000 steps (8 resets) in 145 ms. (27 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4000 steps (8 resets) in 148 ms. (26 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4000 steps (8 resets) in 147 ms. (27 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4000 steps (8 resets) in 145 ms. (27 steps per ms) remains 780/781 properties
BEST_FIRST walk for 4000 steps (8 resets) in 139 ms. (28 steps per ms) remains 779/780 properties
BEST_FIRST walk for 4000 steps (8 resets) in 185 ms. (21 steps per ms) remains 776/779 properties
BEST_FIRST walk for 4000 steps (8 resets) in 181 ms. (21 steps per ms) remains 774/776 properties
BEST_FIRST walk for 4000 steps (8 resets) in 187 ms. (21 steps per ms) remains 772/774 properties
BEST_FIRST walk for 4000 steps (8 resets) in 151 ms. (26 steps per ms) remains 772/772 properties
BEST_FIRST walk for 4000 steps (8 resets) in 172 ms. (23 steps per ms) remains 771/772 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 165 ms. (24 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 158 ms. (25 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 150 ms. (26 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 145 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 140 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 140 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 150 ms. (26 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 144 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 166 ms. (23 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 158 ms. (25 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 142 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 144 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 136 ms. (29 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 142 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 137 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 141 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 143 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 149 ms. (26 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 147 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 139 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 143 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 145 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 148 ms. (26 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 135 ms. (29 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 137 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 141 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 166 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 158 ms. (25 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 146 ms. (27 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 161 ms. (24 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 203 ms. (19 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 209 ms. (19 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 184 ms. (21 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 163 ms. (24 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 157 ms. (25 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 208 ms. (19 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 151 ms. (26 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 151 ms. (26 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 149 ms. (26 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 150 ms. (26 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 152 ms. (26 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 141 ms. (28 steps per ms) remains 771/771 properties
[2025-06-06 09:04:06] [INFO ] Invariant cache hit.
[2025-06-06 09:04:06] [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
[2025-06-06 09:04:15] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:16] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:04:16] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:16] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:16] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:16] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:04:16] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:16] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:04:16] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:16] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 5 ms to minimize.
[2025-06-06 09:04:16] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:04:17] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:17] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:04:17] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:17] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:17] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:17] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:17] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:17] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:17] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2025-06-06 09:04:18] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:18] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:18] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:04:18] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:18] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 0 ms to minimize.
[2025-06-06 09:04:18] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:04:18] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:04:19] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 1 ms to minimize.
[2025-06-06 09:04:19] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:04:19] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:04:19] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:04:19] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:19] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:19] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:19] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:04:19] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:19] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:20] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 1 ms to minimize.
[2025-06-06 09:04:20] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:20] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2025-06-06 09:04:23] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2025-06-06 09:04:23] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:23] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:23] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 0 ms to minimize.
[2025-06-06 09:04:23] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 0 ms to minimize.
[2025-06-06 09:04:23] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:04:23] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 0 ms to minimize.
[2025-06-06 09:04:23] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:04:23] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:24] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:24] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:04:24] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:04:24] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:24] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:04:24] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:24] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:04:24] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 0 ms to minimize.
[2025-06-06 09:04:24] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 0 ms to minimize.
[2025-06-06 09:04:24] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:25] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2025-06-06 09:04:25] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:25] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:04:25] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:04:26] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:04:26] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:26] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:26] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:04:26] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:26] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:04:26] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:26] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:26] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:26] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:27] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:04:27] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:27] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:27] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:04:27] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 0 ms to minimize.
[2025-06-06 09:04:27] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:27] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2025-06-06 09:04:29] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:04:29] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:29] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:04:29] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:29] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:04:29] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 4 ms to minimize.
[2025-06-06 09:04:29] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2025-06-06 09:04:29] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:04:30] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:04:30] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:30] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:04:30] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:30] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:30] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2025-06-06 09:04:30] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:30] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:30] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:30] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:04:31] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:31] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2025-06-06 09:04:35] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:04:35] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:35] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:35] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:36] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:36] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:36] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:04:36] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:36] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:36] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:04:36] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:36] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:04:36] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:36] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:37] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:04:37] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:37] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:37] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:37] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:37] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2025-06-06 09:04:39] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2025-06-06 09:04:39] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 0 ms to minimize.
[2025-06-06 09:04:39] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:39] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:40] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:04:40] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2025-06-06 09:04:40] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:04:40] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:40] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 1 ms to minimize.
[2025-06-06 09:04:40] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:04:40] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2025-06-06 09:04:40] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2025-06-06 09:04:40] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:41] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:41] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2025-06-06 09:04:41] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:41] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2025-06-06 09:04:41] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2025-06-06 09:04:41] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:41] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2025-06-06 09:04:44] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2025-06-06 09:04:44] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:44] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:44] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:04:44] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:04:44] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:44] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2025-06-06 09:04:44] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:04:44] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2025-06-06 09:04:45] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:45] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2025-06-06 09:04:45] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2025-06-06 09:04:45] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2025-06-06 09:04:45] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:04:45] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2025-06-06 09:04:45] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2025-06-06 09:04:45] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 0 ms to minimize.
[2025-06-06 09:04:45] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2025-06-06 09:04:45] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2025-06-06 09:04:45] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2025-06-06 09:04:52] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
SMT process timed out in 45488ms, After SMT, problems are : Problem set: 0 solved, 771 unsolved
Fused 771 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 119 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 16 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 16 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 2455416 steps (4 resets) in 120004 ms. (20 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 142 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 143 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 143 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 143 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 141 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 144 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 142 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 141 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 142 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 143 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 141 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 142 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 137 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 140 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 139 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 138 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 142 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 139 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 139 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 137 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 144 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 139 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 141 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 138 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 143 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 144 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 138 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 138 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 144 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 134 ms. (29 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 141 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 144 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 144 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 136 ms. (29 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 141 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 142 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 139 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 138 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 138 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 140 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 140 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 144 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 162 ms. (24 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 144 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 140 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 138 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 140 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 140 ms. (28 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 142 ms. (27 steps per ms) remains 771/771 properties
BEST_FIRST walk for 4000 steps (8 resets) in 143 ms. (27 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 5117 ms. (steps per millisecond=68 ) 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 4923 ms. (steps per millisecond=71 ) properties seen :0
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 226814 ms.
ITS solved all properties within timeout

BK_STOP 1749200734271

--------------------
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="gold2024"
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-5832"
echo " Executing tool gold2024"
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 r252-tall-174915605600214"
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.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 ;