Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131300549.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DoubleExponent-PT-004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131300549
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716376631072

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:17:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 11:17:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:17:12] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-22 11:17:12] [INFO ] Transformed 216 places.
[2024-05-22 11:17:12] [INFO ] Transformed 198 transitions.
[2024-05-22 11:17:12] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 198 rows 216 cols
[2024-05-22 11:17:12] [INFO ] Computed 24 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 109, 1, 1, 1, 1, 2, +inf, 1, 2, 1]
RANDOM walk for 10000 steps (334 resets) in 28 ms. (344 steps per ms)
FORMULA DoubleExponent-PT-004-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130003 steps (3708 resets) in 191 ms. (677 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0] Max Struct:[+inf, 1, 1, 109, 1, 1, 1, 1, 2, +inf, 1, 2, 1]
[2024-05-22 11:17:12] [INFO ] Invariant cache hit.
[2024-05-22 11:17:12] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 11:17:12] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2024-05-22 11:17:13] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 12 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-22 11:17:13] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:13] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 2 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Deduced a trap composed of 97 places in 79 ms of which 2 ms to minimize.
[2024-05-22 11:17:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 405 ms
[2024-05-22 11:17:13] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-22 11:17:14] [INFO ] Added : 192 causal constraints over 39 iterations in 934 ms. Result :sat
Minimization took 234 ms.
[2024-05-22 11:17:14] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:15] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:15] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-22 11:17:15] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-22 11:17:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:15] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 11:17:15] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-22 11:17:15] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:17:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-22 11:17:15] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-22 11:17:16] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:17:16] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 4 ms to minimize.
[2024-05-22 11:17:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2024-05-22 11:17:16] [INFO ] Added : 188 causal constraints over 39 iterations in 1026 ms. Result :sat
Minimization took 238 ms.
[2024-05-22 11:17:16] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-22 11:17:16] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2024-05-22 11:17:16] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 11:17:16] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-22 11:17:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:16] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:16] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-22 11:17:16] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-22 11:17:17] [INFO ] Added : 183 causal constraints over 37 iterations in 742 ms. Result :sat
Minimization took 206 ms.
[2024-05-22 11:17:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:17] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:18] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-22 11:17:18] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:17:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:18] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 11:17:18] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-22 11:17:18] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:17:18] [INFO ] Deduced a trap composed of 68 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:17:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2024-05-22 11:17:18] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-22 11:17:19] [INFO ] Added : 195 causal constraints over 40 iterations in 883 ms. Result :sat
Minimization took 204 ms.
[2024-05-22 11:17:19] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:19] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:19] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-22 11:17:19] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 11:17:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:19] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2024-05-22 11:17:19] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-22 11:17:19] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-22 11:17:20] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-05-22 11:17:20] [INFO ] Added : 196 causal constraints over 40 iterations in 907 ms. Result :sat
Minimization took 213 ms.
[2024-05-22 11:17:20] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:20] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:21] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-22 11:17:21] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 11:17:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:21] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 11:17:21] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-22 11:17:21] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 11:17:22] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:17:22] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:17:22] [INFO ] Deduced a trap composed of 77 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:17:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 228 ms
[2024-05-22 11:17:22] [INFO ] Added : 190 causal constraints over 39 iterations in 1121 ms. Result :sat
Minimization took 210 ms.
[2024-05-22 11:17:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:22] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:22] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-22 11:17:22] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-22 11:17:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:22] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:22] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-22 11:17:22] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:17:23] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:17:23] [INFO ] Deduced a trap composed of 99 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:17:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2024-05-22 11:17:23] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-22 11:17:23] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-22 11:17:24] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:17:24] [INFO ] Deduced a trap composed of 104 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:17:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 284 ms
[2024-05-22 11:17:24] [INFO ] Added : 193 causal constraints over 40 iterations in 1085 ms. Result :sat
Minimization took 211 ms.
[2024-05-22 11:17:24] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:24] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 12 ms returned sat
[2024-05-22 11:17:24] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-22 11:17:24] [INFO ] Deduced a trap composed of 109 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:17:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:24] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:24] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-22 11:17:24] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:17:24] [INFO ] Deduced a trap composed of 103 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Deduced a trap composed of 109 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:17:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 326 ms
[2024-05-22 11:17:25] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 11:17:25] [INFO ] Added : 191 causal constraints over 39 iterations in 839 ms. Result :sat
Minimization took 221 ms.
[2024-05-22 11:17:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:26] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned unsat
[2024-05-22 11:17:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:26] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2024-05-22 11:17:26] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-22 11:17:26] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:17:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:26] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:26] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-22 11:17:26] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:17:26] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:17:26] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:17:26] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:17:27] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:17:27] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:17:27] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:17:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 573 ms
[2024-05-22 11:17:27] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-22 11:17:28] [INFO ] Added : 194 causal constraints over 40 iterations in 847 ms. Result :sat
Minimization took 224 ms.
[2024-05-22 11:17:28] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:28] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:28] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 11:17:28] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 3 ms to minimize.
[2024-05-22 11:17:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:28] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:28] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-22 11:17:28] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-22 11:17:29] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
[2024-05-22 11:17:29] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:17:29] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:17:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 210 ms
[2024-05-22 11:17:29] [INFO ] Added : 192 causal constraints over 40 iterations in 1052 ms. Result :sat
Minimization took 210 ms.
[2024-05-22 11:17:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:29] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 3 ms returned unsat
[2024-05-22 11:17:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:29] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 11:17:29] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-22 11:17:30] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:17:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:30] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 11:17:30] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-22 11:17:30] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:17:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-22 11:17:30] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-22 11:17:31] [INFO ] Deduced a trap composed of 97 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:17:31] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:17:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2024-05-22 11:17:31] [INFO ] Added : 183 causal constraints over 37 iterations in 860 ms. Result :sat
Minimization took 238 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0] Max Struct:[+inf, 1, 1, 109, 1, 1, 1, 1, 1, +inf, 1, 1, 1]
FORMULA DoubleExponent-PT-004-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 109, 1, 1, 1, 1, +inf, 1, 1]
Support contains 11 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 198/198 transitions.
Graph (complete) has 360 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 215 transition count 160
Reduce places removed 38 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 177 transition count 157
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 174 transition count 157
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 83 place count 174 transition count 149
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 99 place count 166 transition count 149
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 173 place count 129 transition count 112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 185 place count 123 transition count 112
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 199 place count 123 transition count 98
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 213 place count 109 transition count 98
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 227 place count 109 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 108 transition count 97
Applied a total of 228 rules in 74 ms. Remains 108 /216 variables (removed 108) and now considering 97/198 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 108/216 places, 97/198 transitions.
Found an invariant !
This invariant on transitions {20=1, 21=1, 22=1, 43=1, 44=1, 61=1, 67=1, 89=1, 92=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 ms.
This minimized invariant on transitions {20=1, 21=1, 22=1, 43=1, 44=1, 61=1, 67=1, 89=1, 92=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1290 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 109, 1, 1, 1, 1, +inf, 1, 1]
// Phase 1: matrix 97 rows 108 cols
[2024-05-22 11:17:34] [INFO ] Computed 23 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 1000000 steps (127970 resets) in 754 ms. (1324 steps per ms)
BEST_FIRST walk for 11000002 steps (931046 resets) in 5663 ms. (1942 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
[2024-05-22 11:17:40] [INFO ] Invariant cache hit.
[2024-05-22 11:17:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:40] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-22 11:17:40] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-22 11:17:40] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 11:17:40] [INFO ] [Real]Added 11 Read/Feed constraints in 13 ms returned sat
[2024-05-22 11:17:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:40] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 11:17:40] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:17:40] [INFO ] [Nat]Added 11 Read/Feed constraints in 16 ms returned sat
[2024-05-22 11:17:40] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:17:40] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:17:40] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:17:40] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:17:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 230 ms
[2024-05-22 11:17:40] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 5 ms.
[2024-05-22 11:17:40] [INFO ] Added : 59 causal constraints over 12 iterations in 147 ms. Result :sat
Minimization took 72 ms.
[2024-05-22 11:17:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:41] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:41] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-22 11:17:41] [INFO ] [Real]Added 11 Read/Feed constraints in 14 ms returned sat
[2024-05-22 11:17:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:41] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 6 ms returned sat
[2024-05-22 11:17:41] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-22 11:17:41] [INFO ] [Nat]Added 11 Read/Feed constraints in 17 ms returned sat
[2024-05-22 11:17:41] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 4 ms.
[2024-05-22 11:17:41] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:17:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-22 11:17:41] [INFO ] Added : 89 causal constraints over 19 iterations in 334 ms. Result :sat
Minimization took 96 ms.
[2024-05-22 11:17:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:41] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 8 ms returned sat
[2024-05-22 11:17:41] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 11:17:41] [INFO ] [Real]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-22 11:17:41] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 8 ms.
[2024-05-22 11:17:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 11:17:41] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 11:17:41] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-22 11:17:41] [INFO ] [Nat]Added 11 Read/Feed constraints in 24 ms returned sat
[2024-05-22 11:17:41] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 6 ms.
[2024-05-22 11:17:42] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:17:42] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:17:42] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:17:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 158 ms
[2024-05-22 11:17:42] [INFO ] Added : 73 causal constraints over 16 iterations in 359 ms. Result :sat
Minimization took 79 ms.
[2024-05-22 11:17:42] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:42] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-22 11:17:42] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-22 11:17:42] [INFO ] [Real]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 11:17:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 11:17:42] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-22 11:17:42] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-22 11:17:42] [INFO ] [Nat]Added 11 Read/Feed constraints in 16 ms returned sat
[2024-05-22 11:17:42] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:17:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-22 11:17:42] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 6 ms.
[2024-05-22 11:17:42] [INFO ] Added : 88 causal constraints over 19 iterations in 288 ms. Result :sat
Minimization took 115 ms.
[2024-05-22 11:17:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 11:17:43] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-22 11:17:43] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:17:43] [INFO ] [Real]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:17:43] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 8 ms.
[2024-05-22 11:17:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 11:17:43] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 11:17:43] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:17:43] [INFO ] [Nat]Added 11 Read/Feed constraints in 15 ms returned sat
[2024-05-22 11:17:43] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 11:17:43] [INFO ] Added : 81 causal constraints over 17 iterations in 217 ms. Result :sat
Minimization took 81 ms.
[2024-05-22 11:17:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 11:17:43] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-22 11:17:43] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 11:17:43] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 11:17:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:43] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-22 11:17:43] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 11:17:43] [INFO ] [Nat]Added 11 Read/Feed constraints in 13 ms returned sat
[2024-05-22 11:17:43] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:17:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-22 11:17:43] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 11:17:43] [INFO ] Added : 60 causal constraints over 13 iterations in 165 ms. Result :sat
Minimization took 88 ms.
[2024-05-22 11:17:44] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:44] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-22 11:17:44] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-22 11:17:44] [INFO ] [Real]Added 11 Read/Feed constraints in 17 ms returned sat
[2024-05-22 11:17:44] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:17:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:44] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-22 11:17:44] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-22 11:17:44] [INFO ] [Nat]Added 11 Read/Feed constraints in 13 ms returned sat
[2024-05-22 11:17:44] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:17:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-22 11:17:44] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 6 ms.
[2024-05-22 11:17:44] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:17:44] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:17:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2024-05-22 11:17:44] [INFO ] Added : 89 causal constraints over 20 iterations in 478 ms. Result :sat
Minimization took 93 ms.
[2024-05-22 11:17:44] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:44] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-22 11:17:44] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-22 11:17:44] [INFO ] [Real]Added 11 Read/Feed constraints in 23 ms returned sat
[2024-05-22 11:17:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 11:17:44] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 11:17:45] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 11:17:45] [INFO ] [Nat]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:17:45] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 11:17:45] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 8 ms to minimize.
[2024-05-22 11:17:45] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-22 11:17:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2024-05-22 11:17:45] [INFO ] Added : 84 causal constraints over 17 iterations in 347 ms. Result :sat
Minimization took 94 ms.
[2024-05-22 11:17:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 11:17:45] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 11:17:45] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:17:45] [INFO ] [Real]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 11:17:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 11:17:45] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 11:17:45] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:17:45] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 11:17:45] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:17:45] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:17:45] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:17:45] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:17:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 197 ms
[2024-05-22 11:17:45] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 5 ms.
[2024-05-22 11:17:46] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:17:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 11:17:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2024-05-22 11:17:46] [INFO ] Added : 73 causal constraints over 15 iterations in 274 ms. Result :sat
Minimization took 105 ms.
[2024-05-22 11:17:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:46] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 11:17:46] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 11:17:46] [INFO ] [Real]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-22 11:17:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:46] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 11:17:46] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:17:46] [INFO ] [Nat]Added 11 Read/Feed constraints in 14 ms returned sat
[2024-05-22 11:17:46] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 8 ms.
[2024-05-22 11:17:46] [INFO ] Added : 89 causal constraints over 19 iterations in 295 ms. Result :sat
Minimization took 86 ms.
[2024-05-22 11:17:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:46] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 11:17:46] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 11:17:46] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:17:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 11:17:46] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-22 11:17:46] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:17:46] [INFO ] [Nat]Added 11 Read/Feed constraints in 14 ms returned sat
[2024-05-22 11:17:46] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
[2024-05-22 11:17:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-22 11:17:46] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 11:17:47] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:17:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-22 11:17:47] [INFO ] Added : 39 causal constraints over 9 iterations in 154 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
Support contains 11 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 108/108 places, 97/97 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 97/97 transitions.
Applied a total of 0 rules in 16 ms. Remains 108 /108 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-22 11:17:47] [INFO ] Invariant cache hit.
[2024-05-22 11:17:47] [INFO ] Implicit Places using invariants in 95 ms returned [28, 47, 54, 60, 75, 80, 98, 105]
[2024-05-22 11:17:47] [INFO ] Actually due to overlaps returned [80, 75]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 98 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/108 places, 97/97 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 96
Applied a total of 2 rules in 34 ms. Remains 105 /106 variables (removed 1) and now considering 96/97 (removed 1) transitions.
// Phase 1: matrix 96 rows 105 cols
[2024-05-22 11:17:47] [INFO ] Computed 21 invariants in 3 ms
[2024-05-22 11:17:47] [INFO ] Implicit Places using invariants in 71 ms returned [28, 47, 54, 60, 95, 102]
[2024-05-22 11:17:47] [INFO ] Actually due to overlaps returned [102, 95]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 103/108 places, 96/97 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 96
Applied a total of 1 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 103 cols
[2024-05-22 11:17:47] [INFO ] Computed 19 invariants in 4 ms
[2024-05-22 11:17:48] [INFO ] Implicit Places using invariants in 83 ms returned [28, 47, 54, 60]
[2024-05-22 11:17:48] [INFO ] Actually due to overlaps returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 102/108 places, 96/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 318 ms. Remains : 102/108 places, 96/97 transitions.
Found an invariant !
This invariant on transitions {20=1, 21=1, 42=1, 57=1, 63=1, 85=1, 88=1, 93=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {20=1, 21=1, 42=1, 57=1, 63=1, 85=1, 88=1, 93=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1465 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
// Phase 1: matrix 96 rows 102 cols
[2024-05-22 11:17:49] [INFO ] Computed 18 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 1000000 steps (144419 resets) in 671 ms. (1488 steps per ms)
BEST_FIRST walk for 11000003 steps (1005577 resets) in 5246 ms. (2096 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
[2024-05-22 11:17:55] [INFO ] Invariant cache hit.
[2024-05-22 11:17:55] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:55] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:17:55] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-22 11:17:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:55] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:17:55] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 11:17:55] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 11:17:55] [INFO ] [Nat]Added 11 Read/Feed constraints in 15 ms returned sat
[2024-05-22 11:17:55] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:17:55] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-22 11:17:55] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-05-22 11:17:55] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:17:55] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:17:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 239 ms
[2024-05-22 11:17:55] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 7 ms.
[2024-05-22 11:17:56] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:17:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-22 11:17:56] [INFO ] Added : 70 causal constraints over 14 iterations in 265 ms. Result :sat
Minimization took 88 ms.
[2024-05-22 11:17:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:56] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:17:56] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 11:17:56] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:17:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:56] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:17:56] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 11:17:56] [INFO ] [Nat]Added 11 Read/Feed constraints in 19 ms returned sat
[2024-05-22 11:17:56] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 8 ms.
[2024-05-22 11:17:56] [INFO ] Added : 73 causal constraints over 15 iterations in 189 ms. Result :sat
Minimization took 76 ms.
[2024-05-22 11:17:56] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:56] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:17:56] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:17:56] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:17:56] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 13 ms.
[2024-05-22 11:17:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:56] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:17:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:17:56] [INFO ] [Nat]Added 11 Read/Feed constraints in 12 ms returned sat
[2024-05-22 11:17:56] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-22 11:17:57] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:17:57] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-22 11:17:57] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:17:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2024-05-22 11:17:57] [INFO ] Added : 90 causal constraints over 18 iterations in 498 ms. Result :sat
Minimization took 86 ms.
[2024-05-22 11:17:57] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:57] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:17:57] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-22 11:17:57] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 11:17:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:57] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:17:57] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 11:17:57] [INFO ] [Nat]Added 11 Read/Feed constraints in 21 ms returned sat
[2024-05-22 11:17:57] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 7 ms.
[2024-05-22 11:17:57] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:17:57] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:17:58] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:17:58] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2024-05-22 11:17:58] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:17:58] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:17:58] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:17:58] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:17:58] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:17:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 439 ms
[2024-05-22 11:17:58] [INFO ] Added : 90 causal constraints over 18 iterations in 692 ms. Result :sat
Minimization took 115 ms.
[2024-05-22 11:17:58] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:17:58] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:17:58] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:17:58] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:17:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:58] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:17:58] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 11:17:58] [INFO ] [Nat]Added 11 Read/Feed constraints in 15 ms returned sat
[2024-05-22 11:17:58] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 9 ms.
[2024-05-22 11:17:58] [INFO ] Added : 92 causal constraints over 19 iterations in 328 ms. Result :sat
Minimization took 86 ms.
[2024-05-22 11:17:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:59] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:17:59] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:17:59] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-22 11:17:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:59] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:17:59] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:17:59] [INFO ] [Nat]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:17:59] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-22 11:17:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-22 11:17:59] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 7 ms.
[2024-05-22 11:17:59] [INFO ] Added : 92 causal constraints over 19 iterations in 291 ms. Result :sat
Minimization took 113 ms.
[2024-05-22 11:17:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:59] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:17:59] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 11:17:59] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-22 11:17:59] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 8 ms.
[2024-05-22 11:17:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:17:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:17:59] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:17:59] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-22 11:17:59] [INFO ] [Nat]Added 11 Read/Feed constraints in 15 ms returned sat
[2024-05-22 11:17:59] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 7 ms.
[2024-05-22 11:18:00] [INFO ] Added : 82 causal constraints over 18 iterations in 223 ms. Result :sat
Minimization took 89 ms.
[2024-05-22 11:18:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:18:00] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:00] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:18:00] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:18:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:00] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:00] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:18:00] [INFO ] [Nat]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:18:00] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-22 11:18:00] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:18:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-22 11:18:00] [INFO ] Added : 43 causal constraints over 9 iterations in 152 ms. Result :sat
Minimization took 56 ms.
[2024-05-22 11:18:00] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:00] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 11:18:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:00] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:00] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-22 11:18:00] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 11:18:00] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:18:00] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:18:00] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:18:00] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-05-22 11:18:00] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:18:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 213 ms
[2024-05-22 11:18:00] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-22 11:18:01] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:18:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-22 11:18:01] [INFO ] Added : 73 causal constraints over 15 iterations in 232 ms. Result :sat
Minimization took 79 ms.
[2024-05-22 11:18:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:01] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:01] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:18:01] [INFO ] [Real]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:18:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:01] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:01] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:18:01] [INFO ] [Nat]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:18:01] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 4 ms.
[2024-05-22 11:18:01] [INFO ] Added : 90 causal constraints over 18 iterations in 318 ms. Result :sat
Minimization took 135 ms.
[2024-05-22 11:18:01] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:18:01] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:18:01] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 11:18:01] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:18:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:01] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:01] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:18:01] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 11:18:01] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-22 11:18:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-22 11:18:01] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-22 11:18:02] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:18:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-22 11:18:02] [INFO ] Added : 33 causal constraints over 7 iterations in 139 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
Support contains 11 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 96/96 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 102/102 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-22 11:18:02] [INFO ] Invariant cache hit.
[2024-05-22 11:18:02] [INFO ] Implicit Places using invariants in 62 ms returned [46, 53, 59]
[2024-05-22 11:18:02] [INFO ] Actually due to overlaps returned [46, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/102 places, 96/96 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 95
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 99 transition count 95
Applied a total of 3 rules in 9 ms. Remains 99 /100 variables (removed 1) and now considering 95/96 (removed 1) transitions.
// Phase 1: matrix 95 rows 99 cols
[2024-05-22 11:18:02] [INFO ] Computed 16 invariants in 3 ms
[2024-05-22 11:18:02] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 11:18:02] [INFO ] Invariant cache hit.
[2024-05-22 11:18:02] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 11:18:02] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/102 places, 95/96 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 307 ms. Remains : 99/102 places, 95/96 transitions.
Found an invariant !
This invariant on transitions {20=1, 21=1, 41=1, 56=1, 62=1, 83=1, 86=1, 91=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {20=1, 21=1, 41=1, 56=1, 62=1, 83=1, 86=1, 91=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1450 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
[2024-05-22 11:18:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 1000000 steps (144338 resets) in 664 ms. (1503 steps per ms)
FORMULA DoubleExponent-PT-004-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000007 steps (914162 resets) in 4828 ms. (2070 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1]
[2024-05-22 11:18:16] [INFO ] Invariant cache hit.
[2024-05-22 11:18:16] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:16] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:16] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:18:16] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 11:18:16] [INFO ] [Real]Added 11 Read/Feed constraints in 5 ms returned sat
[2024-05-22 11:18:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:16] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:16] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:18:16] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 11:18:17] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:18:17] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:18:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2024-05-22 11:18:17] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 11:18:17] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:18:17] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:18:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2024-05-22 11:18:17] [INFO ] Added : 93 causal constraints over 19 iterations in 524 ms. Result :sat
Minimization took 112 ms.
[2024-05-22 11:18:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:17] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:17] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 11:18:17] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-22 11:18:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 11:18:17] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:18:17] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-22 11:18:17] [INFO ] [Nat]Added 11 Read/Feed constraints in 12 ms returned sat
[2024-05-22 11:18:17] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 11:18:18] [INFO ] Added : 90 causal constraints over 19 iterations in 323 ms. Result :sat
Minimization took 102 ms.
[2024-05-22 11:18:18] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:18] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:18] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:18:18] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 11:18:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:18] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:18:18] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 11:18:18] [INFO ] [Nat]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:18:18] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 11:18:18] [INFO ] Added : 92 causal constraints over 19 iterations in 290 ms. Result :sat
Minimization took 104 ms.
[2024-05-22 11:18:18] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 11:18:18] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:18] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:18:18] [INFO ] [Real]Added 11 Read/Feed constraints in 13 ms returned sat
[2024-05-22 11:18:18] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 11:18:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:18] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:18] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:18:19] [INFO ] [Nat]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-22 11:18:19] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 11:18:19] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-22 11:18:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-22 11:18:19] [INFO ] Added : 88 causal constraints over 18 iterations in 311 ms. Result :sat
Minimization took 105 ms.
[2024-05-22 11:18:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:19] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:19] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:18:19] [INFO ] [Real]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:18:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:19] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:18:19] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 11:18:19] [INFO ] [Nat]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-22 11:18:19] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 11:18:19] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:18:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-22 11:18:19] [INFO ] Added : 79 causal constraints over 16 iterations in 256 ms. Result :sat
Minimization took 95 ms.
[2024-05-22 11:18:19] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 11:18:19] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:18:20] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-22 11:18:20] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:18:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 11:18:20] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:20] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 11:18:20] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 11:18:20] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-22 11:18:20] [INFO ] Added : 61 causal constraints over 13 iterations in 228 ms. Result :sat
Minimization took 84 ms.
[2024-05-22 11:18:20] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:20] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:20] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:18:20] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:18:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:20] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:18:20] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 11:18:20] [INFO ] [Nat]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-22 11:18:20] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-22 11:18:20] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:18:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 185 ms
[2024-05-22 11:18:21] [INFO ] Added : 89 causal constraints over 18 iterations in 417 ms. Result :sat
Minimization took 125 ms.
[2024-05-22 11:18:21] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 11:18:21] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:21] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 11:18:21] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:18:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:21] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-22 11:18:21] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-22 11:18:21] [INFO ] [Nat]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-22 11:18:21] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 11:18:21] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:18:21] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:18:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:18:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 150 ms
[2024-05-22 11:18:21] [INFO ] Added : 46 causal constraints over 10 iterations in 275 ms. Result :sat
Minimization took 69 ms.
[2024-05-22 11:18:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:21] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:21] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 11:18:21] [INFO ] [Real]Added 11 Read/Feed constraints in 22 ms returned sat
[2024-05-22 11:18:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:21] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:21] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:18:21] [INFO ] [Nat]Added 11 Read/Feed constraints in 12 ms returned sat
[2024-05-22 11:18:21] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:18:21] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:18:21] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-22 11:18:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 137 ms
[2024-05-22 11:18:21] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 11:18:22] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:18:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-22 11:18:22] [INFO ] Added : 74 causal constraints over 15 iterations in 244 ms. Result :sat
Minimization took 94 ms.
[2024-05-22 11:18:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:22] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:22] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 11:18:22] [INFO ] [Real]Added 11 Read/Feed constraints in 12 ms returned sat
[2024-05-22 11:18:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:22] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:18:22] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-22 11:18:22] [INFO ] [Nat]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-22 11:18:22] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 11:18:22] [INFO ] Added : 92 causal constraints over 20 iterations in 368 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1]
Support contains 10 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 94
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 98 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 97 transition count 93
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 97 transition count 93
Applied a total of 5 rules in 12 ms. Remains 97 /99 variables (removed 2) and now considering 93/95 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 97/99 places, 93/95 transitions.
Found an invariant !
This invariant on transitions {20=1, 21=1, 37=1, 52=1, 58=1, 79=1, 82=1, 87=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {20=1, 21=1, 37=1, 52=1, 58=1, 79=1, 82=1, 87=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1424 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1]
// Phase 1: matrix 93 rows 97 cols
[2024-05-22 11:18:25] [INFO ] Computed 16 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1]
RANDOM walk for 1000000 steps (144619 resets) in 689 ms. (1449 steps per ms)
BEST_FIRST walk for 10000004 steps (914559 resets) in 4917 ms. (2033 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1]
[2024-05-22 11:18:31] [INFO ] Invariant cache hit.
[2024-05-22 11:18:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:31] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:31] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:18:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:18:31] [INFO ] [Real]Added 12 Read/Feed constraints in 10 ms returned sat
[2024-05-22 11:18:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:31] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:31] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:18:31] [INFO ] [Nat]Added 12 Read/Feed constraints in 6 ms returned sat
[2024-05-22 11:18:31] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:18:31] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:18:31] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:18:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 126 ms
[2024-05-22 11:18:31] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 11:18:31] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:18:31] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:18:31] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 0 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 0 ms to minimize.
[2024-05-22 11:18:32] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 872 ms
[2024-05-22 11:18:32] [INFO ] Added : 90 causal constraints over 19 iterations in 1195 ms. Result :sat
Minimization took 115 ms.
[2024-05-22 11:18:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:32] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:32] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:18:32] [INFO ] [Real]Added 12 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:18:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:32] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:33] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:18:33] [INFO ] [Nat]Added 12 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:18:33] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-22 11:18:33] [INFO ] Added : 87 causal constraints over 20 iterations in 282 ms. Result :sat
Minimization took 121 ms.
[2024-05-22 11:18:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:33] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:33] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-22 11:18:33] [INFO ] [Real]Added 12 Read/Feed constraints in 10 ms returned sat
[2024-05-22 11:18:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 11:18:33] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:18:33] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-22 11:18:33] [INFO ] [Nat]Added 12 Read/Feed constraints in 30 ms returned sat
[2024-05-22 11:18:33] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 11:18:33] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:18:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-22 11:18:34] [INFO ] Added : 87 causal constraints over 20 iterations in 396 ms. Result :sat
Minimization took 125 ms.
[2024-05-22 11:18:34] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Real]Added 12 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:18:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Nat]Added 12 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:18:34] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 11:18:34] [INFO ] Added : 88 causal constraints over 18 iterations in 241 ms. Result :sat
Minimization took 122 ms.
[2024-05-22 11:18:34] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Real]Added 12 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:18:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 11:18:34] [INFO ] [Nat]Added 12 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:18:34] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 11:18:35] [INFO ] Added : 92 causal constraints over 19 iterations in 291 ms. Result :sat
Minimization took 127 ms.
[2024-05-22 11:18:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:35] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:18:35] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-22 11:18:35] [INFO ] [Real]Added 12 Read/Feed constraints in 11 ms returned sat
[2024-05-22 11:18:35] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 11:18:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:35] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:35] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 11:18:35] [INFO ] [Nat]Added 12 Read/Feed constraints in 14 ms returned sat
[2024-05-22 11:18:35] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:18:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-22 11:18:35] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 11:18:35] [INFO ] Added : 54 causal constraints over 11 iterations in 154 ms. Result :sat
Minimization took 76 ms.
[2024-05-22 11:18:35] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 11:18:35] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:35] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 11:18:35] [INFO ] [Real]Added 12 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:18:35] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 11:18:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 11:18:35] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:18:35] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 11:18:35] [INFO ] [Nat]Added 12 Read/Feed constraints in 20 ms returned sat
[2024-05-22 11:18:35] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 11:18:36] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:18:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-22 11:18:36] [INFO ] Added : 69 causal constraints over 14 iterations in 213 ms. Result :sat
Minimization took 82 ms.
[2024-05-22 11:18:36] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-22 11:18:36] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:36] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 11:18:36] [INFO ] [Real]Added 12 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:18:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:36] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-22 11:18:36] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:18:36] [INFO ] [Nat]Added 12 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:18:36] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 11:18:36] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:18:36] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:18:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2024-05-22 11:18:36] [INFO ] Added : 91 causal constraints over 20 iterations in 456 ms. Result :sat
Minimization took 101 ms.
[2024-05-22 11:18:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:36] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 11:18:37] [INFO ] [Real]Added 12 Read/Feed constraints in 12 ms returned sat
[2024-05-22 11:18:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:37] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:18:37] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 11:18:37] [INFO ] [Nat]Added 12 Read/Feed constraints in 6 ms returned sat
[2024-05-22 11:18:37] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:18:37] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 2 ms to minimize.
[2024-05-22 11:18:37] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:18:37] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:18:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 162 ms
[2024-05-22 11:18:37] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 11:18:37] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:18:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:18:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2024-05-22 11:18:37] [INFO ] Added : 68 causal constraints over 14 iterations in 305 ms. Result :sat
Minimization took 88 ms.
[2024-05-22 11:18:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:37] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:18:37] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:18:37] [INFO ] [Real]Added 12 Read/Feed constraints in 10 ms returned sat
[2024-05-22 11:18:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:18:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:18:37] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:18:37] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 11:18:37] [INFO ] [Nat]Added 12 Read/Feed constraints in 12 ms returned sat
[2024-05-22 11:18:37] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 11:18:38] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:18:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-22 11:18:38] [INFO ] Added : 78 causal constraints over 16 iterations in 275 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1]
Support contains 10 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 93/93 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 93/93 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 93/93 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2024-05-22 11:18:38] [INFO ] Invariant cache hit.
[2024-05-22 11:18:38] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 11:18:38] [INFO ] Invariant cache hit.
[2024-05-22 11:18:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:18:38] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-22 11:18:38] [INFO ] Redundant transitions in 1 ms returned []
Running 92 sub problems to find dead transitions.
[2024-05-22 11:18:38] [INFO ] Invariant cache hit.
[2024-05-22 11:18:39] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 2/95 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 11:18:39] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:18:39] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:18:40] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:18:40] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 0 ms to minimize.
[2024-05-22 11:18:40] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 11:18:40] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 11:18:40] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 0 ms to minimize.
[2024-05-22 11:18:40] [INFO ] Deduced a trap composed of 52 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:18:40] [INFO ] Deduced a trap composed of 54 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 11:18:41] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 2/97 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 11:18:41] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 11:18:42] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 11:18:42] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/97 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 14 (OVERLAPS) 93/190 variables, 97/126 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 17 (OVERLAPS) 0/190 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 138 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4989 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 97/97 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 2/95 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 2/97 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 93/190 variables, 97/126 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 92/230 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 11:18:45] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:18:45] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:18:45] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:18:45] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 11:18:47] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/190 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 16 (OVERLAPS) 0/190 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 235 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5992 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 97/97 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 18/18 constraints]
After SMT, in 11044ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 11066ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11373 ms. Remains : 97/97 places, 93/93 transitions.
Found an invariant !
This invariant on transitions {20=1, 21=1, 37=1, 52=1, 58=1, 79=1, 82=1, 87=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {20=1, 21=1, 37=1, 52=1, 58=1, 79=1, 82=1, 87=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1]
RANDOM walk for 40000 steps (5643 resets) in 1608 ms. (24 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (367 resets) in 86 ms. (45 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (370 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (359 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (359 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (358 resets) in 54 ms. (72 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (381 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (376 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (371 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (372 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (377 resets) in 22 ms. (173 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (347 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (335 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (351 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (356 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (371 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (343 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (373 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (372 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 231803 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :4 out of 18
Probabilistic random walk after 231803 steps, saw 115934 distinct states, run finished after 3004 ms. (steps per millisecond=77 ) properties seen :4
[2024-05-22 11:18:56] [INFO ] Invariant cache hit.
[2024-05-22 11:18:56] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem MAX3 is UNSAT
At refinement iteration 4 (OVERLAPS) 23/93 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 93/186 variables, 93/107 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 12/119 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 4/190 variables, 4/123 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 2/125 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 125 constraints, problems are : Problem set: 1 solved, 13 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 97/97 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 62/70 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 11:18:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 23/93 variables, 9/15 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 11:18:56] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-22 11:18:56] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:18:56] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:18:56] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-22 11:18:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-22 11:18:56] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-22 11:18:56] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:18:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:18:56] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 12/27 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 6/33 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:18:57] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:18:58] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 16/49 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 93/186 variables, 93/142 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 12/154 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 13/167 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 4/190 variables, 4/171 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 2/173 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/190 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 173 constraints, problems are : Problem set: 1 solved, 13 unsolved in 2017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 97/97 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 13/14 constraints, Known Traps: 35/35 constraints]
After SMT, in 2324ms problems are : Problem set: 1 solved, 13 unsolved
Fused 13 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 3193 ms.
Support contains 8 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 93/93 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 96 transition count 92
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 96 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 95 transition count 91
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 95 transition count 91
Applied a total of 6 rules in 12 ms. Remains 95 /97 variables (removed 2) and now considering 91/93 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 95/97 places, 91/93 transitions.
RANDOM walk for 40000 steps (5764 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3664 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3578 resets) in 250 ms. (159 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3620 resets) in 223 ms. (178 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3645 resets) in 216 ms. (184 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3637 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3652 resets) in 220 ms. (180 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3649 resets) in 209 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3625 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3633 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3673 resets) in 136 ms. (291 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3602 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3629 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3670 resets) in 182 ms. (218 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 262695 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 13
Probabilistic random walk after 262695 steps, saw 131397 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
// Phase 1: matrix 91 rows 95 cols
[2024-05-22 11:19:05] [INFO ] Computed 16 invariants in 2 ms
[2024-05-22 11:19:05] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 60/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 23/91 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 91/182 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 13/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:19:05] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 4/186 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 127 constraints, problems are : Problem set: 0 solved, 13 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 60/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 23/91 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 91/182 variables, 91/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 13/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 4/186 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-22 11:19:06] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/186 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/186 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 151 constraints, problems are : Problem set: 0 solved, 13 unsolved in 959 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 14/14 constraints]
After SMT, in 1395ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2068 ms.
Support contains 8 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 95/95 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-22 11:19:09] [INFO ] Invariant cache hit.
[2024-05-22 11:19:09] [INFO ] Implicit Places using invariants in 55 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 94/95 places, 91/91 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 90
Applied a total of 2 rules in 7 ms. Remains 93 /94 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 93 cols
[2024-05-22 11:19:09] [INFO ] Computed 15 invariants in 3 ms
[2024-05-22 11:19:09] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-22 11:19:09] [INFO ] Invariant cache hit.
[2024-05-22 11:19:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:19:09] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 93/95 places, 90/91 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 376 ms. Remains : 93/95 places, 90/91 transitions.
RANDOM walk for 40000 steps (5754 resets) in 584 ms. (68 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3658 resets) in 243 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3676 resets) in 162 ms. (245 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3616 resets) in 219 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3631 resets) in 216 ms. (184 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3666 resets) in 224 ms. (177 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 202 ms. (197 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3659 resets) in 195 ms. (204 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3673 resets) in 179 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3634 resets) in 200 ms. (199 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3619 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3678 resets) in 242 ms. (164 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3711 resets) in 219 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3721 resets) in 221 ms. (180 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 242767 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 13
Probabilistic random walk after 242767 steps, saw 121408 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-22 11:19:14] [INFO ] Invariant cache hit.
[2024-05-22 11:19:14] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 63/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 18/89 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 90/179 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 13/115 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:19:14] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:19:14] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-22 11:19:14] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 4/183 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 124 constraints, problems are : Problem set: 0 solved, 13 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 63/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 18/89 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:19:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:19:15] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 90/179 variables, 89/107 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 13/120 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 13/133 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 11:19:15] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:19:15] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/179 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 4/183 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/183 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/183 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/183 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 141 constraints, problems are : Problem set: 0 solved, 13 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 7/7 constraints]
After SMT, in 1147ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 4216 ms.
Support contains 8 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 93/93 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-22 11:19:19] [INFO ] Invariant cache hit.
[2024-05-22 11:19:19] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 11:19:19] [INFO ] Invariant cache hit.
[2024-05-22 11:19:19] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:19:20] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-22 11:19:20] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-22 11:19:20] [INFO ] Invariant cache hit.
[2024-05-22 11:19:20] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 2/91 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 2/93 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 11:19:20] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 90/183 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 122 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2045 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 2/91 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 2/93 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 90/183 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 89/211 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/183 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 211 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3209 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints]
After SMT, in 5289ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 5292ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5538 ms. Remains : 93/93 places, 90/90 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 93 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 92 transition count 89
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2 place count 92 transition count 82
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 85 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 82 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 82 transition count 79
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 82 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 81 transition count 78
Applied a total of 24 rules in 11 ms. Remains 81 /93 variables (removed 12) and now considering 78/90 (removed 12) transitions.
Running SMT prover for 13 properties.
// Phase 1: matrix 78 rows 81 cols
[2024-05-22 11:19:25] [INFO ] Computed 15 invariants in 4 ms
[2024-05-22 11:19:25] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-22 11:19:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:19:25] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 11:19:25] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2024-05-22 11:19:25] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:19:25] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:19:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2024-05-22 11:19:25] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-22 11:19:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-22 11:19:25] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:19:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
TRAPS : Iteration 1
[2024-05-22 11:19:25] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-22 11:19:25] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-22 11:19:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2024-05-22 11:19:25] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:19:25] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-05-22 11:19:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
TRAPS : Iteration 2
[2024-05-22 11:19:26] [INFO ] After 586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
[2024-05-22 11:19:26] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Over-approximation ignoring read arcs solved 0 properties in 763 ms.
FORMULA DoubleExponent-PT-004-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, +inf, 1]
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 93 rows 97 cols
[2024-05-22 11:19:26] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1425 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10000 steps (900 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 11:19:26] [INFO ] Invariant cache hit.
[2024-05-22 11:19:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:19:26] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:19:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:19:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:19:26] [INFO ] [Real]Added 12 Read/Feed constraints in 10 ms returned sat
[2024-05-22 11:19:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:19:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 11:19:26] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:19:26] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:19:26] [INFO ] [Nat]Added 12 Read/Feed constraints in 6 ms returned sat
[2024-05-22 11:19:26] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 2 ms to minimize.
[2024-05-22 11:19:26] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:19:26] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:19:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 141 ms
[2024-05-22 11:19:26] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 11:19:26] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:19:26] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-22 11:19:26] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:19:26] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-22 11:19:26] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:19:26] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 2 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:19:27] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1069 ms
[2024-05-22 11:19:27] [INFO ] Added : 90 causal constraints over 19 iterations in 1399 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 93/93 transitions.
Graph (complete) has 332 edges and 97 vertex of which 95 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 95 transition count 90
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 93 transition count 90
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 14 place count 89 transition count 86
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 89 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 87 transition count 84
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 87 transition count 84
Applied a total of 20 rules in 17 ms. Remains 87 /97 variables (removed 10) and now considering 84/93 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 87/97 places, 84/93 transitions.
Found an invariant !
This invariant on transitions {11=1, 12=1, 22=1, 33=1, 39=1, 57=1, 60=1, 63=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 12=1, 22=1, 33=1, 39=1, 57=1, 60=1, 63=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1450 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 84 rows 87 cols
[2024-05-22 11:19:30] [INFO ] Computed 15 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144342 resets) in 587 ms. (1700 steps per ms)
BEST_FIRST walk for 1000000 steps (91588 resets) in 425 ms. (2347 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 11:19:31] [INFO ] Invariant cache hit.
[2024-05-22 11:19:31] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:19:31] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 11:19:31] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 11:19:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:19:31] [INFO ] [Real]Added 14 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:19:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:19:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:19:31] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 11:19:31] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:19:31] [INFO ] [Nat]Added 14 Read/Feed constraints in 12 ms returned sat
[2024-05-22 11:19:31] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
[2024-05-22 11:19:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-22 11:19:31] [INFO ] Computed and/alt/rep : 80/447/80 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-22 11:19:31] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:19:31] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:19:31] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:19:31] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:19:31] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:19:31] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:19:31] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:19:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 339 ms
[2024-05-22 11:19:32] [INFO ] Added : 69 causal constraints over 15 iterations in 518 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 87/87 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 11:19:32] [INFO ] Invariant cache hit.
[2024-05-22 11:19:32] [INFO ] Implicit Places using invariants in 71 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/87 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 83
Applied a total of 2 rules in 5 ms. Remains 85 /86 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 85 cols
[2024-05-22 11:19:32] [INFO ] Computed 14 invariants in 4 ms
[2024-05-22 11:19:32] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 11:19:32] [INFO ] Invariant cache hit.
[2024-05-22 11:19:32] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:19:32] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 211 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/87 places, 83/84 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 81
Applied a total of 4 rules in 5 ms. Remains 82 /84 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 82 cols
[2024-05-22 11:19:32] [INFO ] Computed 13 invariants in 3 ms
[2024-05-22 11:19:32] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 11:19:32] [INFO ] Invariant cache hit.
[2024-05-22 11:19:32] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:19:32] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 82/87 places, 81/84 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 508 ms. Remains : 82/87 places, 81/84 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 19=1, 30=1, 36=1, 52=1, 55=1, 58=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1, 10=1, 19=1, 30=1, 36=1, 52=1, 55=1, 58=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 11:19:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144327 resets) in 583 ms. (1712 steps per ms)
BEST_FIRST walk for 1000000 steps (91498 resets) in 423 ms. (2358 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 11:19:33] [INFO ] Invariant cache hit.
[2024-05-22 11:19:33] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:19:33] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:19:33] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-22 11:19:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:19:33] [INFO ] [Real]Added 14 Read/Feed constraints in 13 ms returned sat
[2024-05-22 11:19:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:19:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:19:33] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-22 11:19:33] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 11:19:33] [INFO ] [Nat]Added 14 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:19:33] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:19:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-22 11:19:33] [INFO ] Computed and/alt/rep : 75/416/75 causal constraints (skipped 5 transitions) in 5 ms.
[2024-05-22 11:19:34] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-22 11:19:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:19:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2024-05-22 11:19:34] [INFO ] Added : 49 causal constraints over 10 iterations in 203 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 11:19:34] [INFO ] Invariant cache hit.
[2024-05-22 11:19:34] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 11:19:34] [INFO ] Invariant cache hit.
[2024-05-22 11:19:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:19:34] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-22 11:19:34] [INFO ] Redundant transitions in 2 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 11:19:34] [INFO ] Invariant cache hit.
[2024-05-22 11:19:34] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1674 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 76/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:19:37] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/163 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:19:39] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/163 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 15 (OVERLAPS) 0/163 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 191 constraints, problems are : Problem set: 0 solved, 80 unsolved in 5206 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 6906ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6910ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7123 ms. Remains : 82/82 places, 81/81 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 19=1, 30=1, 36=1, 52=1, 55=1, 58=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1, 10=1, 19=1, 30=1, 36=1, 52=1, 55=1, 58=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1412 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 40000 steps (5770 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3687 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1270584 steps, run timeout after 3001 ms. (steps per millisecond=423 ) properties seen :0 out of 1
Probabilistic random walk after 1270584 steps, saw 635286 distinct states, run finished after 3002 ms. (steps per millisecond=423 ) properties seen :0
[2024-05-22 11:19:44] [INFO ] Invariant cache hit.
[2024-05-22 11:19:44] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/64 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/82 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/158 variables, 73/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/163 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/64 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/82 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:19:44] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:19:44] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:19:44] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/158 variables, 73/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/163 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 301ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 81/81 transitions.
RANDOM walk for 40000 steps (5751 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3679 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1353775 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :0 out of 1
Probabilistic random walk after 1353775 steps, saw 676895 distinct states, run finished after 3001 ms. (steps per millisecond=451 ) properties seen :0
[2024-05-22 11:19:47] [INFO ] Invariant cache hit.
[2024-05-22 11:19:47] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/64 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/82 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/158 variables, 73/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/163 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/64 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/82 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:19:48] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:19:48] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:19:48] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/158 variables, 73/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/163 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 282ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 11:19:48] [INFO ] Invariant cache hit.
[2024-05-22 11:19:48] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 11:19:48] [INFO ] Invariant cache hit.
[2024-05-22 11:19:48] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:19:48] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-22 11:19:48] [INFO ] Redundant transitions in 2 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 11:19:48] [INFO ] Invariant cache hit.
[2024-05-22 11:19:48] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 80 unsolved in 12885 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 76/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:20:02] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/163 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:20:04] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/163 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 15 (OVERLAPS) 0/163 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 191 constraints, problems are : Problem set: 0 solved, 80 unsolved in 5052 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 17965ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 17967ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18177 ms. Remains : 82/82 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 82 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 76 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 73 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 73 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 72 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 69
Applied a total of 24 rules in 9 ms. Remains 70 /82 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 70 cols
[2024-05-22 11:20:06] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 11:20:06] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:20:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 11:20:06] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-22 11:20:06] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:20:06] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:20:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 1
[2024-05-22 11:20:06] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:20:06] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 140 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-00 in 40470 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 93 rows 97 cols
[2024-05-22 11:20:06] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1470 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10000 steps (911 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:20:06] [INFO ] Invariant cache hit.
[2024-05-22 11:20:06] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 11:20:06] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:20:06] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:20:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:20:06] [INFO ] [Real]Added 12 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:20:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:20:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:06] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:20:06] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:20:06] [INFO ] [Nat]Added 12 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:20:06] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 11:20:06] [INFO ] Added : 87 causal constraints over 20 iterations in 267 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 97 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p167) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 92/92 transitions.
Graph (complete) has 328 edges and 97 vertex of which 94 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 2 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 317 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 92 transition count 87
Reduce places removed 3 places and 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 89 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 88 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 88 transition count 84
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 20 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 29 place count 70 transition count 64
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 67 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 34 place count 66 transition count 63
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 66 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 36 place count 65 transition count 62
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 38 place count 65 transition count 62
Applied a total of 38 rules in 7 ms. Remains 65 /97 variables (removed 32) and now considering 62/92 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 65/97 places, 62/92 transitions.
// Phase 1: matrix 62 rows 65 cols
[2024-05-22 11:20:07] [INFO ] Computed 12 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144086 resets) in 574 ms. (1739 steps per ms)
BEST_FIRST walk for 1000000 steps (91586 resets) in 420 ms. (2375 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:20:08] [INFO ] Invariant cache hit.
[2024-05-22 11:20:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 11:20:08] [INFO ] [Real]Absence check using 3 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 11:20:08] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 11:20:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 11:20:08] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-22 11:20:08] [INFO ] Computed and/alt/rep : 60/322/60 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-22 11:20:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:20:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 11:20:08] [INFO ] [Nat]Absence check using 3 positive and 9 generalized place invariants in 1 ms returned sat
[2024-05-22 11:20:08] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-22 11:20:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:20:08] [INFO ] Computed and/alt/rep : 60/322/60 causal constraints (skipped 1 transitions) in 4 ms.
[2024-05-22 11:20:08] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-22 11:20:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-22 11:20:08] [INFO ] Added : 47 causal constraints over 10 iterations in 139 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 65/65 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 62/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 65 /65 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-22 11:20:08] [INFO ] Invariant cache hit.
[2024-05-22 11:20:08] [INFO ] Implicit Places using invariants in 55 ms returned [13, 20]
[2024-05-22 11:20:08] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/65 places, 62/62 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 61
Applied a total of 2 rules in 1 ms. Remains 63 /64 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 63 cols
[2024-05-22 11:20:08] [INFO ] Computed 11 invariants in 8 ms
[2024-05-22 11:20:08] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 11:20:08] [INFO ] Invariant cache hit.
[2024-05-22 11:20:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 11:20:08] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 63/65 places, 61/62 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 259 ms. Remains : 63/65 places, 61/62 transitions.
[2024-05-22 11:20:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144017 resets) in 578 ms. (1727 steps per ms)
BEST_FIRST walk for 1000001 steps (91511 resets) in 423 ms. (2358 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:20:09] [INFO ] Invariant cache hit.
[2024-05-22 11:20:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:09] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 0 ms returned sat
[2024-05-22 11:20:09] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-22 11:20:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 11:20:09] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-22 11:20:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:20:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-22 11:20:09] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 0 ms returned sat
[2024-05-22 11:20:09] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-22 11:20:09] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2024-05-22 11:20:09] [INFO ] Computed and/alt/rep : 59/315/59 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-22 11:20:10] [INFO ] Added : 59 causal constraints over 12 iterations in 129 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 63/63 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-22 11:20:10] [INFO ] Invariant cache hit.
[2024-05-22 11:20:10] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 11:20:10] [INFO ] Invariant cache hit.
[2024-05-22 11:20:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 11:20:10] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-22 11:20:10] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-22 11:20:10] [INFO ] Invariant cache hit.
[2024-05-22 11:20:10] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 60/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-22 11:20:11] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-22 11:20:11] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:20:11] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-22 11:20:11] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 148 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1631 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
After SMT, in 2463ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2464ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2627 ms. Remains : 63/63 places, 61/61 transitions.
RANDOM walk for 40000 steps (5720 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3662 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3664 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 785771 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :0 out of 2
Probabilistic random walk after 785771 steps, saw 393072 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :0
[2024-05-22 11:20:15] [INFO ] Invariant cache hit.
[2024-05-22 11:20:15] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:20:15] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:20:15] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/124 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 86 constraints, problems are : Problem set: 0 solved, 2 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/124 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 220ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 63/63 places, 61/61 transitions.
RANDOM walk for 40000 steps (5775 resets) in 58 ms. (677 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3614 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3680 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 682792 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :0 out of 2
Probabilistic random walk after 682792 steps, saw 341542 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
[2024-05-22 11:20:19] [INFO ] Invariant cache hit.
[2024-05-22 11:20:19] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:20:19] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:20:19] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/124 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 86 constraints, problems are : Problem set: 0 solved, 2 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/124 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 214ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 121 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 63/63 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-22 11:20:19] [INFO ] Invariant cache hit.
[2024-05-22 11:20:19] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 11:20:19] [INFO ] Invariant cache hit.
[2024-05-22 11:20:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 11:20:19] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-22 11:20:19] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-22 11:20:19] [INFO ] Invariant cache hit.
[2024-05-22 11:20:19] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 60/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-22 11:20:20] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:20:21] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-22 11:20:21] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-22 11:20:21] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 148 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1673 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
After SMT, in 2471ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2475ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2631 ms. Remains : 63/63 places, 61/61 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 63 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 58 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 56 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 56 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 55 transition count 53
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 55 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 54 transition count 52
Applied a total of 18 rules in 3 ms. Remains 54 /63 variables (removed 9) and now considering 52/61 (removed 9) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 52 rows 54 cols
[2024-05-22 11:20:22] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 11:20:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 11:20:22] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-22 11:20:22] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 11:20:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:20:22] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:20:22] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:20:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:22] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 15 ms returned sat
[2024-05-22 11:20:22] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 11:20:22] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 11:20:22] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 11:20:22] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 157 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-01 in 15731 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 93 rows 97 cols
[2024-05-22 11:20:22] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1468 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10000 steps (902 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:20:22] [INFO ] Invariant cache hit.
[2024-05-22 11:20:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:22] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:20:22] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 11:20:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:20:22] [INFO ] [Real]Added 12 Read/Feed constraints in 11 ms returned sat
[2024-05-22 11:20:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:20:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:22] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:20:22] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-22 11:20:22] [INFO ] [Nat]Added 12 Read/Feed constraints in 38 ms returned sat
[2024-05-22 11:20:22] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 11:20:22] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:20:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-22 11:20:22] [INFO ] Added : 87 causal constraints over 20 iterations in 396 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 97 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p197) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 92/92 transitions.
Graph (complete) has 329 edges and 97 vertex of which 94 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 2 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 93 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 91 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 91 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 90 transition count 86
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 87 transition count 83
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 87 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 85 transition count 81
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 85 transition count 81
Applied a total of 21 rules in 5 ms. Remains 85 /97 variables (removed 12) and now considering 81/92 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 85/97 places, 81/92 transitions.
// Phase 1: matrix 81 rows 85 cols
[2024-05-22 11:20:23] [INFO ] Computed 16 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144176 resets) in 600 ms. (1663 steps per ms)
BEST_FIRST walk for 1000001 steps (91287 resets) in 437 ms. (2283 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:20:24] [INFO ] Invariant cache hit.
[2024-05-22 11:20:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:24] [INFO ] [Real]Absence check using 7 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 11:20:24] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 11:20:24] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:20:24] [INFO ] [Real]Added 13 Read/Feed constraints in 12 ms returned sat
[2024-05-22 11:20:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:20:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:24] [INFO ] [Nat]Absence check using 7 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 11:20:24] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-22 11:20:24] [INFO ] [Nat]Added 13 Read/Feed constraints in 16 ms returned sat
[2024-05-22 11:20:24] [INFO ] Computed and/alt/rep : 79/446/79 causal constraints (skipped 1 transitions) in 6 ms.
[2024-05-22 11:20:24] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:20:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-22 11:20:24] [INFO ] Added : 79 causal constraints over 16 iterations in 286 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 85/85 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 11:20:24] [INFO ] Invariant cache hit.
[2024-05-22 11:20:24] [INFO ] Implicit Places using invariants in 62 ms returned [20, 39, 43]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/85 places, 81/81 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 82 transition count 77
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 78 transition count 77
Applied a total of 8 rules in 2 ms. Remains 78 /82 variables (removed 4) and now considering 77/81 (removed 4) transitions.
// Phase 1: matrix 77 rows 78 cols
[2024-05-22 11:20:24] [INFO ] Computed 13 invariants in 3 ms
[2024-05-22 11:20:24] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 11:20:24] [INFO ] Invariant cache hit.
[2024-05-22 11:20:24] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:20:24] [INFO ] Implicit Places using invariants and state equation in 136 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 202 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 77/85 places, 77/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 271 ms. Remains : 77/85 places, 77/81 transitions.
// Phase 1: matrix 77 rows 77 cols
[2024-05-22 11:20:24] [INFO ] Computed 12 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144380 resets) in 606 ms. (1647 steps per ms)
BEST_FIRST walk for 1000000 steps (91141 resets) in 436 ms. (2288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:20:25] [INFO ] Invariant cache hit.
[2024-05-22 11:20:26] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:26] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 11:20:26] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 11:20:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:20:26] [INFO ] [Real]Added 13 Read/Feed constraints in 5 ms returned sat
[2024-05-22 11:20:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:20:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:26] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 11:20:26] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 11:20:26] [INFO ] [Nat]Added 13 Read/Feed constraints in 10 ms returned sat
[2024-05-22 11:20:26] [INFO ] Computed and/alt/rep : 75/432/75 causal constraints (skipped 1 transitions) in 7 ms.
[2024-05-22 11:20:26] [INFO ] Added : 72 causal constraints over 15 iterations in 184 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 77/77 places, 77/77 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-22 11:20:26] [INFO ] Invariant cache hit.
[2024-05-22 11:20:26] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 11:20:26] [INFO ] Invariant cache hit.
[2024-05-22 11:20:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:20:26] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-22 11:20:26] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-22 11:20:26] [INFO ] Invariant cache hit.
[2024-05-22 11:20:26] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/154 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 102 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/154 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 76/178 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-22 11:20:28] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:20:28] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-22 11:20:28] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-22 11:20:28] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:20:28] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:20:28] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 6/184 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 184 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2817 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 6/6 constraints]
After SMT, in 3999ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 4000ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4217 ms. Remains : 77/77 places, 77/77 transitions.
RANDOM walk for 40000 steps (5728 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3639 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3641 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 668221 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 2
Probabilistic random walk after 668221 steps, saw 334181 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
[2024-05-22 11:20:33] [INFO ] Invariant cache hit.
[2024-05-22 11:20:33] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:20:33] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:20:33] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:20:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/72 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 77/149 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/154 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:20:33] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:20:33] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-22 11:20:33] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/72 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:20:34] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 77/149 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/154 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/154 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 441ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 162 ms.
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 77/77 places, 77/77 transitions.
RANDOM walk for 40000 steps (5787 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3617 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3626 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 549336 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 2
Probabilistic random walk after 549336 steps, saw 274732 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2024-05-22 11:20:37] [INFO ] Invariant cache hit.
[2024-05-22 11:20:37] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:20:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:20:37] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:20:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/72 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 77/149 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/154 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:20:37] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-22 11:20:37] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-22 11:20:37] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/72 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:20:37] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 77/149 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/154 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/154 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 443ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 77/77 places, 77/77 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-22 11:20:37] [INFO ] Invariant cache hit.
[2024-05-22 11:20:37] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 11:20:37] [INFO ] Invariant cache hit.
[2024-05-22 11:20:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:20:38] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-22 11:20:38] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-22 11:20:38] [INFO ] Invariant cache hit.
[2024-05-22 11:20:38] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/154 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 102 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/154 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 76/178 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-22 11:20:40] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:20:40] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-05-22 11:20:40] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:20:40] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:20:40] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:20:40] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 6/184 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 184 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2947 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 6/6 constraints]
After SMT, in 4134ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 4135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4356 ms. Remains : 77/77 places, 77/77 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 77 transition count 71
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 71 transition count 71
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 68 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 68 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 67 transition count 67
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 67 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 65 transition count 65
Applied a total of 24 rules in 10 ms. Remains 65 /77 variables (removed 12) and now considering 65/77 (removed 12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 65 rows 65 cols
[2024-05-22 11:20:42] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 11:20:42] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:42] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 11:20:42] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 11:20:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:20:42] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:20:42] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:20:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:42] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 11:20:42] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 11:20:42] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 11:20:42] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-22 11:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
TRAPS : Iteration 1
[2024-05-22 11:20:42] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 11:20:42] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 209 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-02 in 20123 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 93 rows 97 cols
[2024-05-22 11:20:42] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (1456 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10001 steps (938 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-22 11:20:42] [INFO ] Invariant cache hit.
[2024-05-22 11:20:42] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:42] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:20:42] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:20:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:20:42] [INFO ] [Real]Added 12 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:20:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:20:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:42] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:20:42] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 11:20:42] [INFO ] [Nat]Added 12 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:20:42] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 11:20:42] [INFO ] Added : 88 causal constraints over 18 iterations in 257 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 93/93 transitions.
Graph (complete) has 332 edges and 97 vertex of which 94 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 94 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 92 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 92 transition count 90
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 91 transition count 90
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 87 transition count 86
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 87 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 86 transition count 85
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 86 transition count 85
Applied a total of 20 rules in 13 ms. Remains 86 /97 variables (removed 11) and now considering 85/93 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 86/97 places, 85/93 transitions.
// Phase 1: matrix 85 rows 86 cols
[2024-05-22 11:20:43] [INFO ] Computed 14 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (144164 resets) in 645 ms. (1547 steps per ms)
BEST_FIRST walk for 1000001 steps (91462 resets) in 466 ms. (2141 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-22 11:20:44] [INFO ] Invariant cache hit.
[2024-05-22 11:20:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:44] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2024-05-22 11:20:44] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 11:20:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:20:44] [INFO ] [Real]Added 14 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:20:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:20:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 11:20:44] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 11:20:44] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 11:20:44] [INFO ] [Nat]Added 14 Read/Feed constraints in 11 ms returned sat
[2024-05-22 11:20:44] [INFO ] Computed and/alt/rep : 81/464/81 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-22 11:20:44] [INFO ] Added : 78 causal constraints over 17 iterations in 279 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 86/86 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-22 11:20:44] [INFO ] Invariant cache hit.
[2024-05-22 11:20:44] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 11:20:44] [INFO ] Invariant cache hit.
[2024-05-22 11:20:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:20:44] [INFO ] Implicit Places using invariants and state equation in 184 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 245 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/86 places, 85/85 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 84
Applied a total of 2 rules in 3 ms. Remains 84 /85 variables (removed 1) and now considering 84/85 (removed 1) transitions.
// Phase 1: matrix 84 rows 84 cols
[2024-05-22 11:20:44] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 11:20:44] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 11:20:45] [INFO ] Invariant cache hit.
[2024-05-22 11:20:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:20:45] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/86 places, 84/85 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 521 ms. Remains : 84/86 places, 84/85 transitions.
[2024-05-22 11:20:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (144050 resets) in 652 ms. (1531 steps per ms)
BEST_FIRST walk for 1000001 steps (91371 resets) in 472 ms. (2114 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-22 11:20:46] [INFO ] Invariant cache hit.
[2024-05-22 11:20:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:46] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-22 11:20:46] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 11:20:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:20:46] [INFO ] [Real]Added 14 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:20:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:20:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 11:20:46] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-22 11:20:46] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 11:20:46] [INFO ] [Nat]Added 14 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:20:46] [INFO ] Computed and/alt/rep : 80/459/80 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-22 11:20:46] [INFO ] Added : 73 causal constraints over 16 iterations in 225 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 84/84 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 11:20:46] [INFO ] Invariant cache hit.
[2024-05-22 11:20:46] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 11:20:46] [INFO ] Invariant cache hit.
[2024-05-22 11:20:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:20:47] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-22 11:20:47] [INFO ] Redundant transitions in 2 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-22 11:20:47] [INFO ] Invariant cache hit.
[2024-05-22 11:20:47] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1779 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 83/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/168 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-22 11:20:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 195 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 1/1 constraints]
After SMT, in 6988ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 6989ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7291 ms. Remains : 84/84 places, 84/84 transitions.
RANDOM walk for 40000 steps (5722 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3661 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3596 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 721468 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 2
Probabilistic random walk after 721468 steps, saw 360819 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
[2024-05-22 11:20:57] [INFO ] Invariant cache hit.
[2024-05-22 11:20:57] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 82/154 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 13/167 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 14 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 1 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 11:20:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/72 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 82/154 variables, 72/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 13/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/167 variables, 11/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 2/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 1/112 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/168 variables, 1/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/168 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 113 constraints, problems are : Problem set: 1 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 260ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 84/84 places, 84/84 transitions.
RANDOM walk for 40000 steps (5771 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3627 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1327533 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :0 out of 1
Probabilistic random walk after 1327533 steps, saw 663772 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
[2024-05-22 11:21:00] [INFO ] Invariant cache hit.
[2024-05-22 11:21:00] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 82/154 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/167 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:21:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/72 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 82/154 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/167 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/168 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/168 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 195ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 11:21:00] [INFO ] Invariant cache hit.
[2024-05-22 11:21:00] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 11:21:00] [INFO ] Invariant cache hit.
[2024-05-22 11:21:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:21:01] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-22 11:21:01] [INFO ] Redundant transitions in 4 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-22 11:21:01] [INFO ] Invariant cache hit.
[2024-05-22 11:21:01] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 83/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/168 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-22 11:21:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 195 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5244 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 1/1 constraints]
After SMT, in 7028ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 7029ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7322 ms. Remains : 84/84 places, 84/84 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 84 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 77 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 74 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 74 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 73 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 72 transition count 72
Applied a total of 24 rules in 16 ms. Remains 72 /84 variables (removed 12) and now considering 72/84 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 72 cols
[2024-05-22 11:21:08] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 11:21:08] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:21:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 11:21:08] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-22 11:21:08] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:21:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:21:08] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:21:08] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-22 11:21:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 1
[2024-05-22 11:21:08] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:21:08] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 160 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-04 in 25859 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 93 rows 97 cols
[2024-05-22 11:21:08] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1449 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10000 steps (914 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:21:08] [INFO ] Invariant cache hit.
[2024-05-22 11:21:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:08] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:21:08] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-22 11:21:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:21:08] [INFO ] [Real]Added 12 Read/Feed constraints in 15 ms returned sat
[2024-05-22 11:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:21:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:08] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:21:08] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:21:08] [INFO ] [Nat]Added 12 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:21:08] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 11:21:08] [INFO ] Added : 92 causal constraints over 19 iterations in 287 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 93/93 transitions.
Graph (complete) has 332 edges and 97 vertex of which 95 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 95 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 93 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 93 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 92 transition count 90
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 88 transition count 86
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 88 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 86 transition count 84
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 86 transition count 84
Applied a total of 21 rules in 8 ms. Remains 86 /97 variables (removed 11) and now considering 84/93 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 86/97 places, 84/93 transitions.
// Phase 1: matrix 84 rows 86 cols
[2024-05-22 11:21:09] [INFO ] Computed 15 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144241 resets) in 623 ms. (1602 steps per ms)
BEST_FIRST walk for 1000000 steps (91508 resets) in 450 ms. (2217 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:21:10] [INFO ] Invariant cache hit.
[2024-05-22 11:21:10] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:10] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 11:21:10] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-22 11:21:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:21:10] [INFO ] [Real]Added 14 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:21:10] [INFO ] Computed and/alt/rep : 80/463/80 causal constraints (skipped 3 transitions) in 7 ms.
[2024-05-22 11:21:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:21:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 11:21:10] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-22 11:21:10] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 11:21:10] [INFO ] [Nat]Added 14 Read/Feed constraints in 13 ms returned sat
[2024-05-22 11:21:10] [INFO ] Computed and/alt/rep : 80/463/80 causal constraints (skipped 3 transitions) in 8 ms.
[2024-05-22 11:21:10] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:21:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-22 11:21:10] [INFO ] Added : 77 causal constraints over 16 iterations in 343 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 86/86 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 11:21:10] [INFO ] Invariant cache hit.
[2024-05-22 11:21:10] [INFO ] Implicit Places using invariants in 61 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/86 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 83
Applied a total of 2 rules in 3 ms. Remains 84 /85 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 84 cols
[2024-05-22 11:21:10] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 11:21:10] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 11:21:10] [INFO ] Invariant cache hit.
[2024-05-22 11:21:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:21:11] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/86 places, 83/84 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 317 ms. Remains : 84/86 places, 83/84 transitions.
[2024-05-22 11:21:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144360 resets) in 616 ms. (1620 steps per ms)
BEST_FIRST walk for 1000001 steps (91443 resets) in 442 ms. (2257 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:21:12] [INFO ] Invariant cache hit.
[2024-05-22 11:21:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 11:21:12] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 6 ms returned sat
[2024-05-22 11:21:12] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 11:21:12] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:21:12] [INFO ] [Real]Added 14 Read/Feed constraints in 11 ms returned sat
[2024-05-22 11:21:12] [INFO ] Computed and/alt/rep : 79/458/79 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-22 11:21:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:21:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:12] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 11:21:12] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-22 11:21:12] [INFO ] [Nat]Added 14 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:21:12] [INFO ] Computed and/alt/rep : 79/458/79 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-22 11:21:12] [INFO ] Added : 76 causal constraints over 16 iterations in 325 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-22 11:21:12] [INFO ] Invariant cache hit.
[2024-05-22 11:21:12] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 11:21:12] [INFO ] Invariant cache hit.
[2024-05-22 11:21:12] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:21:13] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-05-22 11:21:13] [INFO ] Redundant transitions in 12 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-22 11:21:13] [INFO ] Invariant cache hit.
[2024-05-22 11:21:13] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 11:21:13] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:21:13] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:21:13] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:21:13] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-05-22 11:21:13] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:21:13] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/167 variables, 84/104 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 14/118 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 118 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1984 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/167 variables, 84/104 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 14/118 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 82/200 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 11:21:16] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (OVERLAPS) 0/167 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 201 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3404 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints]
After SMT, in 5418ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 5420ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5691 ms. Remains : 84/84 places, 83/83 transitions.
RANDOM walk for 40000 steps (5747 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3653 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3653 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 644371 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 2
Probabilistic random walk after 644371 steps, saw 322261 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
[2024-05-22 11:21:21] [INFO ] Invariant cache hit.
[2024-05-22 11:21:21] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:21:21] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/80 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:21:21] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:21:21] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-22 11:21:21] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-22 11:21:21] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 83/163 variables, 80/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/167 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:21:21] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/80 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:21:22] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 83/163 variables, 80/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/167 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 551ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 180 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 83/83 transitions.
RANDOM walk for 40000 steps (5769 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3728 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3745 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 691842 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 2
Probabilistic random walk after 691842 steps, saw 345994 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
[2024-05-22 11:21:25] [INFO ] Invariant cache hit.
[2024-05-22 11:21:25] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:21:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/80 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:21:25] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:21:25] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:21:25] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-22 11:21:25] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 83/163 variables, 80/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/167 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:21:25] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/80 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:21:25] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 83/163 variables, 80/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/167 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 516ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 279 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-22 11:21:26] [INFO ] Invariant cache hit.
[2024-05-22 11:21:26] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 11:21:26] [INFO ] Invariant cache hit.
[2024-05-22 11:21:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:21:26] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-22 11:21:26] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-22 11:21:26] [INFO ] Invariant cache hit.
[2024-05-22 11:21:26] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 11:21:27] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:21:27] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-22 11:21:27] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:21:27] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:21:27] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:21:27] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/167 variables, 84/104 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 14/118 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 118 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2006 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/167 variables, 84/104 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 14/118 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 82/200 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 11:21:29] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (OVERLAPS) 0/167 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 201 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3552 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints]
After SMT, in 5583ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 5584ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5833 ms. Remains : 84/84 places, 83/83 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 84 transition count 76
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 77 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 74 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 74 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 73 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 72 transition count 71
Applied a total of 24 rules in 8 ms. Remains 72 /84 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 71 rows 72 cols
[2024-05-22 11:21:32] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 11:21:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:32] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 11:21:32] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 11:21:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:21:32] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:21:32] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:21:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:32] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 11:21:32] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 11:21:32] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 11:21:32] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 11:21:32] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 159 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-05 in 23992 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 93 rows 97 cols
[2024-05-22 11:21:32] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1450 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10000 steps (910 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:21:32] [INFO ] Invariant cache hit.
[2024-05-22 11:21:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 11:21:32] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:21:32] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 11:21:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:21:32] [INFO ] [Real]Added 12 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:21:32] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 11:21:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:21:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:32] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:21:32] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 11:21:32] [INFO ] [Nat]Added 12 Read/Feed constraints in 12 ms returned sat
[2024-05-22 11:21:32] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 11:21:32] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:21:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-22 11:21:32] [INFO ] Added : 69 causal constraints over 14 iterations in 228 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 97 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p174) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 91/91 transitions.
Graph (complete) has 330 edges and 97 vertex of which 94 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 2 places and 2 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 92 transition count 87
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 306 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 89 transition count 84
Reduce places removed 3 places and 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 86 transition count 81
Reduce places removed 3 places and 3 transitions.
Graph (complete) has 282 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 17 place count 82 transition count 77
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 274 edges and 80 vertex of which 78 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 21 place count 78 transition count 74
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 261 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 24 place count 75 transition count 72
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 25 place count 74 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 26 place count 73 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 27 place count 72 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 27 place count 72 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 32 place count 69 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 34 place count 68 transition count 64
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 36 place count 68 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 38 place count 66 transition count 62
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 40 place count 66 transition count 62
Applied a total of 40 rules in 20 ms. Remains 66 /97 variables (removed 31) and now considering 62/91 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 66/97 places, 62/91 transitions.
// Phase 1: matrix 62 rows 66 cols
[2024-05-22 11:21:32] [INFO ] Computed 12 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144162 resets) in 592 ms. (1686 steps per ms)
BEST_FIRST walk for 1000000 steps (91769 resets) in 438 ms. (2277 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:21:33] [INFO ] Invariant cache hit.
[2024-05-22 11:21:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 11:21:33] [INFO ] [Real]Absence check using 3 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 11:21:33] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 11:21:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 11:21:33] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-22 11:21:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:21:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 11:21:34] [INFO ] [Nat]Absence check using 3 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 11:21:34] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-22 11:21:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-22 11:21:34] [INFO ] Computed and/alt/rep : 60/324/60 causal constraints (skipped 1 transitions) in 5 ms.
[2024-05-22 11:21:34] [INFO ] Added : 59 causal constraints over 13 iterations in 124 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 66/66 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 62/62 transitions.
Applied a total of 0 rules in 0 ms. Remains 66 /66 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-22 11:21:34] [INFO ] Invariant cache hit.
[2024-05-22 11:21:34] [INFO ] Implicit Places using invariants in 52 ms returned [13, 20]
[2024-05-22 11:21:34] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/66 places, 62/62 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 61
Applied a total of 2 rules in 2 ms. Remains 64 /65 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 64 cols
[2024-05-22 11:21:34] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 11:21:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 11:21:34] [INFO ] Invariant cache hit.
[2024-05-22 11:21:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 11:21:34] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 163 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 63/66 places, 61/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 219 ms. Remains : 63/66 places, 61/62 transitions.
// Phase 1: matrix 61 rows 63 cols
[2024-05-22 11:21:34] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144412 resets) in 570 ms. (1751 steps per ms)
BEST_FIRST walk for 1000000 steps (91292 resets) in 424 ms. (2352 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:21:35] [INFO ] Invariant cache hit.
[2024-05-22 11:21:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:35] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 11:21:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 11:21:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 11:21:35] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-22 11:21:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:21:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:35] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 11:21:35] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-22 11:21:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2024-05-22 11:21:35] [INFO ] Computed and/alt/rep : 59/315/59 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-22 11:21:35] [INFO ] Added : 53 causal constraints over 12 iterations in 112 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 63/63 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-22 11:21:35] [INFO ] Invariant cache hit.
[2024-05-22 11:21:35] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 11:21:35] [INFO ] Invariant cache hit.
[2024-05-22 11:21:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 11:21:35] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-22 11:21:35] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-22 11:21:35] [INFO ] Invariant cache hit.
[2024-05-22 11:21:35] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 774 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 60/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2043ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2044ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2192 ms. Remains : 63/63 places, 61/61 transitions.
RANDOM walk for 40000 steps (5786 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3711 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3704 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 605392 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 2
Probabilistic random walk after 605392 steps, saw 302825 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
[2024-05-22 11:21:41] [INFO ] Invariant cache hit.
[2024-05-22 11:21:41] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:21:41] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:21:41] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/124 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 86 constraints, problems are : Problem set: 0 solved, 2 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/124 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 230ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 152 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 63/63 places, 61/61 transitions.
RANDOM walk for 40000 steps (5751 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3697 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3722 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 485919 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 2
Probabilistic random walk after 485919 steps, saw 243066 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2024-05-22 11:21:44] [INFO ] Invariant cache hit.
[2024-05-22 11:21:44] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:21:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:21:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/124 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 86 constraints, problems are : Problem set: 0 solved, 2 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/124 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 83 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 63/63 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-22 11:21:44] [INFO ] Invariant cache hit.
[2024-05-22 11:21:44] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 11:21:44] [INFO ] Invariant cache hit.
[2024-05-22 11:21:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 11:21:45] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-22 11:21:45] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-22 11:21:45] [INFO ] Invariant cache hit.
[2024-05-22 11:21:45] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 60/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 144 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1227 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2021ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2022ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2186 ms. Remains : 63/63 places, 61/61 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 63 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 58 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 56 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 56 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 55 transition count 53
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 55 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 54 transition count 52
Applied a total of 18 rules in 13 ms. Remains 54 /63 variables (removed 9) and now considering 52/61 (removed 9) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 52 rows 54 cols
[2024-05-22 11:21:47] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 11:21:47] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 11:21:47] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-22 11:21:47] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 11:21:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:21:47] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:21:47] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:21:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:47] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-22 11:21:47] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 11:21:47] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 11:21:47] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:21:47] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:21:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
TRAPS : Iteration 1
[2024-05-22 11:21:47] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 11:21:47] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 243 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-08 in 15035 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 93 rows 97 cols
[2024-05-22 11:21:47] [INFO ] Computed 16 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1443 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10000 steps (895 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 11:21:47] [INFO ] Invariant cache hit.
[2024-05-22 11:21:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:47] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-22 11:21:47] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 11:21:47] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:21:47] [INFO ] [Real]Added 12 Read/Feed constraints in 11 ms returned sat
[2024-05-22 11:21:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:21:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:47] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:21:47] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 11:21:47] [INFO ] [Nat]Added 12 Read/Feed constraints in 7 ms returned sat
[2024-05-22 11:21:47] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:21:47] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-22 11:21:47] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:21:47] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:21:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 179 ms
[2024-05-22 11:21:47] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 11:21:47] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-22 11:21:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-22 11:21:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2024-05-22 11:21:47] [INFO ] Added : 68 causal constraints over 14 iterations in 297 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 93/93 transitions.
Graph (complete) has 332 edges and 97 vertex of which 95 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 95 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 94 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 94 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 93 transition count 90
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 89 transition count 86
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 89 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 87 transition count 84
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 87 transition count 84
Applied a total of 20 rules in 6 ms. Remains 87 /97 variables (removed 10) and now considering 84/93 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 87/97 places, 84/93 transitions.
Found an invariant !
This invariant on transitions {11=1, 12=1, 22=1, 33=1, 39=1, 57=1, 60=1, 63=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 12=1, 22=1, 33=1, 39=1, 57=1, 60=1, 63=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 84 rows 87 cols
[2024-05-22 11:21:48] [INFO ] Computed 15 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144475 resets) in 590 ms. (1692 steps per ms)
BEST_FIRST walk for 1000000 steps (91118 resets) in 432 ms. (2309 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 11:21:49] [INFO ] Invariant cache hit.
[2024-05-22 11:21:49] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:49] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 11:21:49] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-22 11:21:49] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:21:49] [INFO ] [Real]Added 14 Read/Feed constraints in 3 ms returned sat
[2024-05-22 11:21:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:21:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:49] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 11:21:49] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-22 11:21:49] [INFO ] [Nat]Added 14 Read/Feed constraints in 12 ms returned sat
[2024-05-22 11:21:49] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:21:49] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:21:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2024-05-22 11:21:49] [INFO ] Computed and/alt/rep : 80/447/80 causal constraints (skipped 3 transitions) in 4 ms.
[2024-05-22 11:21:49] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:21:49] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-22 11:21:49] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:21:49] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:21:49] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:21:49] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:21:49] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:21:50] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:21:50] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:21:50] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:21:50] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:21:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 488 ms
[2024-05-22 11:21:50] [INFO ] Added : 64 causal constraints over 14 iterations in 642 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 87/87 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 11:21:50] [INFO ] Invariant cache hit.
[2024-05-22 11:21:50] [INFO ] Implicit Places using invariants in 61 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/87 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 83
Applied a total of 2 rules in 2 ms. Remains 85 /86 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 85 cols
[2024-05-22 11:21:50] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 11:21:50] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 11:21:50] [INFO ] Invariant cache hit.
[2024-05-22 11:21:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:21:50] [INFO ] Implicit Places using invariants and state equation in 239 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 293 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/87 places, 83/84 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 81
Applied a total of 4 rules in 3 ms. Remains 82 /84 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 82 cols
[2024-05-22 11:21:50] [INFO ] Computed 13 invariants in 2 ms
[2024-05-22 11:21:50] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 11:21:50] [INFO ] Invariant cache hit.
[2024-05-22 11:21:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:21:50] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 82/87 places, 81/84 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 580 ms. Remains : 82/87 places, 81/84 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 19=1, 30=1, 36=1, 52=1, 55=1, 58=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1, 10=1, 19=1, 30=1, 36=1, 52=1, 55=1, 58=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 11:21:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144446 resets) in 594 ms. (1680 steps per ms)
BEST_FIRST walk for 1000001 steps (91430 resets) in 432 ms. (2309 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 11:21:52] [INFO ] Invariant cache hit.
[2024-05-22 11:21:52] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:52] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:21:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-22 11:21:52] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:21:52] [INFO ] [Real]Added 14 Read/Feed constraints in 13 ms returned sat
[2024-05-22 11:21:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:21:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 11:21:52] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-22 11:21:52] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 11:21:52] [INFO ] [Nat]Added 14 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:21:52] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-22 11:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-22 11:21:52] [INFO ] Computed and/alt/rep : 75/416/75 causal constraints (skipped 5 transitions) in 6 ms.
[2024-05-22 11:21:52] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-22 11:21:52] [INFO ] Added : 60 causal constraints over 13 iterations in 231 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 11:21:52] [INFO ] Invariant cache hit.
[2024-05-22 11:21:52] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 11:21:52] [INFO ] Invariant cache hit.
[2024-05-22 11:21:52] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:21:52] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-22 11:21:52] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 11:21:52] [INFO ] Invariant cache hit.
[2024-05-22 11:21:52] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1621 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 76/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:21:55] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/163 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:21:57] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:21:57] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-22 11:21:57] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/163 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:21:58] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:21:58] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:21:58] [INFO ] Deduced a trap composed of 43 places in 27 ms of which 0 ms to minimize.
[2024-05-22 11:21:58] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:21:58] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 5/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 16 (OVERLAPS) 0/163 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 198 constraints, problems are : Problem set: 0 solved, 80 unsolved in 6230 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
After SMT, in 7869ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 7870ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8116 ms. Remains : 82/82 places, 81/81 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 19=1, 30=1, 36=1, 52=1, 55=1, 58=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1, 10=1, 19=1, 30=1, 36=1, 52=1, 55=1, 58=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 40000 steps (5754 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3714 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1378220 steps, run timeout after 3001 ms. (steps per millisecond=459 ) properties seen :0 out of 1
Probabilistic random walk after 1378220 steps, saw 689121 distinct states, run finished after 3001 ms. (steps per millisecond=459 ) properties seen :0
[2024-05-22 11:22:03] [INFO ] Invariant cache hit.
[2024-05-22 11:22:03] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/64 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/82 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/158 variables, 73/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/163 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/64 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/82 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:22:04] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:22:04] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:22:04] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/158 variables, 73/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:22:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/163 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/163 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/163 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 81/81 transitions.
RANDOM walk for 40000 steps (5768 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3683 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1393317 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :0 out of 1
Probabilistic random walk after 1393317 steps, saw 696670 distinct states, run finished after 3001 ms. (steps per millisecond=464 ) properties seen :0
[2024-05-22 11:22:07] [INFO ] Invariant cache hit.
[2024-05-22 11:22:07] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/64 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/82 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/158 variables, 73/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/163 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/64 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/82 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:22:07] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-22 11:22:07] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:22:07] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/158 variables, 73/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:22:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/163 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/163 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/163 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 297ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 11:22:07] [INFO ] Invariant cache hit.
[2024-05-22 11:22:07] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 11:22:07] [INFO ] Invariant cache hit.
[2024-05-22 11:22:07] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:22:07] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-22 11:22:07] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 11:22:07] [INFO ] Invariant cache hit.
[2024-05-22 11:22:07] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1588 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 76/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:22:10] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/163 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:22:12] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:22:12] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:22:12] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/163 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:22:13] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:22:13] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 0 ms to minimize.
[2024-05-22 11:22:13] [INFO ] Deduced a trap composed of 43 places in 27 ms of which 1 ms to minimize.
[2024-05-22 11:22:13] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
[2024-05-22 11:22:13] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 5/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 16 (OVERLAPS) 0/163 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 198 constraints, problems are : Problem set: 0 solved, 80 unsolved in 6077 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
After SMT, in 7691ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 7692ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7917 ms. Remains : 82/82 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 82 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 76 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 73 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 73 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 72 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 69
Applied a total of 24 rules in 9 ms. Remains 70 /82 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 70 cols
[2024-05-22 11:22:15] [INFO ] Computed 13 invariants in 0 ms
[2024-05-22 11:22:15] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 11:22:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 11:22:15] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-22 11:22:15] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 11:22:15] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:22:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 1
[2024-05-22 11:22:15] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 11:22:15] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 150 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-12 in 28315 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 93 rows 97 cols
[2024-05-22 11:22:15] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1439 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (931 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:22:15] [INFO ] Invariant cache hit.
[2024-05-22 11:22:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 11:22:15] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:22:15] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 11:22:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:22:15] [INFO ] [Real]Added 12 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:22:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:22:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-22 11:22:15] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 11:22:15] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-22 11:22:15] [INFO ] [Nat]Added 12 Read/Feed constraints in 11 ms returned sat
[2024-05-22 11:22:15] [INFO ] Computed and/alt/rep : 92/451/92 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 11:22:15] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 11:22:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-22 11:22:16] [INFO ] Added : 78 causal constraints over 16 iterations in 255 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 97 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p204) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 92/92 transitions.
Graph (complete) has 330 edges and 97 vertex of which 94 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 93 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 91 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 91 transition count 87
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 14 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 18 place count 81 transition count 73
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 78 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 76 transition count 71
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 76 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 31 place count 73 transition count 68
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 73 transition count 68
Applied a total of 33 rules in 4 ms. Remains 73 /97 variables (removed 24) and now considering 68/92 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 73/97 places, 68/92 transitions.
// Phase 1: matrix 68 rows 73 cols
[2024-05-22 11:22:16] [INFO ] Computed 13 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143615 resets) in 571 ms. (1748 steps per ms)
BEST_FIRST walk for 1000001 steps (91096 resets) in 438 ms. (2277 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:22:17] [INFO ] Invariant cache hit.
[2024-05-22 11:22:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 11:22:17] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:22:17] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-22 11:22:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:22:17] [INFO ] [Real]Added 12 Read/Feed constraints in 4 ms returned sat
[2024-05-22 11:22:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:22:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 11:22:17] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 11:22:17] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-22 11:22:17] [INFO ] [Nat]Added 12 Read/Feed constraints in 8 ms returned sat
[2024-05-22 11:22:17] [INFO ] Computed and/alt/rep : 66/356/66 causal constraints (skipped 1 transitions) in 5 ms.
[2024-05-22 11:22:17] [INFO ] Added : 63 causal constraints over 14 iterations in 171 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 73/73 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-22 11:22:17] [INFO ] Invariant cache hit.
[2024-05-22 11:22:17] [INFO ] Implicit Places using invariants in 52 ms returned [13, 20]
[2024-05-22 11:22:17] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 72/73 places, 68/68 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 67
Applied a total of 2 rules in 2 ms. Remains 71 /72 variables (removed 1) and now considering 67/68 (removed 1) transitions.
// Phase 1: matrix 67 rows 71 cols
[2024-05-22 11:22:17] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 11:22:17] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 11:22:17] [INFO ] Invariant cache hit.
[2024-05-22 11:22:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:22:17] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 164 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 70/73 places, 67/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 221 ms. Remains : 70/73 places, 67/68 transitions.
// Phase 1: matrix 67 rows 70 cols
[2024-05-22 11:22:17] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144504 resets) in 596 ms. (1675 steps per ms)
BEST_FIRST walk for 1000000 steps (91513 resets) in 416 ms. (2398 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 11:22:18] [INFO ] Invariant cache hit.
[2024-05-22 11:22:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 11:22:18] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:22:18] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-22 11:22:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:22:18] [INFO ] [Real]Added 12 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:22:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 11:22:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 11:22:18] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:22:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-22 11:22:18] [INFO ] [Nat]Added 12 Read/Feed constraints in 9 ms returned sat
[2024-05-22 11:22:18] [INFO ] Computed and/alt/rep : 65/347/65 causal constraints (skipped 1 transitions) in 4 ms.
[2024-05-22 11:22:19] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-22 11:22:19] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-22 11:22:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 11:22:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 116 ms
[2024-05-22 11:22:19] [INFO ] Added : 64 causal constraints over 14 iterations in 253 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 70/70 places, 67/67 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2024-05-22 11:22:19] [INFO ] Invariant cache hit.
[2024-05-22 11:22:19] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 11:22:19] [INFO ] Invariant cache hit.
[2024-05-22 11:22:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:22:19] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-22 11:22:19] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-22 11:22:19] [INFO ] Invariant cache hit.
[2024-05-22 11:22:19] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/137 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 93 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/137 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 66/159 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 11:22:21] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-22 11:22:21] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 11:22:21] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:22:21] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 11:22:22] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/137 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 11:22:23] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:22:23] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-22 11:22:23] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-22 11:22:24] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-22 11:22:24] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/137 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 11:22:24] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:22:24] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:22:24] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-22 11:22:25] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-22 11:22:25] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 1 ms to minimize.
[2024-05-22 11:22:25] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2024-05-22 11:22:25] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/137 variables, 7/176 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 17 (OVERLAPS) 0/137 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 176 constraints, problems are : Problem set: 0 solved, 66 unsolved in 5910 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 17/17 constraints]
After SMT, in 7167ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 7168ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7364 ms. Remains : 70/70 places, 67/67 transitions.
RANDOM walk for 40000 steps (5740 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3598 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3687 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 774759 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 2
Probabilistic random walk after 774759 steps, saw 387555 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
[2024-05-22 11:22:29] [INFO ] Invariant cache hit.
[2024-05-22 11:22:29] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/63 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 66/129 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/137 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/63 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 66/129 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/137 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/137 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 95 constraints, problems are : Problem set: 0 solved, 2 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 157 ms.
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 70/70 places, 67/67 transitions.
RANDOM walk for 40000 steps (5791 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3604 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3680 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 691273 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 2
Probabilistic random walk after 691273 steps, saw 345779 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
[2024-05-22 11:22:33] [INFO ] Invariant cache hit.
[2024-05-22 11:22:33] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/63 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 66/129 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/137 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/63 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 66/129 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/137 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/137 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 95 constraints, problems are : Problem set: 0 solved, 2 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 83 ms.
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 70/70 places, 67/67 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2024-05-22 11:22:33] [INFO ] Invariant cache hit.
[2024-05-22 11:22:33] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 11:22:33] [INFO ] Invariant cache hit.
[2024-05-22 11:22:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 11:22:33] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-22 11:22:33] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-22 11:22:33] [INFO ] Invariant cache hit.
[2024-05-22 11:22:33] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/137 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 93 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1307 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/137 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 66/159 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 11:22:35] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:22:35] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 11:22:36] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:22:36] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 11:22:37] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/137 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 11:22:38] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-22 11:22:38] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-22 11:22:38] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-22 11:22:38] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-22 11:22:38] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/137 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-22 11:22:39] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:22:39] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-22 11:22:39] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-22 11:22:39] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-22 11:22:39] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:22:39] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-22 11:22:39] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/137 variables, 7/176 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 17 (OVERLAPS) 0/137 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 176 constraints, problems are : Problem set: 0 solved, 66 unsolved in 6117 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 17/17 constraints]
After SMT, in 7447ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 7448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7626 ms. Remains : 70/70 places, 67/67 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 70 transition count 62
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 62
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 63 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 63 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 61 transition count 58
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 61 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 57
Applied a total of 20 rules in 6 ms. Remains 60 /70 variables (removed 10) and now considering 57/67 (removed 10) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 57 rows 60 cols
[2024-05-22 11:22:41] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 11:22:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 11:22:41] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:22:41] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 11:22:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 11:22:41] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:22:41] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:22:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 11:22:41] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 11:22:41] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 11:22:41] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 11:22:41] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 11:22:41] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 122 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-13 in 25576 ms.
[2024-05-22 11:22:41] [INFO ] Flatten gal took : 55 ms
[2024-05-22 11:22:41] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-22 11:22:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 97 places, 93 transitions and 431 arcs took 4 ms.
Total runtime 329224 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-004

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/422/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 97
TRANSITIONS: 93
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


SAVING FILE /home/mcc/execution/422/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
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: 3162
MODEL NAME: /home/mcc/execution/422/model
97 places, 93 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Creating all event NSFs..
Building monolithic NSF...
Convergence in 16 steps.
Creating all event NSFs..
Convergence in 16 steps.
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Building monolithic NSF...
Convergence in 16 steps.
Creating all event NSFs..
Start RS construction.
Start RS construction.
Convergence in 16 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 39 steps.
Creating all event NSFs..
Convergence in 39 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 39 steps.
Creating all event NSFs..
Convergence in 39 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 94 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 94 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 94 steps.
Convergence in 94 steps.
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 159 steps.
Creating all event NSFs..
Convergence in 159 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 159 steps.
Convergence in 159 steps.
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 334 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 334 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 334 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 334 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 579 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 75 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 579 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 75 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 579 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 75 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 579 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 75 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2352 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2352 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1690 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1690 steps.
Creating all event NSFs..
Convergence in 2352 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 2352 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1690 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1690 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716377329286

--------------------
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 UpperBounds -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="DoubleExponent-PT-004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DoubleExponent-PT-004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131300549"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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