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.r084-tall-174860080700484.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 EisenbergMcGuire-PT-05, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080700484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 460K May 29 14:32 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 1748741230834

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:27:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-01 01:27:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:27:12] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2025-06-01 01:27:12] [INFO ] Transformed 295 places.
[2025-06-01 01:27:12] [INFO ] Transformed 800 transitions.
[2025-06-01 01:27:12] [INFO ] Found NUPN structural information;
[2025-06-01 01:27:12] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 247 ms.
Built sparse matrix representations for Structural reductions in 8 ms.24444KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 295/295 places, 800/800 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 72 ms. Remains 295 /295 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 86 ms. Remains : 295/295 places, 800/800 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 295/295 places, 800/800 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 28 ms. Remains 295 /295 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2025-06-01 01:27:12] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2025-06-01 01:27:12] [INFO ] Computed 16 invariants in 21 ms
[2025-06-01 01:27:13] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-01 01:27:13] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
[2025-06-01 01:27:13] [INFO ] Invariant cache hit.
[2025-06-01 01:27:13] [INFO ] State equation strengthened by 196 read => feed constraints.
[2025-06-01 01:27:13] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2025-06-01 01:27:13] [INFO ] Redundant transitions in 42 ms returned []
Running 795 sub problems to find dead transitions.
[2025-06-01 01:27:13] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
[2025-06-01 01:27:13] [INFO ] Invariant cache hit.
[2025-06-01 01:27:13] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 295/295 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 11/306 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 22 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 20/331 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2025-06-01 01:27:25] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:27:27] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:27:27] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:27:27] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:27:27] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:27:27] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:27:27] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 6 ms to minimize.
[2025-06-01 01:27:27] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:27:28] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:27:28] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:27:28] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:27:28] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2025-06-01 01:27:29] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:27:29] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:27:29] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:27:29] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:27:29] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:27:31] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 4 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:27:32] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:27:33] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2025-06-01 01:27:34] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:27:34] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:27:34] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:27:34] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:27:34] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:27:35] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:27:36] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:27:36] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:27:36] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:27:36] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:27:38] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:27:38] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:27:38] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:27:38] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:27:38] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2025-06-01 01:27:38] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:27:39] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:27:39] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:27:39] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:27:40] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/760 variables, and 391 constraints, problems are : Problem set: 0 solved, 795 unsolved in 30035 ms.
Refiners :[Domain max(s): 295/295 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/295 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 795 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 295/295 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 11/306 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 80/391 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2025-06-01 01:27:46] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:27:47] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:27:47] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:27:47] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:27:47] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:27:48] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:27:48] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:27:48] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:27:48] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:27:48] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:27:48] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:27:48] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:27:49] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:27:49] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:27:50] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:27:50] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:27:50] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:27:51] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:27:51] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2025-06-01 01:27:51] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 20/411 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2025-06-01 01:27:52] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:27:52] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:27:53] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:27:53] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:27:56] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:27:56] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:27:57] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:27:57] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:27:57] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:27:57] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:27:57] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
[2025-06-01 01:27:57] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:27:58] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:27:58] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:27:58] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:27:58] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 0 ms to minimize.
[2025-06-01 01:27:59] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:27:59] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:27:59] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:27:59] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 20/431 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2025-06-01 01:28:01] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:28:01] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:28:02] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2025-06-01 01:28:02] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:28:04] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:28:05] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2025-06-01 01:28:07] [INFO ] Deduced a trap composed of 68 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:28:07] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:28:07] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:28:07] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:28:08] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:28:08] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:28:09] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:28:09] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:28:09] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 6 ms to minimize.
[2025-06-01 01:28:11] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 20/451 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/760 variables, and 451 constraints, problems are : Problem set: 0 solved, 795 unsolved in 30035 ms.
Refiners :[Domain max(s): 295/295 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/295 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 0/795 constraints, Known Traps: 140/140 constraints]
After SMT, in 60458ms problems are : Problem set: 0 solved, 795 unsolved
Search for dead transitions found 0 dead transitions in 60485ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61125 ms. Remains : 295/295 places, 800/800 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2798 ms (no deadlock found). (steps per millisecond=446 )
Random directed walk for 1250005 steps, including 0 resets, run took 2123 ms (no deadlock found). (steps per millisecond=588 )
[2025-06-01 01:28:18] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
[2025-06-01 01:28:18] [INFO ] Invariant cache hit.
[2025-06-01 01:28:19] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-06-01 01:28:19] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 22 ms returned sat
[2025-06-01 01:28:19] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2025-06-01 01:28:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 01:28:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-06-01 01:28:19] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 10 ms returned sat
[2025-06-01 01:28:19] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2025-06-01 01:28:19] [INFO ] State equation strengthened by 196 read => feed constraints.
[2025-06-01 01:28:19] [INFO ] [Nat]Added 196 Read/Feed constraints in 23 ms returned sat
[2025-06-01 01:28:20] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:28:20] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:28:20] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:28:20] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 3 ms to minimize.
[2025-06-01 01:28:20] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:28:20] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:28:20] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:28:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 1102 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 295/295 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 295 transition count 795
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 795
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 290 transition count 715
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 210 transition count 715
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 190 transition count 695
Applied a total of 210 rules in 48 ms. Remains 190 /295 variables (removed 105) and now considering 695/800 (removed 105) transitions.
[2025-06-01 01:28:21] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
// Phase 1: matrix 360 rows 190 cols
[2025-06-01 01:28:21] [INFO ] Computed 16 invariants in 3 ms
[2025-06-01 01:28:21] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-01 01:28:21] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2025-06-01 01:28:21] [INFO ] Invariant cache hit.
[2025-06-01 01:28:21] [INFO ] State equation strengthened by 196 read => feed constraints.
[2025-06-01 01:28:21] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2025-06-01 01:28:21] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2025-06-01 01:28:21] [INFO ] Invariant cache hit.
[2025-06-01 01:28:21] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 11/201 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:28:24] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2025-06-01 01:28:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:28:24] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2025-06-01 01:28:24] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:28:25] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:28:25] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:28:25] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:28:25] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:28:25] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:28:26] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:28:26] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2025-06-01 01:28:26] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:28:26] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:28:26] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:28:26] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:28:26] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:28:26] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:28:26] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:28:27] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:28:27] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:28:30] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:28:30] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:28:30] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:28:30] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2025-06-01 01:28:30] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:28:30] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:28:31] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:28:31] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:28:31] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:28:31] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2025-06-01 01:28:31] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:28:31] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:28:32] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2025-06-01 01:28:32] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:28:32] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:28:32] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:28:32] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:28:32] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:28:32] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:28:33] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:28:36] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2025-06-01 01:28:36] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:28:37] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:28:37] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2025-06-01 01:28:37] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:28:37] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2025-06-01 01:28:37] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:28:37] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:28:38] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:28:38] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:28:38] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:28:38] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:28:38] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:28:38] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:28:38] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:28:38] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:28:38] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:28:39] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:28:39] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:28:39] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:28:39] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:28:39] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/286 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:28:43] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:28:44] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2025-06-01 01:28:44] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2025-06-01 01:28:44] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:28:44] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:28:44] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:28:44] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:28:44] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:28:45] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:28:45] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:28:45] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:28:45] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:28:45] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:28:45] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:28:46] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:28:46] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:28:46] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:28:46] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2025-06-01 01:28:46] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2025-06-01 01:28:46] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:28:48] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:28:48] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 2 ms to minimize.
[2025-06-01 01:28:48] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:28:48] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:28:48] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:28:49] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:28:49] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:28:49] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2025-06-01 01:28:49] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 3 ms to minimize.
[2025-06-01 01:28:50] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:28:50] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:28:50] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2025-06-01 01:28:50] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2025-06-01 01:28:50] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:28:51] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:28:51] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:28:51] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/550 variables, and 323 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30019 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 117/117 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 11/201 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 117/323 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:28:54] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:28:54] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:28:55] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:28:55] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:28:55] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:28:56] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 3 ms to minimize.
[2025-06-01 01:28:57] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:28:57] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:28:57] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:28:57] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:28:57] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 11/334 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:29:02] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:29:04] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:29:05] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 9/343 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:29:07] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:29:08] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:29:09] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:29:10] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:29:10] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:29:10] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2025-06-01 01:29:10] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:29:10] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:29:11] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:29:11] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:29:11] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2025-06-01 01:29:11] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:29:12] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:29:12] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 14/357 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:29:15] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:29:15] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:29:16] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:29:16] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:29:17] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:29:17] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:29:17] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:29:17] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:29:18] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:29:18] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:29:19] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 11/368 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/550 variables, and 368 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30015 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 0/690 constraints, Known Traps: 162/162 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60273ms
Starting structural reductions in LIVENESS mode, iteration 1 : 190/295 places, 695/800 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 61091 ms. Remains : 190/295 places, 695/800 transitions.
Initial state reduction rules removed 5 formulas.
RANDOM walk for 40000 steps (8 resets) in 2610 ms. (15 steps per ms) remains 495/690 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 495/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 494/495 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 494/494 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 494/494 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 494/494 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 494/494 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 494/494 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 494/494 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 494/494 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 494/494 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 494/494 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 494/494 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 493/494 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 493/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 492/493 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 492/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 491/492 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 491/491 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 491/491 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 491/491 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 491/491 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 491/491 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 491/491 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 491/491 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 491/491 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 491/491 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 491/491 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/491 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 490/490 properties
[2025-06-01 01:29:23] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2025-06-01 01:29:23] [INFO ] Invariant cache hit.
[2025-06-01 01:29:23] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (OVERLAPS) 53/190 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 53/201 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2025-06-01 01:29:28] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:29:28] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:29:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/550 variables, and 209 constraints, problems are : Problem set: 0 solved, 490 unsolved in 5018 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (OVERLAPS) 53/190 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 53/201 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2025-06-01 01:29:30] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:29:31] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2025-06-01 01:29:31] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2025-06-01 01:29:31] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:29:31] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:29:31] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:29:31] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:29:31] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:29:31] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:29:31] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:29:31] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:29:31] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:29:31] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:29:31] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2025-06-01 01:29:32] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:29:32] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:29:32] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:29:32] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:29:32] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:29:32] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2025-06-01 01:29:33] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:29:33] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:29:33] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:29:33] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
SMT process timed out in 10275ms, After SMT, problems are : Problem set: 0 solved, 490 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 137 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 695/695 transitions.
Applied a total of 0 rules in 15 ms. Remains 190 /190 variables (removed 0) and now considering 695/695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 190/190 places, 695/695 transitions.
RANDOM walk for 4000000 steps (8 resets) in 109313 ms. (36 steps per ms) remains 470/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 470/470 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 470/470 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 470/470 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 463/470 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 461/463 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 460/461 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 458/460 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 458/458 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 453/458 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 453/453 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 453/453 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 453/453 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 453/453 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 452/453 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 452/452 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 452/452 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 451/452 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 451/451 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 451/451 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 451/451 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 451/451 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 451/451 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 451/451 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 448/451 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 446/448 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 444/446 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 444/444 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 443/444 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 443/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 442/443 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 441/442 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 441/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 440/441 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 440/440 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 440/440 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 440/440 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 439/440 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 438/439 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 437/438 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 437/437 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 437/437 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 437/437 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 437/437 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 437/437 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 437/437 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 431/437 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 431/431 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 431/431 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 425/431 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 425/425 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 425/425 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 419/425 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 419/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 414/419 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 414/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 413/414 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 413/413 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 413/413 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 409/413 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 409/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 408/409 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 408/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 407/408 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 403/407 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 403/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 402/403 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 402/402 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 402/402 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 402/402 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 402/402 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 400/402 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 400/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 399/400 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 399/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 395/399 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 395/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 394/395 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 392/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 392/392 properties
[2025-06-01 01:30:12] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2025-06-01 01:30:12] [INFO ] Invariant cache hit.
[2025-06-01 01:30:12] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 74/190 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 74/201 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-06-01 01:30:16] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:30:16] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2025-06-01 01:30:16] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2025-06-01 01:30:16] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:30:16] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:30:16] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:30:16] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:30:16] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:30:16] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:30:17] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:30:17] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:30:17] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:30:17] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:30:17] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2025-06-01 01:30:17] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:30:17] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2025-06-01 01:30:17] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:30:17] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:30:17] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:30:17] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-06-01 01:30:19] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:30:19] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:30:19] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 2 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:30:21] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:30:21] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:30:21] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:30:21] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:30:21] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:30:21] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-06-01 01:30:22] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:30:22] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:30:22] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:30:22] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
[2025-06-01 01:30:22] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:30:22] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:30:22] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:30:22] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:30:22] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-06-01 01:30:24] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2025-06-01 01:30:24] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:30:24] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2025-06-01 01:30:24] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 20/286 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:30:31] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:30:31] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:30:31] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:30:31] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 9/295 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-06-01 01:30:32] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:30:32] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:30:32] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:30:32] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:30:32] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2025-06-01 01:30:32] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:30:33] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:30:33] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2025-06-01 01:30:33] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:30:33] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:30:33] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:30:33] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:30:33] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-06-01 01:30:35] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 1 ms to minimize.
[2025-06-01 01:30:36] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:30:36] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:30:36] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:30:36] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:30:36] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:30:36] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:30:36] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:30:37] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2025-06-01 01:30:37] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:30:37] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:30:37] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:30:38] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2025-06-01 01:30:38] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 14/329 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-06-01 01:30:41] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:30:42] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:30:42] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:30:42] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:30:43] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:30:43] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:30:44] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-06-01 01:30:45] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:30:46] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:30:46] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:30:47] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:30:47] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:30:47] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2025-06-01 01:30:47] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:30:47] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:30:48] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:30:48] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:30:48] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:30:48] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:30:49] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 13/349 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-06-01 01:30:50] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:30:51] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:30:51] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:30:51] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:30:51] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:30:52] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2025-06-01 01:30:56] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:30:57] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:30:57] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:30:57] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:30:57] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
SMT process timed out in 45205ms, After SMT, problems are : Problem set: 0 solved, 392 unsolved
Fused 392 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 116 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 695/695 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 188 transition count 685
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 188 transition count 685
Applied a total of 4 rules in 33 ms. Remains 188 /190 variables (removed 2) and now considering 685/695 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 188/190 places, 685/695 transitions.
RANDOM walk for 4000000 steps (8 resets) in 91924 ms. (43 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 392/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 391/392 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 390/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 390/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 389/390 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 386/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 386/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 385/386 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 385/385 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 385/385 properties
Probabilistic random walk after 10000001 steps, saw 1757143 distinct states, run finished after 75542 ms. (steps per millisecond=132 ) properties seen :265
[2025-06-01 01:32:43] [INFO ] Flow matrix only has 350 transitions (discarded 335 similar events)
// Phase 1: matrix 350 rows 188 cols
[2025-06-01 01:32:43] [INFO ] Computed 16 invariants in 1 ms
[2025-06-01 01:32:43] [INFO ] State equation strengthened by 188 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 135/188 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2025-06-01 01:32:44] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:32:45] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:32:46] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2025-06-01 01:32:46] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:32:46] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:32:46] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:32:46] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2025-06-01 01:32:46] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:32:46] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2025-06-01 01:32:47] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:32:47] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:32:47] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2025-06-01 01:32:47] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:32:47] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:32:47] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2025-06-01 01:32:48] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:32:48] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2025-06-01 01:32:49] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:32:49] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 350/538 variables, 188/236 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 188/424 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2025-06-01 01:32:51] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:32:51] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:32:52] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:32:53] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 4/428 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2025-06-01 01:32:54] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:32:54] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (OVERLAPS) 0/538 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 430 constraints, problems are : Problem set: 0 solved, 120 unsolved in 16006 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 188/188 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 135/188 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 350/538 variables, 188/242 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 188/430 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 120/550 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2025-06-01 01:33:02] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:33:02] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 2/552 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2025-06-01 01:33:04] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:33:05] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:33:05] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2025-06-01 01:33:10] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/538 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2025-06-01 01:33:13] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:33:14] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:33:14] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:33:14] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:33:14] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:33:14] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 6/562 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (OVERLAPS) 0/538 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 562 constraints, problems are : Problem set: 0 solved, 120 unsolved in 24805 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 188/188 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 50/50 constraints]
After SMT, in 40863ms problems are : Problem set: 0 solved, 120 unsolved
Parikh walk visited 5 properties in 3857 ms.
Support contains 53 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 685/685 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 171 transition count 600
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 171 transition count 600
Applied a total of 34 rules in 21 ms. Remains 171 /188 variables (removed 17) and now considering 600/685 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 171/188 places, 600/685 transitions.
RANDOM walk for 4000000 steps (8 resets) in 47680 ms. (83 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 115/115 properties
Interrupted probabilistic random walk after 7191552 steps, run timeout after 45001 ms. (steps per millisecond=159 ) properties seen :17 out of 115
Probabilistic random walk after 7191552 steps, saw 1211801 distinct states, run finished after 45007 ms. (steps per millisecond=159 ) properties seen :17
[2025-06-01 01:34:28] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
// Phase 1: matrix 265 rows 171 cols
[2025-06-01 01:34:28] [INFO ] Computed 16 invariants in 4 ms
[2025-06-01 01:34:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 124/171 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 265/436 variables, 171/201 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 120/321 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/436 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 321 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7001 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 124/171 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-06-01 01:34:36] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 265/436 variables, 171/202 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 120/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 98/420 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-06-01 01:34:38] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:34:38] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:34:38] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-06-01 01:34:40] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:34:40] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:34:40] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 3/426 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/436 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 426 constraints, problems are : Problem set: 0 solved, 98 unsolved in 9617 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 21/21 constraints]
After SMT, in 16660ms problems are : Problem set: 0 solved, 98 unsolved
Parikh walk visited 6 properties in 4878 ms.
Support contains 47 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 600/600 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 170 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 19 ms. Remains 170 /171 variables (removed 1) and now considering 595/600 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 170/171 places, 595/600 transitions.
RANDOM walk for 4000000 steps (8 resets) in 35155 ms. (113 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 674 ms. (592 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 669 ms. (597 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 672 ms. (594 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 663 ms. (602 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 668 ms. (597 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 688 ms. (580 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 694 ms. (575 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 674 ms. (592 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 669 ms. (597 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 671 ms. (595 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 676 ms. (590 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 669 ms. (597 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 675 ms. (591 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 664 ms. (601 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 652 ms. (612 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 674 ms. (592 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 657 ms. (607 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 659 ms. (606 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 667 ms. (598 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 667 ms. (598 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 657 ms. (607 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 655 ms. (609 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 668 ms. (597 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 674 ms. (592 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 668 ms. (597 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 680 ms. (587 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 636 ms. (627 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 664 ms. (601 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 670 ms. (596 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 647 ms. (617 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 668 ms. (597 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 662 ms. (603 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 649 ms. (615 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 650 ms. (614 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 655 ms. (609 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 645 ms. (619 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 680 ms. (587 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 645 ms. (619 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 675 ms. (591 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 661 ms. (604 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 676 ms. (590 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 664 ms. (601 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 676 ms. (590 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 674 ms. (592 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 662 ms. (603 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 669 ms. (597 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 669 ms. (597 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 676 ms. (590 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 667 ms. (598 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 674 ms. (592 steps per ms) remains 92/92 properties
Interrupted probabilistic random walk after 9654012 steps, run timeout after 54001 ms. (steps per millisecond=178 ) properties seen :12 out of 92
Probabilistic random walk after 9654012 steps, saw 1624703 distinct states, run finished after 54001 ms. (steps per millisecond=178 ) properties seen :12
[2025-06-01 01:36:02] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2025-06-01 01:36:02] [INFO ] Computed 16 invariants in 1 ms
[2025-06-01 01:36:02] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 123/169 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 01:36:03] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:36:03] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:36:03] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:36:03] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:36:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 01:36:03] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:36:04] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:36:04] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:36:04] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2025-06-01 01:36:04] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:36:04] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:36:04] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:36:04] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:36:04] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:36:04] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:36:04] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 01:36:05] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:36:05] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 1/170 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 01:36:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2025-06-01 01:36:06] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:36:06] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 260/430 variables, 170/207 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 116/323 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/430 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 323 constraints, problems are : Problem set: 0 solved, 80 unsolved in 7165 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 123/169 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 1/170 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:36:11] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 260/430 variables, 170/211 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 116/327 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 80/407 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 01:36:13] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 01:36:16] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:36:16] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:36:16] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:36:16] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:36:16] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/430 variables, 5/413 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/430 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 18 (OVERLAPS) 0/430 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 413 constraints, problems are : Problem set: 0 solved, 80 unsolved in 10535 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 31/31 constraints]
After SMT, in 17736ms problems are : Problem set: 0 solved, 80 unsolved
Fused 80 Parikh solutions to 79 different solutions.
Parikh walk visited 0 properties in 4060 ms.
Support contains 46 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 4000000 steps (8 resets) in 43155 ms. (92 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 813 ms. (491 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 813 ms. (491 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 861 ms. (464 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 830 ms. (481 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 815 ms. (490 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 785 ms. (508 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 814 ms. (490 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 923 ms. (432 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 805 ms. (496 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 904 ms. (441 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 853 ms. (468 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 789 ms. (506 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 802 ms. (498 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 797 ms. (501 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 781 ms. (511 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 900 ms. (443 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 793 ms. (503 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 915 ms. (436 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 790 ms. (505 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 938 ms. (425 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 799 ms. (500 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 840 ms. (475 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 789 ms. (506 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 807 ms. (495 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 768 ms. (520 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 811 ms. (492 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 840 ms. (475 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 839 ms. (476 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 899 ms. (444 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 812 ms. (492 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 819 ms. (487 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 814 ms. (490 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 862 ms. (463 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 796 ms. (501 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 850 ms. (470 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 789 ms. (506 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 811 ms. (492 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 777 ms. (514 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 776 ms. (514 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 793 ms. (503 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 793 ms. (503 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 774 ms. (516 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 788 ms. (506 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 794 ms. (503 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 794 ms. (503 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 883 ms. (452 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 797 ms. (501 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 820 ms. (487 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 924 ms. (432 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 998 ms. (400 steps per ms) remains 80/80 properties
Interrupted probabilistic random walk after 13189008 steps, run timeout after 75001 ms. (steps per millisecond=175 ) properties seen :18 out of 80
Probabilistic random walk after 13189008 steps, saw 2199578 distinct states, run finished after 75002 ms. (steps per millisecond=175 ) properties seen :18
[2025-06-01 01:38:04] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:38:04] [INFO ] Invariant cache hit.
[2025-06-01 01:38:04] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 123/167 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:38:05] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:38:05] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:38:05] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:38:05] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2025-06-01 01:38:05] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 3/170 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:38:07] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:38:07] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:38:07] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 260/430 variables, 170/200 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 116/316 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:38:08] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:38:09] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/430 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 16 (OVERLAPS) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 318 constraints, problems are : Problem set: 0 solved, 62 unsolved in 6992 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 123/167 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 3/170 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:38:12] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:38:12] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 260/430 variables, 170/204 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 116/320 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 62/382 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (OVERLAPS) 0/430 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 382 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3954 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 18/18 constraints]
After SMT, in 10977ms problems are : Problem set: 0 solved, 62 unsolved
Fused 62 Parikh solutions to 61 different solutions.
Parikh walk visited 0 properties in 3144 ms.
Support contains 44 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 18 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 4000000 steps (8 resets) in 29735 ms. (134 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 585 ms. (682 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 583 ms. (684 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 585 ms. (682 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 588 ms. (679 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 586 ms. (681 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 585 ms. (682 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 593 ms. (673 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 578 ms. (690 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 579 ms. (689 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 570 ms. (700 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 561 ms. (711 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 554 ms. (720 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 575 ms. (694 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 588 ms. (679 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 564 ms. (707 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 567 ms. (704 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 554 ms. (720 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 556 ms. (718 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 575 ms. (694 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 573 ms. (696 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 574 ms. (695 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 582 ms. (686 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 576 ms. (693 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 593 ms. (673 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 582 ms. (686 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 591 ms. (675 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 574 ms. (695 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 583 ms. (684 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 587 ms. (680 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 590 ms. (676 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 602 ms. (663 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 582 ms. (686 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 592 ms. (674 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 573 ms. (696 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 585 ms. (682 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 569 ms. (701 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 564 ms. (707 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 578 ms. (690 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 579 ms. (689 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 587 ms. (680 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 567 ms. (704 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 560 ms. (713 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 553 ms. (722 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 557 ms. (716 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 578 ms. (690 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 553 ms. (722 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 549 ms. (727 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 555 ms. (719 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 548 ms. (728 steps per ms) remains 62/62 properties
Interrupted probabilistic random walk after 8212734 steps, run timeout after 48001 ms. (steps per millisecond=171 ) properties seen :0 out of 62
Probabilistic random walk after 8212734 steps, saw 1384514 distinct states, run finished after 48001 ms. (steps per millisecond=171 ) properties seen :0
[2025-06-01 01:39:23] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:39:23] [INFO ] Invariant cache hit.
[2025-06-01 01:39:23] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 123/167 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:39:23] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:39:23] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:39:23] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:39:24] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-06-01 01:39:24] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 3/170 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:39:24] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:39:24] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 260/430 variables, 170/200 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 116/316 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:39:26] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:39:28] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/430 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 16 (OVERLAPS) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 318 constraints, problems are : Problem set: 0 solved, 62 unsolved in 6810 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 123/167 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 3/170 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:39:30] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:39:31] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 260/430 variables, 170/204 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 116/320 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 62/382 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (OVERLAPS) 0/430 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 382 constraints, problems are : Problem set: 0 solved, 62 unsolved in 4046 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 18/18 constraints]
After SMT, in 10887ms problems are : Problem set: 0 solved, 62 unsolved
Fused 62 Parikh solutions to 61 different solutions.
Parikh walk visited 0 properties in 3140 ms.
Support contains 44 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2025-06-01 01:39:37] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:39:37] [INFO ] Invariant cache hit.
[2025-06-01 01:39:37] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-01 01:39:37] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:39:37] [INFO ] Invariant cache hit.
[2025-06-01 01:39:37] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 01:39:37] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2025-06-01 01:39:37] [INFO ] Redundant transitions in 7 ms returned []
Running 590 sub problems to find dead transitions.
[2025-06-01 01:39:37] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:39:37] [INFO ] Invariant cache hit.
[2025-06-01 01:39:37] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:39:39] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2025-06-01 01:39:39] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2025-06-01 01:39:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:39:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 01:39:39] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:39:40] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:39:40] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:39:40] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:39:40] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 2 ms to minimize.
[2025-06-01 01:39:40] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:39:40] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:39:40] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:39:40] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:39:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2025-06-01 01:39:40] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:39:40] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:39:41] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:39:41] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:39:41] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:39:41] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:39:41] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:39:41] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2025-06-01 01:39:42] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2025-06-01 01:39:42] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:39:42] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:39:42] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:39:42] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:39:42] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:39:42] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:39:46] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:39:46] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 2 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:39:49] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 11/87 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:39:55] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:39:55] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:39:55] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:39:55] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:39:55] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:39:55] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:39:56] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:40:01] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:40:01] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:40:02] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:40:02] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:40:02] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:40:02] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:40:02] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:40:02] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:40:02] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 103 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 87/103 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:40:11] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:40:11] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:40:12] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:40:12] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:40:13] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:40:13] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:40:13] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:40:13] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:40:14] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:40:14] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:40:14] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:40:17] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:40:17] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:40:17] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:40:18] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:40:18] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:40:18] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:40:18] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:40:19] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:40:19] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2025-06-01 01:40:19] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:40:19] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:40:19] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:40:21] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:40:21] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:40:22] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:40:22] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:40:23] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:40:24] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:40:24] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 3 ms to minimize.
[2025-06-01 01:40:28] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:40:28] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:40:28] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:40:28] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:40:28] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:40:28] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:40:29] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 17/159 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:40:32] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:40:32] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:40:32] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:40:33] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:40:33] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:40:33] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:40:33] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:40:33] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
SMT process timed out in 60202ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60636 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 400000 steps (8 resets) in 3546 ms. (112 steps per ms) remains 13/44 properties
Running SMT prover for 13 properties.
[2025-06-01 01:40:38] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:40:38] [INFO ] Invariant cache hit.
[2025-06-01 01:40:38] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-01 01:40:38] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-01 01:40:38] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13
[2025-06-01 01:40:38] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 01:40:39] [INFO ] After 37ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2025-06-01 01:40:39] [INFO ] After 277ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:13
[2025-06-01 01:40:39] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2025-06-01 01:40:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-01 01:40:39] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-01 01:40:39] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2025-06-01 01:40:39] [INFO ] After 50ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2025-06-01 01:40:39] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:40:39] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:40:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2025-06-01 01:40:39] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2025-06-01 01:40:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2025-06-01 01:40:39] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:40:39] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:40:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2025-06-01 01:40:39] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2025-06-01 01:40:40] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:40:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2025-06-01 01:40:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-06-01 01:40:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2025-06-01 01:40:40] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:40:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
TRAPS : Iteration 1
[2025-06-01 01:40:40] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:40:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
TRAPS : Iteration 2
[2025-06-01 01:40:40] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:40:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2025-06-01 01:40:40] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:40:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
TRAPS : Iteration 3
[2025-06-01 01:40:41] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:40:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2025-06-01 01:40:41] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:40:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
TRAPS : Iteration 4
[2025-06-01 01:40:41] [INFO ] After 2353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
[2025-06-01 01:40:41] [INFO ] After 2524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
RANDOM walk for 4000000 steps (8 resets) in 50431 ms. (79 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1098 ms. (363 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 857 ms. (466 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1018 ms. (392 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 922 ms. (433 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 927 ms. (431 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 857 ms. (466 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1122 ms. (356 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1151 ms. (347 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 917 ms. (435 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 996 ms. (401 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 997 ms. (400 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 985 ms. (405 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1123 ms. (355 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 969 ms. (412 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 913 ms. (437 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 983 ms. (406 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1071 ms. (373 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 880 ms. (454 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 815 ms. (490 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1175 ms. (340 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 980 ms. (407 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 990 ms. (403 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1093 ms. (365 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 957 ms. (417 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 988 ms. (404 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1020 ms. (391 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 871 ms. (458 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 962 ms. (415 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 978 ms. (408 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1046 ms. (382 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1027 ms. (389 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1024 ms. (390 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1067 ms. (374 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1179 ms. (338 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 911 ms. (438 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1055 ms. (378 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 977 ms. (409 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1060 ms. (377 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1014 ms. (394 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1019 ms. (392 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 931 ms. (429 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1183 ms. (337 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1016 ms. (393 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 853 ms. (468 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 949 ms. (421 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1102 ms. (362 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 910 ms. (439 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 957 ms. (417 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 851 ms. (469 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1085 ms. (368 steps per ms) remains 62/62 properties
Interrupted probabilistic random walk after 12822918 steps, run timeout after 90001 ms. (steps per millisecond=142 ) properties seen :0 out of 62
Probabilistic random walk after 12822918 steps, saw 2138560 distinct states, run finished after 90001 ms. (steps per millisecond=142 ) properties seen :0
[2025-06-01 01:42:42] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:42:42] [INFO ] Invariant cache hit.
[2025-06-01 01:42:42] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 123/167 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 3/170 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:42:45] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 260/430 variables, 170/200 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 116/316 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:42:46] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/430 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 16 (OVERLAPS) 0/430 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 318 constraints, problems are : Problem set: 0 solved, 62 unsolved in 6876 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 123/167 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 3/170 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 01:42:50] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:42:50] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 260/430 variables, 170/204 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 116/320 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 62/382 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (OVERLAPS) 0/430 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 382 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3936 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 18/18 constraints]
After SMT, in 10852ms problems are : Problem set: 0 solved, 62 unsolved
Fused 62 Parikh solutions to 61 different solutions.
Parikh walk visited 0 properties in 3508 ms.
Support contains 44 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2025-06-01 01:42:57] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:42:57] [INFO ] Invariant cache hit.
[2025-06-01 01:42:57] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-01 01:42:57] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:42:57] [INFO ] Invariant cache hit.
[2025-06-01 01:42:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 01:42:57] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2025-06-01 01:42:57] [INFO ] Redundant transitions in 5 ms returned []
Running 590 sub problems to find dead transitions.
[2025-06-01 01:42:57] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:42:57] [INFO ] Invariant cache hit.
[2025-06-01 01:42:57] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:42:59] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:42:59] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:42:59] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:42:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 01:42:59] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:43:03] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:43:03] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:43:03] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:43:03] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:43:03] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:43:03] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2025-06-01 01:43:03] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:43:03] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:43:06] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:43:06] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:43:07] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:43:07] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:43:07] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:43:07] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:43:07] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:43:07] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:43:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:43:07] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:43:07] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:43:07] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:43:08] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:43:08] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:43:08] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:43:08] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:43:08] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:43:08] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2025-06-01 01:43:08] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:43:08] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:43:10] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:43:10] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 11/87 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:43:15] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:43:15] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:43:15] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:43:15] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:43:15] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:43:15] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:43:15] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:43:21] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:43:21] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:43:23] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:43:23] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:43:23] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 590 unsolved
(s99 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 103 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 87/103 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:43:29] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:43:30] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:43:30] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:43:30] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:43:30] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:43:30] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:43:30] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:43:30] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2025-06-01 01:43:31] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:43:32] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:43:32] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:43:33] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:43:33] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2025-06-01 01:43:33] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:43:35] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:43:35] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:43:38] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:43:38] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:43:38] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2025-06-01 01:43:38] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:43:39] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:43:39] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2025-06-01 01:43:39] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:43:41] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:43:41] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:43:42] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:43:42] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:43:43] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:43:44] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 2 ms to minimize.
[2025-06-01 01:43:44] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:43:50] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 17/159 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2025-06-01 01:43:52] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:43:52] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 167 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 151/151 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60609 ms. Remains : 170/170 places, 595/595 transitions.
RANDOM walk for 400000 steps (8 resets) in 3039 ms. (131 steps per ms) remains 13/44 properties
Running SMT prover for 13 properties.
[2025-06-01 01:43:58] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2025-06-01 01:43:58] [INFO ] Invariant cache hit.
[2025-06-01 01:43:58] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-01 01:43:58] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-01 01:43:58] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13
[2025-06-01 01:43:58] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 01:43:58] [INFO ] After 43ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2025-06-01 01:43:59] [INFO ] After 295ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:13
[2025-06-01 01:43:59] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2025-06-01 01:43:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-01 01:43:59] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-01 01:43:59] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2025-06-01 01:43:59] [INFO ] After 48ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2025-06-01 01:43:59] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:43:59] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:43:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2025-06-01 01:43:59] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2025-06-01 01:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2025-06-01 01:43:59] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:43:59] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:43:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2025-06-01 01:43:59] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:43:59] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:43:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2025-06-01 01:43:59] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2025-06-01 01:43:59] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
TRAPS : Iteration 1
[2025-06-01 01:44:00] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
TRAPS : Iteration 2
[2025-06-01 01:44:00] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2025-06-01 01:44:00] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
TRAPS : Iteration 3
[2025-06-01 01:44:00] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2025-06-01 01:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2025-06-01 01:44:01] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:44:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
TRAPS : Iteration 4
[2025-06-01 01:44:01] [INFO ] After 2275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
[2025-06-01 01:44:01] [INFO ] After 2447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
RANDOM walk for 542 steps (0 resets) in 11 ms. (45 steps per ms) remains 0/1 properties
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 334 ms. (119 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33430 steps (7 resets) in 86 ms. (384 steps per ms) remains 0/1 properties
RANDOM walk for 779 steps (0 resets) in 8 ms. (86 steps per ms) remains 0/1 properties
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 1008 steps (0 resets) in 7 ms. (126 steps per ms) remains 0/1 properties
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
RANDOM walk for 443 steps (0 resets) in 7 ms. (55 steps per ms) remains 0/1 properties
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17332 steps, run visited all 1 properties in 61 ms. (steps per millisecond=284 )
Probabilistic random walk after 17332 steps, saw 8436 distinct states, run finished after 67 ms. (steps per millisecond=258 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11422 steps, run visited all 1 properties in 45 ms. (steps per millisecond=253 )
Probabilistic random walk after 11422 steps, saw 6278 distinct states, run finished after 45 ms. (steps per millisecond=253 ) properties seen :1
RANDOM walk for 38164 steps (8 resets) in 166 ms. (228 steps per ms) remains 0/1 properties
RANDOM walk for 37 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 352 steps (0 resets) in 5 ms. (58 steps per ms) remains 0/1 properties
RANDOM walk for 6539 steps (1 resets) in 31 ms. (204 steps per ms) remains 0/1 properties
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 28246 steps, run visited all 1 properties in 98 ms. (steps per millisecond=288 )
Probabilistic random walk after 28246 steps, saw 11508 distinct states, run finished after 99 ms. (steps per millisecond=285 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8344 steps, run visited all 1 properties in 39 ms. (steps per millisecond=213 )
Probabilistic random walk after 8344 steps, saw 4781 distinct states, run finished after 39 ms. (steps per millisecond=213 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3304 steps, run visited all 1 properties in 15 ms. (steps per millisecond=220 )
Probabilistic random walk after 3304 steps, saw 2268 distinct states, run finished after 16 ms. (steps per millisecond=206 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6724 steps, run visited all 1 properties in 26 ms. (steps per millisecond=258 )
Probabilistic random walk after 6724 steps, saw 4080 distinct states, run finished after 27 ms. (steps per millisecond=249 ) properties seen :1
RANDOM walk for 19550 steps (4 resets) in 70 ms. (275 steps per ms) remains 0/1 properties
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1096 steps, run visited all 1 properties in 8 ms. (steps per millisecond=137 )
Probabilistic random walk after 1096 steps, saw 847 distinct states, run finished after 8 ms. (steps per millisecond=137 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 44206 steps, run visited all 1 properties in 149 ms. (steps per millisecond=296 )
Probabilistic random walk after 44206 steps, saw 15198 distinct states, run finished after 149 ms. (steps per millisecond=296 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4876 steps, run visited all 1 properties in 31 ms. (steps per millisecond=157 )
Probabilistic random walk after 4876 steps, saw 3118 distinct states, run finished after 31 ms. (steps per millisecond=157 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7456 steps, run visited all 1 properties in 30 ms. (steps per millisecond=248 )
Probabilistic random walk after 7456 steps, saw 4364 distinct states, run finished after 30 ms. (steps per millisecond=248 ) properties seen :1
RANDOM walk for 23152 steps (4 resets) in 75 ms. (304 steps per ms) remains 0/1 properties
RANDOM walk for 34 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 46576 steps, run visited all 1 properties in 160 ms. (steps per millisecond=291 )
Probabilistic random walk after 46576 steps, saw 15890 distinct states, run finished after 160 ms. (steps per millisecond=291 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9652 steps, run visited all 1 properties in 38 ms. (steps per millisecond=254 )
Probabilistic random walk after 9652 steps, saw 5422 distinct states, run finished after 38 ms. (steps per millisecond=254 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5362 steps, run visited all 1 properties in 24 ms. (steps per millisecond=223 )
Probabilistic random walk after 5362 steps, saw 3402 distinct states, run finished after 24 ms. (steps per millisecond=223 ) properties seen :1
RANDOM walk for 209 steps (0 resets) in 4 ms. (41 steps per ms) remains 0/1 properties
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 26542 steps (6 resets) in 92 ms. (285 steps per ms) remains 0/1 properties
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 67 steps (0 resets) in 6 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 278 steps (0 resets) in 7 ms. (34 steps per ms) remains 0/1 properties
RANDOM walk for 430 steps (0 resets) in 6 ms. (61 steps per ms) remains 0/1 properties
RANDOM walk for 726 steps (0 resets) in 7 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 1003 steps (0 resets) in 9 ms. (100 steps per ms) remains 0/1 properties
RANDOM walk for 254 steps (0 resets) in 6 ms. (36 steps per ms) remains 0/1 properties
RANDOM walk for 549 steps (0 resets) in 5 ms. (91 steps per ms) remains 0/1 properties
RANDOM walk for 618 steps (0 resets) in 7 ms. (77 steps per ms) remains 0/1 properties
RANDOM walk for 931 steps (0 resets) in 7 ms. (116 steps per ms) remains 0/1 properties
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 224 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 3 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 150 transition count 185
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 135 transition count 185
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 135 transition count 174
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 58 place count 119 transition count 174
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 90 place count 103 transition count 158
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 98 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 98 transition count 231
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 118 place count 98 transition count 215
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 134 place count 82 transition count 215
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 139 place count 82 transition count 215
Applied a total of 139 rules in 28 ms. Remains 82 /170 variables (removed 88) and now considering 215/595 (removed 380) transitions.
Running SMT prover for 62 properties.
// Phase 1: matrix 215 rows 82 cols
[2025-06-01 01:44:03] [INFO ] Computed 11 invariants in 2 ms
[2025-06-01 01:44:03] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-01 01:44:04] [INFO ] After 943ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:62
[2025-06-01 01:44:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-01 01:44:05] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :62
TRAPS : Iteration 0
[2025-06-01 01:44:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 01:44:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 01:44:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2025-06-01 01:44:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 01:44:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2025-06-01 01:44:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 01:44:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-01 01:44:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2025-06-01 01:44:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
TRAPS : Iteration 1
[2025-06-01 01:44:07] [INFO ] After 2349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :62
[2025-06-01 01:44:07] [INFO ] After 3110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :62
Over-approximation ignoring read arcs solved 0 properties in 4144 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :62 assertions to prove.
Starting structural reductions in LIVENESS mode, iteration 0 : 295/295 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 295 transition count 795
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 795
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 290 transition count 715
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 210 transition count 715
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 190 transition count 695
Applied a total of 210 rules in 18 ms. Remains 190 /295 variables (removed 105) and now considering 695/800 (removed 105) transitions.
[2025-06-01 01:44:07] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
// Phase 1: matrix 360 rows 190 cols
[2025-06-01 01:44:07] [INFO ] Computed 16 invariants in 1 ms
[2025-06-01 01:44:07] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-01 01:44:07] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2025-06-01 01:44:07] [INFO ] Invariant cache hit.
[2025-06-01 01:44:07] [INFO ] State equation strengthened by 196 read => feed constraints.
[2025-06-01 01:44:08] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2025-06-01 01:44:08] [INFO ] Flow matrix only has 360 transitions (discarded 335 similar events)
[2025-06-01 01:44:08] [INFO ] Invariant cache hit.
[2025-06-01 01:44:08] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 11/201 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:44:13] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:44:13] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:44:13] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:44:13] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:44:13] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:44:16] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:44:16] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:44:17] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:44:17] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:44:17] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:44:17] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:44:17] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:44:17] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:44:17] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:44:17] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-06-01 01:44:18] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:44:18] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:44:18] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:44:18] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:44:18] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 2 ms to minimize.
[2025-06-01 01:44:19] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:44:19] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:44:19] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:44:19] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:44:19] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:44:20] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:44:20] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:44:20] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:44:20] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:44:20] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:44:21] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2025-06-01 01:44:22] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:44:22] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:44:22] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:44:22] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2025-06-01 01:44:22] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:44:23] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:44:23] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:44:23] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:44:23] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/286 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:44:32] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2025-06-01 01:44:32] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2025-06-01 01:44:32] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:44:32] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:44:32] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:44:32] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:44:34] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:44:34] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:44:34] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 2 ms to minimize.
[2025-06-01 01:44:34] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:44:35] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:44:35] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:44:35] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:44:35] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:44:35] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:44:36] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:44:36] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:44:36] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:44:36] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:44:36] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:44:37] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:44:37] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:44:37] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:44:38] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:44:38] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2025-06-01 01:44:38] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/326 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/550 variables, and 326 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30017 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 11/201 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 120/326 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:44:40] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:44:43] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:44:43] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:44:43] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:44:43] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:44:43] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:44:43] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:44:44] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2025-06-01 01:44:44] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:44:44] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:44:45] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 13/339 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:44:48] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:44:48] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:44:51] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:44:51] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:44:52] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:44:52] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:44:52] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:44:52] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:44:52] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2025-06-01 01:44:52] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:44:52] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 11/350 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2025-06-01 01:44:57] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:45:00] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 12/362 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/550 variables, and 362 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30019 ms.
Refiners :[Domain max(s): 190/190 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/190 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 0/690 constraints, Known Traps: 156/156 constraints]
After SMT, in 60239ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Starting structural reductions in LIVENESS mode, iteration 1 : 190/295 places, 695/800 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 60989 ms. Remains : 190/295 places, 695/800 transitions.
Unable to solve all queries for examination Liveness. Remains :695 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 695 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1076281 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-05

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 295
TRANSITIONS: 800
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 3600
NUPN UNITS: 13
LOADING TIME: 0.843

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.07
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.238
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 4195
MODEL NAME: /home/mcc/execution/model
295 places, 800 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

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="EisenbergMcGuire-PT-05"
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 EisenbergMcGuire-PT-05, 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 r084-tall-174860080700484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-05.tgz
mv EisenbergMcGuire-PT-05 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 ;