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.r488-tall-171631132900541.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 ltsminxred
Input is DoubleExponent-PT-003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900541
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 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 50K 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-003-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717193706134

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:15:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 22:15:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:15:07] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-31 22:15:07] [INFO ] Transformed 163 places.
[2024-05-31 22:15:07] [INFO ] Transformed 148 transitions.
[2024-05-31 22:15:07] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 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, +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, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 148 rows 163 cols
[2024-05-31 22:15:07] [INFO ] Computed 19 invariants in 35 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, 1, 2, 3, 1, 1, 3, 1, 1, 1, 12]
RANDOM walk for 10000 steps (330 resets) in 21 ms. (454 steps per ms)
FORMULA DoubleExponent-PT-003-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110004 steps (3100 resets) in 169 ms. (647 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 3, 3, 1, 1, 12]
[2024-05-31 22:15:07] [INFO ] Invariant cache hit.
[2024-05-31 22:15:07] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-31 22:15:08] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 17 ms returned sat
[2024-05-31 22:15:08] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-31 22:15:08] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 11 ms to minimize.
[2024-05-31 22:15:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-31 22:15:08] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2024-05-31 22:15:08] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-31 22:15:08] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:15:08] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:15:08] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:15:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2024-05-31 22:15:08] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-31 22:15:09] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:15:09] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:15:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2024-05-31 22:15:09] [INFO ] Added : 142 causal constraints over 29 iterations in 741 ms. Result :sat
Minimization took 186 ms.
[2024-05-31 22:15:09] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:09] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-31 22:15:09] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-31 22:15:09] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:15:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:09] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 28 ms returned sat
[2024-05-31 22:15:09] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-31 22:15:09] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:15:09] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:15:10] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:15:10] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:15:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 240 ms
[2024-05-31 22:15:10] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-31 22:15:10] [INFO ] Deduced a trap composed of 67 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:15:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-31 22:15:10] [INFO ] Added : 108 causal constraints over 22 iterations in 406 ms. Result :sat
Minimization took 121 ms.
[2024-05-31 22:15:10] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-31 22:15:10] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:10] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-31 22:15:10] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:15:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-31 22:15:10] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:10] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 22:15:10] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:15:10] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:15:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2024-05-31 22:15:10] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-31 22:15:11] [INFO ] Added : 97 causal constraints over 20 iterations in 273 ms. Result :sat
Minimization took 114 ms.
[2024-05-31 22:15:11] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:11] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-31 22:15:11] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-31 22:15:11] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:15:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-31 22:15:11] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2024-05-31 22:15:11] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-31 22:15:11] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:15:11] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:15:11] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:15:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 153 ms
[2024-05-31 22:15:11] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 22:15:12] [INFO ] Added : 106 causal constraints over 22 iterations in 295 ms. Result :sat
Minimization took 129 ms.
[2024-05-31 22:15:12] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:12] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-31 22:15:12] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-31 22:15:12] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:15:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:12] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-31 22:15:12] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-31 22:15:12] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:15:12] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:15:12] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:15:12] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:15:12] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:15:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 328 ms
[2024-05-31 22:15:12] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 22:15:13] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:15:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-05-31 22:15:13] [INFO ] Added : 135 causal constraints over 27 iterations in 461 ms. Result :sat
Minimization took 133 ms.
[2024-05-31 22:15:13] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:13] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-31 22:15:13] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-31 22:15:13] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:15:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2024-05-31 22:15:13] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-31 22:15:13] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-31 22:15:13] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:15:13] [INFO ] Deduced a trap composed of 42 places in 24 ms of which 2 ms to minimize.
[2024-05-31 22:15:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2024-05-31 22:15:13] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 22:15:14] [INFO ] Added : 141 causal constraints over 29 iterations in 475 ms. Result :sat
Minimization took 128 ms.
[2024-05-31 22:15:14] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned unsat
[2024-05-31 22:15:14] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned unsat
[2024-05-31 22:15:14] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2024-05-31 22:15:14] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-31 22:15:14] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:15:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:14] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-31 22:15:14] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-31 22:15:14] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:15:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-31 22:15:14] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 22:15:15] [INFO ] Added : 138 causal constraints over 28 iterations in 368 ms. Result :sat
Minimization took 132 ms.
[2024-05-31 22:15:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:15] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:15] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-31 22:15:15] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:15:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:15] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-31 22:15:15] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-31 22:15:15] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:15:15] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 2 ms to minimize.
[2024-05-31 22:15:15] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 5 ms to minimize.
[2024-05-31 22:15:15] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:15:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 224 ms
[2024-05-31 22:15:15] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 22:15:16] [INFO ] Added : 136 causal constraints over 28 iterations in 348 ms. Result :sat
Minimization took 155 ms.
[2024-05-31 22:15:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:16] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-31 22:15:16] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-31 22:15:16] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:15:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:16] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-31 22:15:16] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 22:15:16] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:15:16] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:15:16] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:15:16] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:15:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 227 ms
[2024-05-31 22:15:16] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 22:15:17] [INFO ] Added : 145 causal constraints over 29 iterations in 393 ms. Result :sat
Minimization took 137 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 1, 1, 12]
FORMULA DoubleExponent-PT-003-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-08 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] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 12]
Support contains 9 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 157 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 156 transition count 116
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 126 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 124 transition count 114
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 68 place count 124 transition count 107
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 82 place count 117 transition count 107
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 140 place count 88 transition count 78
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 85 transition count 78
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 157 place count 85 transition count 67
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 168 place count 74 transition count 67
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 177 place count 74 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 73 transition count 66
Applied a total of 178 rules in 71 ms. Remains 73 /163 variables (removed 90) and now considering 66/148 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 73/163 places, 66/148 transitions.
Found an invariant !
This invariant on transitions {11=1, 12=1, 13=1, 27=1, 28=1, 36=1, 45=1, 58=1, 62=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 ms.
This minimized invariant on transitions {11=1, 12=1, 13=1, 27=1, 28=1, 36=1, 45=1, 58=1, 62=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :[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] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 12]
// Phase 1: matrix 66 rows 73 cols
[2024-05-31 22:15:18] [INFO ] Computed 15 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
RANDOM walk for 1000000 steps (128073 resets) in 779 ms. (1282 steps per ms)
BEST_FIRST walk for 9000004 steps (762279 resets) in 4549 ms. (1978 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
[2024-05-31 22:15:23] [INFO ] Invariant cache hit.
[2024-05-31 22:15:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:23] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:23] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:15:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 22:15:23] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:23] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-31 22:15:23] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 22:15:23] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:15:23] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-31 22:15:23] [INFO ] Added : 58 causal constraints over 13 iterations in 133 ms. Result :sat
Minimization took 52 ms.
[2024-05-31 22:15:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:23] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:23] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-31 22:15:23] [INFO ] [Real]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:15:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:23] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:23] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:15:23] [INFO ] [Nat]Added 7 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:15:23] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 22:15:23] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:15:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-31 22:15:24] [INFO ] Added : 44 causal constraints over 9 iterations in 151 ms. Result :sat
Minimization took 38 ms.
[2024-05-31 22:15:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Real]Added 7 Read/Feed constraints in 7 ms returned sat
[2024-05-31 22:15:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Nat]Added 7 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:15:24] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-31 22:15:24] [INFO ] Added : 37 causal constraints over 8 iterations in 64 ms. Result :sat
Minimization took 35 ms.
[2024-05-31 22:15:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 5 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Real]Added 7 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:15:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Nat]Added 7 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:15:24] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 22:15:24] [INFO ] Added : 40 causal constraints over 8 iterations in 64 ms. Result :sat
Minimization took 34 ms.
[2024-05-31 22:15:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 5 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:15:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:15:24] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:15:24] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:15:24] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:15:24] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:15:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 115 ms
[2024-05-31 22:15:24] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 22:15:24] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:15:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-31 22:15:24] [INFO ] Added : 65 causal constraints over 15 iterations in 194 ms. Result :sat
Minimization took 45 ms.
[2024-05-31 22:15:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Nat]Added 7 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:15:25] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:15:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-31 22:15:25] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 22:15:25] [INFO ] Added : 63 causal constraints over 13 iterations in 121 ms. Result :sat
Minimization took 50 ms.
[2024-05-31 22:15:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:25] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 22:15:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:25] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 22:15:25] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:15:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-31 22:15:25] [INFO ] Added : 63 causal constraints over 13 iterations in 177 ms. Result :sat
Minimization took 50 ms.
[2024-05-31 22:15:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Real]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-31 22:15:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Nat]Added 7 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:15:25] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:15:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-31 22:15:25] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 22:15:25] [INFO ] Added : 63 causal constraints over 13 iterations in 120 ms. Result :sat
Minimization took 42 ms.
[2024-05-31 22:15:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:25] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:26] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:15:26] [INFO ] [Real]Added 7 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:15:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:26] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:26] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 22:15:26] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:26] [INFO ] Computed and/alt/rep : 65/305/65 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 22:15:26] [INFO ] Added : 65 causal constraints over 13 iterations in 125 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
Support contains 9 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 73/73 places, 66/66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-31 22:15:26] [INFO ] Invariant cache hit.
[2024-05-31 22:15:26] [INFO ] Implicit Places using invariants in 66 ms returned [14, 21, 39, 44, 63]
[2024-05-31 22:15:26] [INFO ] Actually due to overlaps returned [39, 44, 14]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 74 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 70/73 places, 66/66 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 69 transition count 65
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 69 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 68 transition count 64
Applied a total of 4 rules in 10 ms. Remains 68 /70 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 68 cols
[2024-05-31 22:15:26] [INFO ] Computed 12 invariants in 2 ms
[2024-05-31 22:15:26] [INFO ] Implicit Places using invariants in 179 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 67/73 places, 64/66 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 67 transition count 64
Applied a total of 1 rules in 11 ms. Remains 67 /67 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 67 cols
[2024-05-31 22:15:26] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 22:15:26] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 22:15:26] [INFO ] Invariant cache hit.
[2024-05-31 22:15:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 22:15:26] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 67/73 places, 64/66 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 422 ms. Remains : 67/73 places, 64/66 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 24=1, 30=1, 39=1, 52=1, 56=1, 61=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, 24=1, 30=1, 39=1, 52=1, 56=1, 61=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1434 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :[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] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
[2024-05-31 22:15:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
RANDOM walk for 1000000 steps (143978 resets) in 638 ms. (1564 steps per ms)
BEST_FIRST walk for 9000002 steps (822070 resets) in 4130 ms. (2178 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
[2024-05-31 22:15:32] [INFO ] Invariant cache hit.
[2024-05-31 22:15:32] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:32] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:32] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-31 22:15:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 22:15:32] [INFO ] [Real]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-31 22:15:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:32] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:32] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:15:32] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-31 22:15:32] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 22:15:32] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-31 22:15:32] [INFO ] Added : 60 causal constraints over 13 iterations in 148 ms. Result :sat
Minimization took 51 ms.
[2024-05-31 22:15:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:15:33] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 22:15:33] [INFO ] Added : 63 causal constraints over 13 iterations in 117 ms. Result :sat
Minimization took 46 ms.
[2024-05-31 22:15:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Real]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-31 22:15:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 0 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:33] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 22:15:33] [INFO ] Added : 54 causal constraints over 11 iterations in 87 ms. Result :sat
Minimization took 38 ms.
[2024-05-31 22:15:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Real]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:15:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-31 22:15:33] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 22:15:33] [INFO ] Added : 54 causal constraints over 11 iterations in 101 ms. Result :sat
Minimization took 40 ms.
[2024-05-31 22:15:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Real]Added 7 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:15:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:15:33] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:15:33] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 22:15:34] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:15:34] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:15:34] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:15:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 138 ms
[2024-05-31 22:15:34] [INFO ] Added : 59 causal constraints over 13 iterations in 290 ms. Result :sat
Minimization took 41 ms.
[2024-05-31 22:15:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Real]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-31 22:15:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-31 22:15:34] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:15:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-31 22:15:34] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 22:15:34] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-31 22:15:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-31 22:15:34] [INFO ] Added : 51 causal constraints over 11 iterations in 119 ms. Result :sat
Minimization took 38 ms.
[2024-05-31 22:15:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-31 22:15:34] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 22:15:34] [INFO ] Added : 53 causal constraints over 11 iterations in 90 ms. Result :sat
Minimization took 45 ms.
[2024-05-31 22:15:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:15:34] [INFO ] [Nat]Added 7 Read/Feed constraints in 7 ms returned sat
[2024-05-31 22:15:34] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:15:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-31 22:15:34] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 22:15:34] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-31 22:15:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-31 22:15:34] [INFO ] Added : 47 causal constraints over 10 iterations in 112 ms. Result :sat
Minimization took 38 ms.
[2024-05-31 22:15:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:35] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-31 22:15:35] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:35] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:35] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:15:35] [INFO ] [Nat]Added 7 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:15:35] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:15:35] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:15:35] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:15:35] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:15:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 158 ms
[2024-05-31 22:15:35] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 22:15:35] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:15:35] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:15:35] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:15:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 119 ms
[2024-05-31 22:15:35] [INFO ] Added : 63 causal constraints over 13 iterations in 247 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 67/67 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 22:15:35] [INFO ] Invariant cache hit.
[2024-05-31 22:15:35] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 22:15:35] [INFO ] Invariant cache hit.
[2024-05-31 22:15:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 22:15:35] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-31 22:15:35] [INFO ] Redundant transitions in 0 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-31 22:15:35] [INFO ] Invariant cache hit.
[2024-05-31 22:15:35] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 64/131 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-31 22:15:36] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-05-31 22:15:36] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:15:36] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:15:36] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/131 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 89 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1552 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 67/67 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/131 variables, 67/82 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 63/152 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-31 22:15:38] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 153 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1774 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 67/67 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 5/5 constraints]
After SMT, in 3365ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3537 ms. Remains : 67/67 places, 64/64 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 24=1, 30=1, 39=1, 52=1, 56=1, 61=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, 24=1, 30=1, 39=1, 52=1, 56=1, 61=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1471 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :[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] Max Struct:[1, 1, 1, 1, +inf, 1, 1, 1, 6]
RANDOM walk for 40000 steps (5769 resets) in 1544 ms. (25 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (352 resets) in 62 ms. (63 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (356 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (347 resets) in 87 ms. (45 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (377 resets) in 80 ms. (49 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (359 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (374 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (339 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (386 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (359 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (382 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (371 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (374 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (381 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (366 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (360 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (357 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (367 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
Probabilistic random walk after 1000000 steps, saw 500119 distinct states, run finished after 2344 ms. (steps per millisecond=426 ) properties seen :16
[2024-05-31 22:15:43] [INFO ] Invariant cache hit.
[2024-05-31 22:15:43] [INFO ] State equation strengthened by 7 read => feed constraints.
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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX8 is UNSAT
After SMT solving in domain Real declared 48/131 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5 constraints, Generalized P Invariants (flows): 1/6 constraints, State Equation: 0/67 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DoubleExponent-PT-003-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 7 queries.) : Max Seen:[0, 0] Max Struct:[+inf, 6]
Starting property specific reduction for DoubleExponent-PT-003-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:15:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1441 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10000 steps (898 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:15:43] [INFO ] Invariant cache hit.
[2024-05-31 22:15:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:43] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:43] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 22:15:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 22:15:43] [INFO ] [Real]Added 7 Read/Feed constraints in 7 ms returned sat
[2024-05-31 22:15:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:43] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:43] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 22:15:43] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:15:43] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 22:15:43] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:15:43] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:15:43] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:15:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 128 ms
[2024-05-31 22:15:43] [INFO ] Added : 59 causal constraints over 13 iterations in 246 ms. Result :sat
Minimization took 41 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 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 64/64 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 2 place count 67 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 65 transition count 62
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 65 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 64 transition count 61
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 64 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 10 place count 62 transition count 59
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 12 place count 62 transition count 59
Applied a total of 12 rules in 11 ms. Remains 62 /67 variables (removed 5) and now considering 59/64 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 62/67 places, 59/64 transitions.
Found an invariant !
This invariant on transitions {7=1, 8=1, 17=1, 23=1, 30=1, 42=1, 46=1, 50=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {7=1, 8=1, 17=1, 23=1, 30=1, 42=1, 46=1, 50=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1453 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 59 rows 62 cols
[2024-05-31 22:15:44] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144194 resets) in 592 ms. (1686 steps per ms)
BEST_FIRST walk for 1000001 steps (91554 resets) in 425 ms. (2347 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:15:45] [INFO ] Invariant cache hit.
[2024-05-31 22:15:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:45] [INFO ] [Real]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:45] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 22:15:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 22:15:45] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:15:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:45] [INFO ] [Nat]Absence check using 7 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:45] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-31 22:15:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:15:45] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:15:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-31 22:15:45] [INFO ] Computed and/alt/rep : 56/283/56 causal constraints (skipped 2 transitions) in 4 ms.
[2024-05-31 22:15:45] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:15:45] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:15:45] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:15:45] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:15:45] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:15:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 189 ms
[2024-05-31 22:15:45] [INFO ] Added : 45 causal constraints over 9 iterations in 264 ms. Result :sat
Minimization took 39 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 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 62/62 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-31 22:15:45] [INFO ] Invariant cache hit.
[2024-05-31 22:15:45] [INFO ] Implicit Places using invariants in 72 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/62 places, 59/59 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 58
Applied a total of 2 rules in 12 ms. Remains 60 /61 variables (removed 1) and now considering 58/59 (removed 1) transitions.
// Phase 1: matrix 58 rows 60 cols
[2024-05-31 22:15:45] [INFO ] Computed 10 invariants in 0 ms
[2024-05-31 22:15:45] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 22:15:45] [INFO ] Invariant cache hit.
[2024-05-31 22:15:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 22:15:46] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 60/62 places, 58/59 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 257 ms. Remains : 60/62 places, 58/59 transitions.
Found an invariant !
This invariant on transitions {7=1, 8=1, 16=1, 22=1, 29=1, 40=1, 44=1, 48=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {7=1, 8=1, 16=1, 22=1, 29=1, 40=1, 44=1, 48=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1435 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-31 22:15:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144344 resets) in 582 ms. (1715 steps per ms)
BEST_FIRST walk for 1000000 steps (91088 resets) in 420 ms. (2375 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:15:47] [INFO ] Invariant cache hit.
[2024-05-31 22:15:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:47] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:47] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 22:15:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 22:15:47] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:47] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-31 22:15:47] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-31 22:15:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-31 22:15:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:15:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-31 22:15:47] [INFO ] Computed and/alt/rep : 56/289/56 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-31 22:15:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:15:47] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:15:47] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:15:47] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:15:47] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:15:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:15:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 208 ms
[2024-05-31 22:15:47] [INFO ] Added : 54 causal constraints over 15 iterations in 332 ms. Result :sat
Minimization took 44 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 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 60/60 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-31 22:15:47] [INFO ] Invariant cache hit.
[2024-05-31 22:15:47] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-31 22:15:47] [INFO ] Invariant cache hit.
[2024-05-31 22:15:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 22:15:47] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-31 22:15:47] [INFO ] Redundant transitions in 0 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-31 22:15:47] [INFO ] Invariant cache hit.
[2024-05-31 22:15:47] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/118 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 57 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 78 constraints, problems are : Problem set: 0 solved, 57 unsolved in 671 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/118 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 57/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-31 22:15:48] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-31 22:15:49] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:15:49] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-31 22:15:49] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/118 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 139 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1743 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints]
After SMT, in 2433ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2583 ms. Remains : 60/60 places, 58/58 transitions.
Found an invariant !
This invariant on transitions {7=1, 8=1, 16=1, 22=1, 29=1, 40=1, 44=1, 48=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {7=1, 8=1, 16=1, 22=1, 29=1, 40=1, 44=1, 48=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 (5779 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3670 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2058 steps, run visited all 1 properties in 6 ms. (steps per millisecond=343 )
Probabilistic random walk after 2058 steps, saw 1044 distinct states, run finished after 9 ms. (steps per millisecond=228 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-05 in 6870 ms.
Starting property specific reduction for DoubleExponent-PT-003-UpperBounds-15
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 64 rows 67 cols
[2024-05-31 22:15:50] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (1439 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10000 steps (924 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 22:15:50] [INFO ] Invariant cache hit.
[2024-05-31 22:15:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:50] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:15:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 22:15:50] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:50] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:50] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-31 22:15:50] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:15:50] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:15:50] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:15:50] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:15:50] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:15:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 120 ms
[2024-05-31 22:15:50] [INFO ] Computed and/alt/rep : 63/293/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 22:15:50] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:15:50] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:15:50] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:15:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 136 ms
[2024-05-31 22:15:50] [INFO ] Added : 63 causal constraints over 13 iterations in 258 ms. Result :sat
Minimization took 61 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 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 64/64 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 2 place count 67 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 65 transition count 62
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 2 with 4 rules applied. Total rules applied 8 place count 63 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 63 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 62 transition count 59
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 62 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 61 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 13 place count 61 transition count 58
Applied a total of 13 rules in 9 ms. Remains 61 /67 variables (removed 6) and now considering 58/64 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 61/67 places, 58/64 transitions.
// Phase 1: matrix 58 rows 61 cols
[2024-05-31 22:15:51] [INFO ] Computed 11 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (143940 resets) in 568 ms. (1757 steps per ms)
BEST_FIRST walk for 1000000 steps (91497 resets) in 413 ms. (2415 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-31 22:15:52] [INFO ] Invariant cache hit.
[2024-05-31 22:15:52] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:52] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-31 22:15:52] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 22:15:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:15:52] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:15:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:52] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:52] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:15:52] [INFO ] [Nat]Added 10 Read/Feed constraints in 12 ms returned sat
[2024-05-31 22:15:52] [INFO ] Computed and/alt/rep : 57/294/57 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 22:15:52] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:15:52] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:15:52] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:15:52] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:15:52] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-31 22:15:52] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-31 22:15:52] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:15:52] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-31 22:15:52] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:15:52] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:15:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 353 ms
[2024-05-31 22:15:52] [INFO ] Added : 49 causal constraints over 10 iterations in 429 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 58/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-31 22:15:52] [INFO ] Invariant cache hit.
[2024-05-31 22:15:52] [INFO ] Implicit Places using invariants in 43 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 58/58 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 57
Applied a total of 2 rules in 4 ms. Remains 59 /60 variables (removed 1) and now considering 57/58 (removed 1) transitions.
// Phase 1: matrix 57 rows 59 cols
[2024-05-31 22:15:52] [INFO ] Computed 10 invariants in 0 ms
[2024-05-31 22:15:52] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-31 22:15:52] [INFO ] Invariant cache hit.
[2024-05-31 22:15:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:15:52] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/61 places, 57/58 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 186 ms. Remains : 59/61 places, 57/58 transitions.
[2024-05-31 22:15:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144123 resets) in 578 ms. (1727 steps per ms)
BEST_FIRST walk for 1000000 steps (91559 resets) in 422 ms. (2364 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:15:53] [INFO ] Invariant cache hit.
[2024-05-31 22:15:53] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:53] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 22:15:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:15:53] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:15:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:53] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:53] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-31 22:15:53] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:53] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:15:53] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-31 22:15:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2024-05-31 22:15:53] [INFO ] Computed and/alt/rep : 56/291/56 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 22:15:54] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:15:54] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:15:54] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-31 22:15:54] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:15:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 148 ms
[2024-05-31 22:15:54] [INFO ] Added : 49 causal constraints over 10 iterations in 224 ms. Result :sat
Minimization took 41 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 59 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p159) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 55/55 transitions.
Reduce places removed 1 places and 2 transitions.
Graph (complete) has 208 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 53
Reduce places removed 2 places and 3 transitions.
Graph (complete) has 195 edges and 55 vertex of which 54 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 1 with 3 rules applied. Total rules applied 5 place count 54 transition count 50
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 54 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 53 transition count 49
Applied a total of 7 rules in 5 ms. Remains 53 /59 variables (removed 6) and now considering 49/55 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 53/59 places, 49/55 transitions.
// Phase 1: matrix 49 rows 53 cols
[2024-05-31 22:15:54] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144384 resets) in 555 ms. (1798 steps per ms)
BEST_FIRST walk for 1000000 steps (91757 resets) in 407 ms. (2450 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:15:55] [INFO ] Invariant cache hit.
[2024-05-31 22:15:55] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:55] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:55] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 22:15:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 22:15:55] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:15:55] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:55] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-31 22:15:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:15:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:15:55] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-31 22:15:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2024-05-31 22:15:55] [INFO ] Computed and/alt/rep : 48/241/48 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 22:15:55] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:15:55] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:15:55] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-31 22:15:55] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-31 22:15:55] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-31 22:15:55] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-31 22:15:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 189 ms
[2024-05-31 22:15:55] [INFO ] Added : 42 causal constraints over 9 iterations in 246 ms. Result :sat
Minimization took 46 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 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 53/53 places, 49/49 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-05-31 22:15:55] [INFO ] Invariant cache hit.
[2024-05-31 22:15:55] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-31 22:15:55] [INFO ] Invariant cache hit.
[2024-05-31 22:15:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 22:15:55] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 105 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 52/53 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 107 ms. Remains : 52/53 places, 49/49 transitions.
// Phase 1: matrix 49 rows 52 cols
[2024-05-31 22:15:55] [INFO ] Computed 9 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143986 resets) in 560 ms. (1782 steps per ms)
BEST_FIRST walk for 1000001 steps (91821 resets) in 403 ms. (2475 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:15:56] [INFO ] Invariant cache hit.
[2024-05-31 22:15:56] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:56] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:56] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 22:15:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 22:15:56] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:15:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:56] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-31 22:15:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-31 22:15:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 22:15:56] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:15:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-31 22:15:56] [INFO ] Computed and/alt/rep : 48/239/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 22:15:56] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:15:56] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:15:57] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-31 22:15:57] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-31 22:15:57] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-31 22:15:57] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-31 22:15:57] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
[2024-05-31 22:15:57] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:15:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 240 ms
[2024-05-31 22:15:57] [INFO ] Added : 45 causal constraints over 10 iterations in 307 ms. Result :sat
Minimization took 32 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 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 52/52 places, 49/49 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-05-31 22:15:57] [INFO ] Invariant cache hit.
[2024-05-31 22:15:57] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 22:15:57] [INFO ] Invariant cache hit.
[2024-05-31 22:15:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 22:15:57] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-31 22:15:57] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-31 22:15:57] [INFO ] Invariant cache hit.
[2024-05-31 22:15:57] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 49/101 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 69 constraints, problems are : Problem set: 0 solved, 48 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 52/52 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 49/101 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 48/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-31 22:15:58] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:15:58] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-31 22:15:58] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/101 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 120 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1170 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 52/52 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 1915ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1916ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2042 ms. Remains : 52/52 places, 49/49 transitions.
RANDOM walk for 40000 steps (5809 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3667 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3669 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3424 steps, run visited all 2 properties in 15 ms. (steps per millisecond=228 )
Probabilistic random walk after 3424 steps, saw 1729 distinct states, run finished after 15 ms. (steps per millisecond=228 ) properties seen :2
FORMULA DoubleExponent-PT-003-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DoubleExponent-PT-003-UpperBounds-15 in 9000 ms.
[2024-05-31 22:15:59] [INFO ] Flatten gal took : 26 ms
[2024-05-31 22:15:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-31 22:15:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 64 transitions and 291 arcs took 3 ms.
Total runtime 52298 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DoubleExponent-PT-003-UpperBounds-05

BK_STOP 1717193759826

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2024
ub formula name DoubleExponent-PT-003-UpperBounds-05
ub formula formula --maxsum=/tmp/1268/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-003"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DoubleExponent-PT-003, 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 r488-tall-171631132900541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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